Sciweavers

618 search results - page 2 / 124
» Mechanism design for policy routing
Sort
View
CCR
1998
140views more  CCR 1998»
13 years 10 months ago
Policy tree multicast routing: an extension to sparse mode source tree delivery
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scal...
Horst Hodel
WINE
2005
Springer
161views Economy» more  WINE 2005»
14 years 4 months ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
14 years 2 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
MOBISYS
2005
ACM
14 years 10 months ago
Horde: separating network striping policy from mechanism
Inverse multiplexing, or network striping, allows the construction of a high-bandwidth virtual channel from a collection of multiple low-bandwidth network channels. Striping syste...
Asfandyar Qureshi, John V. Guttag
QOFIS
2004
Springer
14 years 4 months ago
Policy-Aware Connectionless Routing
The current Internet implements hop-by-hop packet forwarding based entirely on globally-unique identifiers specified in packet headers, and routing tables that identify destinati...
Bradley R. Smith, J. J. Garcia-Luna-Aceves