請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/98099完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 周俊廷 | zh_TW |
| dc.contributor.advisor | Chun-Ting Chou | en |
| dc.contributor.author | 呂霽原 | zh_TW |
| dc.contributor.author | JI-YUAN LU | en |
| dc.date.accessioned | 2025-07-25T16:04:16Z | - |
| dc.date.available | 2025-07-26 | - |
| dc.date.copyright | 2025-07-25 | - |
| dc.date.issued | 2025 | - |
| dc.date.submitted | 2025-07-22 | - |
| dc.identifier.citation | [1] Chowdhury, N. M. K., & Boutaba, R. (2009). Network virtualization: state of the art and research challenges. IEEE Communications magazine, 47(7), 20-26.
[2] Chowdhury, N. M. K., Rahman, M. R., & Boutaba, R. (2009, April). Virtual network embedding with coordinated node and link mapping. In IEEE INFOCOM 2009 (pp. 783-791). IEEE. [3] Fischer, A., Botero, J. F., Beck, M. T., De Meer, H., & Hesselbach, X. (2013). Virtual network embedding: A survey. IEEE Communications Surveys & Tutorials, 15(4), 1888-1906. [4] Bhardwaj, S., Jain, L., & Jain, S. (2010). Cloud computing: A study of infrastructure as a service (IAAS). International Journal of engineering and information Technology, 2(1), 60-63. [5] Rahman, M. R., Aib, I., & Boutaba, R. (2010). Survivable virtual network embedding. In NETWORKING 2010: 9th International IFIP TC 6 Networking Conference, Chennai, India, May 11-15, 2010. Proceedings 9 (pp. 40-52). Springer Berlin Heidelberg. [6] Yeow, W. L., Westphal, C., & Kozat, U. (2010, September). Designing and embedding reliable virtual infrastructures. In Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures (pp. 33-40). [7] Haider, A., Potter, R., & Nakao, A. (2009, May). Challenges in resource allocation in network virtualization. In 20th ITC specialist seminar (Vol. 18, No. 2009). ITC. [8] Shahriar, N., Ahmed, R., Chowdhury, S. R., Khan, M. M. A., Boutaba, R., Mitra, J., & Zeng, F. (2016, May). Connectivity-aware virtual network embedding. In 2016 IFIP Networking Conference (IFIP Networking) and Workshops (pp. 46-54). IEEE. [9] Markopoulou, A., Iannaccone, G., Bhattacharyya, S., Chuah, C. N., & Diot, C. (2004, March). Characterization of failures in an IP backbone. In IEEE INFOCOM 2004 (Vol. 4, pp. 2307-2317). IEEE. [10] Shahriar, N., Ahmed, R., Chowdhury, S. R., Khan, A., Boutaba, R., & Mitra, J. (2017). Generalized recovery from node failure in virtual network embedding. IEEE Transactions on Network and Service Management, 14(2), 261-274. [11] Yu, H., Qiao, C., Anand, V., Liu, X., Di, H., & Sun, G. (2010, December). Survivable virtual infrastructure mapping in a federated computing and networking system under single regional failures. In 2010 IEEE Global Telecommunications Conference GLOBECOM 2010 (pp. 1-6). IEEE. [12] Chowdhury, S. R., Ahmed, R., Khan, M. M. A., Shahriar, N., Boutaba, R., Mitra, J., & Zeng, F. (2016). Dedicated protection for survivable virtual network embedding. IEEE Transactions on Network and Service Management, 13(4), 913-926. [13] Yu, H., Anand, V., Qiao, C., & Sun, G. (2011, June). Cost efficient design of survivable virtual infrastructure to recover from facility node failures. In 2011 IEEE international conference on communications (ICC) (pp. 1-6). IEEE. [14] Yuan, Y., Wang, C., Wang, C., Zhang, C., & Zhu, N. (2013, September). Fault tolerant virtual network embedding algorithm based on redundant backup resource. In 2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and Control (pp. 354-357). IEEE. [15] Hu, Q., Wang, Y., & Cao, X. (2013). Survivable network virtualization for single facility node failure: A network flow perspective. Optical Switching and Networking, 10(4), 406-415. [16] Guo, B., Qiao, C., Wang, J., Yu, H., Zuo, Y., Li, J., ... & He, Y. (2013). Survivable virtual network design and embedding to survive a facility node failure. Journal of Lightwave Technology, 32(3), 483-493. [17] Ayoubi, S., Chen, Y., & Assi, C. (2016). Towards promoting backup-sharing in survivable virtual network design. IEEE/ACM Transactions on Networking, 24(5), 3218-3231. [18] Fajjari, I., Aitsaadi, N., Pujolle, G., & Zimmermann, H. (2011, December). Vnr algorithm: A greedy approach for virtual networks reconfigurations. In 2011 IEEE Global Telecommunications Conference-GLOBECOM 2011 (pp. 1-6). IEEE. [19] Kuo-Liang Chang Chien, “Virtual Network Embedding in Faulty Fog Networks”, Graduate Institute of Communication Engineering College of Electrical Engineering and Computer Science National Taiwan University Master Thesis, 2019 [20] Chowdhury, M., Rahman, M. R., & Boutaba, R. (2011). Vineyard: Virtual network embedding algorithms with coordinated node and link mapping. IEEE/ACM Transactions on networking, 20(1), 206-219. [21] Cheng, X., Su, S., Zhang, Z., Wang, H., Yang, F., Luo, Y., & Wang, J. (2011). Virtual network embedding through topology-aware node ranking. ACM SIGCOMM Computer Communication Review, 41(2), 38-47. [22] Yu-Hsiang Chao, “Virtual Network Embedding in Heterogeneous Fog Networks”, Graduate Institute of Communication Engineering College of Electrical Engineering and Computer Science National Taiwan University Master Thesis, 2020 [23] Wei-Che Chen, “Latency-Aware Virtual Network Embedding in Fog-Cloud Networks”, Graduate Institute of Communication Engineering College of Electrical Engineering and Computer Science National Taiwan University Master Thesis, 2019 [24] Chowdhury, M., Samuel, F., & Boutaba, R. (2010, September). Polyvine: policy-based virtual network embedding across multiple domains. In Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures (pp. 49-56). [25] Rahman, M. R., & Boutaba, R. (2013). SVNE: Survivable virtual network embedding algorithms for network virtualization. IEEE Transactions on Network and Service Management, 10(2), 105-118. [26] Yu, H., Anand, V., Qiao, C., & Di, H. (2011, March). Migration based protection for virtual infrastructure survivability for link failure. In Optical Fiber Communication Conference (p. OTuR2). Optica Publishing Group. [27] Khan, M. M. A., Shahriar, N., Ahmed, R., & Boutaba, R. (2015, November). Simple: Survivability in multi-path link embedding. In 2015 11th International Conference on Network and Service Management (CNSM) (pp. 210-218). IEEE. [28] Yan-Jhu Wang, “Survivable Virtual Network Embedding Based on Single-Link Failures”, Graduate Institute of Communication Engineering College of Electrical Engineering and Computer Science National Taiwan University Master Thesis, 2023 [29] Yuan, Y., Wang, C. R., Wan, C., Wang, C., & Song, X. (2013). Repeatable optimization algorithm based discrete PSO for virtual network embedding. In Advances in Neural Networks–ISNN 2013: 10th International Symposium on Neural Networks, Dalian, China, July 4-6, 2013, Proceedings, Part I 10 (pp. 334-342). Springer Berlin Heidelberg. | - |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/98099 | - |
| dc.description.abstract | 隨著網路基礎設施對於有彈性且高效資源利用的需求日益增長,虛擬網路嵌入(VNE)技術應運而生。虛擬網路(VN)已廣泛應用於雲端計算與軟體定義網路(SDN)等應用中,以滿足這些不同應用或服務需要具有獨立的網路拓撲結構、特殊計算資源、網路頻寬、延遲與可靠性之多樣需求。透過VN 的需求抽象化,網路營運商在無需關注底層實體網路的細節下仍然能夠提供相應之服務,同時透過虛擬網路嵌入(VNE)演算法,營運商可快速將VN對應至實體網路(SN),確保服務品質(QoS)需求得以滿足,同時最大化資源利用率。
在 VNE 研究領域的眾多議題中,本研究聚焦於因實體網路(SN)的失效(尤其是節點失效)時產生的生存性問題,實體網路之失效可能源自於硬體故障、軟體錯誤或網路攻擊,對於關鍵應用與服務而言,此類失效可能嚴重影響使用者滿意度與營運可靠性,因此可生存性成為 VN 設計與管理中不可忽視的議題。 為解決 VNE 的可生存性問題,本研究採用一種解耦方法,也就是將生存性與嵌入問題分開處理 [16][17],並提出兩項新的設計原則。首先,我們在所謂的增強階段(augmentation phase)處理生存性問題,透過增加備援虛擬節點與相應的備援虛擬連結來「增強」 VN。此研究透過探討各種增強 VN 的策略,識別出一種擁有最大 augmented VN 解空間的增強策略,提高了尋找全域最佳 augmented VN 的可能性。其次,本研究開發了一種名為 Nest-Base 的演算法,以快速識別在放寬限制條件下的全域最佳augmented VN。此外,本研究亦設計了一種嵌入演算法,此演算法確保了增強階段的資源增量與最終嵌入成本之間具有較強的線性關聯性,使得Nest-Base找到的資源增量最小的augmented VN,能夠最終實現最低的嵌入成本。 模擬結果顯示,Nest-Base 在 VN 接受率 (acceptance ratio) 與嵌入成本方面皆優於現有方法,包括 FIP、FDP [16]及 ProRed [17]。在適中負載的網路環境下,Nest-Base 嵌入成本降低幅度 在 小型 SN 中相較於 FIP 降低 11.6% 至 29.2%,相較於 FDP 降低 12.9% 至 31.5%,相較於 ProRed 降低 18.9% 至 25.4%。在 大型 SN 中,嵌入成本的降低幅度分別為 10.0% 至 29.1%(相較於 FIP)、11.7% 至 31.0%(相較於 FDP)、19.5% 至 25.7%(相較於 ProRed)。 在高負載的網路環境下,Nest-Base VN 接受率範圍 在 小型 SN 中為 60% 至 70%,在 大型 SN 中為 85% 至 100%。相較於 FIP、FDP 和 ProRed,Nest-Base 在 小型 SN 的 VN 接受率分別提升 25% 至 35%(相較於 FIP)、30%(相較於 FDP)、10% 至 15%(相較於 ProRed)。在 大型 SN 中,VN 接受率的提升幅度為 25% 至 45%(相較於 FIP 和 FDP)、2% 至 12.5%(相較於 ProRed)。此結果凸顯了本研究方案的實用性,並顯示其在多種實際網路應用場景中的價值。 | zh_TW |
| dc.description.abstract | The growing demand for flexible and efficient resource utilization of network infrastructures has driven the development of Virtual Network Embedding (VNE). Virtual Networks (VNs) are widely used in cloud computing and software-defined networks (SDN), where different applications or services require independent, isolated network topologies with specific requirements in terms of bandwidth, latency, and reliability. The abstraction of VNs allows network operators to provide these services without worrying about the underlying physical network's details. By using VNE algorithms, the VN can be efficiently mapped onto the substrate networks (SNs), ensuring that the QoS requirements are satisfied, and resource utilization is maximized.
Among different issues studied in the field of VNE, we focus on the survivability issue which deal with SNs failure (in particular node failure) due to hardware malfunctions, software bugs, or cyberattacks. For critical applications and services, these failures can severely affect user satisfaction and operational reliability, making survivability an essential consideration in VN design and management. To address the survivability issue of VNE, we adopted a decoupled approach to tackle survivability and embedding separately [16][17] with two new design principles. First, the survivability issue is handled in the so-called augmentation phase, where backup virtual nodes are added, along with corresponding backup virtual links, to “augment” the VNs. By exploring various augmented VN strategies, this research identifies an augmentation strategy with the largest solution space for augmented VNs, thereby enhancing the likelihood of finding a optimal augmented VN. Second, an algorithm named Nest-Base was developed to quickly identify optimal augmented VNs under the relaxed constraints. Finally, a mapping (embedding) algorithm with a stronger linear correlation between resource increment of the augmentation phase and embedding cost of the mapping (embedding) phase is also developed such that the augmented VN with the minimum resource increment during the augmentation phase will lead to the minimum mapping (embedding) cost during the mapping phase. The simulation results indicate that Nest-Base provides the lowest embedding cost while accommodating VNs significantly better than other approaches, including FIP, FDP [16], and ProRed [17]. Under moderate-load network conditions, Nest-Base achieves an embedding cost reduction ranging from 11.6% to 29.2% compared to FIP, 12.9% to 31.5% compared to FDP, and 18.9% to 25.4% compared to ProRed in small-scale SNs. In large-scale SNs, the embedding cost reduction reaches 10.0% to 29.1% over FIP, 11.7% to 31.0% over FDP, and 19.5% to 25.7% over ProRed. Under high-load network conditions, the VN acceptance ratio of Nest-Base remains within 60% to 70% in small-scale SNs and 85% to 100% in large-scale SNs. Compared to FIP, FDP, and ProRed, Nest-Base achieves a VN acceptance ratio improvement ranging from 25% to 35% over FIP, 30% over FDP, and 10% to 15% over ProRed in small-scale SNs. In large-scale SNs, the VN acceptance ratio improvement reaches 25% to 45% over FIP and FDP, and 2% to 12.5% over ProRed. This highlights the practicality of our solution, underlining its value across a variety of potential networking scenarios. | en |
| dc.description.provenance | Submitted by admin ntu (admin@lib.ntu.edu.tw) on 2025-07-25T16:04:16Z No. of bitstreams: 0 | en |
| dc.description.provenance | Made available in DSpace on 2025-07-25T16:04:16Z (GMT). No. of bitstreams: 0 | en |
| dc.description.tableofcontents | 致謝 i
中文摘要 ii ABSTRACT iv CONTENTS vii LIST OF FIGURES xi LIST OF TABLES xvii LIST OF ALGORITHMS xx CHAPTER 1 INTRODUCTION 1 1.1 Background of Virtual Network Embedding 1 1.2 Background of Survivable Virtual Network Embedding 2 1.3 Motivation 4 1.4 Research Objectives and Problem Definition 8 1.5 Thesis Contributions 9 1.6 Thesis Organization 11 CHAPTER 2 RELATED WORK 12 2.1 Virtual Network Embedding 13 2.2 Survivable Virtual Network Embedding 14 2.2.1 Link Failure in Virtual Network Embedding 14 2.2.2 Node Failure in Virtual Network Embedding 15 2.2.2.1 Switching Node Failure 15 2.2.2.2 Facility Node Failure 16 2.3 Identified Problems of [16] and [17] 44 2.3.1 Lack of Linearity in [16] and [17] 44 2.3.2 The Narrow Solution Space of [17] 50 CHAPTER 3 SYSTEM SETTINGS AND ASSUMPTIONS 53 3.1 Network Model 53 3.1.1 Virtual Network Model 53 3.1.2 Substrate Network Model 53 3.2 Resource Constraints and Mapping Limitations 54 3.2.1 Resource Constraints during VN to SN Mapping 54 3.2.2 Mapping Limitations 55 3.3 Mapping (Embedding) Cost and Acceptance Ratio Metrics 56 3.3.1 Mapping (Embedding) Cost Metrics 56 3.3.2 Acceptance Ratio Metrics 58 CHAPTER 4 PROPOSED APPROACH 59 4.1 Optimal Augmented VN Strategy 60 4.1.1 Identifying Inefficient Augmentation Strategies 63 4.1.2 Analyzing the Solution Space of Effective Strategies 67 4.2 Design for Augmented VN Generation Algorithm 79 4.2.1 Design Principles for Minimum-Increment Augmented VN 79 4.2.2 Nest-Base Algorithm for Minimum-Increment Augmented VN Generation 83 4.2.3 Pseudo Code for Nest-Base Algorithm 98 4.3 Design for Mapping Algorithm 102 4.3.1 Mapping Process for Augmented VN 102 4.3.2 Pseudo Code for Mapping Algorithm 119 CHAPTER 5 PERFORMANCE EVALUATION 124 5.1 Numerical Analysis 124 5.1.1 Experimental Setup 126 5.1.1.1 Virtual Network Settings 127 5.1.1.2 Substrate Network Settings 128 5.1.1.3 Performance Metrics 130 5.1.2 Results in Sparse Substrate Network 132 5.1.3 Results in Semi-Dense Substrate Network 138 5.1.4 Results in Dense Substrate Network 144 5.1.5 Summary and Key Observations 150 5.1.5.1 The Efficiency of the Proposed Algorithm in Finding the Globally Optimal Minimum-Increment Augmented VN 150 5.1.5.2 Mapping (embedding) cost and Linearity of the Mapping Algorithm 151 5.1.5.3 Relationship Between Solution Space Size and Minimum Mapping (Embedding) Cost 152 5.2 Performance Evaluation under Real-World Network Scenarios 153 5.2.1 Experimental Setup 154 5.2.1.1 Virtual Network Settings 154 5.2.1.2 Substrate Network Settings 156 5.2.1.3 Performance Metrics 158 5.2.2 Results in Small Substrate Network 158 5.2.2.1 Mapping Cost Evaluation 159 5.2.2.2 Acceptance Rate Evaluation 165 5.2.3 Results in Large Substrate Network 168 5.2.3.1 Mapping Cost Evaluation 168 5.2.3.2 Acceptance Rate Evaluation 173 CHAPTER 6 CONCLUSIONS 176 REFERENCES 178 | - |
| dc.language.iso | en | - |
| dc.subject | 虛擬網路嵌入(VNE) | zh_TW |
| dc.subject | 可生存性 VNE | zh_TW |
| dc.subject | VN增強 | zh_TW |
| dc.subject | 節點失效 | zh_TW |
| dc.subject | survivability VNE | en |
| dc.subject | VN augmentation | en |
| dc.subject | virtual network embedding (VNE) | en |
| dc.subject | node failure | en |
| dc.title | 針對單一實體設施節點失效之具生存性虛擬網路可擴展映射方法 | zh_TW |
| dc.title | Scalable Embedding of Survivable Virtual Network Against Single Facility Node Failures | en |
| dc.type | Thesis | - |
| dc.date.schoolyear | 113-2 | - |
| dc.description.degree | 碩士 | - |
| dc.contributor.oralexamcommittee | 魏宏宇;逄愛君;蕭旭君 | zh_TW |
| dc.contributor.oralexamcommittee | Hung-Yu Wei;AC Pang;Hsu-Chun Hsiao | en |
| dc.subject.keyword | 虛擬網路嵌入(VNE),可生存性 VNE,VN增強,節點失效, | zh_TW |
| dc.subject.keyword | virtual network embedding (VNE),survivability VNE,VN augmentation,node failure, | en |
| dc.relation.page | 182 | - |
| dc.identifier.doi | 10.6342/NTU202501591 | - |
| dc.rights.note | 同意授權(全球公開) | - |
| dc.date.accepted | 2025-07-23 | - |
| dc.contributor.author-college | 電機資訊學院 | - |
| dc.contributor.author-dept | 電信工程學研究所 | - |
| dc.date.embargo-lift | 2025-07-26 | - |
| 顯示於系所單位: | 電信工程學研究所 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-113-2.pdf | 11.63 MB | Adobe PDF | 檢視/開啟 |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
