Sciweavers

31 search results - page 5 / 7
» Constant Queue Routing on a Mesh
Sort
View
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
15 years 10 months ago
Priority based forced requeue to reduce worst-case latencies for bursty traffic
- 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...
Mikael Millberg, Axel Jantsch
WINET
2010
97views more  WINET 2010»
15 years 1 months ago
Routing in the frequency domain
Abstract The design of single transceiver based multichannel multi-hop wireless mesh networks focuses on the trade-off between rapid neighbor synchronization and maximizing the usa...
Jay A. Patel, Haiyun Luo, Indranil Gupta
SPAA
1996
ACM
15 years 7 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
16 years 3 months ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden
142
Voted
ICC
2007
IEEE
146views Communications» more  ICC 2007»
15 years 9 months ago
Active Window Management: An Efficient Gateway Mechanism for TCP Traffic Control
—Many techniques have been proposed in the last few years to address performance degradations in end-to-end congestion control. Although these techniques require parameter tuning...
Mario Barbera, Alfio Lombardo, Carla Panarello, Gi...