Management of Variable Data Streams in Networks

DOI10.1007/978-3-642-02094-0_13MaRDI QIDQ3637322zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• How bad is selfish routing?
• Algorithms – ESA 2004
• Equilibria in dynamic selfish routing
• Routing into two parallel links: Game-theoretic distributed algorithms
• Selfish Routing in Capacitated Networks

Cites work

• A class of games possessing pure-strategy Nash equilibria
• Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
• Adaptive routing with stale information
• Algorithms – ESA 2004
• Approximating Wardrop Equilibria with Finitely Many Agents
• Automata, Languages and Programming
• Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
• Distributed selfish load balancing
• Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach.
• Fast convergence of selfish rerouting
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• How bad is selfish routing?
• How much can taxes help selfish routing?
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 6469241 (Why is no real title available?)
• Network Games with Atomic Players
• On the impact of combinatorial structure on congestion games
• On the relationship between Nash—Cournot and Wardrop equilibria
• Route optimization in IP networks
• Routing without regret, on convergence to Nash equilibria of regret-minimizing algorithms in routing games
• Stackelberg scheduling strategies
• The complexity of pure Nash equilibria
• The effect of collusion in congestion games
• The price of anarchy is independent of the network topology
• The price of anarchy of finite congestion games
• The price of routing unsplittable flow

Cited in

(11)

• The evolution of transport protocols: an evolutionary game perspective
• Equilibrium routing strategies in data transmission networks
• Data management in networks: Experimental evaluation of a provably good strategy
• Stream data management.
• A nonlinear pairwise swapping dynamics to model the selfish rerouting evolutionary game
• Achievability of efficient satisfaction equilibria in self-configuring networks
• Self-adaptive management policy for scale-free networks
• Stochastic stability in internet router congestion games
• Money-based coordination of network packets
• Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes
• A game theoretic comparison of TCP and digital fountain based protocols

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637322)