Connection-Oriented Networks

This chapter focuses on the optimization of connection-oriented networks (CONs). Following a brief introduction to the basics of technologies and protocols used in CONs, we formulate several optimization problems that arise in the context of connection-oriented networking applied to cloud computing and content-oriented services. To address specific attributes of cloud computing and content-oriented services, the optimization problems presented—besides including classical unicast flows—also embrace anycast and multicast network flows. All presented optimization problems are formulated as ILP models. Moreover, for selected optimization problems, we propose and analyze solution algorithms and report results of numerical experiments.

[1]  Tibor Cinkler,et al.  Evaluation and estimation of the availability of p-cycle protected connections , 2013, Telecommun. Syst..

[2]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[3]  Nikolaos Laoutaris,et al.  On the optimization of storage capacity allocation for content distribution , 2005, Comput. Networks.

[4]  Marcin Markowski,et al.  The Three-Criteria Servers Replication and Topology Assignment Problem in Wide Area Networks , 2006, ICCSA.

[5]  Antonio Capone,et al.  Multi-layer MPLS network design: The impact of statistical multiplexing , 2008, Comput. Networks.

[6]  Oktay Günlük,et al.  A branch-and-cut algorithm for capacitated network design problems , 1999, Math. Program..

[7]  Luigi Fratta,et al.  Flow Deviation: 40 years of incremental flows for packets, waves, cars and tunnels , 2014, Comput. Networks.

[8]  Weiwei Fang,et al.  Optimising data placement and traffic routing for energy saving in Backbone Networks , 2014, Trans. Emerg. Telecommun. Technol..

[9]  Jacek Rak,et al.  Shared Backup Path Protection for Anycast and Unicast Flows Using the Node-Link Notation , 2011, 2011 IEEE International Conference on Communications (ICC).

[10]  El-Sayed M. El-Alfy,et al.  A Pareto-based hybrid multiobjective evolutionary approach for constrained multipath traffic engineering optimization in MPLS/GMPLS networks , 2013, J. Netw. Comput. Appl..

[11]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[12]  Krzysztof Walkowiak,et al.  Anycasting in connection-oriented computer networks: Models, algorithms and results , 2010, Int. J. Appl. Math. Comput. Sci..

[13]  Dario Rossi,et al.  Cost-aware caching: Optimizing cache provisioning and object placement in ICN , 2014, 2014 IEEE Global Communications Conference.

[14]  M. Tornatore,et al.  Design of Disaster-Resilient Optical Datacenter Networks , 2012, Journal of Lightwave Technology.

[15]  Feng Zhang,et al.  Applying p-Cycles in Dynamic Provisioning of Survivable Multicast Sessions in Optical WDM Networks , 2007, OFC/NFOEC 2007 - 2007 Conference on Optical Fiber Communication and the National Fiber Optic Engineers Conference.

[16]  Wensheng Zhang,et al.  An efficient anycast routing algorithm for load-balancing based on evolutionary algorithm , 2010, 2010 3rd IEEE International Conference on Broadband Network and Multimedia Technology (IC-BNMT).

[17]  Piet Demeester,et al.  Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS , 2004 .

[18]  Daniel Bienstock,et al.  Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem , 2002, Math. Program..

[19]  Krzysztof Walkowiak,et al.  A heuristic approach to working and spare capacity optimization for survivable anycast streaming protected by p-cycles , 2014, Telecommun. Syst..

[20]  Sudipta Mahapatra,et al.  A metaheuristic approach for optical network optimization problems , 2013, Appl. Soft Comput..

[21]  Krzysztof Walkowiak,et al.  Gains of anycast demand relocation in survivable elastic optical networks , 2014, 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM).

[22]  Feng Zhang,et al.  p-cycle based optical multicast protection approaches for combined node and link failure recovery , 2010, Asia Communications and Photonics Conference and Exhibition.

[23]  Yanghee Choi,et al.  WAVE: Popularity-based and collaborative in-network caching for content-oriented networks , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[24]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[25]  Krzysztof Walkowiak,et al.  Design of MPLS over DWDM Architecture for Unicast and Anycast Flows , 2010, NEW2AN.

