File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Bandwidth packing with priority classes

TitleBandwidth packing with priority classes
Authors
KeywordsBandwidth packing
Integer programming
Lagrangean relaxation
OR in telecommunications
Priority classes
Issue Date2009
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejor
Citation
European Journal Of Operational Research, 2009, v. 192 n. 1, p. 313-325 How to Cite?
AbstractThe bandwidth packing problem is defined as the selection and routing of messages from a given list of messages with prespecified requirements on demand for bandwidth. The messages have to be routed over a network with given topology so that the generated revenue is maximized. Messages to be routed are classified into two priority classes. An integer programming based formulation of this problem is proposed and a Lagrangean relaxation based methodology is described for solving this problem. A general purpose heuristic is then developed for generating feasible solutions of good quality. Several numerical experiments are conducted using a number of problem parameters such as number of messages, ratio of messages for lower and higher priority classes, capacity of links, and demand distribution of messages belonging to different classes and high quality solutions to the priority bandwidth packing problem are generated under the different situations. © 2007.
Persistent Identifierhttp://hdl.handle.net/10722/60198
ISSN
2015 Impact Factor: 2.679
2015 SCImago Journal Rankings: 2.595
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorBose, Ien_HK
dc.date.accessioned2010-05-31T04:05:44Z-
dc.date.available2010-05-31T04:05:44Z-
dc.date.issued2009en_HK
dc.identifier.citationEuropean Journal Of Operational Research, 2009, v. 192 n. 1, p. 313-325en_HK
dc.identifier.issn0377-2217en_HK
dc.identifier.urihttp://hdl.handle.net/10722/60198-
dc.description.abstractThe bandwidth packing problem is defined as the selection and routing of messages from a given list of messages with prespecified requirements on demand for bandwidth. The messages have to be routed over a network with given topology so that the generated revenue is maximized. Messages to be routed are classified into two priority classes. An integer programming based formulation of this problem is proposed and a Lagrangean relaxation based methodology is described for solving this problem. A general purpose heuristic is then developed for generating feasible solutions of good quality. Several numerical experiments are conducted using a number of problem parameters such as number of messages, ratio of messages for lower and higher priority classes, capacity of links, and demand distribution of messages belonging to different classes and high quality solutions to the priority bandwidth packing problem are generated under the different situations. © 2007.en_HK
dc.languageengen_HK
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejoren_HK
dc.relation.ispartofEuropean Journal of Operational Researchen_HK
dc.subjectBandwidth packingen_HK
dc.subjectInteger programmingen_HK
dc.subjectLagrangean relaxationen_HK
dc.subjectOR in telecommunicationsen_HK
dc.subjectPriority classesen_HK
dc.titleBandwidth packing with priority classesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0377-2217&volume=192&spage=313&epage=325&date=2009&atitle=Bandwidth+Packing+With+Priority+Classesen_HK
dc.identifier.emailBose, I: bose@business.hku.hken_HK
dc.identifier.authorityBose, I=rp01041en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.ejor.2007.09.011en_HK
dc.identifier.scopuseid_2-s2.0-50849113788en_HK
dc.identifier.hkuros160461en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-50849113788&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume192en_HK
dc.identifier.issue1en_HK
dc.identifier.spage313en_HK
dc.identifier.epage325en_HK
dc.identifier.isiWOS:000259898100025-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridBose, I=7003751502en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats