Journal of the ACM (JACM)
Performance of estimated traffic matrices in traffic engineering
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A Distributed Reinforcement Learning Scheme for Network Routing
A Distributed Reinforcement Learning Scheme for Network Routing
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
On the interaction of multiple overlay routing
Performance Evaluation - Performance 2005
Drafting behind Akamai (travelocity-based detouring)
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Can ISPS and P2P users cooperate for improved performance?
ACM SIGCOMM Computer Communication Review
Interaction of ISPs: Distributed Resource Allocation and Revenue Maximization
IEEE Transactions on Parallel and Distributed Systems
P4p: provider portal for applications
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Taming the torrent: a practical approach to reducing cross-isp traffic in peer-to-peer systems
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Cooperative content distribution and traffic engineering
Proceedings of the 3rd international workshop on Economics of networked systems
On cooperative settlement between content, transit and eyeball internet service providers
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
DaVinci: dynamically adaptive virtual networks for a customized internet
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Prices are right: managing resources and incentives in peer-assisted content distribution
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
A tutorial on decomposition methods for network utility maximization
IEEE Journal on Selected Areas in Communications
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
GreenCoop: cooperative green routing with energy-efficient servers
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Limitations and possibilities of path trading between autonomous systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Improving content delivery using provider-aided distance information
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Enabling content-aware traffic engineering
ACM SIGCOMM Computer Communication Review
Traffic engineering with semiautonomous users: a game-theoretic perspective
IEEE/ACM Transactions on Networking (TON)
Quantifying the benefits of joint content and network routing
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Distributing content simplifies ISP traffic engineering
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Less pain, most of the gain: incrementally deployable ICN
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Pushing CDN-ISP collaboration to the limit
ACM SIGCOMM Computer Communication Review
Joint Server Selection and Routing for Geo-replicated Services
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
Hi-index | 0.00 |
Traditionally, Internet Service Providers (ISPs) make profit by providing Internet connectivity, while content providers (CPs) play the more lucrative role of delivering content to users. As network connectivity is increasingly a commodity, ISPs have a strong incentive to offer content to their subscribers by deploying their own content distribution infrastructure. Providing content services in an ISP network presents new opportunities for coordination between traffic engineering (to select efficient routes for the traffic) and server selection (to match servers with subscribers). In this work, we develop a mathematical framework that considers three models with an increasing amount of cooperation between the ISP and the CP. We show that separating server selection and traffic engineering leads to sub-optimal equilibria, even when the CP is given accurate and timely information about the ISP's network in a partial cooperation. More surprisingly, extra visibility may result in a less efficient outcome and such performance degradation can be unbounded. Leveraging ideas from cooperative game theory, we propose an architecture based on the concept of Nash bargaining solution. Simulations on realistic backbone topologies are performed to quantify the performance differences among the three models. Our results apply both when a network provider attempts to provide content, and when separate ISP and CP entities wish to cooperate. This study is a step toward a systematic understanding of the interactions between those who provide and operate networks and those who generate and distribute content.