[26]  Tibor Cinkler,et al.  A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[27]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[28]  Nikolaos Laoutaris,et al.  Joint object placement and node dimensioning for Internet content distribution , 2004, Inf. Process. Lett..

[29]  Nelson Luis Saldanha da Fonseca,et al.  Algorithm for FIPP p-cycle path protection in flexgrid networks , 2014, 2014 IEEE Global Communications Conference.

[30]  Chris Develder,et al.  Joint Dimensioning of Server and Network Infrastructure for Resilient Optical Grids/Clouds , 2012, IEEE/ACM Transactions on Networking.

[31]  Jian Shen,et al.  A tabu search algorithm for the routing and capacity assignment problem in computer networks , 2005, Comput. Oper. Res..

[32]  Gerhard Haßlinger,et al.  Efficiency of caches for content distribution on the Internet , 2010, 2010 22nd International Teletraffic Congress (lTC 22).

[33]  Chris Develder,et al.  Exploiting relocation to reduce network dimensions of resilient optical grids , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

[34]  Iradj Ouveysi,et al.  Designing cost-effective content distribution networks , 2007, Comput. Oper. Res..

[35]  Wayne D. Grover,et al.  Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[36]  C. G. Gruber.  Resilient networks with non-simple p-cycles , 2003, 10th International Conference on Telecommunications, 2003. ICT 2003..

[37]  Chris Develder,et al.  Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection , 2011, 2011 IEEE International Conference on Communications (ICC).

[38]  Zongpeng Li,et al.  Youtube traffic characterization: a view from the edge , 2007, IMC '07.

[39]  Krzysztof Walkowiak,et al.  Optimization of survivable networks with simultaneous unicast and anycast flows , 2009, 2009 International Conference on Ultra Modern Telecommunications & Workshops.

[40]  Rajmohan Rajaraman,et al.  Approximation algorithms for data placement in arbitrary networks , 2001, SODA '01.

[41]  Shay Kutten,et al.  Optimal allocation of electronic content , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[42]  Wei Li,et al.  p-Cycle Network Design for Specified Minimum Dual-Failure Restorability , 2007, 2007 IEEE International Conference on Communications.

[43]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective , 1998 .

[44]  Marcin Markowski,et al.  An Exact Algorithm for the Servers Allocation, Capacity and Flow Assignment Problem with Cost Criterion and Delay Constraint in Wide Area Networks , 2007, International Conference on Computational Science.

[45]  L. Velasco,et al.  Survivable IP/MPLS-Over-WSON Multilayer Network Optimization , 2011, IEEE/OSA Journal of Optical Communications and Networking.

[46]  Krzysztof Walkowiak,et al.  Joint working and spare capacity assignment for anycast streaming in survivable networks protected by p-Cycles , 2011, 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[47]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

[48]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[49]  Doan B. Hoang,et al.  Joint Optimization of Capacity and Flow Assignment in a Packet-Switched Communications Network , 1987, IEEE Trans. Commun..

[50]  Larry J. LeBlanc,et al.  Packet Routing in Telecommunication Networks with Path and Flow Restrictions , 1999, INFORMS J. Comput..

[51]  Jacek Rak,et al.  Joint optimization of anycast and unicast flows in survivable optical networks , 2010, 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS).

[52]  Mateusz Dzida,et al.  On popularity-based load balancing in content networks , 2012, 2012 24th International Teletraffic Congress (ITC 24).

[53]  David Coley,et al.  Introduction to Genetic Algorithms for Scientists and Engineers , 1999 .

[54]  Feng Zhang,et al.  Optimized design of node-and-link protecting p-cycle with restorability constraints for optical multicast traffic protection , 2009, 2009 14th OptoElectronics and Communications Conference.

[55]  Oliver W. W. Yang,et al.  Finding protection cycles in DWDM networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[56]  Deep Medhi,et al.  IP/MPLS-over-OTN-over-DWDM Multilayer Networks: An Integrated Three-Layer Capacity Optimization Model, a Heuristic, and a Study , 2012, IEEE Transactions on Network and Service Management.

[57]  P. Mahey,et al.  Multicommodity flow problems with a bounded number of paths: A flow deviation approach , 2007 .

