48 search results - page 1 / 10 » Adaptive Packet Routing for Bursty Adversarial Traffic |
STOC
1998
ACM
13 years 8 months ago
1998
ACM
LCN
2000
IEEE
13 years 8 months ago
2000
IEEE
Future computer networks are expected to carry bursty real-time traffic with stringent time-delay requirements. Popular shortest-path routing protocols have the disadvantage of ca...
PDPTA
2003
13 years 6 months ago
2003
Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessaril...
DATE
2009
IEEE
13 years 11 months ago
2009
IEEE
- In this paper we introduce Priority Based Forced Requeue to decrease worst-case latencies in NoCs offering best effort services. Forced Requeue is to prematurely lift out low pri...
DATE
2008
IEEE
13 years 11 months ago
2008
IEEE
A novel routing algorithm, named Balanced Adaptive Routing Protocol (BARP), is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at ...