Sciweavers

414 search results - page 73 / 83
» Minimizing Routing State for Light-Weight Network Simulation
Sort
View
80
Voted
TON
2002
99views more  TON 2002»
14 years 11 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
CONEXT
2007
ACM
15 years 3 months ago
Fair and efficient scheduling in data ferrying networks
Data-ferrying disconnection-tolerant networks allow remote rural areas to access the Internet at very low cost, making them viable alternatives to more expensive access technologi...
Shimin Guo, Srinivasan Keshav
87
Voted
CORR
2010
Springer
64views Education» more  CORR 2010»
14 years 11 months ago
Selfish Response to Epidemic Propagation
An epidemic spreading in a network calls for a decision on the part of the network members: They should decide whether to protect themselves or not. Their decision depends on the ...
George Theodorakopoulos, Jean-Yves Le Boudec, John...
CONEXT
2009
ACM
15 years 22 days ago
BUFFALO: bloom filter forwarding architecture for large organizations
In enterprise and data center networks, the scalability of the data plane becomes increasingly challenging as forwarding tables and link speeds grow. Simply building switches with...
Minlan Yu, Alex Fabrikant, Jennifer Rexford
FITRAMEN
2008
15 years 1 months ago
A Fair and Dynamic Load-Balancing Mechanism
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
Federico Larroca, Jean-Louis Rougier