Active Topology Inference in Store, Code, and Forward Networks

Gregory Larmore, Willie K. Harrison
{"title":"Active Topology Inference in Store, Code, and Forward Networks","authors":"Gregory Larmore, Willie K. Harrison","doi":"10.1109/ISWCS.2018.8491220","DOIUrl":null,"url":null,"abstract":"This paper presents a technique for active topology inference in store, code, and forward networks. Many techniques exist for topology inference and are well suited for store-and-forward and cut-through switching; however, these simpler techniques fail to capitalize on the flexibility of recoding afforded by store, code, and forward networks. This is in contrast to network coding, which recodes the data whenever possible and consequently achieves the maximum flow (and minimum cut) of throughput across a network. The technique herein utilizes a single probe message between a single source and potentially many destination nodes to achieve deterministic topology inference.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2018.8491220","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper presents a technique for active topology inference in store, code, and forward networks. Many techniques exist for topology inference and are well suited for store-and-forward and cut-through switching; however, these simpler techniques fail to capitalize on the flexibility of recoding afforded by store, code, and forward networks. This is in contrast to network coding, which recodes the data whenever possible and consequently achieves the maximum flow (and minimum cut) of throughput across a network. The technique herein utilizes a single probe message between a single source and potentially many destination nodes to achieve deterministic topology inference.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
存储、编码和转发网络中的主动拓扑推理
本文提出了一种在存储网络、编码网络和转发网络中进行主动拓扑推理的技术。存在许多拓扑推断技术,非常适合存储转发和直通交换;然而,这些更简单的技术不能充分利用存储、代码和转发网络所提供的重新编码的灵活性。这与网络编码形成对比,网络编码在可能的情况下对数据进行重新编码,从而实现网络上吞吐量的最大流量(和最小切割)。该技术利用单个源节点和潜在的多个目标节点之间的单个探测消息来实现确定性拓扑推断。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impact of Selective Channels on Post-OFDM Waveforms for 5G Machine Type Communications Secure Power Allocation of Two-Way Relaying with an Untrusted Denoise-and-Forward Relay Joint Hybrid Precoding Based on Orthogonal Codebook in Millimeter Wave Systems Approximating Electromagnetic Exposure in Dense Indoor Environments Location-Aware Hypergraph Coloring Based Spectrum Allocation for D2D Communication
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1