128 search results - page 11 / 26 » Efficient Deadline-Based QoS Algorithms for High-Performance... |
172
click to vote
SPAA
1996
ACM
15 years 7 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 ...
129
Voted
CN
2006
15 years 3 months ago
2006
Finding paths that satisfy the performance requirements of applications according to the link state information in a network is known as the quality-of-service (QoS) routing probl...
121
click to vote
CN
2004
15 years 3 months ago
2004
Label switched networks have become increasingly attractive to both network providers and customers. By creating aggregate, bandwidth-reserved flows, these networks offer routing ...
112
click to vote
ADHOC
2005
15 years 3 months ago
2005
This paper first studied the timeslot assignment problem in time division multiple access/code division multiple access (TDMA/CDMA) wireless ad hoc networks. Given a path P, we pr...
153
click to vote
TPDS
2010
15 years 1 months ago
2010
—Due to a continued increase in the speed and capacities of computing devices, combined with our society’s growing need for mobile communication capabilities, multihop wireless...