InfoMax: An Information Maximizing Transport Layer Protocol for Named Data Networks

Jongdeog Lee, Akash Kapoor, Md. Tanvir Al Amin, Zhehao Wang, Zeyuan Zhang, Radhika Goyal, T. Abdelzaher
{"title":"InfoMax: An Information Maximizing Transport Layer Protocol for Named Data Networks","authors":"Jongdeog Lee, Akash Kapoor, Md. Tanvir Al Amin, Zhehao Wang, Zeyuan Zhang, Radhika Goyal, T. Abdelzaher","doi":"10.1109/ICCCN.2015.7288420","DOIUrl":null,"url":null,"abstract":"The advent of social networks, mobile sensing, and the Internet of Things herald an age of data overload, where the amount of data generated and stored by various data services exceeds application consumption needs. In such an age, an increasingly important need of data clients will be one of data sub-sampling. This need calls for novel data dissemination protocols that allow clients to request from the network a representative sampling of data that matches a query. In this paper, we present the design of a new transport-layer dissemination protocol, called InfoMax, that allows applications to request such a data sampling. InfoMax exploits the recently proposed named-data-networking (NDN) stack that makes networks aware of hierarchical data names, as opposed to IP addresses. Assuming that named objects with longer prefixes are semantically more similar, InfoMax has the property of minimizing semantic redundancy among delivered data items, hence offering the best coverage of the requested topic with the fewest bytes. The paper discusses the design of InfoMax, its experimental evaluation, and example applications.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2015.7288420","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

The advent of social networks, mobile sensing, and the Internet of Things herald an age of data overload, where the amount of data generated and stored by various data services exceeds application consumption needs. In such an age, an increasingly important need of data clients will be one of data sub-sampling. This need calls for novel data dissemination protocols that allow clients to request from the network a representative sampling of data that matches a query. In this paper, we present the design of a new transport-layer dissemination protocol, called InfoMax, that allows applications to request such a data sampling. InfoMax exploits the recently proposed named-data-networking (NDN) stack that makes networks aware of hierarchical data names, as opposed to IP addresses. Assuming that named objects with longer prefixes are semantically more similar, InfoMax has the property of minimizing semantic redundancy among delivered data items, hence offering the best coverage of the requested topic with the fewest bytes. The paper discusses the design of InfoMax, its experimental evaluation, and example applications.
一种用于命名数据网络的信息最大化传输层协议
社交网络、移动传感和物联网的出现预示着数据过载时代的到来,各种数据服务产生和存储的数据量超过了应用程序消费需求。在这样一个时代,数据客户端越来越重要的需求之一将是数据子采样。这种需求需要新的数据传播协议,允许客户端从网络请求匹配查询的有代表性的数据抽样。在本文中,我们提出了一个新的传输层传播协议的设计,称为InfoMax,它允许应用程序请求这样的数据采样。InfoMax利用了最近提出的命名数据网络(NDN)堆栈,该堆栈使网络能够感知分层数据名称,而不是IP地址。假设具有较长前缀的命名对象在语义上更相似,InfoMax具有最小化交付数据项之间的语义冗余的特性,从而用最少的字节提供请求主题的最佳覆盖。本文讨论了InfoMax的设计、实验评价和实例应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信