Elastic Service Availability: Utility Framework and Optimal Provisioning

IEEE Journal on Selected Areas in Communications

Volumn 26, Issue 6, 2008, Pages 55-65

  Xu, Dahai ^a   Li, Ying ^a   Chiang, Mung ^a   Calderbank, A Robert ^a  

^a Princeton University   (United States)

Author keywords

network utility maximization; resource allocation; Service availability; shared protection

Indexed keywords

EID: 85008044343     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSACOCN.2008.030607     Document Type: Article

References (33)

1. O. Gerstel and G. Sasaki, “Quality of protection (QoP): a quantitative unifying paradigm to protection service grades,” in Proc. Optical Networking and Communications Conference (OPTICOMM’03), Denver, CO, 2001.
2. G. Holland, “Carrier class metro networking,” Riverstone Networks, Technology white paper no. 135, July 2002.
3. AT&T Business Service Guide, http://new.serviceguide.att.com.
4. L. Z. C. Saradhi and M. Gurusamy, “Differentiated QoS for survivable WDM optical networks,” IEEE Commun. Mag., vol. 42, no. 5, pp. 8–14, May 2004.
5. A. Fumagalli and M. Tacca, “Differentiated reliability (DiR) in WDM rings without wavelength converters,” in Proc. IEEE International Conference on Communications (ICC’01), Helsinki, Finland, pp. 2887–2891.
6. S. Arakawa, J. Katou, and M. Murata, “Design method of logical topologies with quality Of reliability in WDM networks,” in Photonic Network Commun., vol. 5, no. 2, pp. 107–121, Mar. 2003.
7. F. Kelly, A. Maulloo, and D. Tan, “Rate control in communication networks: shadow prices, proportional fairness and stability,” J. Operational Research Society, vol. 49, no. 3, pp. 237–252, Mar. 1998.
8. H. Yaiche, R. R. Mazumdar, and C. Rosenberg, “A game theoretic framework for bandwidth allocation and pricing in broadband networks,” IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 667–678, 2000.
9. S. Shenker, “Fundamental design issues for the future Internet,” IEEE J. Select. Areas Commun., vol. 13, no. 7, pp. 1176–1188, Sept. 1995.
10. S. H. Low, “A duality model of TCP and queue management algorithms,” IEEE/ACM Trans. Networking, vol. 11, no. 4, pp. 525–536, 2003.
11. R. Srikant, The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications). Springer Verlag, 2004.
12. S. S. Kunniyur and R. Srikant, “End-to-end congestion control schemes: utility functions, random losses and ECN marks,” IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 689–702, 2003.
13. R. J. La and V. Anantharam, “Utility-based rate control in the Internet for elastic traffic,” IEEE/ACM Trans. Networking, vol. 10, no. 2, pp. 272–286, 2002.
14. S. H. Low and D. E. Lapsley, “Optimization flow control-part I: basic algorithm and convergence,” IEEE/ACM Trans. Networking, vol. 7, no. 6, pp. 861–874, 1999.
15. R. T. Rockafellar, Network Flows and Monotropic Programming. Athena Scientific, 1998.
16. M. Chiang, S. H. Low, A. R. Calderbank, and J. C. Doyle, Layering as optimization decomposition: a mathematical theory of network architectures,” Proc. IEEE, Jan. 2007.
17. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, “An architecture for differentiated service,” IETF, RFC 2475, 1998.
18. C. Bouras and A. Sevasti, “SLA-based QoS pricing in DiffServ networks,” Computer Commun., vol. 27, no. 18, pp. 1868–1880, 2004.
19. X. Wang and H. Schulzrinne, “Pricing network resources for adaptive applications,” in IEEE/ACM Trans. Networking, Apr. 2006.
20. L. DaSilva, D. Petr, and N. Akar, “Equilibrium pricing in multiservice priority based networks,” in Proc. IEEE Global Communications Conference ’97, Phoenix, AZ, Nov. 1997.
21. “Static pricing and quality of service in multiple service networks,” in Proc. 5th Conference on Computer Science and Informatics, Atlantic City, NJ, 2000, pp. 355–358.
22. J. W. Lee, M. Chiang, and R. A. Calderbank, “Pricing-based distributed algorithms for rate-reliability tradeoff in network utility maximization,” in IEEE Conference on Computer Communications (INFOCOM’06), Barcelona, Spain, Apr. 2006.
23. V. Marbukh, “On aggregate utility maximization based network management: challenges and possible approaches,” in Proc. IEEE International Conference on Communications (ICC’04), Paris, France, 2004.
24. V. Sharma et al., “Framework for MPLS-based recovery,” Internet draft, draft-ietf-mpls-recovery-frmwrk-08.txt (work in progress), Oct. 2002.
25. J. Mo and J. C. Walrand, “Fair end-to-end window-based congestion control.” IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 556–567, 2000.
26. M. Kodialam and T. V. Lakshman, “Dynamic routing of bandwidth guaranteed tunnels with restoration,” in Proc. IEEE Conference on Computer Communications (INFOCOM’00), Tel Aviv, Israel, pp. 902–911.
27. G. Li et al., “Efficient distributed path selection for shared restoration connections,” in Proc. IEEE Conference on Computer Communications (INFOCOM’02), New York, NY, pp. 140–149.
28. C. Qiao and D. Xu, “Distributed partial information management (DPIM) schemes for survivable networks-part I,” in Proc. IEEE Conference on Computer Communications (INFOCOM’02), New York, NY, pp. 302–311.
29. S. Boyd and L. Vandenberghe, Convex Optimization. New York: Cambridge University Press, 2004.
30. D. P. Bertsekas, Nonlinear Programming, 2nd ed. Athena Scientific, 1999.
31. M. Minoux, Mathematical Programming: Theory and Algorithms. Wiley, 1986.
32. S. Baroni, P. Bayvel, and R.J.Gibbens, “On the number of wavelength in arbitrarily-connected wavelength-routed optical networks,” University of Cambridge, Statistical Laboratory Research Report 1998–7, available at http://www.statslab.cam.ac.uk/reports/1998/1998-7.pdf, 1998.
33. Y. Liu, D. Tipper, and P. Siripongwutikorn, “Approximating optimal spare capacity allocation by successive survivable routing,” in Proc. IEEE Conference on Computer Communications (INFOCOM'Ol). Anchorage, AK, pp. 699–708.