Sciweavers

1815 search results - page 106 / 363
» Path Planning for Network Performance
Sort
View
CN
2006
116views more  CN 2006»
13 years 8 months ago
Techniques for available bandwidth measurement in IP networks: A performance comparison
As the Internet grows in scale and complexity, the need for accurate traffic measurement increases. Among the different parameters relevant to traffic measurement, the paper pays ...
Leopoldo Angrisani, Salvatore D'Antonio, Marcello ...
ASPLOS
2006
ACM
14 years 2 months ago
A spatial path scheduling algorithm for EDGE architectures
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...
Katherine E. Coons, Xia Chen, Doug Burger, Kathryn...
ICNP
1997
IEEE
14 years 16 days ago
Balanced Routing
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Jorge Arturo Cobb, Mohamed G. Gouda
COMCOM
2004
85views more  COMCOM 2004»
13 years 8 months ago
Optimal PNNI complex node representations for restrictive costs
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Ilias Iliadis
DEBU
2010
170views more  DEBU 2010»
13 years 8 months ago
Roads Belong in Databases
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...
Jagan Sankaranarayanan, Hanan Samet