Paper Info
Title
Benefit of Online Real-Time Data in the Braess Paradox with Anticipatory Routing
Abstract
The routing problem in traffic networks is a prominent problem of distributed adaptive systems. The online routing game model is used to investigate the routing problem, when each subsequent agent of the traffic flow may select different route based on real-time data. Recent investigations proved that if the agents of such system use shortest path search strategy, then in some situations sometimes the multi-agent system may be worse off with real-time data than without real-time data. This paper contributes to the state-of-the-art by proving the guaranteed worst case benefit of online real-time data in the Braess paradox where each subsequent agent of the traffic flow may select different route using anticipatory techniques.
Year
DOI
Venue
2016
10.1109/ICAC.2016.68
2016 IEEE International Conference on Autonomic Computing (ICAC)
Keywords
Field
DocType
online routing game,benefit of online real-time data
Link-state routing protocol,Equal-cost multi-path routing,Dynamic Source Routing,Static routing,Policy-based routing,Computer science,Routing domain,Destination-Sequenced Distance Vector routing,Real-time computing,Routing Information Protocol,Distributed computing
Conference
ISSN
ISBN
Citations 
2474-0756
978-1-5090-1655-6
1
PageRank 
References 
Authors
0.36
0
1
Name
Order
Citations
PageRank
László Zsolt Varga119424.42