Sciweavers

2497 search results - page 61 / 500
» Requirements for models of achievable routing
Sort
View
SIGCOMM
1999
ACM
15 years 6 months ago
Routing with a Clue
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
SP
1989
IEEE
15 years 5 months ago
Security Issues in Policy Routing
Routing mechanisms for inter-autonomousregion communication require distribution of policy-sensitive information as well as algorithms that operate on such information. Without su...
Deborah Estrin, Gene Tsudik
106
Voted
COMCOM
2004
153views more  COMCOM 2004»
15 years 1 months ago
BLR: beacon-less routing algorithm for mobile ad hoc networks
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...
Marc Heissenbüttel, Torsten Braun, Thomas Ber...
130
Voted
CORR
2010
Springer
91views Education» more  CORR 2010»
15 years 1 months ago
Shadowing Effects on Routing Protocol of Multihop Ad Hoc Networks
Two-ray ground reflection model has been widely used as the propagation model to investigate the performance of an ad hoc network. But two-ray model is too simple to represent a r...
Anwar Hossain, Mohammed Tarique, Rumana Islam
INFOCOM
2010
IEEE
14 years 11 months ago
FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps
It is becoming apparent that the next generation IP route lookup architecture needs to achieve speeds of 100Gbps and beyond while supporting both IPv4 and IPv6 with fast real-time ...
Masanori Bando, H. Jonathan Chao