Sciweavers

4037 search results - page 5 / 808
» Routing without ordering
Sort
View
CAL
2004
13 years 7 months ago
An Efficient Fault-Tolerant Routing Methodology for Meshes and Tori
In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade...
María Engracia Gómez, José Du...
CN
2010
112views more  CN 2010»
13 years 5 months ago
An Internet without the Internet protocol
The growth of the Internet has brought about many challenges for its critical infrastructure. The DNS infrastructure, which translates mnemonic host names into IP addresses unders...
Craig A. Shue, Minaxi Gupta
INFOCOM
2003
IEEE
14 years 27 days ago
Capacity, Delay and Mobility in Wireless Ad-Hoc Networks
Abstract— Network throughput and packet delay are two important parameters in the design and the evaluation of routing protocols for ad-hoc networks. While mobility has been show...
Nikhil Bansal, Zhen Liu
TON
2002
138views more  TON 2002»
13 years 7 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
MOBICOM
2003
ACM
14 years 26 days ago
Geographic routing without location information
For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e....
Ananth Rao, Christos H. Papadimitriou, Scott Shenk...