Sciweavers

21 search results - page 3 / 5
» Using forgetful routing to control BGP table size
Sort
View
CCR
2004
157views more  CCR 2004»
13 years 5 months ago
Designing BGP-based outbound traffic engineering techniques for stub ASes
Today, most multi-connected autonomous systems (AS) need to control the flow of their interdomain traffic for both performance and economical reasons. This is usually done by manu...
Steve Uhlig, Olivier Bonaventure
INFOCOM
2005
IEEE
13 years 11 months ago
Routing in ad hoc networks: a theoretical framework with practical implications
— In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a ...
Nianjun Zhou, Alhussein A. Abouzeid
INFOCOM
2010
IEEE
13 years 4 months ago
On the Aggregatability of Router Forwarding Tables
—The rapid growth of global routing tables has raised concerns among many Internet Service Providers. The most immediate concern regarding routing scalability is the size of the ...
Xin Zhao, Yaoqing Liu, Lan Wang, Beichuan Zhang
INFOCOM
2006
IEEE
13 years 11 months ago
Tunnel Vector: A New Routing Algorithm with Scalability
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
Cheng-Jia Lai, Richard R. Muntz
MINENET
2006
ACM
13 years 11 months ago
Forensic analysis of autonomous system reachability
Security incidents have an adverse impact not only on end systems, but also on Internet routing, resulting in many out-of-reach prefixes. Previous work has looked at performance ...
D. K. Lee, Sue B. Moon, Taesang Choi, Taesoo Jeong