[58]  Wayne D. Grover,et al.  IP layer restoration and network planning based on virtual protection cycles , 2000, IEEE Journal on Selected Areas in Communications.

[59]  Chris Develder,et al.  Anycast end-to-end resilience for cloud services over virtual optical networks , 2013, 2013 15th International Conference on Transparent Optical Networks (ICTON).

[60]  Krzysztof Walkowiak,et al.  Quasi-hierarchical Evolutionary Algorithm for Flow Optimization in Survivable MPLS Networks , 2007, ICCSA.

[61]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[62]  Kazutaka Murakami,et al.  Virtual path routing for survivable ATM networks , 1996, TNET.

[63]  Anthony E. Krzesinski,et al.  Path selection and bandwidth allocation in MPLS networks , 2003, Perform. Evaluation.

[64]  Deep Medhi,et al.  A Network Optimization Model for Multi-layer IP/MPLS over OTN/DWDM Networks , 2009, IPOM.

[65]  Sudipta Mahapatra,et al.  An evolutionary programming algorithm for survivable routing and wavelength assignment in transparent optical networks , 2013, Inf. Sci..

[66]  W.D. Grover,et al.  A disjoint route-sets approach to design of path-protecting p-cycle networks , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..

[67]  Wensheng Zhang,et al.  Intelligent p-Cycle Protection for Dynamic Multicast Sessions in WDM Networks , 2010, IEEE/OSA Journal of Optical Communications and Networking.

[68]  Gilbert Laporte,et al.  Exact algorithms for the joint object placement and request routing problem in content distribution networks , 2008, Comput. Oper. Res..

[69]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[70]  Mark Coates,et al.  Video-on-Demand Server Selection and Placement , 2007, International Teletraffic Congress.

[71]  Laurence A. Wolsey,et al.  A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem , 2003, Networks.

[72]  Ying Wu,et al.  Survivable routing and spectrum allocation algorithm based on p-cycle protection in elastic optical networks , 2014 .

[73]  Víctor López,et al.  Multi-layer capacity planning for IP-optical networks , 2014, IEEE Communications Magazine.

[74]  Bezalel Gavish,et al.  A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..

[75]  Chris Develder,et al.  Column Generation for Dimensioning Resilient Optical Grid Networks with Relocation , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[76]  Jaroslaw Arabas,et al.  Applying an evolutionary algorithm to telecommunication network design , 2001, IEEE Trans. Evol. Comput..

[77]  Michel Minoux,et al.  Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods , 2001, Ann. Oper. Res..

[78]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[79]  Fabián A. Chudak,et al.  Fast optical Layer mesh protection using pre-cross-connected trails , 2002, IEEE/ACM Transactions on Networking.

[80]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[81]  Kai Xu,et al.  Applying p-Cycle technique to elastic optical networks , 2014, 2014 International Conference on Optical Network Design and Modeling.

[82]  Krzysztof Walkowiak,et al.  A Unified Approach to Survivability of Connection-Oriented Networks , 2005, ISCIS.

[83]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[84]  Feng Zhang,et al.  Extending p-Cycles to Source Failure Recovery for Optical Multicast Media Traffic , 2010, IEEE/OSA Journal of Optical Communications and Networking.

[85]  Krzysztof Walkowiak,et al.  Modeling of Survivable Network Design Problems with Simultaneous Unicast and Anycast Flows , 2009, 2009 2nd International Symposium on Logistics and Industrial Informatics.

[86]  Jacek Rak,et al.  Simultaneous optimization of unicast and anycast flows and replica location in survivable optical networks , 2013, Telecommun. Syst..

[87]  Wayne D. Grover,et al.  Extending the p-cycle concept to path segment protection for span and node failure recovery , 2003, IEEE J. Sel. Areas Commun..

[88]  Eduardo Camponogara,et al.  Implementing traffic engineering in MPLS-based IP networks with Lagrangean relaxation , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[89]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[90]  Óscar González de Dios,et al.  A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem , 2013, Comput. Oper. Res..

