File Download
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A Lagrangean Relaxation Based Scheme For Allocation Of Bandwidth
| Title | A Lagrangean Relaxation Based Scheme For Allocation Of Bandwidth |
|---|---|
| Authors | |
| Keywords | Optimization under uncertainty Bandwidth Heuristic Lagrangean relaxation |
| Issue Date | 2005 |
| 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? |
| Abstract | In 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 Identifier | http://hdl.handle.net/10722/112300 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Bose, I | en_HK |
| dc.date.accessioned | 2010-09-26T03:26:11Z | - |
| dc.date.available | 2010-09-26T03:26:11Z | - |
| dc.date.issued | 2005 | en_HK |
| dc.identifier.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 | en_HK |
| dc.identifier.uri | http://hdl.handle.net/10722/112300 | - |
| dc.description.abstract | In 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.language | eng | en_HK |
| dc.relation.ispartof | Proceedings of the 5th International Conference on Electronic Business | en_HK |
| dc.subject | Optimization under uncertainty | - |
| dc.subject | Bandwidth | - |
| dc.subject | Heuristic | - |
| dc.subject | Lagrangean relaxation | - |
| dc.title | A Lagrangean Relaxation Based Scheme For Allocation Of Bandwidth | en_HK |
| dc.type | Conference_Paper | en_HK |
| dc.identifier.email | Bose, I: bose@business.hku.hk | en_HK |
| dc.identifier.authority | Bose, I=rp01041 | en_HK |
| dc.description.nature | published_or_final_version | - |
| dc.identifier.scopus | eid_2-s2.0-84873560347 | - |
| dc.identifier.hkuros | 112639 | en_HK |
| dc.identifier.spage | 167 | en_HK |
| dc.identifier.epage | 171 | en_HK |