Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Capacity Assignment and Routing for Interactive Multimedia Service Networks

  • Lim, Byung-Ha (College of Business Administration, Chung-Ang University) ;
  • Park, June-Sung (Industrial Engineering, Computer Science and Knowledge Service Engineering, KAIST)
  • Received : 2008.05.06
  • Accepted : 2009.02.09
  • Published : 2010.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

A binary linear integer program is formulated for the problem of expanding the capacity of a fiber optic network and routing the traffic to deliver new interactive multimedia services. A two-phase Lagrangian dual search procedure and a Lagrangian heuristic are developed. Computational results show superior performance of the two-phase subgradient optimization compared with the conventional one-phase approach.

Keywords

References

  1. M. L. Fisher, "The Lagrangian relaxation method for solving integer programming problems," Management Science, vol. 27, no. 1, pp. 1–18, 1981. https://doi.org/10.1287/mnsc.27.1.1
  2. M. Gerla, J. A. S. Monteiro, and R. Pazos, "Topology design and bandwidth allocation in ATM nets," IEEE J. Sel. Areas Commun., vol. 7, no. 8, pp. 1253–1262, 1989. https://doi.org/10.1109/49.35570
  3. Informa Media & Telecoms, On-Demand TV & PVRs, 2008.
  4. V. O. K. Li, W. Liao, X. Qiu, and E. Wong, "Performance model of interactive video-on-demand systems," IEEE J. Sel. Areas Commun., vol. 14, no. 6, pp. 1099–1109, 1996. https://doi.org/10.1109/49.508281
  5. J. M. McManus and K.W. Ross, "Video-on-demand over ATM: Constantrate transmission and transport," IEEE J. Sel. Areas Commun., vol. 14, no. 6, pp. 1087–1098, 1996. https://doi.org/10.1109/49.508280
  6. D. Medhi, "Multi-hour, multi-traffic class network design for virtual pathbased dynamically reconfigurable wide-area ATM networks," IEEE/ACM Trans. Netw., vol. 3, no. 6, pp. 809–818, 1995. https://doi.org/10.1109/90.477726
  7. D. Medhi and D. Tipper, "Some approaches to solving a multihour broadband network capacity design problem with single-path routing," Telecommun. Syst., vol. 13, no. 2–4, pp. 269–291, 2000. https://doi.org/10.1023/A:1019148207669
  8. J. P. Nussbaumer, B. V. Patel, F. Schaffa, and J. P. G. Sterbenz, "Networking requirements for interactive video on demand," IEEE J. Sel. Areas Commun., vol. 13, no. 5, pp. 779–787, 1995. https://doi.org/10.1109/49.391753
  9. J. S. Park, B. H. Lim, and Y. Lee, "A Lagrangian dual-based branch-andbound algorithm for the generalized multi-assignment problem," Management Science, vol. 44, no. 12, pp. 271–282, 1998. https://doi.org/10.1287/mnsc.44.12.S271
  10. P. V. Rangan, H. M. Vin, and S. Ramanathan, "Designing an on-demand multimedia service," IEEE Commun. Mag., pp. 56–64, July 1992.
  11. Y. Sato, and K. Sato, "Virtual path and link capacity design for ATM networks," IEEE J. Sel. Areas Commun., vol. 9, no. 1, pp. 104–111, 1991. https://doi.org/10.1109/49.64909