Sciweavers

75 search results - page 7 / 15
» Name independent routing for growth bounded networks
Sort
View
CCR
2004
79views more  CCR 2004»
13 years 7 months ago
Reverse engineering the Internet
To provide insight into Internet operation and performance, recent efforts have measured various aspects of the Internet, developing and improving measurement tools in the process....
Neil T. Spring, David Wetherall, Thomas E. Anderso...
COMCOM
2008
131views more  COMCOM 2008»
13 years 7 months ago
CORA: Collaborative Opportunistic Recovery Algorithm for loss controlled, delay bounded ad hoc multicast
In this paper, we present Collaborative Opportunistic Recovery Algorithm (CORA) designed for multicast multimedia applications with low loss as well as latency constraints in ad h...
Yunjung Yi, Jiejun Kong, Mario Gerla, Joon-Sang Pa...
SSD
2005
Springer
188views Database» more  SSD 2005»
14 years 29 days ago
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
Qingsong Lu, Betsy George, Shashi Shekhar
FLAIRS
2004
13 years 8 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
ICCCN
2007
IEEE
13 years 9 months ago
Greedy Face Routing with Face ID Support in Wireless Networks
—Geographic face routing provides an attractive way for packet delivery in wireless networks due to its high reliability and low overhead. A good face routing protocol should pro...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan