Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Juan Echagüe"'
Autor:
Salvador López-Barajas, Pedro J. Sanz, Raúl Marín-Prades, Alfonso Gómez-Espinosa, Josué González-García, Juan Echagüe
Publikováno v:
Journal of Marine Science and Engineering, Vol 12, Iss 1, p 80 (2023)
Net inspection in fish-farm cages is a daily task for divers. This task represents a high cost for fish farms and is a high-risk activity for human operators. The total inspection surface can be more than 1500 m2, which means that this activity is ti
Externí odkaz:
https://doaj.org/article/17ce12e3370845e89767f0ea4aa8be5b
An important issue in complex networks is to find efficient strategies for information delivery between a given sending node and its destination host. Whereas there is no doubt that the use of the congestion provides significant advantages for routin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::623f6231969071f09fe9b366a098dfa0
https://hdl.handle.net/20.500.12761/1531
https://hdl.handle.net/20.500.12761/1531
Publikováno v:
Networked Systems ISBN: 9783030670863
NETYS
NETYS
In this work, we consider a computational model of a distributed system formed by a set of servers in which jobs, that are continuously arriving, have to be executed. Every job is formed by a set of dependent tasks (i. e., each task may have to wait
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::104e6d35654842afe0d6ab672c1c03e0
https://doi.org/10.1007/978-3-030-67087-0_23
https://doi.org/10.1007/978-3-030-67087-0_23
Publikováno v:
Computer Communications. 31:1824-1831
The issue of breaking cycles in communication networks is an important topic for several reasons. For instance, it is required when transparent bridges are filling the forwarding tables. It is also needed to prevent the occurrence of deadlocks caused
Autor:
Juan Echagüe, Vicent Cholvi
Publikováno v:
Computer Networks. 51:4460-4474
Network stability is an important issue that has attracted the attention of many researchers in recent years. Such interest comes from the need to ensure that, as the system runs for an arbitrarily length of time, no server will suffer an unbounded q
Publikováno v:
IEEE Access, Vol 9, Pp 139516-139526 (2021)
Technological changes (NFV, Osmotic Computing, Cyber-physical Systems) are making very important devising techniques to efficiently run a flow of jobs formed by dependent tasks in a set of servers. These problem can be seen as generalizations of the
Externí odkaz:
https://doaj.org/article/b0032d7c22034ac8b687fa1382e5c980
Autor:
Juan Echagüe, Vicent Cholvi
Publikováno v:
VALUETOOLS
As a means of supporting quality of service guarantees, aggregate multiplexing has attracted a lot of attention in the networking community, since it requires less complexity than flow-based scheduling. However, contrary to what happens in the case o
Publikováno v:
Quality of Service in the Emerging Networking Panorama ISBN: 9783540232384
QofIS
QofIS
We present a novel distributed algorithm which provides QoS by only enabling free-of-cycles routes which are known to ensure network stability. Network stability is synonymous of QoS as allows to deterministically bound maximum delays and backlogs. C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d7a32f88d17cb830628a19372cb75e2
https://doi.org/10.1007/978-3-540-30193-6_23
https://doi.org/10.1007/978-3-540-30193-6_23
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540673064
LATIN
LATIN
This work studies the notion of locality in the context of process specification. It relates naturally with other works where information about the localities of a program is obtained information from its description written down in a programming lan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56eb26e37f309a10ca1cbbed12cab77d
https://doi.org/10.1007/10719839_42
https://doi.org/10.1007/10719839_42
Publikováno v:
ResearcherID
In this work, we consider a generalized version of the adversarial model and study the universal stability (stability in any network) of scheduling policies under low load rates. We show that any work-conserving policy is universally stable at any lo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1d6bbcc8a05ad9fd98d2b95b3948ec4
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=ORCID&SrcApp=OrcidOrg&DestLinkType=FullRecord&DestApp=ISI&KeyUT=WOS:000187710200004&KeyUID=WOS:000187710200004
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=ORCID&SrcApp=OrcidOrg&DestLinkType=FullRecord&DestApp=ISI&KeyUT=WOS:000187710200004&KeyUID=WOS:000187710200004