Traffic Groomings and Graph Designs

Zhi He Liang; Shi Xin Liang

doi:10.4028/www.scientific.net/AMM.635-637.1124

Paper Titles

Study on Characteristics and Application of LED Displays
p.1105

Study on the Driving Circuit of Carbon Nanotube Field Emission Display Based on Luminance Control
p.1109

The Design and Simulated Analysis of Laser Beam-Shaping System for the Flow Cytometry
p.1114

The Development and Solution of Intelligent Secondary Power in Space
p.1118

Traffic Groomings and Graph Designs
p.1124

A Design of Position Terminal Based on BDS
p.1128

Research on Multi-Scroll Chaotic Attractors Synchronization Technique
p.1132

Finding Most Vital Node in Satellite Communication Network
p.1136

Research of Power Communication Network System’s Reliability Based on Cloud Model and Fuzzy Petri Nets
p.1140

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 635-637Traffic Groomings and Graph Designs

Traffic Groomings and Graph Designs

Abstract:

Wavelength Division Networks (WDM) rings is a very attractive network. The key terminating equipments are add-drop multiplexers (ADMs) on the WDM networks. It is essential to find an efficient routing and wavelength assignment to a given set of traffic streams such that the total ADM cost is minimal. In this paper, we will obtain the minimal ADM number A(12,v)=v (v-1)/4 when v≡1,9 (mod 24) and v≥25.

You might also be interested in these eBooks

Advanced Design and Manufacturing Technology IV

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 635-637)

Pages:

1124-1127

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.635-637.1124

Citation:

Cite this paper

Online since:

September 2014

Authors:

Zhi He Liang*, Shi Xin Liang

Keywords:

Add-Drop Multiplexer (ADM), Complete Graph, Graph Design, Traffic Grooming

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] P. Adams, D. Bryant and M. Buchanan: A survey on the existence of G-designs. J. Combin. Des. 16 (2008) , pp.373-410.

DOI: 10.1002/jcd.20170

Google Scholar

[2] C. J. Colbourn and J. H. Dinitz: Handbook of Combinatorial Designs, 2nd ed, Chapman \& Hall/CRC, Boca Raton, (2007).

Google Scholar

[3] G. Ge and A.C.H. Ling: On the existence of (K5-e)-designs with application to optical networks. SIAM J. Discrete Math. 21 (2007), pp.851-864.

DOI: 10.1137/060660084

Google Scholar

[4] J. -C. Bermond and D. Coudert: Traffic grooming in unidirectional WDM ring networks using design theory, in: Proc IEEE Conf Commun, ICC'03, IEEE, vol. 2, Los Alamitos, CA, 2003, pp.1402-1406.

DOI: 10.1109/icc.2003.1204621

Google Scholar

[5] C.J. Colbourn, H. -L. Fu, G. Ge, A.C.H. Ling and H. -C. Lu: Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 7, SIAM J. Discrete Math. 23 (2008) , pp.109-122.

DOI: 10.1137/070709141

Google Scholar

[6] Z. Liang and J. Wang: Six-vertex graph packings and coverings of lKv. J. Combin. Math. Combin. Comput. 73(2010), pp.31-53.

Google Scholar

[7] Z. Liang: Graph designs, packings and coverings of lKv with a graph of six vertices and containing a triangle. Australisian J. of Combin. 28(2003), pp.51-66.

Google Scholar