Directed virtual path layouts in ATM networks

DOI10.1016/S0304-3975(01)00394-2zbMATH Open1026.68002OpenAlexW1980392832MaRDI QIDQ1870524FDOQ1870524

Authors: Nausica Marlin, David Peleg, Jean-Claude Bermond, Stéphane Pérennes 

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00394-2

Recommendations

• scientific article; zbMATH DE number 1717268
• Structural Information and Communication Complexity
• Virtual Path Layouts in ATM Networks
• ATM layouts with bounded hop count and congestion
• scientific article; zbMATH DE number 1263996

zbMATH Keywords

embeddingdiameterloadATMvirtual path layout

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On forwarding indices of networks
• Expanding and forwarding
• The forwarding index of directed networks
• Cost Trade-offs in Graph Embeddings, with Applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hop-Congestion Trade-Offs for High-Speed Networks
• The virtual path layout problem in fast networks (extended abstract)
• On the design of efficient ATM routing schemes
• Title not available (Why is that?)
• A new characterization of tree medians with applications to distributed sorting
• Optimal layouts on a chain ATM network
• Title not available (Why is that?)
• A complete characterization of the path layout construction problem for ATM networks with given hop count and load

Cited In (10)

• A decision-theoretic approach to reliable message delivery
• Optimal design of virtual links in AFDX networks
• Title not available (Why is that?)
• GMPLS label space minimization through hypergraph layouts
• Virtual network embedding in the cycle
• Virtual path layouts optimizing total hop count on ATM tree networks
• Fault-tolerant virtual path layout in ATM networks
• Designing hypergraph layouts to GMPLS routing strategies
• Structural Information and Communication Complexity
• Deterministic Models of Communication Faults

This page was built for publication: Directed virtual path layouts in ATM networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870524)