{"title":"广播环境下的分布式路由设计","authors":"J. Westcott, J. Jubin","doi":"10.1109/MILCOM.1982.4806013","DOIUrl":null,"url":null,"abstract":"In this paper, we will present the need for distributed network control in a packet radio environment, the criteria used for its evaluation, and an overview of the network algorithms chosen to maintain routing information and to route user traffic. The routing algorithm, known as tiered rings, functions by building a distributed tree of shortest path routes to each packet radio in the network. The information kept by each node grows only linearly as the network expands. The design uses the radio channel efficiently by providing shortest path routing and by taking advantage of the information available in a broadcast environment.","PeriodicalId":179832,"journal":{"name":"MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"A Distributed Routing Design for a Broadcast Environment\",\"authors\":\"J. Westcott, J. Jubin\",\"doi\":\"10.1109/MILCOM.1982.4806013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we will present the need for distributed network control in a packet radio environment, the criteria used for its evaluation, and an overview of the network algorithms chosen to maintain routing information and to route user traffic. The routing algorithm, known as tiered rings, functions by building a distributed tree of shortest path routes to each packet radio in the network. The information kept by each node grows only linearly as the network expands. The design uses the radio channel efficiently by providing shortest path routing and by taking advantage of the information available in a broadcast environment.\",\"PeriodicalId\":179832,\"journal\":{\"name\":\"MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.1982.4806013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.1982.4806013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Distributed Routing Design for a Broadcast Environment
In this paper, we will present the need for distributed network control in a packet radio environment, the criteria used for its evaluation, and an overview of the network algorithms chosen to maintain routing information and to route user traffic. The routing algorithm, known as tiered rings, functions by building a distributed tree of shortest path routes to each packet radio in the network. The information kept by each node grows only linearly as the network expands. The design uses the radio channel efficiently by providing shortest path routing and by taking advantage of the information available in a broadcast environment.