1 / 83

QoS Budget Allocation and Path Planning in All-IP Core Network

QoS Budget Allocation and Path Planning in All-IP Core Network. 在 All-IP 核心網路上的品質預算之配置及路徑規劃. 政治大學資訊科學所 指導教授 : 連耀南 學 生 : 林岳生. Outline. Introduction and Related Work System Model Solution Approaches Performance Evaluation Experiment Design Simulation Results

grace
Download Presentation

QoS Budget Allocation and Path Planning in All-IP Core Network

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. QoS Budget Allocation and Path Planning in All-IP Core Network 在All-IP核心網路上的品質預算之配置及路徑規劃 政治大學資訊科學所 指導教授 : 連耀南 學 生 : 林岳生

  2. Outline • Introduction and Related Work • System Model • Solution Approaches • Performance Evaluation • Experiment Design • Simulation Results • Conclusion and Future Work

  3. All-IP Network • All-IP Network • 使用packet switching的IP網路承載各類網路應用 • 單一傳輸平台提供固定網路及行動網路上所有服務， 包括語音、多媒體、資料等各類服務。 • 優點 • 減少建置與管理的成本 • 提供跨網路應用的平台 • 挑戰 • 異質網路整合 • 複雜的QoS問題

  4. Network Convergence => All-IP Network

  5. A Simplified All-IP Network Architecture

  6. Quality of Service • QoS aspects • Long delay time • Jitter • Packet loss • More complicated QoS management

  7. QoS Management • IP Network QoS Architecture • IntServ • DiffServ • QoS Management Architecture • TEQUILA • Victor O.K. Li’s Architecture • AQUILA • BBQ (Budget-Based QoS Management) • Yao-Nan Lien, Hung-Ching Jang, Tsu-Chieh Tsai and Hsing Luh, 2005, "Budget Based QoS Management Infrastructure for All-IP Networks '', Proceedings of the IEEE 25th International Conference on Advanced Communication Technology

  8. BBQ Design Philosophy • Budget Based QoS Management • Pre-Planning vs. On-Demand Managements • Class Based Service Policies • Path Centric Per-Flow End-to-End QoS Assurance

  9. Bearer Service Architecture

  10. Key Tasks of Core Network • Resource Allocation • Admission Control • Routing (Path Planning) • Packet Forwarding

  11. Path Planning in BBQ • Bandwidth-Delay Constrained Routing Problem • Solved by Greedy Algorithm • Greedy Path Planning Algorithm (GPPA) • Chung-Tsun Li and Yao-Nan Lien, 2003, "Path Planning in Budget-Based QoS Management for All-IP Core Networks" • Fix quality bound and bandwidth capacity • Allocated by the order of unit profit

  12. Quality is Load-dependent

  13. Related Work • KLONE algorithm • Yao-Nan Lien and Yu-Sheng Huang, 2004, “Delay Sensitive Routing for High Speed Packet-Switching Networks”, Proceedings of the IEEE International Conference Networking, Sensing, and Control, March 21-23. 2004 • Model as flow-based routing problem with links and nodes delay dependent on flows.

  14. Quality is Load-dependent

  15. Routing with Fixed Quality Bound • Node uv ( Bandwidth Capacity, Quality Bound ) (70MB,10ms) 4 (100MB, 15ms) (80MB, 10ms) 2 (90MB,9ms) 7 (60MB,6ms) (150MB,10ms) 5 1 (40MB,6ms) (100MB,10ms) (60MB,6ms) 3 6 (80MB,15ms)

  16. Capacity-Quality is Optional • Node uv ( Bandwidth Capacity, Quality Bound ) (70MB,10ms) 4 (100MB,15ms) or (80MB, 12ms) or (60MB, 10ms) (80MB,10ms) or (70MB, 8ms) 2 (90MB,9ms) 7 (60MB,6ms) (150MB,10ms) or (130MB, 8ms) or (100MB, 6ms) 5 1 (40MB,6ms) (100MB,10ms) or (70MB, 7ms) (60MB,6ms) 3 6 (80MB,15ms) or (50MB, 10ms)

  17. Motivation • 考量負載對於鏈結提供服務品質的影響，主動規劃鏈結上的參數規劃，期望能提供較佳的繞徑規劃的參數規劃。 • 網路營運者可靈活地管理網路，以到達營運者的運作目標。

  18. Outline • Introduction and Related Work • System Model • Solution Approaches • Performance Evaluation • Experiment Design • Simulation Results • Conclusion and Future Work

  19. Quality Definition • 假設只處理單一的quality constraint • 由網路營運者自行定義服務品質參數 • 服務品質定義，Ex:

  20. System Model • 鏈結資源規劃最佳化 • 假設每個鏈結上有幾組bandwidth capacity與quality的選擇。 • 選出一組最佳的路徑規劃參數，提供為QoS routing規劃依據，使得獲利最大。

  21. Capacity-Delay is Optional • Node uv ( Bandwidth Capacity, Quality Bound ) (70MB,10ms) 4 (100MB,15ms) or (80MB, 12ms) or (60MB, 10ms) (80MB,10ms) or (70MB, 8ms) 2 (90MB,9ms) 7 (60MB,6ms) (150MB,10ms) or (130MB, 8ms) or (100MB, 6ms) 5 1 (40MB,6ms) (100MB,10ms) or (70MB, 7ms) (60MB,6ms) 3 6 (80MB,15ms) or (50MB, 10ms)

  22. Notation

  23. System Model • 給定一組網路拓樸 G(V,E)，G為direct graph，包含 |V|個node和 |E|個directed link，V是node的集合，E是link的集合。 • 在任一個link euv，有k組參數，每組參數有兩個屬性　　　　，一為此link euv能提供的最大bandwidth capacity　 ，另一為此capacity 所能提供的quality 。 • 輸入為request set R，ri代表第 i個 request，包含起點(si)，終點(di)，所需要頻寬(bi)，和服務品質參數(qi)四個參數。

  24. System Model • 定義獲利 mi是允許request ri進入核心網路後所獲得的利益。 • 獲益函數P()依據網路營運者提供服務品質與頻寬的獲利關係對應。

  25. System Model • 在有限資源下，儘可能找出滿足request set R所要求constraint的路徑組合Ω，使得總獲益Ｍ能獲得最大值。

  26. Capacity-Quality is Optional • Node uv 4 2 7 5 1 3 6

  27. Routing Problem • Challenge • 如何選擇 CQ (capacity-quality) pair?

  28. Solution Approaches • NP-Complete Problem • Solution Approaches for Sub-optimal • General Search • Genetic algorithm • Tabu search • Hill-climbing • Branch and bound • Heuristic Search

  29. Hill Climbing + Heuristic Approaches • Capacity-First Algorithm • Capacity First • Path Planning (GPPA) • CQ pair Selection • 依據Routing的結果，逐步調整CQ pair，逐漸選擇capacity較小的CQ pair • Quality-First Algorithm • Quality First • Path Planning (GPPA) • CQ pair Selection • 依據Routing的結果，逐步調整CQ pair，逐漸選擇quality較差的capacity-quality pair

  30. Capacity-First Algorithm

  31. Capacity-First Algorithm

  32. Capacity-First Algorithm

  33. Capacity-First Algorithm 1.Capacity First 一個拓樸的鏈結上有多組可供選擇的CQ pair，在每個鏈結上優先選擇capacity最大，quality最差的pair。 2.Path Planning (GPPA) (1)基於選定的網路參數，進行路徑規劃，所獲結果如滿足所有request需求，則結束。 (2)否則，則檢查是否有任一鏈結有剩餘的頻寬，並且有可供選擇的CQ pair，假如沒有，則結束。 3.CQ pair Selection 假如有，在這些鏈結中，要優先選擇哪個鏈結調整?

  34. Candidate for CQ pair Adjustment

  35. Weighted Surplus Bandwidth • 依據Priority作為選擇的順序依據

  36. Capacity-First Algorithm 1.Capacity First 一個拓樸的鏈結上有多組可供選擇的CQ pair，在每個鏈結上優先選擇capacity最大，quality最差的pair。 2.Path Planning (GPPA) (1)基於選定的網路參數，進行路徑規劃，所獲結果如滿足所有request需求，則結束。 (2)否則，則檢查是否有任一鏈結有剩餘的頻寬，並且有可供選擇的CQ pair，假如沒有，則結束。 3.CQ pair Selection 假如有，優先選擇Priority最大的鏈結，選擇該鏈結次大capacity的CQ pair，確定拓樸的參數設定後，回到步驟2。

  37. Drop of Profit • Local optimal • Backtracking Mechanism

  38. Capacity-First Algorithm 1.Capacity First 一個拓樸的鏈結上有多組可供選擇的CQ pair，在每個鏈結上優先選擇capacity最大，quality最差的pair。 2.Path Planning (GPPA) (1)基於選定的網路參數，進行路徑規劃，所獲結果如滿足所有request需求，則結束。 (2)否則，則檢查是否有任一鏈結有剩餘的頻寬，並且有可供選擇的CQ pair，假如沒有，則結束。 (3)假如CQ pair選擇的結果造成profit下降，將造成profit下降的CQ pair標記 3.CQ pair Selection 假如有，優先選擇Priority最大的鏈結，選擇該鏈結次大capacity的CQ pair，確定拓樸的參數設定後，回到步驟2。

  39. Flow of Capacity-First Algorithm

  40. Quality-First Algorithm

  41. Quality-First Algorithm

  42. Quality-First Algorithm

  43. Quality-First Algorithm 1.Capacity First 一個拓樸的鏈結上有多組可供選擇的CQ pair，在每個鏈結上優先選擇quality最佳，capacity最差的pair。 2.Path Planning (GPPA) (1)基於選定的網路參數，進行路徑規劃，所獲結果如滿足所有request需求，則結束。 (2)否則，則檢查是否有任一鏈結有剩餘的頻寬，並且有可供選擇的CQ pair，假如沒有，則結束。 (3)假如CQ pair選擇的結果造成profit下降，將造成profit下降的CQ pair標記 3.CQ pair Selection 假如有，優先選擇Priority最小的鏈結，選擇該鏈結次佳quality的CQ pair，確定拓樸的參數設定後，回到步驟2。

  44. Flow ofQuality-First Algorithm

  45. Complexity • GPPA的複雜度 • Exhaustic Search的複雜度 (設有L個鏈結，每個鏈結固定有K組CQ pair)

  46. Summary • 找到的參數可能是區域最佳解。 • 需要適當的backtracking機制，以其能跳脫區域最佳解。

  47. Outline • Introduction and Related Work • System Model • Solution Approaches • Performance Evaluation • Experiment Design • Simulation Results • Conclusion and Future Work

  48. Performance Evaluation • 效能評估指標 • Profit function P() • 獲利是由request ri使用的頻寬bi，乘以服務品質qi的單位頻寬獲益(profit per unit bandwidth) U

  49. Experiment Environment • Experimental tools • Linux, GNU g++ • Simulator • GPPA Simulator • GPPA Simulator with : • Capacity-First Algorithm • Quality-First Algorithm • Topology Generator • Request generator • Profit Simulator

  50. Experiments Overview • Experiment #1 • 節點鏈結率對於獲利的影響 • 節點數對於獲利的影響 • 鏈結使用率之平均值與標準差 • Experiment #2 • 預測誤差對獲利的影響

More Related