Sciweavers

2497 search results - page 26 / 500
» Requirements for models of achievable routing
Sort
View
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
15 years 5 months ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling
NETWORKING
2011
14 years 4 months ago
oBGP: An Overlay for a Scalable iBGP Control Plane
The Internet is organized as a collection of networks called Autonomous Systems (ASes). The Border Gateway Protocol (BGP) is the glue that connects these administrative domains. Co...
Iuniana M. Oprescu, Mickael Meulle, Steve Uhlig, C...
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 1 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...
MDM
2009
Springer
130views Communications» more  MDM 2009»
15 years 8 months ago
Towards an Indoor Level-of-Detail Model for Route Visualization
Indoor routing represents an essential feature required by applications and systems that provide spatial information about complex sites, buildings and infrastructures such as in ...
Benjamin Hagedorn, Matthias Trapp, Tassilo Glander...
INFOCOM
2008
IEEE
15 years 8 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