Management of Variable Data Streams in Networks

DOI10.1007/978-3-642-02094-0_13zbMath1248.68060OpenAlexW1532482941MaRDI QIDQ3637322

Berthold Vöcking, Anja Feldmann, Nils Kammenhuber, Simon Fischer

Publication date: 9 July 2009

Published in: Algorithmics of Large and Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02094-0_13

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Internet topics (68M11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How much can taxes help selfish routing?
• A class of games possessing pure-strategy Nash equilibria
• The effect of collusion in congestion games
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• How bad is selfish routing?
• On the impact of combinatorial structure on congestion games
• Approximating Wardrop Equilibria with Finitely Many Agents
• The complexity of pure Nash equilibria
• Adaptive routing with end-to-end feedback
• The price of anarchy of finite congestion games
• Distributed selfish load balancing
• Network Games with Atomic Players
• On the relationship between Nash—Cournot and Wardrop equilibria
• Stackelberg scheduling strategies
• Adaptive routing with stale information
• Routing without regret
• Algorithms – ESA 2004
• Automata, Languages and Programming
• The Price of Routing Unsplittable Flow
• The price of anarchy is independent of the network topology

This page was built for publication: Management of Variable Data Streams in Networks