Scaling of Most-Likely Traffic Patterns of Hose- and Cost-Constrained Ring and Mesh Networks

Steven K. Korotky; Kostas N. Oikonomou

Optical Fiber Communication Conference and Exposition and The National Fiber Optic Engineers Conference
Technical Digest (CD) (Optica Publishing Group, 2006),
paper PDP41

Scaling of Most-Likely Traffic Patterns of Hose- and Cost-Constrained Ring and Mesh Networks

Steven K. Korotky and Kostas N. Oikonomou

Optical Fiber Communication Conference 2006

Anaheim, California United States
5–10 March 2006
ISBN: 1-55752-802-0

From the session
Postdeadline Session V (PDP)

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
S. K. Korotky and K. N. Oikonomou, "Scaling of Most-Likely Traffic Patterns of Hose- and Cost-Constrained Ring and Mesh Networks," in Optical Fiber Communication Conference and Exposition and The National Fiber Optic Engineers Conference, Technical Digest (CD) (Optica Publishing Group, 2006), paper PDP41.

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Save article

Abstract

We report analytical results and statistical comparisons for the solution to the hose- and cost-constrained inverse problem for the traffic matrix and distance-dependence of ring and mesh networks based on the method of maximum entropy.

PDF Article

More Like This

Optimal Traffic Hubbing and Grooming in Hybrid Networks

Ali Zolfaghari
NThA3 National Fiber Optic Engineers Conference (NFOEC) 2006

Optimal traffic grooming in WDM mesh networks under dynamic traffic

Mounire El Houmaidi, Mostafa A. Bassiouni, and Guifang Li
ThG3 Optical Fiber Communication Conference (OFC) 2004

Optical Ring Services in GMPLS Based Mesh Networks: An Implementation of Optical GRID

Sugang Xu and Hiroaki Harai
JThB74 National Fiber Optic Engineers Conference (NFOEC) 2006

Previous Article Next Article