Sciweavers

244 search results - page 22 / 49
» Algorithmic Techniques for Maintaining Shortest Routes in Dy...
Sort
View
HIPC
2007
Springer
13 years 12 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
MOBIHOC
2005
ACM
14 years 7 months ago
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...
Jian Tang, Guoliang Xue, Weiyi Zhang
INFOCOM
2010
IEEE
13 years 6 months ago
Back-Pressure Routing for Intermittently Connected Networks
—We study a mobile wireless network where groups or clusters of nodes are intermittently connected via mobile “carriers” (the carriers provide connectivity over time among di...
Jung Ryu, Lei Ying, Sanjay Shakkottai
IPPS
2006
IEEE
14 years 2 months ago
Dynamic power saving in fat-tree interconnection networks using on/off links
Current trends in high-performance parallel computers show that fat-tree interconnection networks are one of the most popular topologies. The particular characteristics of this to...
Marina Alonso, Salvador Coll, Juan Miguel Mart&iac...
SPAA
2006
ACM
14 years 1 months ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...