Virtual network construction scheduling based on network criticality for robust physical networks

Urayama, Yasuhiro; Tsubota, Hayato; Tachibana, Takuji

doi:10.1109/icce-tw.2015.7217007

Cited by 2 publications

(9 citation statements)

References 3 publications

(3 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As we said before, the papers [1] and [13] explained the improvement of well-known KMB algorithm. Such a technique is capable of constructing many virtual networks taking care of the robustness of the physical network [17], [18]).…”

Section: Previous Workmentioning

confidence: 89%

“…In the paper [1], we have a survey of methods we can use to design a new virtual network as an overview of some papers [3]- [12]. Also, in papers [1] and [13] the new solution of VPN sub-network construction is proposed. It is based on the K-shortest path algorithm and Prim's Minimum spanning tree algorithm with some modification consisting of adding techniques: the path splitting and the path migration.…”

Section: Previous Workmentioning

confidence: 99%

“…It is mostly related to the robustness of the network [17], which is explained in Section VII. If all offered topologies cannot satisfy the traffic demands, the service provider has to perform the path splitting and path migration that are explained in chapters 3.3 and 3.4 of the paper [1]. As it is said in chapter 3.3, "The path splitting can decrease the loss probability of user's request by allowing another topology.…”

Section: Previous Workmentioning

confidence: 99%

See 2 more Smart Citations

Virtual Network Construction Technique, Treating All VPNs Simultaneously

Krile

Medvecký²

2020

ELEKTRON ELEKTROTECH

View full text Add to dashboard Cite

In the paper, a new construction technique for virtual network (e.g., Virtual Private Network (VPN)) based on flow permutation algorithm is proposed. In existing methods for creating virtual networks, whereby virtual networks are constructed one by one in time and the new virtual network can use only the remaining resources, it could be non-optimal. Our approach treats all traffic flows simultaneously and is capable of balancing the network much better than other existing techniques. As we show, the proposed new construction technique work well, even in the condition of hard loaded networks operating on the edge of capacity, i.e., in situations when traditional techniques could cause unbalanced network and significant congestion problems. For huge number of traffic flows, heuristic algorithm, whose complexity rises linearly, is evaluated.

show abstract

Section: Previous Workmentioning

confidence: 89%

Section: Previous Workmentioning

confidence: 99%

Section: Previous Workmentioning

confidence: 99%

See 1 more Smart Citation

Virtual Network Construction Technique, Treating All VPNs Simultaneously

Krile

Medvecký²

2020

ELEKTRON ELEKTROTECH

View full text Add to dashboard Cite

show abstract

“…At first, we explain a procedure of virtual network construction [16,17]. In the following, we assume that each virtual network is provided with the service provider by the telecommunications carrier that manages a substrate network.…”

Section: Virtual Network Construction Proceduresmentioning

confidence: 99%

“…By utilizing these methods, each virtual network can keep the data transmission service even if a failure of single link of the substrate network occurs. Moreover, virtual network construction methods for robust substrate networks have been proposed in [15], [16] and [17]. In these methods, virtual networks are constructed over a substrate network while utilizing conventional data transmission services such as existing Internet services in the substrate network.…”

Section: Introductionmentioning

confidence: 99%

Replacement Algorithm of Virtual Service Resources with Dynamic Resource Allocation Based on Traffic Change in Virtual Networks

Horiuchi¹,

Tachibana²

2018

JCN

Self Cite

View full text Add to dashboard Cite

Multiple virtual networks are constructed by using network virtualization technology on a substrate network with network resources. By using virtual service resources, a particular service can be provided with users over each virtual network. Moreover, network virtualization for mobile users has been expected in the future network service. In mobile virtual networks, mobile user moves from a node to other nodes and connects to other access points frequently. Therefore, the traffic on each link and each node in the virtual network changes. Because the quality of the service depends on the amount of traffic on links and nodes, the quality of services changes according to the user's movement. This paper proposes replacement algorithm of virtual service resources with dynamic resource allocation based on traffic change for mobile applications in virtual networks. In our proposed method, the amount of resources for each node and that for each link are changed based on the traffic change. Moreover, the virtual service resource moves to the adjacent node from a node, and this replacement is repeated until the quality of service satisfies the requested quality. With our proposed method, it is expected that the quality of service can be maintained for mobile users even if the amount of traffic changes. We evaluate the performance of our proposed method with simulation. In numerical examples, it is shown that our proposed method is effective when a larger number users move and the amount of traffic changes.

show abstract

Virtual network construction scheduling based on network criticality for robust physical networks

Cited by 2 publications

References 3 publications

Virtual Network Construction Technique, Treating All VPNs Simultaneously

Virtual Network Construction Technique, Treating All VPNs Simultaneously

Replacement Algorithm of Virtual Service Resources with Dynamic Resource Allocation Based on Traffic Change in Virtual Networks

Contact Info

Product

Resources

About