Sciweavers

482 search results - page 16 / 97
» On routing table growth
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Avoiding transient loops during IGP convergence in IP networks
— When the topology of an IP network changes due to a link failure or a link weight modification, the routing tables of all the routers must be updated. Each of those updates ma...
Pierre Francois, Olivier Bonaventure
INFOCOM
2008
IEEE
14 years 2 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
INFOCOM
2006
IEEE
14 years 1 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
CAL
2007
13 years 7 months ago
Logic-Based Distributed Routing for NoCs
—The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
José Flich, José Duato
AINA
2004
IEEE
13 years 11 months ago
A Small IP Forwarding Table Using Hashing
As the demand for high bandwidth on the Internet increases, it is required to build next generation routers with the capability of forwarding multiple millions of packets per secon...
Yeim-Kuan Chang, Wen-Hsin Cheng