A framework for tiered service in MPLS networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 1577-1585

  Rouskas, George N ^a   Baradwaj, Nikhil ^b  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b MicroStrategy ^*

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING;

NETWORK OPERATORS; NETWORK RESOURCES; P-MEDIAN PROBLEM;

WIRELESS NETWORKS;

EID: 34548362088     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.185     Document Type: Conference Paper

References (9)

1. A. Aggarwal, M. Klawe, S. Moran, P. Shor, R. Wilber. Geometric applications of a matrix searching algorithm. Algorithmica, 2:195-208, 1987.
2. A. Aggarwal and J. Park. Notes on searching in multidimensional monotone arrays. In IEEE FOCS, pages 497-512, 1988.
3. Nikhil Baradwaj. Traffic quantization and its application to QoS routing. Master's thesis, NCSU, Raleigh, NC, August 2005.
4. D. Cavendish, K. Murakami, S-H. Yun, O. Matsuda, and M. Nishihara. New transport services for next-generation SONET/SDH systems. IEEE Communications Magazine, 40(5):80-87, May 2002.
5. M. Daskin. Network and Discrete Location: Models, Algorithms, and Applications. John Wiley and Sons, New York, 1995.
6. R. Hassin and A. Tamir. Improved complexity bounds for location problems on the real line. Operations Res. Letters, 10:395-402, 1991.
7. C-T. Lea, A. Alyatama. Bandwidth quantization and states reduction in the broadband ISDN. IEEE/ACM Tran. Network., 3:352-360, June 1995.
8. N. Megiddo and K. J. Supowit. On the complexity of some common geometric location problems. SIAM J. Computing, 13:182-196, Feb. 1984.
9. S. Ramabhadran and J. Pasquale. Stratified round robin: A low complexity packet scheduler with bandwidth fairness and bounded delay. In Proceedings of ACM SIGCOMM '03, pages 239-249, August 2003.