19 search results - page 4 / 4 » Optimal Many-to-One Routing on the Mesh with Constant Queues |
114
click to vote
SPAA
1996
ACM
15 years 1 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
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...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses...