Sciweavers

5 search results - page 1 / 1
» Achieving sub-second IGP convergence in large IP networks
Sort
View
CCR
2005
89views more  CCR 2005»
13 years 4 months ago
Achieving sub-second IGP convergence in large IP networks
We describe and analyse in details the various factors that influence the convergence time of intradomain link state routing protocols. This convergence time reflects the time req...
Pierre François, Clarence Filsfils, John Ev...
CONEXT
2005
ACM
13 years 6 months ago
Achieving sub-50 milliseconds recovery upon BGP peering link failures
We first show by measurements that BGP peering links fail as frequently as intradomain links and usually for short periods of time. We propose a new fast-reroute technique where ...
Olivier Bonaventure, Clarence Filsfils, Pierre Fra...
ICC
2009
IEEE
197views Communications» more  ICC 2009»
13 years 11 months ago
A Game-Based Self-Organizing Uplink Tree for VoIP Services in IEEE 802.16j Networks
— In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their s...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
ICDCS
2003
IEEE
13 years 10 months ago
Optimal Distribution Tree for Internet Streaming Media
Internet radio and television stations require significant bandwidth to support delivery of high quality audio and video streams to a large number of receivers. IP multicast is a...
Min Sik Kim, Simon S. Lam, Dong-Young Lee
CONEXT
2006
ACM
13 years 10 months ago
Using forgetful routing to control BGP table size
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
Elliott Karpilovsky, Jennifer Rexford