Hop-Limit Path Mapping Algorithm for Virtual Network Embedding
| Autor: | Min Zhang, Xijie Tang |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Computer science
Distributed computing Network mapping Network virtualization 020206 networking & telecommunications 02 engineering and technology Kernel virtual address space Computer Science Applications Hop (networking) Mapping algorithm 0202 electrical engineering electronic engineering information engineering Virtual network embedding 020201 artificial intelligence & image processing Electrical and Electronic Engineering Virtual network |
| Zdroj: | Wireless Personal Communications. 95:2033-2048 |
| ISSN: | 1572-834X 0929-6212 |
| DOI: | 10.1007/s11277-016-3933-1 |
| Popis: | Virtual network (VN) mapping which deals with the allocation of network resources from the shared physical substrate to individual VNs is one of the key challenges for the application of realizing network virtualization. While a variety of state-of-the-art algorithms have attempted to address this issue from different aspects, the challenge still remains for mapping virtual link with hop count constraint. This paper presents a fast approximation path mapping algorithm to address this issue by formulating such virtual link mapping problem as a path-flow mathematical programming model, which aims to minimize the maximum link load factor. Through the use of the primal–dual method, a fully polynomial time approximation algorithm is proposed to solve this model. The experimental results show that the proposed algorithm can effectively solve the problem of path mapping with hop limit. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink