1768 search results - page 84 / 354 » Optimal routing in Chord |
116
click to vote
INFOCOM
2000
IEEE
15 years 5 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
103
Voted
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
100
click to vote
SIGCOMM
2005
ACM
15 years 6 months ago
2005
ACM
The Internet’s core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior researc...
116
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
Monitoring transit traffic at one or more points in a network is of interest to network operators for reasons of traffic accounting, debugging or troubleshooting, forensics, and tr...
128
click to vote
ISPD
2005
ACM
15 years 6 months ago
2005
ACM
The sustained progress of VLSI technology has altered the landscape of routing which is a major physical design stage. For timing driven routings, traditional approaches which con...