政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/36373
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 113393/144380 (79%)
造訪人次 : 51236832      線上人數 : 895
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 >  Item 140.119/36373


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/36373


    題名: Delay Sensitive Routing for High Speed Packet-switching Networks
    高速封包交換網路中考量網路延遲的路由
    作者: 黃玉昇
    Yu-Sheng Huang
    貢獻者: 連耀南
    Yao-Nan Lien
    黃玉昇
    Yu-Sheng Huang
    關鍵詞: delay sensitive routing
    high speed packet switching
    日期: 2002
    上傳時間: 2009-09-18 18:25:48 (UTC+8)
    摘要: 在如同全IP網路(ALL-IP Network)這類的分封交換網路(packet-switching network)中提供具時效性的服務(time-sensitive services)必須嚴格的控制時間。路由規劃是網路管理中重要的一環，所以這類網路的路由規劃必須考慮網路延遲。然而就我們目前所知，多數的傳統路由演算法並不以傳輸延遲(path delay)為主要考量因素；例外少數有考量延遲時間的演算法也僅限於鍊結延遲(link delay)，而未考慮節點延遲(node delay)。此乃肇因於以往頻寬的成本極為昂貴，因而造成演算法設計者在設計時會儘可能有效利用頻寬，如此免不了會犧牲傳遞速度。在過去幾年間，由於光通訊技術的提升，網路頻寬的成長速度遠遠已超過路由器(router)處理能力的成長。在這樣不對等的成長比例驅使下，節點延遲，亦即路由器處理封包時所耗時間，在傳輸延遲中所佔的比例亦隨之快速增長。也因此我們認為，在為高速封包交換網路設計路由演算法時，必須同時考量鍊結延遲和節點延遲。在本論文中，我們設計了一個訊務流為基礎的路由演算法(flow-based routing algorithm)，KLONE，來驗證我們的論點。在規劃路由時，KLONE會把發生在鍊結和節點上的延遲時間一併列入計算，並以全體延遲時間為主要考量。透過我們反覆的測試實驗，我們發現其較之於常用的OSPF演算法，可以在效能上有30%的勝出。藉此，我們的論點得到初步的證實。
    Providing time sensitive services becomes an essential task for some packet-switching networks such as All-IP networks, which will carry all the traffics supported by both circuit-switching and packet-switching networks. To fulfill this demand, such networks require a delay sensitive routing mechanism to provide time-related QoS for delay sensitive services. However, most of traditional routing algorithms do not take delay time as a major concern. Only a few are designed for time sensitive services. These time sensitive routing algorithms are designed at the time when the link bandwidth is the only scarce resource. As the bandwidth of communication links grows rapidly in recent years due to the advance of optical communication technologies, link bandwidth is no longer the only scarce resource. The processing speed of nodes, for example, routers, becomes another critical source of delay time. In this thesis, we designed a new flow-based routing algorithm, the KLONE algorithm, which takes average delay time as its minimization objective and takes both nodes and links as delay components. Through an intensive evaluation using simulation method, we demonstrate that a routing algorithm that considers both link and node delay might outperform the traditional OSPF algorithm.
    i
    1 Introduction … … … … … … … … … … … … … … … … … … … … … … … … … … ...1
    1.1 Switching Network Technologies ....................................................................2
    1.1.1 Circuit-Switching Networks .................................................................2
    1.1.2 Packet-Switching Networks ..................................................................4
    1.1.3 Network Convergence and ALL-IP Networks ......................................7
    1.2 Delay Time Analysis ......................................................................................10
    1.2.1 One Trip Delay Time .......................................................................... 11
    1.2.2 Categories of Delay Time Components .............................................. 11
    1.2.3 Myth of Bandwidth.............................................................................15
    1.2.4 Possible Delay in Routers ...................................................................16
    1.3 Motivation and Research Objective. ..............................................................18
    1.4 Solution Approaches ......................................................................................19
    1.5 Performance Evaluation.................................................................................20
    2 Related Works … … … … … … … … … … … … … … … … … … … … … … … … … 21
    2.1 Routing Approaches .......................................................................................21
    2.1.1 Shortest Path Routing .........................................................................21
    2.1.2 Flooding ..............................................................................................22
    2.1.3 Flow-Based Routing ...........................................................................22
    2.1.4 Distance Vector Routing .....................................................................23
    2.1.5 Link State Routing ..............................................................................24
    2.2 Delay Sensitive Routing ................................................................................24
    2.2.1 Resource Reservation..........................................................................25
    2.2.2 Probes Flooding ..................................................................................25
    2.2.3 Classified Queues................................................................................26
    2.2.4 Delay Time Estimation .......................................................................27
    2.2.5 Miscellaneous ......................................................................................27
    2.3 Summary........................................................................................................28
    3 Routing With Node Delay… … … … … … … … … … … … … … … … … … … … … ..29
    3.1 An Illustration Example .................................................................................29
    3.2 Routing Problem Model.................................................................................31
    3.2.1 Traffic Model ......................................................................................31
    3.2.3 Objective Function..............................................................................33
    3.3 Iterative Solution Algorithm ..........................................................................34
    3.3.1 Intra Iteration Procedures....................................................................35
    3.3.2 Termination Conditions .......................................................................37
    3.2.3 Estimation of Path Delay Time....… … … … … … … … … … … … … … 38
    3.3.4 Node Delay to Link Delay Conversion...............................................41
    3.4 KLONE Algorithm Detail ..............................................................................43
    3.4.2 Pseudo Codes ......................................................................................44
    3.4.3 Complexity Analysis ...........................................................................47
    3.5 Summary........................................................................................................47
    4 Performance Evaluation … … … … … … … … … … … … … … … … … … … … … ..49
    4.1 Performance Evaluation Metrics....................................................................49
    4.1.1 Convergence of KLONE Algorithm ...................................................50
    4.1.2 Performance of KLONE Algorithm....................................................50
    4.2 Design of Experiments...................................................................................51
    4.2.1 Test Instance Generation.....................................................................51
    4.2.2 Experiments ........................................................................................53
    4.3 Experiments and Results ................................................................................54
    4.3.1 Exp-1: Convergence Test ....................................................................56
    4.3.2 Exp-2: Sensitivity to Connectivity......................................................61
    4.3.3 Exp-3: Sensitivity to BP Ratio ............................................................63
    4.3.4 Exp-4: Sensitivity to Number of Nodes ..............................................65
    4.3.5 Comparison with Optimal Solution ....................................................64
    4.3.6 Weakness of KLONE Algorithm ........................................................65
    4.4 Analysis and Summary ..................................................................................67
    5 Concluding Remark and Future Work … … … … … … … … … … … … … … … 68
    參考文獻: 【1】3rd Generation Partnership Project, ""Technical Specification Group Services and
    Systems Aspects; Architecture for an All IP network``, 3GPP TR 23.922 version 1.0.0.,
    October 1999.
    【2】S. Floyd, and V. Jacobson, ""Random Early Detection Gateways fo r Congestion
    Avoidance``, IEEE/ACM Transactions on Networking, vol. 1, no. 4, August 1993, pp.
    397-413.
    【3】A. Demers, S. Keshav and S. Shenker, ""Design and Analysis of a Fair Queueing
    Algorithm``, Proc. SIGCOMM`89, ACM, September 1989, pp. 1-12.
    【4】International Communication Union, ""Coding of Speech at 8kb/s Using
    Conjugate-Structure Algebraic-code-Excited Linear-Prediction (CS-ACELP)``, ITU-T.
    G.729.1, March 1996.
    【5】D. Awduche, J. Malcolm, J. Agogbua, M. O`Dell and J. McManus, ""Requirements for
    Traffic Engineering Over MPLS``, RFC 2702, September 1999.
    【6】D. Ooms, B. Sales, W. Livens, A. Acharya, F. Griffoul and F. Ansari, ""Overview of IP
    Multicast in a Multi-Protocol Label Switching (MPLS) Environment``, RFC 3553,
    August 2002.
    【7】E. Rosen and Y. Rekhter, ""BGP/MPLS VPN``, RFC 2547, March 1999.
    【8】A. S. Tanenbaum, ""Computer Networks, Third Edition``, Prentice Hall, March 1996,
    pp. 345-366.
    【9】Dijkstra, E.W., ""A Note on Two Problems in Connection with Graphs``, Numerische
    Math, vol. 1, March 1959, pp. 269-271.
    【10】C. Hedrick, ""Routing Information Protocol``, RFC 1058, June 1988.
    【11】J. Moy, ""OSPF version 2``, RFC 1583, March 1994.
    【12】Christophe Beaujean, ""Delay-Based Routing Issues in IP Networks``, contact
    GRADIENT CR/98/148, May 2000.
    【13】Douglas S.Reeves and Hussein F. Salama, ""A Distributed Algorithm for
    Delay-Constrained Unicast Routing``, IEEE Transaction on Network , April 2000.
    【14】R. Braden, L. Zhang, S. Berson, S. Herzog and S. Jamin, ""Resource Reservation
    Protocol (RSVP) – Version 1 Functional Specification``, RFC 2205, September 1997.
    【15】K. Chan, R. Sahita, S. Hahn and K. McCloghrie, ""Differentiated Services Quality of
    Service Policy Information Base ``, RFC 3317, March 2003.
    【16】Bill Goodman, ""Internet Telephony and Modem Delay``, IEEE Network, May 1999,
    pp. 8-16.
    【17】J. Garcia-Luna-Aceves and J. Behrens, ""Distributed scalable routing based on vectors
    of link states``, IEEE J. Select on Communication, October 1995.
    【18】Jon Postel, ""Internet Protocol``, RFC 791, September 1981.
    【19】Mark A. Sportack, ""IP Routing Fundamentals``, Cisco ISBN: I-57870-071-x, May
    1999.
    【20】R. Wideyono, ""The Design and Evaluation of Routing Algorithms for Real-Time
    Channels``, International Computer Science Institute, Univ. of California at Berkeley,
    Tech Rep. ISCI TR-94-024, June 1994.
    【21】S. Rampal and D. Reeves, ""An evaluation of routing and admission control
    algorithms for multimedia traffic``, Proc. of the 5th IFIP Conf. on High Performance
    Networks, October 1995.
    【22】S. Lavenberg, ""Mean Value Analysis of Closed Multichain Queuing Networks``,
    Journal of the Association for Computing Machinery, vol. 27, no. 2, April 1980, pp.
    313-322.
    【23】Z. Wang and J. Crowcroft, ""Quality of Service Routing for Supporting Multimedia
    Applications``, IEEE Select on Communication, September 1996.
    描述: 碩士
    國立政治大學
    資訊科學學系
    88753006
    91
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0088753006
    資料類型: thesis
    顯示於類別:[資訊科學系] 學位論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    index.html0KbHTML2455檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