69 search results - page 8 / 14 » On the selectivity of multidimensional routing indices |
COMCOM
2004
13 years 7 months ago
2004
Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well wit...
ISCC
2003
IEEE
14 years 25 days ago
2003
IEEE
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in n...
ICPPW
2002
IEEE
14 years 15 days ago
2002
IEEE
In large networks, maintaining precise global network state information is almost impossible. Many factors, such as non-negligible propagation delay, infrequent state updates due ...
ASPDAC
2006
ACM
14 years 1 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...
INFOCOM
2009
IEEE
14 years 2 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 ...