Studies on Adaptive Routing for a Wide-Area Overlay Network System

• Material Type: 博士論文
• Title: Studies on Adaptive Routing for a Wide-Area Overlay Network System
• Author/Editor: 柏崎, 礼生
• Author Heading: 柏崎, 礼生
• Publication, Distribution, etc.: Hokkaido University
• Publication Date: 2014-03-25
• Publication Date (W3CDTF): 2014-03-25
• Alternative Title: 広域オーバーレイネットワークのための適応的経路制御に関する研究
• Contributor: 高井, 昌彰; 栗原, 正仁; 水田, 正弘; 棟朝, 雅晴; 山本, 雅人
• Degree grantor/type: 北海道大学
• Date Granted: 2014-03-25
• Date Granted (W3CDTF): 2014-03-25
• Dissertation Number: 乙第6907号
• Degree Type: 博士(情報科学)
• Conferring No. (Dissertation): 乙第6907号
• Text Language Code: eng
• Alias of Author: Kashiwazaki, Hiroki
• NDC: 500
• Target Audience: 一般
• Note (General): This paper proposes and evaluates two types of trafficengineering algorithms.The first, REI, and its derivative, NREI, are decentralized stochastic methods that have autonomousadaptability to network traffic conditions.When a routing node has some different paths to a givendestination, these paths can be evaluated in terms oftheir latency (delay time) information,which will be given from a feedback packet sent backfrom a destination node to a source node after anoutbound packet reaches the destination node.This algorithm is based on a one-way delay algorithm.NREI was developed from the delay time based adaptiverouting algorithm, REI, and is enforced for packetlosses caused by network congestion.Based on a path evaluation using latency and penaltyscores from lost packets, every node works as adistributed autonomous agent for adaptive routing.Through network simulations comparing these algorithmsto conventional and enhanced OSPFs and evaluationson an IP network of a research test bed, it is shownthat a multi-agent based routing algorithm has betteradaptability and scalability to congested path avoidance and network load balancing.In addition, the other approach proposed is a centralized deterministic method that uses a discreteevent simulator.This method searches for a suboptimal combination of paths from the enormous number of combinations ofpaths determined from pairs of all source nodes andall destination nodes.Cloud computing resources are used to evaluate thesehuge combinations rapidly, by which we can utilizepowerful computing resources.This method was tested on an ns-2 simulator with eight-and eleven-node networks.The results show that the method has better adaptabilityand high-speed performance for cross-traffic avoidance.Finally, implementation using OpenFlow is consideredand herein a hybrid model consisting of the two proposedalgorithms is discussed.; (主査) 教授 高井 昌彰, 教授 栗原 正仁, 教授 水田 正弘, 教授 棟朝 雅晴, 教授 山本 雅人; 情報科学研究科
• DOI: 10.14943/doctoral.r6907; https://doi.org/10.14943/doctoral.r6907
• Persistent ID (NDL): info:ndljp/pid/8949823; https://dl.ndl.go.jp/pid/8949823
• Collection: 障害者向け資料
• Collection (Materials For Handicapped People:1): テキストデータ
• Collection (particular): 国立国会図書館デジタルコレクション > デジタル化資料 > 博士論文; https://dl.ndl.go.jp/collections/A00014
• Acquisition Basis: 博士論文（自動収集）
• Available (W3CDTF): 2015-03-03
• Date Accepted (W3CDTF): 2015-02-03T05:25:05+09:00
• Date Created (W3CDTF): 2014-01
• Format (IMT): PDF
• Access Restrictions: 国立国会図書館内限定公開
• Service for the Digitized Contents Transmission Service: 図書館・個人送信対象外
• Availability of remote photoduplication service: 可
• Periodical Title (URI): http://dx.doi.org/10.14943/doctoral.r6907; http://hdl.handle.net/2115/55690
• Is Referenced By (URI): http://hdl.handle.net/2115/55677
• Data Provider (Database): 国立国会図書館 : 国立国会図書館デジタルコレクション; https://dl.ndl.go.jp