177 search results - page 10 / 36 » Stackelberg Routing in Arbitrary Networks |
103
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...
98
Voted
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...
114
Voted
CORR
2008
Springer
15 years 17 days ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
109
Voted
INFOCOM
2002
IEEE
15 years 5 months ago
2002
IEEE
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...
85
Voted
ICNP
2009
IEEE
15 years 7 months ago
2009
IEEE
—We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the no...