Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Load-balanced wavelength assignment strategies for optical burst/packet switching networks

Load-balanced wavelength assignment strategies for optical burst/packet switching networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

Loss-free schemes are defined to ensure successful packet/burst transmissions in optical packet/burst switching networks. To this end, they rely on a collision-free routing and wavelength assignment (CF-RWA) scheme combined with simple contention resolution mechanisms that guarantee the absence of losses in intermediate links. Here, the CF-RWA problem is studied. In particular, by using graph theory, the problem of finding CF-RWA schemes that minimise the number of wavelengths to serve a given traffic matrix is set. The problem is simplified when it is formulated by using pre-defined sets of non-colliding paths. Within this framework, the problem is shown to be equivalent to finding a given vertex-set colouring of the so-called restriction digraph. Here, two heuristic algorithms are proposed to obtain such vertex-set colourings. One of them provides a suitable CF-RWA without having to solve the minimisation problem. By way of example, the proposed method is applied to the NSFNet and the EON network providing quasi-optimal results.

Inspec keywords: matrix algebra; graph colouring; telecommunication traffic; wavelength assignment; resource allocation; set theory; telecommunication network routing; minimisation; optical burst switching; optical fibre networks; packet switching

Other keywords: minimisation problem; vertex-set colouring; pre-defined noncolliding path set; restriction digraph; graph theory; optical burst/packet switching network; contention resolution mechanism; load-balanced wavelength assignment strategy; traffic matrix; collision-free routing

Subjects: Algebra; Combinatorial mathematics; Multiplexing and switching in optical communication; Communication network design, planning and routing; Optical fibre networks; Optimisation techniques

References

    1. 1)
      • J.P. Jue , V.M. Vokkarane . (2005) Optical burst switched networks.
    2. 2)
      • A.M. Odlyzko . Internet traffic growth: sources and implications. Proc. SPIE Optical Trans. Systems and Equip. for WDM Network II , 1 - 15
    3. 3)
      • Cankaya, H.C., Charcranoon, S., El-Bawab, T.S.: `A preemptive scheduling technique for OBS networks with service differentiation', Proc. IEEE Globecom, 2003, p. 2673–2689.
    4. 4)
      • Y. Chen , C. Qiao , X. Yu . Optical burst switching: a new area in optical networking research. IEEE Netw. , 3 , 16 - 23
    5. 5)
      • G. Chartrand , L. Lesniak . (1996) Graphs and digraphs.
    6. 6)
      • M.A. Fiol . Eigenvalue interlacing and weight parameters of graphs. Linear Algebr. Appl. , 275 - 301
    7. 7)
      • Chen, Y., Wu, H., Xu, D., Qiao, C.: `Performance analysis of optical burst switched node with deflection routing', Proc. IEEE ICC, 2003, p. 1355–1359.
    8. 8)
      • M. Pioro , D. Medhi . (2004) Routing, flow, and capacity design in communication and computer networks.
    9. 9)
      • W.D. Grover . (2004) Mesh-based survivable networks.
    10. 10)
      • C. Qiao , M. Yoo . Optical burst switching (OBS) – a new paradigm for an optical Internet. J. High Speed Netw. , 1 , 69 - 84
    11. 11)
      • S. Yao , B. Mukherjee , S.J.B. Yoo , S. Dixit . A unified study of contention-resolution schemes in optical packet-switched networks. IEEE J. Light. Technol. , 3 , 672 - 683
    12. 12)
      • E. Karasan , E. Ayanoglu . Performance of WDM transport networks. IEEE JSAC , 7 , 1081 - 1096
    13. 13)
    14. 14)
      • Agustí-Torra, A., Cervelló-Pastor, C., Fiol, M.A.: `Wavelength and offset window assignment schemes to avoid contention in OBS rings', Proc. Broadnets, 2006, San José, CA.
    15. 15)
      • J. Bang-Jensen , G. Gutin . (2002) Digraphs: theory, algorithms and applications.
    16. 16)
      • Agustí-Torra, A., Cervelló-Pastor, C., Fiol, M.A.: `A new approach to loss-free packet/burst transmission in all-optical networks', Proc. WOBS, 2006, San José, CA.
    17. 17)
      • J. Turner . Terabit burst switching. J. High Speed Netw. , 1 , 3 - 16
    18. 18)
      • I. Chlamtac , A. Ganz , G. Karmi . Lightpath communications: an approach to high bandwidth optical WANs. IEEE Trans. Commun. , 1171 - 1182
    19. 19)
      • Gauger, C.M.: `Dimensioning of FDL buffers for optical burst switching nodes', Proc. ONDM, 2002, Torino, Italy, p. 117–132.
    20. 20)
      • Bermond, J.-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: `Graph problems arising from wavelength routing in all-optical networks', Proc. WOCS, 1997, Geneva.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com_20070409
Loading

Related content

content/journals/10.1049/iet-com_20070409
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address