1017 search results - page 78 / 204 » Throughput-centric routing algorithm design |
136
Voted
JUCS
2010
15 years 1 months ago
2010
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
153
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...
136
Voted
AINA
2004
IEEE
15 years 7 months ago
2004
IEEE
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
141
Voted
ASPDAC
2006
ACM
15 years 9 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
153
Voted
ALGORITHMICA
2005
15 years 3 months ago
2005
In an adversarial queueing network, the incoming traffic is decided by an adversary, who operates under a reasonable rate restriction. This model provides a valuable, complementar...