On the interaction of multiple overlay routing

Authors:
Wenjie Jiang;Dah-Ming Chiu;John C. S. Lui
Affiliations:
Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong;Department of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong;Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong
Venue:
Performance Evaluation - Performance 2005
Year:
2005

Citing 7
Cited 9

The end-to-end effects of Internet path selection

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
How bad is selfish routing?

Journal of the ACM (JACM)
A routing underlay for overlay networks

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On selfish routing in internet-like environments

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal routing in Chord

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On Self Adaptive Routing in Dynamic Environments - An Evaluation and Design Using a Simple, Probabilistic Scheme

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Measurement-based optimal routing on overlay architectures for unicast sessions

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation

Loss-cognizant pricing in networks with greedy users

Computer Networks: The International Journal of Computer and Telecommunications Networking
On the Access Pricing and Network Scaling Issues of Wireless Mesh Networks

IEEE Transactions on Computers
A revenue-rewarding scheme of providing incentive for cooperative proxy caching for media streaming systems

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Cooperative content distribution and traffic engineering

Proceedings of the 3rd international workshop on Economics of networked systems
Cooperative content distribution and traffic engineering in an ISP network

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
A cooperative routing method for multiple overlay networks

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Resolving cross-layer conflict between overlay routing and traffic engineering

IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for peer-to-peer market economy

International Journal of Grid and Utility Computing
Traffic engineering with semiautonomous users: a game-theoretic perspective

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the past few years, overlay networks have received much attention but there has been little study on the ''interaction'' of multiple, co-existing overlays on top of a physical network. In addition to previously introduced concept of overlay routing strategy such as selfish routing, we introduce a new strategy called ''overlay optimal routing''. Under this routing policy, the overlay seeks to minimize its weighted average delay by splitting its traffic onto multiple paths. We establish that (i) the overlay optimal routing can achieve better delay compared to selfish routing and (ii) there exists a Nash equilibrium when multiple overlays adopt this strategy. Although an equilibrium point exists for overlay optimal routing and possibly for selfish routing, we show that the interaction of multiple overlay routing may not be Pareto optimal and that some fairness anomalies of resource allocation may occur. This is worthy of attention since overlay may not know the existence of other overlays and they will continue to operate at this sub-optimal point. We explore two pricing schemes to resolve the above issues. We show that by incorporating a proper pricing scheme, the overlay routing game can be led to the desired equilibrium and avoid the problems mentioned above. Extensive fluid-based simulations are performed to support the theoretical claims.