Competitive packet routing with priority lists

DOI10.4230/LIPICS.MFCS.2016.49MaRDI QIDQ4608611zbMATH OpenOpenAlexFDO

Authors Tobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch

Publication date 21 March 2018

Full work available at URL https://dblp.uni-trier.de/db/conf/mfcs/mfcs2016.html#HarksPSK16

zbMATH Keywords

complexityNash equilibriumpacket routingprice of anarchypriority policy

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Games involving graphs (91A43)

Recommendations

• A priority-based model of routing
• Equilibria in routing games with edge priorities
• The impact of local policies on the quality of packet routing in paths, trees, and rings
• Congestion games with priority-based scheduling

Cited in

(6)

• A system for priority routing and capacity assignment in packet switched networks
• Equilibria in routing games with edge priorities
• Identity-Based Hierarchical Key-Insulated Encryption Without Random Oracles
• Computing scores of forwarding schemes in switched networks with probabilistic faults
• Oligopolistic competitive packet routing
• The impact of local policies on the quality of packet routing in paths, trees, and rings

This page was built for publication: Competitive packet routing with priority lists

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