{"title":"On the Performance of End-to-End Routing in Complex Networks with Intermittent Links","authors":"Michikazu Ohnishi, Chuta Minamiguchi, H. Ohsaki","doi":"10.1109/COMPSAC48688.2020.0-100","DOIUrl":null,"url":null,"abstract":"Emergence of IoT (Internet of Things) applications poses challenges on the networking infrastructure since those applications must accommodate a large number of end nodes (e.g., smart sensor devices), and the communication among those nodes are unreliable. In the last decade, DTN (Delay/Disruption-Tolerant Networking) has been actively studied by many researchers, which aims to provide efficient and reliable end-to-end communication in environments where end-to-end paths can not be reliably established. In DTN re-search, superiority and inferiority of several classes of routing mechanisms have been clarified. However, it is still an open question how effectively or ineffectively end-to-end routing performs in networks with moderately intermittent communication links. In this paper, we therefore address the following research questions: (1) does end-to-end routing perform effectively in a large-scale network with many nodes, each of which is connected with a few other nodes via intermittent communication links? (2) how is the average end-to-end message delivery delay affected by the degree (i.e., the total number of incoming and outgoing links) of source and destination nodes? To answer the above research questions, we analytically derive the average message delivery delay with end-to-end routing on a complex network with an arbitrary degree distribution.","PeriodicalId":430098,"journal":{"name":"2020 IEEE 44th Annual Computers, Software, and Applications Conference (COMPSAC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 44th Annual Computers, Software, and Applications Conference (COMPSAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPSAC48688.2020.0-100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Emergence of IoT (Internet of Things) applications poses challenges on the networking infrastructure since those applications must accommodate a large number of end nodes (e.g., smart sensor devices), and the communication among those nodes are unreliable. In the last decade, DTN (Delay/Disruption-Tolerant Networking) has been actively studied by many researchers, which aims to provide efficient and reliable end-to-end communication in environments where end-to-end paths can not be reliably established. In DTN re-search, superiority and inferiority of several classes of routing mechanisms have been clarified. However, it is still an open question how effectively or ineffectively end-to-end routing performs in networks with moderately intermittent communication links. In this paper, we therefore address the following research questions: (1) does end-to-end routing perform effectively in a large-scale network with many nodes, each of which is connected with a few other nodes via intermittent communication links? (2) how is the average end-to-end message delivery delay affected by the degree (i.e., the total number of incoming and outgoing links) of source and destination nodes? To answer the above research questions, we analytically derive the average message delivery delay with end-to-end routing on a complex network with an arbitrary degree distribution.