2 research outputs found

    Loci of competition for future internet architectures

    Full text link

    가상 λ„€νŠΈμ›Œν¬μ˜ μžμ› ν• λ‹Ή, 가격 κ²°μ • 및 κ³ μž₯ 관리

    Get PDF
    ν•™μœ„λ…Όλ¬Έ (박사)-- μ„œμšΈλŒ€ν•™κ΅ λŒ€ν•™μ› : 전기·컴퓨터곡학뢀, 2013. 8. μ„œμŠΉμš°.λ„€νŠΈμ›Œν¬ κ°€μƒν™”λŠ” 물리적 λ„€νŠΈμ›Œν¬μ˜ 곡유 μžμ›λ“€μ„ 볡수 개의 가상 λ„€νŠΈμ›Œν¬λ“€μ— λ™μ μœΌλ‘œ ν• λ‹Ήν•  수 있게 ν•΄μ£ΌλŠ” κΈ°μˆ μ΄λ‹€. μžμ› ν• λ‹Ήμ˜ μœ μ—°μ„±κ³Ό 가상 λ„€νŠΈμ›Œν¬λ“€ μ‚¬μ΄μ˜ 독립성 λ•Œλ¬Έμ—, λ„€νŠΈμ›Œν¬ κ°€μƒν™”λŠ” λ„€νŠΈμ›Œν¬ ν…ŒμŠ€νŠΈλ² λ“œλ₯Ό μ„€κ³„ν•˜κΈ° μœ„ν•œ 기반 기술둜써 주둜 ν™œμš©λ˜μ–΄ 왔을 뿐만 μ•„λ‹ˆλΌ, μΈν„°λ„·μ˜ λ‹€μ–‘ν™”λ₯Ό μ§€μ›ν•˜κΈ° μœ„ν•œ λΉ„μš© 효율 높은 ν•΄κ²°μ±…μœΌλ‘œμ¨ 여겨지기 μ‹œμž‘ν–ˆλ‹€. μ„œλΉ„μŠ€μ— 따라 κ³„μΈ΅ν™”λœ 인터넷을 μ„€κ³„ν•˜κΈ° μœ„ν•œ ν•˜λ‚˜μ˜ μˆ˜λ‹¨μœΌλ‘œμ¨, λ„€νŠΈμ›Œν¬ κ°€μƒν™”λŠ” μ—¬μ „νžˆ ν•΄κ²°ν•΄μ•Ό ν•  λ§Žμ€ 도전 κ³Όμ œλ“€μ„ 가지고 μžˆλ‹€. 이 ν•™μœ„ 논문은 가상 λ„€νŠΈμ›Œν¬ ν™˜κ²½μ—μ„œ μ€‘μš”ν•œ λͺ‡ 가지 μƒˆλ‘œμš΄ 연ꡬ μ£Όμ œλ“€μ„ μ œμ‹œν•˜κ³ , 그에 λŒ€ν•œ 효과적인 해법듀을 μ œμ•ˆν•œλ‹€. 첫 번째둜, 가상 λ„€νŠΈμ›Œν¬μ˜ λ‹€μ–‘ν•œ QoS μš”κ΅¬μ‚¬ν•­μ„ λ§Œμ‘±μ‹œν‚¬ 수 μžˆλŠ” λ„€νŠΈμ›Œν¬ 졜적 λΆ„ν•  방법을 μ œμ•ˆν•œλ‹€. QoS와 λŒ€μ—­ν­ μ œν•œ 쑰건을 κ³ λ €ν•˜μ—¬ 가상 λ„€νŠΈμ›Œν¬ λΆ„ν•  문제λ₯Ό μ΅œμ ν™” 문제둜 λͺ¨ν˜•ν™”ν•˜κ³ , 문제의 ꡬ쑰적 λ³΅μž‘μ„±μ„ ν•΄κ²°ν•˜κΈ° μœ„ν•΄ μ΅œλ‹¨ 경둜 λΌμš°νŒ…μ— κΈ°λ°˜ν•œ νœ΄λ¦¬μŠ€ν‹±μ„ μ œμ•ˆν•œλ‹€. μ‹€μ œ 인터넷 ν™˜κ²½μ„ κ³ λ €ν•œ λŒ€κ·œλͺ¨ μ‹€ν—˜μ„ 톡해, μ œμ•ˆν•œ νœ΄λ¦¬μŠ€ν‹±μ˜ νš¨μœ¨μ„±κ³Ό ν™•μž₯성을 μž…μ¦ν•œλ‹€. λ‹€μŒμœΌλ‘œ, 가상 λ„€νŠΈμ›Œν¬μ—μ„œ μ°¨λ“± 접속 μ„œλΉ„μŠ€λ₯Ό μœ„ν•œ κ²½μ œμ„± 뢄석 λͺ¨λΈμ„ μ œμ‹œν•œλ‹€. λ¨Όμ € μ‚¬μš©μž κ°€μž… 변동 λͺ¨ν˜•μ΄ ν•œ κ°’μœΌλ‘œ μˆ˜λ ΄ν•˜κΈ° μœ„ν•œ μΆ©λΆ„ 쑰건을 μœ λ„ν•˜κ³ , μ΄λŸ¬ν•œ 쑰건 ν•˜μ—μ„œ 인터넷 μ„œλΉ„μŠ€ 제곡자의 μˆ˜μ΅μ„ μ΅œλŒ€ν™”ν•  수 μžˆλŠ” 졜적의 가격 κ²°μ • 방법 및 λŒ€μ—­ν­ λΆ„ν•  방법을 μ°ΎλŠ”λ‹€. 수치 μ‹€ν—˜μ„ 톡해, μ μ ˆν•œ 가격 κ²°μ •κ³Ό λŒ€μ—­ν­ 뢄할이 μ΄λ£¨μ–΄μ§„λ‹€λŠ” κ°€μ • ν•˜μ—μ„œ μ°¨λ“±ν™” μ„œλΉ„μŠ€κ°€ 단일 μ„œλΉ„μŠ€λ³΄λ‹€ 더 높은 μˆ˜μ΅μ„±μ„ λ‚˜νƒ€λ‚Ό 수 μžˆμŒμ„ 증λͺ…ν•œλ‹€. λ§ˆμ§€λ§‰μœΌλ‘œ, 가상 λ„€νŠΈμ›Œν¬ κ°„ νŠΈλž˜ν”½ μ „ν™˜μ„ ν†΅ν•œ λΉ λ₯΄κ³  효과적인 κ³ μž₯ 회볡 κΈ°μˆ μ„ κ°œλ°œν•œλ‹€. 가상 λ„€νŠΈμ›Œν¬μ˜ ꡬ쑰적 νŠΉμ„±μ„ ν™œμš©ν•œ κ³ μž₯ 회볡 κΈ°μˆ μ„ μ΄μš©ν•˜λ©΄, λͺ¨λ“  링크에 λŒ€ν•œ λ°±μ—… κ²½λ‘œκ°€ 항상 μ‘΄μž¬ν•˜λ„λ‘ 미리 ν† ν΄λ‘œμ§€λ₯Ό 섀계해야 ν•  ν•„μš”κ°€ μ—†κ³ , 각 λΌμš°ν„°μ—μ„œ κ·Έ κ²½λ‘œλ“€μ— λŒ€ν•œ 계산을 미리 ν•΄ 놓을 ν•„μš”κ°€ μ—†λ‹€. κ·ΈλŸΌμ—λ„ λΆˆκ΅¬ν•˜κ³ , μ œμ•ˆν•œ κ³ μž₯ 회볡 방법은 기쑴의 κΈ°μˆ λ“€κ³Ό 같은 쒋은 μ„±λŠ₯을 보인닀. 이 ν•™μœ„ 논문은 가상 λ„€νŠΈμ›Œν¬λ₯Ό 기반으둜 ν•˜λŠ” 인터넷 ν™˜κ²½μ—μ„œ λ°œμƒν•  수 μžˆλŠ” μ€‘μš”ν•œ λ¬Έμ œλ“€μ„ λ‹€λ£¨κ³ μž ν•œλ‹€. 이 λ…Όλ¬Έμ—μ„œ μ œμ•ˆν•˜λŠ” 뢄석 λͺ¨λΈ 및 μ‹€ν—˜ 결과듀은 ν˜„μž¬ μΈν„°λ„·μ˜ ν•œκ³„λ₯Ό κ·Ήλ³΅ν•˜κ³ , 미래 인터넷 μ•„ν‚€ν…μ²˜λ₯Ό μ„€κ³„ν•˜κΈ° μœ„ν•œ μœ μš©ν•œ 지침을 μ œκ³΅ν•  것이닀.Network virtualization is an emerging technology that enables the dynamic partitioning of a shared physical network infrastructure into multiple virtual networks. Because of its flexibility in resource allocation and independency among virtual networks, the network virtualization technology has not only been mainly deployed to build a testbed network, but also has come to be regarded as a cost-effective solution for diversifying the Internet. As a means of building the multi-layered Internet, network virtualization still faces a number of challenging issues that need to be addressed. This dissertation deals with several important research topics and provides effective solutions in network virtualization environment. First, I focus on the optimal partitioning of finite substrate resources for satisfying the diverse QoS requirements of virtual networks. I formulate virtual network partitioning problem as a mixed integer multi-commodity flow problem. Then, to tackle the structural complexity of the problem, I propose a simple heuristic based on shortest path routing algorithm. By conducting large-scale network experiments, I verify the efficiency and scalability of the heuristic. Next, I propose an economic model for tiered access service in virtual networks in order to remedy the deficiency of the existing tiered service schemes. I first derive a sufficient condition for stability of user subscription dynamics, and find the optimal pricing and capacity partitioning by addressing the revenue maximization problem of the tiered access service in a network virtualization environment. Numerical results show that the tiered service can be more profitable than the non-tiered service under proper pricing and capacity partitioning conditions. Last, I develop a fast and effective failure recovery mechanism through inter-virtual network traffic switching in virtual networks. The proposed failure recovery mechanism neither has topological constraints for the existence of backup paths, nor requires the pre-computation of them, but nevertheless guarantees as fast recovery as the existing failure recovery methods. This dissertation aims to address important issues in the virtual network-based Internet. I believe that the analysis and results in this dissertation will provide useful guidelines to improve the Internet.1 Introduction 1.1 Background and Motivation 1.2 Contributions and Outline of the Dissertation 2 Effective Partitioning for Service Level Differentiation in Virtual Networks 2.1 Introduction 2.2 Related Work 2.3 Model and Assumption 2.3.1 Business Model 2.3.2 Network Model 2.3.3 Traffic Demands 2.3.4 QoS Metric 2.4 Formulation 2.4.1 Objective 2.4.2 Substrate Partitioning Problem 2.4.3 Decomposition 2.5 Heuristic 2.6 Evaluation 2.6.1 Small Network Experiment 2.6.2 Large Network Experiment 2.7 Summary 3 Optimal Pricing and Capacity Partitioning for Tiered Access Service in Virtual Networks 3.1 Introduction 3.2 Motivating Example 3.3 A Tiered Service Model 3.3.1 Network Virtualization Environment 3.3.2 Effective Access Rate 3.3.3 Valuation Parameter and User Utility 3.3.4 User Subscription and the ISP Revenue 3.4 Non-tiered Service Analysis 3.4.1 User Subscription Dynamics 3.4.2 Optimal Pricing for Maximizing the ISP Revenue 3.5 Tiered Service Analysis 3.5.1 User Subscription Dynamics 3.5.2 Convergence of the User Subscription Dynamics 3.5.3 Optimal Pricing for Maximizing the ISP Revenue 3.6 Numerical Results 3.6.1 Non-tiered Service Example 3.6.2 Tiered Service Example 3.7 Related Work and Discussion 3.8 Summary 4 Inter-Virtual Network Traffic Switching for Fast Failure Recovery 4.1 Introduction 4.2 Background 4.3 Preliminaries 4.3.1 Virtual Network Model 4.3.2 Design Goals 4.3.3 Business Models and Switching Policy Agreement 4.3.4 Other Considerations 4.4 Failure Recovery based on Traffic Switching 4.4.1 Inter-VN Traffic Switching 4.4.2 Failure Recovery Process 4.5 Numerical Analysis 4.5.1 Delay 4.5.2 Congestion probability 4.6 Summary 5 Conclusion A Proofs of Lemmas A.1 Proof of Lemma 2 A.2 Proof of Lemma 3Docto
    corecore