學術產出-Proceedings

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 A survey of hierarchical routing algorithms and a new hierarchical hybrid adaptive routing algorithm for large scale computer communication networks
作者 Lien, Yao-nan;Amer, Fathy
連耀南
貢獻者 資科系
日期 1998
上傳時間 17-Jun-2015 16:42:22 (UTC+8)
摘要 A survey is presented of present algorithms, with emphasis of a proposed scheme, the hierarchical hybrid adaptive routing algorithm (HHARA). HHARA reduces the size of routing database by dynamically organizing nodes into hierarchically structured clusters so that only partial information is stored and maintained in each site. The responsibility for routing is shared by the routing hierarchy so that the algorithm can maintain the global routing optimality and the local adaptivity at the same time. In this way, the storage, maintenance, communication, and computation overheads can be reduced while the response time to local status changes is kept small. HHARA can be used with either diagram routing or virtual circuit routing. Due to its ability to adapt to the network changes, it is specially useful for dynamic networks such as large military computer communication networks
關聯 IEEE International Conference on Communications - ICC
資料類型 conference
DOI http://dx.doi.org/10.1109/ICC.1988.13707
dc.contributor 資科系
dc.creator (作者) Lien, Yao-nan;Amer, Fathy
dc.creator (作者) 連耀南zh_TW
dc.date (日期) 1998
dc.date.accessioned 17-Jun-2015 16:42:22 (UTC+8)-
dc.date.available 17-Jun-2015 16:42:22 (UTC+8)-
dc.date.issued (上傳時間) 17-Jun-2015 16:42:22 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/75915-
dc.description.abstract (摘要) A survey is presented of present algorithms, with emphasis of a proposed scheme, the hierarchical hybrid adaptive routing algorithm (HHARA). HHARA reduces the size of routing database by dynamically organizing nodes into hierarchically structured clusters so that only partial information is stored and maintained in each site. The responsibility for routing is shared by the routing hierarchy so that the algorithm can maintain the global routing optimality and the local adaptivity at the same time. In this way, the storage, maintenance, communication, and computation overheads can be reduced while the response time to local status changes is kept small. HHARA can be used with either diagram routing or virtual circuit routing. Due to its ability to adapt to the network changes, it is specially useful for dynamic networks such as large military computer communication networks
dc.format.extent 128 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) IEEE International Conference on Communications - ICC
dc.title (題名) A survey of hierarchical routing algorithms and a new hierarchical hybrid adaptive routing algorithm for large scale computer communication networks
dc.type (資料類型) conferenceen
dc.identifier.doi (DOI) 10.1109/ICC.1988.13707
dc.doi.uri (DOI) http://dx.doi.org/10.1109/ICC.1988.13707