Sciweavers

343 search results - page 2 / 69
» Estimating routing congestion using probabilistic analysis
Sort
View
NETWORKING
2004
13 years 6 months ago
Reducing Packet-Loss by Taking Long-Range Dependences into Account
We show that the "fractal" behavior of Internet traffic can be efficiently and practically employed to significantly reduce packetloss. Thanks to recent advances in the t...
J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud
SPAA
2004
ACM
13 years 10 months ago
Adaptive channel queue routing on k-ary n-cubes
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...
INFOCOM
2003
IEEE
13 years 10 months ago
Estimation of Congestion Price Using Probabilistic Packet Marking
Abstract— One key component of recent pricing-based congestion control schemes is an algorithm for probabilistically setting the Explicit Congestion Notification bit at routers ...
Micah Adler, Jin-yi Cai, Jonathan K. Shapiro, Dona...
DAC
2003
ACM
14 years 6 months ago
Improved global routing through congestion estimation
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
Raia Hadsell, Patrick H. Madden
SLIP
2005
ACM
13 years 10 months ago
Congestion prediction in early stages
Routability optimization has become a major concern in the physical design cycle of VLSI circuits. Due to the recent advances in VLSI technology, interconnect has become a dominan...
Chiu-Wing Sham, Evangeline F. Y. Young