[91]  Krzysztof Walkowiak,et al.  A new approach to optimization of p-cycle protected Multicast optical networks , 2013, 2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[92]  Krzysztof Walkowiak.  A New Method of Primary Routes Selection for Local Restoration , 2004, NETWORKING.

[93]  Xin-She Yang,et al.  Chapter 5 – Genetic Algorithms , 2014 .

[94]  Harry G. Perros,et al.  Connection-Oriented Networks: SONET/SDH, ATM, MPLS and Optical Networks , 2005 .

[95]  Andreas Barth,et al.  Benefits from 2-layer traffic engineering for IP/MPLS networks , 2008, Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium.

[96]  Di Yuan,et al.  A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem , 2000, Oper. Res..

[97]  Feng Zhang,et al.  A Novel Path-Protecting p-Cycle Heuristic Algorithm , 2006, 2006 International Conference on Transparent Optical Networks.

[98]  Bezalel Gavish,et al.  Routing in a Network with Unreliable Components , 1988, IEEE Trans. Commun..

[99]  Philippe Mahey,et al.  A Survey of Algorithms for Convex Multicommodity Flow Problems , 2000 .

[100]  Krzysztof Walkowiak,et al.  Optimization of p-cycles for survivable anycasting streaming , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

[101]  Anjali Agarwal,et al.  Alternate Strategies for Dual Failure Restoration Using p-Cycles , 2006, 2006 IEEE International Conference on Communications.

[102]  Feng Zhang,et al.  An overview of p-cycle based optical multicast protection approaches in mesh WDM networks , 2011, Opt. Switch. Netw..

[103]  Prathima Agrawal,et al.  On relay selection and power allocation in cooperative free-space optical networks , 2015, Photonic Network Communications.

[104]  Deep Medhi,et al.  Optimizing Node Capacity in Multilayer Networks , 2011, IEEE Communications Letters.

[105]  Li Wang,et al.  Two-layer mesh network optimization based on inter-layer decomposition , 2011, Photonic Network Communications.

[106]  Alan Mcguire,et al.  Ethernet as carrier transport infrastructure , 2006, IEEE Communications Magazine.

[107]  Arie M. C. A. Koster,et al.  Robust network design: Formulations, valid inequalities, and computations , 2013, Networks.

[108]  Wayne D. Grover,et al.  Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .

[109]  Feng Zhang,et al.  ρp-Cycle based tree protection of optical multicast traffic for combined link and node failure recovery in WDM mesh networks , 2009, IEEE Commun. Lett..

[110]  Chris Develder,et al.  Resilient network dimensioning for optical grid/clouds using relocation , 2012, 2012 IEEE International Conference on Communications (ICC).

[111]  A. Takacs,et al.  GMPLS controlled ethernet: an emerging packet-oriented transport technology , 2008, IEEE Communications Magazine.

[112]  Arie M. C. A. Koster,et al.  On cut‐based inequalities for capacitated network design polyhedra , 2011, Networks.

[113]  B. Jaumard,et al.  Anycast Routing for Survivable Optical Grids: Scalable Solution Methods and the Impact of Relocation , 2011, IEEE/OSA Journal of Optical Communications and Networking.

[114]  Bernard Cousin,et al.  Extending node protection concept of p-cycles for an efficient resource utilization in multicast traffic , 2011, 2011 IEEE 36th Conference on Local Computer Networks.

[115]  Miguel A. Vega-Rodríguez,et al.  Applying MOEAs to solve the static Routing and Wavelength Assignment problem in optical WDM networks , 2013, Eng. Appl. Artif. Intell..

[116]  Esa Hyytiä.  Heuristic Algorithms for the Generalized Routing and Wavelength Assignment Problem , 2004 .

[117]  Spiridon Bakiras,et al.  Combining replica placement and caching techniques in content distribution networks , 2005, Comput. Commun..

[118]  Abdolreza Abhari,et al.  Workload generation for YouTube , 2009, Multimedia Tools and Applications.

[119]  Krzysztof Walkowiak.  Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks , 2005, International Conference on Computational Science.

[120]  Antonio Capone,et al.  Multi-Layer Network Design with Multicast Traffic and Statistical Multiplexing , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[121]  Feng Zhang,et al.  Source failure recovery for optical multicast traffic in WDM networks , 2011, 2011 13th International Conference on Transparent Optical Networks.

