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.