4037 search results - page 163 / 808 » Routing without ordering |
ISPA
2005
Springer
14 years 2 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—Back-pressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop ...
SIGCOMM
2000
ACM
14 years 1 months ago
2000
ACM
This paper examines the latency in Internet path failure, failover and repair due to the convergence properties of interdomain routing. Unlike switches in the public telephony net...
NAS
2010
IEEE
13 years 7 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
DAC
2004
ACM
14 years 10 months ago
2004
ACM
Just-in-time (JIT) compilation has previously been used in many applications to enable standard software binaries to execute on different underlying processor architectures. Howev...