Traffic Grooming in Star Networks via Matching Techniques

DOI10.1007/978-3-642-13284-1_5zbMATH Open1284.68054OpenAlexW1491384678MaRDI QIDQ3569115FDOQ3569115

Authors: Ignasi Sau, Mordechai Shalom, Shmuel Zaks 

Publication date: 17 June 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13284-1_5

Recommendations

• Approximating the traffic grooming problem in tree and star networks
• Approximating the Traffic Grooming Problem in Tree and Star Networks
• Structural Information and Communication Complexity
• Traffic Grooming: Combinatorial Results and Practical Resolutions
• scientific article; zbMATH DE number 3918404
• Multipath-based multicasting strategies for wormhole-routed star graph interconnection networks
• Hardness and approximation of traffic grooming

zbMATH Keywords

approximation algorithmsmaximum matchingoptical networkstraffic groomingadd-drop multiplexer

Mathematics Subject Classification ID

Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Cited In (5)

• Approximating the traffic grooming problem
• Approximating the traffic grooming problem in tree and star networks
• Structural Information and Communication Complexity
• Approximating the Traffic Grooming Problem in Tree and Star Networks
• On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology

This page was built for publication: Traffic Grooming in Star Networks via Matching Techniques

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