Map of Relaying Messages (MORM) an approach of message distribution enabling Network Advertisement and Discovery

Di Zhou, Yaning Wang, N. Akhtar, K. Moessner, D. Migault
{"title":"Map of Relaying Messages (MORM) an approach of message distribution enabling Network Advertisement and Discovery","authors":"Di Zhou, Yaning Wang, N. Akhtar, K. Moessner, D. Migault","doi":"10.1109/DRCN.2007.4762259","DOIUrl":null,"url":null,"abstract":"Next generation networks will be more and more heterogeneous and dynamic. The traditional model for interactions between different networks is relatively static. However, future scenarios involve quite dynamic inter-network relationships established to meet service requirements on-the-fly. In particular, Network Composition will enable dynamic and automatic cooperation between networks, based on agreements tailored to meet the specific needs of the networks concerned. To facilitate such interactions, functionality to advertise and to discover various networks and services within the local and remote scope will be required. In this paper, we address the twinfunctions of Network Advertisement and Discovery. A scenariobased analysis is used to determine the key requirements of these functions, with special emphasis on the problem of distributing advertisement and discovery messages to a set of unknown target networks. A novel solution called Map of Relaying Messages is presented to enable the efficient and timely distribution of various messages for the purpose of advertisement and discovery.","PeriodicalId":347030,"journal":{"name":"2007 6th International Workshop on Design and Reliable Communication Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 6th International Workshop on Design and Reliable Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRCN.2007.4762259","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Next generation networks will be more and more heterogeneous and dynamic. The traditional model for interactions between different networks is relatively static. However, future scenarios involve quite dynamic inter-network relationships established to meet service requirements on-the-fly. In particular, Network Composition will enable dynamic and automatic cooperation between networks, based on agreements tailored to meet the specific needs of the networks concerned. To facilitate such interactions, functionality to advertise and to discover various networks and services within the local and remote scope will be required. In this paper, we address the twinfunctions of Network Advertisement and Discovery. A scenariobased analysis is used to determine the key requirements of these functions, with special emphasis on the problem of distributing advertisement and discovery messages to a set of unknown target networks. A novel solution called Map of Relaying Messages is presented to enable the efficient and timely distribution of various messages for the purpose of advertisement and discovery.
中继消息映射(MORM)是一种实现网络发布和发现的消息分发方法
下一代网络将变得越来越异构和动态。不同网络之间交互的传统模型是相对静态的。然而,未来的场景涉及建立动态的网络间关系,以满足动态的服务需求。特别是,网络组成将使网络之间能够根据为满足有关网络的具体需要而制订的协定进行动态和自动的合作。为了促进这种相互作用,将需要在本地和远程范围内宣传和发现各种网络和服务的功能。本文讨论了网络广告和发现的双重功能。使用基于场景的分析来确定这些功能的关键需求,特别强调将广告和发现消息分发到一组未知目标网络的问题。提出了一种新颖的中继消息映射方案,以实现各种消息的有效和及时分发,以达到广告和发现的目的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信