A path finding implementation for multi-layer networks

Dijkstra, Freek; Ham, Jeroen van der; Grosso, Paola; Laat, Cees de

doi:10.1016/j.future.2008.07.002

Cited by 18 publications

(12 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The OptiPuter [16] research project, for example, presents a vision of interactive access and control to high-speeds networks, large data-sets and high-performance computing clusters to support e-Science. If the computational and network resources are abstracted and enriched with meta-data, by using NDL [6] for example, multi-touch GUIs can improve the way scientists interact with computational and infrastructural resources to coordinate their experiments and view its results.…”

Section: Discussionmentioning

confidence: 99%

Interactive Control over a Programmable Computer Network Using a Multi-touch Surface

Strijkers

Müller

Cristea

et al. 2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. This article introduces the Interactive Network concept and describes the design and implementation of the first prototype. In an Interactive Network humans become an integral part of the control system to manage programmable networks and grid networks. The implementation consists of a multi-touch table that allows multiple persons to manage and monitor a programmable network simultaneously. The amount of interactive control of the multi-touch interface is illustrated by the ability to create and manipulate paths, which are either end-to-end, multicast or paths that contain loops. First experiences with the multi-touch table show its potential for collaborative management of large-scale infrastructures.

show abstract

Section: Discussionmentioning

confidence: 99%

Interactive Control over a Programmable Computer Network Using a Multi-touch Surface

Strijkers

Müller

Cristea

et al. 2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Protocol continuity (by analogy with wavelength continuity in optical networks) must hold and the adaptation functions should occur in the right order. Moreover, feasible paths can involve loops and their subpaths are not necessary feasible [11], [15]. Nowadays, such paths are manually determined and configurations are operated and applied by scripts.…”

Section: A Connectivity In Multi-layer Networkmentioning

confidence: 99%

Path computation in multi-layer networks: Complexity and algorithms

Lamali

Fergani

Cohen

et al. 2016

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

Abstract-Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and additional operational costs. However, some routers are able to encapsulate, decapsulate and convert protocols and act as a liaison between these layers. A unified control plane would be useful to optimize the use of the network resources and automate the routing configurations. Software-Defined Networking (SDN) based architectures, such as OpenFlow, offer a chance to design such a control plane. One of the most important problems to deal with in this design is the path computation process. Classical path computation algorithms cannot resolve the problem as they do not take into account encapsulations and conversions of protocols. In this paper, we propose algorithms to solve this problem and study several cases: Path computation without bandwidth constraint, under bandwidth constraint and under other Quality of Service constraints. We study the complexity and the scalability of our algorithms and evaluate their performances on real topologies. The results show that they outperform the previous ones proposed in the literature.

show abstract

“…They stress the lack of solutions on path selection and the limitations of graph theory to handle this problem. The authors of [7] present the specificities of a multi-layer path computation taking into account the encapsulation/decapsulation (adaptation) capabilities: the shortest path can contain loops and its sub-paths may not satisfy the compatibility constraints. They provide an example of topology where classical routing algorithms cannot find the shortest path because it contains a loop.…”

Section: Related Work On Path Computation In Multi-layer Networkmentioning

confidence: 99%

Path computation in multi-layer multi-domain networks: A language theoretic approach

Lamali¹,

Pouyllau²,

Barth

2013

Computer Communications

View full text Add to dashboard Cite

Multi-layer networks are networks in which several protocols may coexist at different layers. The Pseudo-Wire architecture provides encapsulation and decapsulation functions of protocols over Packet-Switched Networks. In a multidomain context, computing a path to support end-to-end services requires the consideration of encapsulation and decapsulation capabilities. It appears that graph models are not expressive enough to tackle this problem. In this paper, we propose a new model of heterogeneous networks using Automata Theory. A network is modeled as a Push-Down Automaton (PDA) which is able to capture the encapsulation and decapsulation capabilities, the PDA stack corresponding to the stack of encapsulated protocols. We provide polynomial algorithms that compute the shortest path either in hops or in the number of encapsulations and decapsulations along the inter-domain path, the latter reducing manual configurations and possible loops in the path.

show abstract

A path finding implementation for multi-layer networks

Cited by 18 publications

References 8 publications

Interactive Control over a Programmable Computer Network Using a Multi-touch Surface

Interactive Control over a Programmable Computer Network Using a Multi-touch Surface

Path computation in multi-layer networks: Complexity and algorithms

Path computation in multi-layer multi-domain networks: A language theoretic approach

Contact Info

Product

Resources

About