{"title":"Reducing Routing Overhead in a Growing DDN","authors":"J. Seeger, A. Khanna","doi":"10.1109/MILCOM.1986.4805715","DOIUrl":null,"url":null,"abstract":"The Defense Data Network (DDN), based on ARPANET technology, is expanding rapidly. One segment of the DDN, the MILNET, will include 250 packet switching nodes by the end of 1987 and as many as 700 by 1991. One obstacle that must be overcome to allow this growth is the overhead associated with the current ARPANET dynamic routing mechanism. Both link utilization due to routing updates and routing computational load are roughly proportional to network size. This paper presents three approaches to reducing routing overhead and includes both modifications to the existing routing scheme and a design for a hierarchical extension.","PeriodicalId":126184,"journal":{"name":"MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.1986.4805715","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26
Abstract
The Defense Data Network (DDN), based on ARPANET technology, is expanding rapidly. One segment of the DDN, the MILNET, will include 250 packet switching nodes by the end of 1987 and as many as 700 by 1991. One obstacle that must be overcome to allow this growth is the overhead associated with the current ARPANET dynamic routing mechanism. Both link utilization due to routing updates and routing computational load are roughly proportional to network size. This paper presents three approaches to reducing routing overhead and includes both modifications to the existing routing scheme and a design for a hierarchical extension.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
