Worst case bin packing for OTN electrical layer networks dimensioning

Bajzik, L. and Bernáth, Attila and Bérczi, Kristóf and Jordán, Tibor and Jüttner, Alpár and Király, Tamás and Kovács, Erika and Végh, László (2011) Worst case bin packing for OTN electrical layer networks dimensioning. In: 13th International Conference on Transparent Optical Networks, ICTON 2011. IEEE, New York, pp. 43-49. ISBN 9781457708800

Preview

Text binpacking_paper_u_143300.494987.pdf Download (185kB) | Preview

Abstract

The OTN (Optical Transport Network) standard, defined by ITU-T Recommendation G.709 and G.872, contains a flexible digital hierarchy of ODU (Optical Data Unit) signals. The ODU hierarchy provides sub-wavelength grooming in OTN networks, which is necessary for efficient utilization of the high bit rates of optical channels. When dimensioning the links of a transport network consisting of ODU switches, the packing of lower order ODU signals into higher order ODU signals needs to be taken into account. These networks are expected to be controlled by GMPLS (Generalized MPLS) , which puts specific constraints on the dimensioning. We assume that there is no explicit label control and that the GMPLS control plane is using first-fit strategy for making reservations on a link . With these assumptions the link dimensioning problem is defined as deciding how many higher order ODU component links are required on an OTN GMPLS bundled link for first-fit packing of a given set of lower order ODU demands, in any order of arrival. The paper provides strict bounds for ODU hierarchy-specific item and bin sizes. Then, it introduces an extended variant of the dimensioning problem, when lower order ODU connections which are not controlled by GMPLS are also present.

Actions (login required)

Edit Item