Skip to main content
SpringerLink
Log in

The Multi-Hour Bandwidth Packing Problem with Response Time Guarantees

  • Published:
Information Technology and Management Aims and scope Submit manuscript

Abstract

This paper deals with the multi-hour bandwidth packing problem in telecommunication networks. The problem consists of selecting calls from a list of requests with time varying traffic conditions to be routed on an arc-capacitated network in order to maximize profit. Response time to users is considered by specifying an upper limit on the queueing delay in the network. The paper represents a significant improvement over previous research by presenting a unified model of the problem that considers all possible paths for each call, allows the traffic requirements of the calls to vary over the busy-hours of the day and integrates quality of service to users. A mathematical programming formulation for the problem is presented. A Lagrangean relaxation based heuristic solution procedure is developed. The results of extensive computational experiments over a wide range of problem structures indicate that the procedure is both efficient and effective.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Amiri and R. Barkhi, The multi-hour bandwidth packing problem, Computers and Operations Research 27 (2000) 1–14.

    Google Scholar 

  2. A. Amiri, E. Rolland and R. Barkhi, Bandwidth packing with queueing delay costs: Bounding and heuristic solution procedures, European Journal of Operational Research 112 (1999) 635–645.

    Google Scholar 

  3. C.A. Anderson, K. Fraughnaugh, M. Parkner and J. Ryan, Path assignment for call routing: An application of tabu search, Annals of Operations Research 41 (1993) 301–312.

    Google Scholar 

  4. M.S. Bazaraa and J.J. Goode, A survey of various tactics for generating Lagrangean multipliers in the context of Lagrangean duality, European Journal of Operational Research 3 (1979) 322–328.

    Google Scholar 

  5. L. Cox, L. Davis and Y. Qui, Dynamic anticipatory routing in cuircuit-switched telecommunications networks, in: Handbook of Genetic Algorithms, ed. L. Davis (Van Norstrand/Reinhold, New York, 1991).

    Google Scholar 

  6. B. Gavish, On obtaining the ‘best’ multipliers for a Lagrangean relaxation for integer programming, Computers and Operations Research 5 (1978) 55–71.

    Google Scholar 

  7. B. Gavish and K. Altinkemer, Backbone network design tools with economic tradeoffs, ORSA Journal on Computing 2 (1990) 226–252.

    Google Scholar 

  8. B. Gavish and I. Neuman, A system for routing and capacity assignment in computer networks, IEEE Transactions on Communications 37 (1989) 360–366.

    Google Scholar 

  9. M. Gerla, The design of store-and-forward (S/F) networks for computer communications, Ph.D. dissertation, Computer Science Department, University of California, Los Angeles, 1973.

    Google Scholar 

  10. M. Gerla, A. Monreiro and R. Pazos, Topology design and bandwidth allocation in ATM nets, IEEE Journal on Selected Areas in Communications 7 (1989) 1253–1262.

    Google Scholar 

  11. L. Kleinrock, Communications Nets: Stochastic Message Flow and Delay (Dover, New York, 1964).

    Google Scholar 

  12. L. Kleinrock, Queueing Systems, Vols. 1, 2 (Wiley–Interscience, New York, 1975/1976).

    Google Scholar 

  13. M. Laguna and F. Glover, Bandwidth packing: A tabu search approach, Management Science 39 (1993) 492–500.

    Google Scholar 

  14. J. Monreiro and M. Gerla, Bandwidth allocation in ATM networks, Annals of Operations Research 49 (1994) 25–50.

    Google Scholar 

  15. K. Park, S. Kang and S. Park, An integer programming approach to the bandwidth packing problem, Management Science 42 (1996) 1277–1291.

    Google Scholar 

  16. M. Parker and J. Ryan, A column generation algorithm for bandwidth packing, Telecommunication Systems 2 (1995) 185–196.

    Google Scholar 

  17. B.T. Poljack, A general method of solving extremum problems, Soviet Math. Doklady 8 (1967) 593–597.

    Google Scholar 

  18. E. Rolland, A. Amiri and R. Barkhi, Queueing delay guarantees in bandwidth packing, Computers and Operations Research 26 (1999) 921–935.

    Google Scholar 

  19. M.M. Syslo, N. Deo and J.S. Kowalik, Discrete Optimization Algorithms with Pascal Programs (Prentice-Hall, Englewood Cliffs, NJ, 1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management, College of Business, Oklahoma State University, Stillwater, Oklahoma, USA

    Ali Amiri

Authors
  1. Ali Amiri
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Amiri, A. The Multi-Hour Bandwidth Packing Problem with Response Time Guarantees. Information Technology and Management 4, 113–127 (2003). https://doi.org/10.1023/A:1021832618060

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021832618060

Search

Navigation