research-article

Incentive-compatible caching and peering in data-oriented networks

Authors:

Jarno Rajahalme,

Mikko Särelä,

Pekka Nikander,

Sasu TarkomaAuthors Info & Claims

CoNEXT '08: Proceedings of the 2008 ACM CoNEXT Conference

Article No.: 62, Pages 1 - 6

https://doi.org/10.1145/1544012.1544074

Published: 09 December 2008 Publication History

Abstract

Several new, data-oriented internetworking architectures have been proposed recently. However, the practical deployability of such designs is an open question. In this paper, we consider data-oriented network designs in the light of the policy and incentive structures of the present internetworking economy. A main observation of our work is that none of the present proposals is both policy-compliant and incentive-compatible with the current internetworking market, which makes their deployment very challenging if not impossible. This difficulty stems from the unfounded implicit assumption that data-oriented routing policies directly reflect the underlying packet-level inter-domain policies. We find that to enable the more effective network utilization promised by data-oriented networking, essential caching incentives need to exist, and that data-oriented peering needs be considered separately from peering for packet forwarding.

References

[1]

M. Caesar, T. Condie, J. Kannan, K. Lakshminarayanan, I. Stoica, and S. Shenker. ROFL: Routing on Flat Labels. In ACM SIGCOMM'06. Proceedings, pages 363--374, September 2006.

Digital Library

[2]

H. Chang, S. Jamin, and W. Willinger. To peer or not to peer: Modeling the evolution of the internet's as-level topology. IEEE INFOCOM'06. Proceedings, pages 1--12, April 2006.

[3]

C. Corbett. Peering of Video. Presentation at NANOG 37, available online at http://www.nanog.org/mtg-0606/pdf/bill.norton.3.pdf, June 2006.

[4]

J. Day. Patterns in Network Architecture: A Return to Fundamentals. Prentice-Hall, 2008.

Digital Library

[5]

C. Diot, B. Levine, B. Lyles, H. Kassem, and D. Balensiefen. Deployment issues for the IP multicast service and architecture. Network, IEEE, 14(1): 78--88, 2000.

Digital Library

[6]

P. Faratin, D. Clark, P. Gilmore, S. Bauer, A. Berger, and W. Lehr. Complexity of internet interconnections: Technology, incentives and implications for policy. In The 35th Research Conference on Communication, Information and Internet Policy (TPRC), 2007.

[7]

J. Feigenbaum, V. Ramachandran, and M. Schapira. Incentive-Compatible Interdomain Routing. Tech. Report 1342, Yale Univ., May 2006.

Digital Library

[8]

P. Ganesan, K. Gummadi, and H. Garcia-Molina. Canon in G major: designing DHTs with hierarchical structure. Distributed Computing Systems. Proceedings, pages 263--272, 2004.

Digital Library

[9]

L. Gao. On inferring autonomous system relationships in the Internet. Networking, IEEE/ACM Transactions on, 9(6): 733--745, Dec 2001.

Digital Library

[10]

L. Gao and F. Wang. The extent of AS path inflation by routing policies. IEEE GLOBECOM'02. Proceedings, 3: 2180--2184, Nov. 2002.

[11]

M. Gritter and D. R. Cheriton. An Architecture for Content Routing Support in the Internet. In USENIX USITS'01. Proceedings, Berkeley, CA, USA, 2001.

Digital Library

[12]

G. Huston. Interconnection, Peering, and Settlements. In Proc. Internet Global Summit (INET), Jun. 1999.

[13]

V. Jacobson. A New Way to look at Networking. Talk at Google, available online at http://video.google.com/videoplay?docid=-6972678839686672840, 2006.

[14]

T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K. H. Kim, S. Shenker, and I. Stoica. A Data-Oriented (and Beyond) Network Architecture. In ACM SIGCOMM'07. Proceedings, pages 181--192, 2007.

Digital Library

[15]

J. Moy. Open Shortest Path First (OSPF) version 2. RFC 2328, The Internet Engineering Task Force, Apr. 1998.

[16]

W. B. Norton. Internet Service Providers and Peering. Technical report, Unpublished draft, 2001. http://www.scs.stanford.edu/nyu/04sp/sched/peering.pdf.

[17]

J. Parker, Ed. Recommendations for Interoperable IP Networks using Intermediate System to Intermediate System (ISIS). RFC 3787, The Internet Engineering Task Force, May 2004.

Digital Library

[18]

S. Ratnasamy, S. Shenker, and S. McCanne. Towards an Evolvable Internet Architecture. In ACM SIGCOMM'05. Proceedings, pages 313--324, 2005.

Digital Library

[19]

Y. Rekhter and T. Li. A Border Gateway Protocol (BGP-4). RFC 1771, The Internet Engineering Task Force, Mar. 1995.

Digital Library

[20]

S. Savage, T. Anderson, A. Aggarwal, D. Becker, N. Card-well, A. Collins, E. Hoffman, J. Snell, A. Vahdat, G. Voelker, and J. Zahorjan. Detour: Informed Internet Routing and Transport. Micro, IEEE, 19(1): 50--59, Jan/Feb 1999.

Digital Library

[21]

A. Snoeren and B. Raghavan. Decoupling policy from mechanism in Internet routing. ACM SIGCOMM Computer Communication Review, 34(1): 81--86, 2004.

Digital Library

[22]

H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin. The Impact of Routing Policy on Internet Paths. IEEE INFOCOM'01. Proceedings, 2: 736--742 vol. 2, 2001.

[23]

X. Yang, D. Clark, and A. Berger. NIRA: A New Inter-Domain Routing Architecture. Networking, IEEE/ACM Transactions on, 15(4): 775--788, Aug. 2007.

Digital Library

Cited By

