Network virtualization is an important technology that allows multiple heterogeneous networks running simultaneously share substrate network, it can effectively solve the problem of network ossification. Earlier research has made many heuristic algorithms, but it does not consider the time factor in the embedding process, existing algorithm often make decision according to the present available substrate network resource. This paper, we first explore the time and space of the two dimensional network model, form the perspective of the two-dimensional space-time, we proposed two-dimensional discrete weighted method and multi commodity flow virtual network embedding with time-varying model. We also proposed a virtual network algorithm based on space–time. The simulation result show that the proposed algorithm can effectively utilize the network resources and make substrate network resources maintain the load balance for a long term.
목차
Abstract 1. Introduction 2. Related Work 3. Network Model and Problem Description 3.1. Substrate Network Model 3.2.Virtual Network Request 3.3 VN Embedding Problem Description 3.4.Objectives 4. Multipath Virtual Network Mapping Based on Spatio-Temporal Correlation 4.1. Establishing Two Dimensional Resource Measurement Model about Time-Space Correlation 4.2.Multi Commodity Flow Model Based on Time and Spatial Correlation 4.3. Virtual Network Embedding Algorithm with the Time 5. Performance Evaluation 5.1 Evaluation Environments 5.2 Comparison Method 5.3 Evaluation Results 6.Conclusion References
보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Grid and Distributed Computing
간기
격월간
pISSN
2005-4262
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.9 No.11