177 search results - page 3 / 36 » Stackelberg Routing in Arbitrary Networks |
WAOA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
IPPS
1996
IEEE
13 years 12 months ago
1996
IEEE
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
AGENTS
2000
Springer
14 years 2 days ago
2000
Springer
Adaptivity, both of the individual agents and of the interaction structure among the agents, seems indispensable for scaling up multi-agent systems MAS's in noisy environme...
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...