Soltani MBarekatain BHendessi FBeheshti Z(2025)PSSN: a novel cache placement method based on adapted Shannon entropy and simple additive weighting method in named data networkingKnowledge and Information Systems10.1007/s10115-024-02266-567:2(1507-1540)Online publication date: 1-Feb-2025
https://dl.acm.org/doi/10.1007/s10115-024-02266-5
Hashimoto SMisumi MKamiyama N(2024)Analysis of Diffusion Process of ICN Based on Economic FactorsNOMS 2024-2024 IEEE Network Operations and Management Symposium10.1109/NOMS59830.2024.10575451(1-5)Online publication date: 6-May-2024
https://doi.org/10.1109/NOMS59830.2024.10575451
Ito MKamiyama N(2024)Money Adjustment Among ISPs Based on Cooperative Games for ICN Promotion2024 IEEE Cyber Science and Technology Congress (CyberSciTech)10.1109/CyberSciTech64112.2024.00043(222-229)Online publication date: 5-Nov-2024
https://doi.org/10.1109/CyberSciTech64112.2024.00043
Show More Cited By

Index Terms

Incentive-compatible caching and peering in data-oriented networks

Recommendations

Peering equilibrium multipath routing: a game theory framework for internet peering settlements

It is generally admitted that interdomain peering links represent nowadays the main bottleneck of the Internet, particularly because of lack of coordination between providers, which use independent and "selfish" routing policies. We are interested in ...
Paid peering among internet service providers
GameNets '06: Proceeding from the 2006 workshop on Game theory for communications and networks

We develop models for Internet Service Provider (ISP) peering when ISPs charge each other for carrying traffic. We study linear pricing schemes in a simple ISP peering model using a two stage sequential Nash game in which self interested providers first ...
A peering architecture for ubiquitous IP multicast streaming

IP Multicast has been widely used for the distribution of real-time video. However, a large portion of the Internet is not multicast-enabled. Such networks rely on static relays and static tunnels to support video streaming. Being static, the streaming ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CoNEXT '08: Proceedings of the 2008 ACM CoNEXT Conference

December 2008

526 pages

ISBN:9781605582108

DOI:10.1145/1544012

Conference Chairs:
Arturo Azcorra
IMDEA Networks and University Carlos III of Madrid, Spain
,
Gustavo de Veciana
University Texas at Austin
,
Program Chairs:
Keith W. Ross
Polytechnic University
,
Leandros Tassiulas
University of Thessaly, Greece

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 December 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Seventh Framework Programme

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

49
Total Citations
View Citations
361
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Soltani MBarekatain BHendessi FBeheshti Z(2025)PSSN: a novel cache placement method based on adapted Shannon entropy and simple additive weighting method in named data networkingKnowledge and Information Systems10.1007/s10115-024-02266-567:2(1507-1540)Online publication date: 1-Feb-2025
https://dl.acm.org/doi/10.1007/s10115-024-02266-5
Hashimoto SMisumi MKamiyama N(2024)Analysis of Diffusion Process of ICN Based on Economic FactorsNOMS 2024-2024 IEEE Network Operations and Management Symposium10.1109/NOMS59830.2024.10575451(1-5)Online publication date: 6-May-2024
https://doi.org/10.1109/NOMS59830.2024.10575451
Ito MKamiyama N(2024)Money Adjustment Among ISPs Based on Cooperative Games for ICN Promotion2024 IEEE Cyber Science and Technology Congress (CyberSciTech)10.1109/CyberSciTech64112.2024.00043(222-229)Online publication date: 5-Nov-2024
https://doi.org/10.1109/CyberSciTech64112.2024.00043
Dong LLi R(2021)Optimal Chunk Caching in Network Coding Based Qualitative CommunicationDigital Communications and Networks10.1016/j.dcan.2021.06.002Online publication date: Jun-2021
https://doi.org/10.1016/j.dcan.2021.06.002
Shao XAsaeda HDong MMa Z(2019)Cooperative Inter-Domain Cache Sharing for Information-Centric Networking via a Bargaining Game ApproachIEEE Transactions on Network Science and Engineering10.1109/TNSE.2018.28710216:4(698-710)Online publication date: 1-Oct-2019
https://doi.org/10.1109/TNSE.2018.2871021
Dong LLi R(2019)A Novel Multi-Factored Replacement Algorithm for In-Network Content Caching2019 European Conference on Networks and Communications (EuCNC)10.1109/EuCNC.2019.8801966(246-251)Online publication date: Jun-2019
https://doi.org/10.1109/EuCNC.2019.8801966
Ghasemi CYousefi HShin KZhang B(2018)MUCA: New Routing for Named Data Networking2018 IFIP Networking Conference (IFIP Networking) and Workshops10.23919/IFIPNetworking.2018.8697026(289-297)Online publication date: May-2018
https://doi.org/10.23919/IFIPNetworking.2018.8697026
Yi CCho H(2018)Distributed Horizontal Collaboration Caching in Edge Computing2018 International Conference on Computational Science and Computational Intelligence (CSCI)10.1109/CSCI46756.2018.00287(1454-1455)Online publication date: Dec-2018
https://doi.org/10.1109/CSCI46756.2018.00287
Duan JTian RXing YHuang YCao XZhang YZhao G(2018)A Collaborative Pricing Framework for In-Network Caching in Information- Centric NetworkingIEEE Access10.1109/ACCESS.2018.28491036(40485-40493)Online publication date: 2018
https://doi.org/10.1109/ACCESS.2018.2849103
Xu JXue KCao CYue H(2017)Incentive cooperative caching for localized information-centric networks2017 9th International Conference on Wireless Communications and Signal Processing (WCSP)10.1109/WCSP.2017.8171141(1-6)Online publication date: Oct-2017
https://doi.org/10.1109/WCSP.2017.8171141
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten