TIT
2011
13 years 6 months ago
2011
—“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, ...
QUESTA
2008
13 years 11 months ago
2008
We consider Kelly networks with shuffling of customers within each queue. Specifically, each arrival, departure or movement of customer from one queue to another triggers a shuffl...
CN
2004
13 years 11 months ago
2004
QoS routing involves selection of paths for flows based on the knowledge at network nodes about the availability of resources along paths, and the QoS requirements of flows. Sever...
CONEXT
2005
ACM
14 years 1 months ago
2005
ACM
Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information...
INFOCOM
2009
IEEE
14 years 6 months ago
2009
IEEE
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...