[122]  Di Yuan,et al.  A Lagrangean approach to network design problems , 1998 .

[123]  Wayne D. Grover,et al.  Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles ("p-cycles") , 2000, IEEE Trans. Commun..

[124]  Marcin Markowski,et al.  The Web Replica Allocation and Topology Assignment Problem in Wide Area Networks: Algorithms and Computational Results , 2005, ICCSA.

[125]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[126]  Krzysztof Walkowiak,et al.  Optimal results for Anycast-Protecting p-Cycles problem , 2010, International Congress on Ultra Modern Telecommunications and Control Systems.

[127]  Krzysztof Walkowiak,et al.  Evolutionary Algorithm for Congestion Problem in Connection-Oriented Networks , 2005, ICCSA.

[128]  K. Shiomoto,et al.  High-speed calculation method for large-scale multi-layer network design problem , 2012, 2012 15th International Telecommunications Network Strategy and Planning Symposium (NETWORKS).

[129]  Yezid Donoso,et al.  Multi-Objective Optimization in Computer Networks Using Metaheuristics , 2007 .

[130]  P. Krishnan,et al.  The cache location problem , 2000, TNET.

[131]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

[132]  Luis Velasco,et al.  Valid inequalities for the routing and spectrum allocation problem in elastic optical networks , 2014, 2014 16th International Conference on Transparent Optical Networks (ICTON).

[133]  Gerhard J. Woeginger,et al.  Monge strikes again: optimal placement of web proxies in the internet , 2000, Oper. Res. Lett..

[134]  Michal Pioro,et al.  Valid inequalities for a shortest-path routing optimization problem , 2007 .

[135]  Kai Xu,et al.  Optimal design for $$p$$p-Cycle-protected elastic optical networks , 2015, Photonic Network Communications.

[136]  Krzysztof Walkowiak.  Lagrangean Heuristic for Anycast Flow Assignment in Connection-Oriented Networks , 2006, International Conference on Computational Science.

[137]  Chris Develder,et al.  On the impact of relocation on network dimensions in resilient optical Grids. , 2010, 2010 14th Conference on Optical Network Design and Modeling (ONDM).

[138]  Krzysztof Walkowiak,et al.  p-cycle based multicast protection — A new ILP formulation , 2012, 2012 2nd Baltic Congress on Future Internet Communications.

[139]  Jia Wang,et al.  A survey of web caching schemes for the Internet , 1999, CCRV.

[140]  Feng Zhang,et al.  Performance Evaluation of Optical Multicast Protection Approaches for Combined Node and Link Failure Recovery , 2009, Journal of Lightwave Technology.

[141]  Krzysztof Walkowiak,et al.  Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks , 2008, Comput. Optim. Appl..

[142]  Yu Liu,et al.  Spare Capacity Allocation in Two-Layer Networks , 2007, IEEE Journal on Selected Areas in Communications.

[143]  L. Caccetta,et al.  A branch and cut method for the degree-constrained minimum spanning tree problem , 2001 .

[144]  Daniel Bienstock,et al.  Strong inequalities for capacitated survivable network design problems , 2000, Math. Program..

[145]  Krzysztof Walkowiak.  Modeling and optimization of computer networks , 2011 .

[146]  Steve Uhlig,et al.  Optimal cache allocation for Content-Centric Networking , 2013, 2013 21st IEEE International Conference on Network Protocols (ICNP).

[147]  Sidney L. Hantler,et al.  An Algorithm for Optimal Route Selection in SNA Networks , 1983, IEEE Trans. Commun..

[148]  Yuji Oie,et al.  Evolutionary routing-path selection in congested communication networks , 2009, 2009 IEEE International Conference on Systems, Man and Cybernetics.

[149]  Krzysztof Walkowiak,et al.  Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows , 2010 .

[150]  Krzysztof Walkowiak.  A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks , 2008, ICCSA.

[151]  Athanasios V. Vasilakos,et al.  Aggregated bandwidth allocation: investigation of performance of classical constrained and genetic algorithm based optimisation techniques , 2002, Comput. Commun..