Generating words in a context-free language uniformly at random
Information Processing Letters
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
A multi-layer network model based on ITU-T G.805
Computer Networks: The International Journal of Computer and Telecommunications Networking
A path finding implementation for multi-layer networks
Future Generation Computer Systems
Controlled non-uniform random generation of decomposable structures
Theoretical Computer Science
End-to-end quality of service in pseudo-wire networks
Proceedings of The ACM CoNEXT Student Workshop
Lightpath (wavelength) routing in large WDM networks
IEEE Journal on Selected Areas in Communications
A Link Bundled Auxiliary Graph Model for Constrained Dynamic Traffic Grooming in WDM Mesh Networks
IEEE Journal on Selected Areas in Communications
Path computation in multi-layer multi-domain networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
| Hi-index | 0.24 |
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 multi-domain 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 later reducing manual configurations and possible loops in the path.