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

Scheduling advance reservation requests for wavelength division multiplexed networks with static traffic demands

Scheduling advance reservation requests for wavelength division multiplexed networks with static traffic demands

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

Telecommunication and grid computing applications demand high bandwidth data channels that offer guarantees with respect to service availability. Such applications include: remote surgery, remote experimentation, video on-demand, teleconferencing and bulk transfers. Furthermore, by forecasting traffic patterns internet service providers attempt to optimise network resources in order to lower operational costs during peak periods of bandwidth consumption. Advance reservation for wavelength division multiplexed networks can address some of these issues by reserving high volume communication channels (i.e. lightpaths) beforehand. The authors develop a mathematical model to solve the problem of scheduling lightpaths in advance. The optimal solution is presented as a mixed integer linear program with the assumption that all traffic is static and the network is centrally controlled. Furthermore, we have developed two novel meta-heuristics based on: 1) a greedy implementation (local search) and 2) simulated annealing. The meta-heuristics have shown to produce good approximate solutions in a reasonable amount of time.

Inspec keywords: telecommunication channels; scheduling; integer programming; bandwidth allocation; telecommunication traffic; wavelength division multiplexing; linear programming; grid computing; simulated annealing

Other keywords: communication channel; bandwidth consumption; meta-heuristics; wavelength division multiplexed network; scheduling; grid computing; reservation request; mixed integer linear program; bandwidth data channel; telecommunication; greedy implementation; mathematical model; simulated annealing; static traffic demand

Subjects: Distributed systems software; Optimisation techniques; Optimisation techniques; Multiplexing and switching in optical communication

References

    1. 1)
      • C. Blum , A. Roli . Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. , 3 , 268 - 308
    2. 2)
      • J. Kuri , N. Puech , M. Gagnaire , E. Dotaro , R. Douville . Routing and wavelength assignment of scheduled lightpath demands. IEEE J. Sel. Areas Commun. , 8 , 1231 - 1240
    3. 3)
      • S. Kirkpatrick , C.D. Gelati , M.P. Vecchi . (1994) Optimization by simulated annealing’ in Biology and computation: a physicist's choice.
    4. 4)
      • Available at: http://www.nesc.ac.uk/nesc/define.html, last accessed May 2006.
    5. 5)
      • Huang, M.D., Romeo, F., Sangiovanni-Vincentelli, A.: `An efficient general cooling schedule for simulated annealing', IEEE Int. Conf. Computer Aided Design, 1986, p. 381–384.
    6. 6)
      • I. Foster , C. Kesselman . (1998) The grid: blueprint for a new computing infrastructure.
    7. 7)
      • Available at: http://www.nih.gov/news/pr/dec2004/ncrr-08.htm, last accessed May 2006.
    8. 8)
      • R. Ramaswami , K.N. Sivarajan . Routing and wavelength assignment in all-optical networks'. IEEE/ACM Trans. Netw. , 5 , 489 - 500
    9. 9)
      • P.J.M. Van Laarhoven , E.H.L. Aarts . (1987) Simulated annealing: theory and applications.
    10. 10)
      • Kuri, J., Puech, N., Gagnaire, M.: `Diverse routing of scheduled lightpath demands in an optical transport network', Proc. 4th Int. Workshop on Design of Reliable Communication Networks (DRCN 2003), p. 69–76.
    11. 11)
      • R. Fourer , D.M. Gay , B.W. Kernighan . (2003) AMPL: a modeling language for mathematical programming.
    12. 12)
      • Y.T. Chen , K.H. Lee . A flexible service model for advance reservation. Comput. Netw. , 251 - 262
    13. 13)
      • E.H.I. Aarts , J.H.H. Korst . (1989) Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing.
    14. 14)
      • Available at: http://info.web.cern.ch/Press/PressReleases/Releases 2005/PR06.05E.html, last accessed May 2006.
    15. 15)
      • Saradhi, C.V., Gurusamy, M.: `Graph theoretic approaches for routing and wavelength assignment of scheduled lightpath demands in WDM optical networks', 2005 2nd Int. Conf. Broadband Networks, p. 368–376.
    16. 16)
      • Y. Wang , T.H. Cheng , M.H. Lim . A tabu search algorithm for static routing and wavelength assignment problem. IEEE Commun. Lett. , 9 , 841 - 843
    17. 17)
      • Banerjee, N., Sharan, S.: `A evolutionary algorithm for solving the single objective static routing and wavelength assignment problem in WDM networks', Proc. Int. Conf. Intelligent Sensing and Information Processing, 2004, p. 13–18.
    18. 18)
      • H. Zang , J.P. Jue , B. Mukherjee . A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Opt. Netw. Mag. , 1 , 47 - 60
    19. 19)
      • Wang, C., Ghenniwa, H., Shen, W.: `Heuristic scheduling algorithm for flexible manufacturing systems with partially overlapping machine capabilities', IEEE Int. Conf. Mechatronics and Automation, 2005, 3.
    20. 20)
      • R. Wintner . Bits on the big screen computer bits are replacing film in the biggest change in cinema since Technicolor. IEEE SPECTRUM , 12
    21. 21)
      • Farooq, U., Majumdar, S., Parsons, E.W.: `Impact of laxity on scheduling with advance reservations in grids', MASCOTS, 5, p. 319–324.
    22. 22)
      • Smith, W., Foster, I., Taylor, V.: `Scheduling with advanced reservations', Proc. 14th Int. Parallel and Distributed Processing Symposium IPDPS 2000, p. 127–132.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com_20070500
Loading

Related content

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