File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A Lagrangean Relaxation Based Scheme For Allocation Of Bandwidth

TitleA Lagrangean Relaxation Based Scheme For Allocation Of Bandwidth
Authors
KeywordsOptimization under uncertainty
Bandwidth
Heuristic
Lagrangean relaxation
Issue Date2005
Citation
The 5th International Conference on Electronic Business (ICEB 2005), Hong Kong, 5-9 December 2005. In Proceedings of the 5th International Conference on Electronic Business, 2005, p. 167-171 How to Cite?
AbstractIn this paper we study the bandwidth packing problem in the presence of priority classes. The 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 satisfy delay constraints and have to be routed over a network with given topology so that the revenue generated from routing these messages 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. Several numerical experiments are conducted using a number of problem parameters such as percentage of messages, ratio of messages of lower to higher priority, capacity of links and high quality solutions to the bandwidth packing problem are generated under the different situations.
Persistent Identifierhttp://hdl.handle.net/10722/112300

 

DC FieldValueLanguage
dc.contributor.authorBose, Ien_HK
dc.date.accessioned2010-09-26T03:26:11Z-
dc.date.available2010-09-26T03:26:11Z-
dc.date.issued2005en_HK
dc.identifier.citationThe 5th International Conference on Electronic Business (ICEB 2005), Hong Kong, 5-9 December 2005. In Proceedings of the 5th International Conference on Electronic Business, 2005, p. 167-171en_HK
dc.identifier.urihttp://hdl.handle.net/10722/112300-
dc.description.abstractIn this paper we study the bandwidth packing problem in the presence of priority classes. The 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 satisfy delay constraints and have to be routed over a network with given topology so that the revenue generated from routing these messages 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. Several numerical experiments are conducted using a number of problem parameters such as percentage of messages, ratio of messages of lower to higher priority, capacity of links and high quality solutions to the bandwidth packing problem are generated under the different situations.-
dc.languageengen_HK
dc.relation.ispartofProceedings of the 5th International Conference on Electronic Businessen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectOptimization under uncertainty-
dc.subjectBandwidth-
dc.subjectHeuristic-
dc.subjectLagrangean relaxation-
dc.titleA Lagrangean Relaxation Based Scheme For Allocation Of Bandwidthen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailBose, I: bose@business.hku.hken_HK
dc.identifier.authorityBose, I=rp01041en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.scopuseid_2-s2.0-84873560347-
dc.identifier.hkuros112639en_HK
dc.identifier.spage167en_HK
dc.identifier.epage171en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats