Stitching Notification Distribution Trees for Content-based Publish/Subscribe with P4

Christian Wernecke, Helge Parzyjegla, Gero Mühl, P. Danielis, E. Schweissguth, D. Timmermann
{"title":"Stitching Notification Distribution Trees for Content-based Publish/Subscribe with P4","authors":"Christian Wernecke, Helge Parzyjegla, Gero Mühl, P. Danielis, E. Schweissguth, D. Timmermann","doi":"10.1109/NFV-SDN50289.2020.9289916","DOIUrl":null,"url":null,"abstract":"Publish/subscribe is a flexible communication pattern for loosely coupled distributed applications. The content-based variant matches each published notification against active subscriptions to determine a set of interested subscribers to which the notification is to be delivered. Since the recipient set can be different for each notification, it is challenging to find and install profitable forwarding rules on the network switches. In this paper, we present novel notification forwarding schemes implemented in P4 that use virtual trees (VTs) installed on switches and additional forwarding information encoded in notification packets that is used to connect VTs, to extend VT branches, or to cut off VT subtrees. For deriving beneficial VTs, we consider (i) topological properties of the physical network, (ii) publisher/subscriber relationships, and (iii) notification statistics. We present a generic algorithm for encoding distribution trees and evaluate our forwarding schemes in a data center network. The results show that our schemes perform well and save network bandwidth by reducing the notification header length.","PeriodicalId":283280,"journal":{"name":"2020 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"38 11","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NFV-SDN50289.2020.9289916","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Publish/subscribe is a flexible communication pattern for loosely coupled distributed applications. The content-based variant matches each published notification against active subscriptions to determine a set of interested subscribers to which the notification is to be delivered. Since the recipient set can be different for each notification, it is challenging to find and install profitable forwarding rules on the network switches. In this paper, we present novel notification forwarding schemes implemented in P4 that use virtual trees (VTs) installed on switches and additional forwarding information encoded in notification packets that is used to connect VTs, to extend VT branches, or to cut off VT subtrees. For deriving beneficial VTs, we consider (i) topological properties of the physical network, (ii) publisher/subscriber relationships, and (iii) notification statistics. We present a generic algorithm for encoding distribution trees and evaluate our forwarding schemes in a data center network. The results show that our schemes perform well and save network bandwidth by reducing the notification header length.
使用P4拼接基于内容的发布/订阅通知分布树
发布/订阅是一种灵活的通信模式,适用于松耦合分布式应用程序。基于内容的变体将每个发布的通知与活动订阅进行匹配,以确定将通知传递给的一组感兴趣的订阅者。由于每个通知的接收方集可能不同,因此很难在网络交换机上找到并安装有利可图的转发规则。在本文中,我们提出了在P4中实现的新的通知转发方案,该方案使用安装在交换机上的虚拟树(VT)和编码在通知包中的附加转发信息,用于连接VT,扩展VT分支或切断VT子树。为了获得有益的VTs,我们考虑(i)物理网络的拓扑属性,(ii)发布者/订阅者关系,以及(iii)通知统计。提出了一种通用的分布树编码算法,并对数据中心网络中的转发方案进行了评价。结果表明,我们的方案性能良好,并且通过减少通知头长度节省了网络带宽。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信