Meta-Peering: Automating ISP Peering Decision Process

IF 5.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Network and Service Management Pub Date : 2024-09-12 DOI:10.1109/TNSM.2024.3459796
Md Ibrahim Ibne Alam;Anindo Mahmood;Prasun Kanti Dey;Murat Yuksel;Koushik Kar
{"title":"Meta-Peering: Automating ISP Peering Decision Process","authors":"Md Ibrahim Ibne Alam;Anindo Mahmood;Prasun Kanti Dey;Murat Yuksel;Koushik Kar","doi":"10.1109/TNSM.2024.3459796","DOIUrl":null,"url":null,"abstract":"Peering between Internet Service Providers (ISPs) is playing an increasingly critical role in Internet traffic exchange. As content delivery networks continue to expand, major content ISPs are increasingly opting for peering arrangements over transit services to facilitate faster exchange of traffic. The satisfaction of the ISP pair and the longevity of the peering arrangement depend on the stability and performance of these peering relationships. We introduce <italic>meta-peering</i>, a term which refers to the set of tools needed to help and automate the ISP peering process – starting with identifying a list of ISPs that are likely to peer, writing router rules to establish BGP sessions with them, and extending the service to monitor all these sessions for notifying any major outages or peering agreement violations. In this paper, we first make a thorough analysis of recent trends in ISP peering and describe how <italic>meta-peering</i> can be implemented by integrating some of the existing tools. We mainly focus on instrumenting the automation of the peer selection process with an aim to identifying potential peering partners and peering locations to exchange traffic. Using these direct peering links greatly reduces energy consumption as traffic takes much shorter paths to their destinations, going through reduced number of intermediary devices (e.g., routers, switches) compared to elongated transit routes, consequently reducing the environmental impact. Utilizing PeeringDB and CAIDA datasets to identify possible peering points for ISP pairs, we consider ISPs’ internal policies to generate a list of acceptable peering contracts (APCs). We design two methodologies to rank order each ISP in the APC list and offer guidance on which ones would be stable and beneficial for the potential peers. A study of more than 3,000 ISP pairs (mostly active in North America) shows that our peer selection methods can attain around 80% accuracy in predicting peering relations.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"23 ","pages":"824-845"},"PeriodicalIF":5.4000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10679244/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Peering between Internet Service Providers (ISPs) is playing an increasingly critical role in Internet traffic exchange. As content delivery networks continue to expand, major content ISPs are increasingly opting for peering arrangements over transit services to facilitate faster exchange of traffic. The satisfaction of the ISP pair and the longevity of the peering arrangement depend on the stability and performance of these peering relationships. We introduce meta-peering, a term which refers to the set of tools needed to help and automate the ISP peering process – starting with identifying a list of ISPs that are likely to peer, writing router rules to establish BGP sessions with them, and extending the service to monitor all these sessions for notifying any major outages or peering agreement violations. In this paper, we first make a thorough analysis of recent trends in ISP peering and describe how meta-peering can be implemented by integrating some of the existing tools. We mainly focus on instrumenting the automation of the peer selection process with an aim to identifying potential peering partners and peering locations to exchange traffic. Using these direct peering links greatly reduces energy consumption as traffic takes much shorter paths to their destinations, going through reduced number of intermediary devices (e.g., routers, switches) compared to elongated transit routes, consequently reducing the environmental impact. Utilizing PeeringDB and CAIDA datasets to identify possible peering points for ISP pairs, we consider ISPs’ internal policies to generate a list of acceptable peering contracts (APCs). We design two methodologies to rank order each ISP in the APC list and offer guidance on which ones would be stable and beneficial for the potential peers. A study of more than 3,000 ISP pairs (mostly active in North America) shows that our peer selection methods can attain around 80% accuracy in predicting peering relations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
元对等:ISP 对等互联决策过程自动化
互联网服务提供商(isp)之间的对等在互联网流量交换中发挥着越来越重要的作用。随着内容传送网络的不断扩展,主要的内容isp越来越多地选择对等安排而不是传输服务,以促进更快的流量交换。ISP对的满意度和对等安排的寿命取决于这些对等关系的稳定性和性能。我们介绍元对等,这是一个术语,指的是帮助和自动化ISP对等过程所需的一组工具-从识别可能对等的ISP列表开始,编写路由器规则以与它们建立BGP会话,并扩展服务以监视所有这些会话,以通知任何重大中断或对等协议违反。在本文中,我们首先对ISP对等的最新趋势进行了全面的分析,并描述了如何通过集成一些现有工具来实现元对等。我们主要专注于检测对等选择过程的自动化,目的是识别潜在的对等伙伴和对等位置以交换流量。使用这些直接对等链路大大降低了能源消耗,因为流量到达目的地的路径要短得多,与冗长的传输路线相比,要经过更少数量的中间设备(如路由器、交换机),从而减少了对环境的影响。利用PeeringDB和CAIDA数据集来确定ISP对可能的对等点,我们考虑了ISP的内部策略来生成可接受的对等合约(apc)列表。我们设计了两种方法来对APC列表中的每个ISP进行排序,并提供了哪些方法对潜在的对等体是稳定和有益的指导。一项对3000多个ISP对(主要活跃在北美)的研究表明,我们的对等选择方法在预测对等关系方面可以达到80%左右的准确率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
期刊最新文献
A Dynamic PAPR Reduction Method Using PTS-ESSA for MIMO Generalized FDM Wireless System Cooperative Multi-Agent Strategy for Caching of Transient Data in Edge-Assisted IoT Networks A Threshold-Triggered Deep Q-Network-Based Framework for Self-Healing in Autonomic Software-Defined IIoT-Edge Networks GAN4RM: A CWGAN-Based Framework for Radio Maps Generation in Real Cellular Networks Segment Routing Header (SRH)-Aware Traffic Engineering in Hybrid IP/SRv6 Networks With Deep Reinforcement Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1