學術產出-Proceedings

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Performance evaluation of a hierarchical hybrid adaptive routing algorithm for large scale computer communication networks
作者 Lien, Yao-nan;Amer, Fathy;Ghieth, Ahmed
連耀南
貢獻者 資科系
日期 1998
上傳時間 17-Jun-2015 16:42:34 (UTC+8)
摘要 A hierarchical hybrid adaptive routing algorithm (HHARA) is presented for dynamic large-scale computer communication networks (LSCCN). The performance of the proposed algorithm is evaluated and compared to that of nonhierarchical routing algorithms by simulation experiments on a 50-node network model. The major evaluation criteria are reliability, communication overhead, computation overhead, and average packet delay. A fixed routing algorithm, the most recent ARPANET routing algorithm, and HHARA are compared using simulation experiments. The simulation study indicates that HHARA makes a good balance between the reduction of routing database maintenance overhead, and the global routing capability as well as the local adaptivity to the network changes
關聯 Computer Networking Symposium - CNS
資料類型 conference
DOI http://dx.doi.org/10.1109/CNS.1988.5005
dc.contributor 資科系
dc.creator (作者) Lien, Yao-nan;Amer, Fathy;Ghieth, Ahmed
dc.creator (作者) 連耀南zh_TW
dc.date (日期) 1998
dc.date.accessioned 17-Jun-2015 16:42:34 (UTC+8)-
dc.date.available 17-Jun-2015 16:42:34 (UTC+8)-
dc.date.issued (上傳時間) 17-Jun-2015 16:42:34 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/75918-
dc.description.abstract (摘要) A hierarchical hybrid adaptive routing algorithm (HHARA) is presented for dynamic large-scale computer communication networks (LSCCN). The performance of the proposed algorithm is evaluated and compared to that of nonhierarchical routing algorithms by simulation experiments on a 50-node network model. The major evaluation criteria are reliability, communication overhead, computation overhead, and average packet delay. A fixed routing algorithm, the most recent ARPANET routing algorithm, and HHARA are compared using simulation experiments. The simulation study indicates that HHARA makes a good balance between the reduction of routing database maintenance overhead, and the global routing capability as well as the local adaptivity to the network changes
dc.format.extent 127 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) Computer Networking Symposium - CNS
dc.title (題名) Performance evaluation of a hierarchical hybrid adaptive routing algorithm for large scale computer communication networks
dc.type (資料類型) conferenceen
dc.identifier.doi (DOI) 10.1109/CNS.1988.5005
dc.doi.uri (DOI) http://dx.doi.org/10.1109/CNS.1988.5005