Abstract
This paper proposes a generic revenue-aware bandwidth allocation (RBA) model. This model satisfies diverse QoS requirements of different IP services with revenue as the optimization criterion. Based on this generic model, this paper provides Enhanced Greedy Algorithm (EGA) to solve RBA problems. Unlike other algorithms, the proposed algorithm is deterministic and can be calculated in polynomial time. The experiments on a switched router show that EGA is efficient and applicable for embedded systems.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Braden, R., Zhang, L., Berson, S., Herzog, S., Jamin, S. (eds).: Resource ReSerVation Protocol, IETF, RFC2205 (1997)
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Service, IETF, RFC2475 (1998)
Seddigh, N., Nandy, B., Pieda, P.: Bandwidth assurance issues for TCP flows in a differentiated services network. In: IEEE GLOBECOM, pp. 1792–1798 (1999)
Park, E.-C., Choi, C.-H.: Adpative token bucket algorithm for fair bandwidth allocation in diffserv networks. In: IEEE GLOBECOM, pp. 3176–3180 (2003)
Park, E.-C., Choi, C.-H.: Proportional Bandwidth Allocation in DiffServ Networks. In: IEEE INFOCOM, pp. 2038–2049 (2004)
Kramer, G., Pesavento, G.: Ethernet Passive Optical Network (EPON): Building a Next-Generation Optical Access Network. In: IEEE Communications Magazine, pp. 66–73 (2002)
IEEE 802.17 Resilient packet ring (RPR) access method & physical layer specifications (2004)
An, F.-T., Hsueh, Y.-L., Kim, K.S., White, I.M., Kazovsky, L.G.: A New Dynamic Bandwidth Allocation Protocol with Quality of Service in Ethernet-based Passive Optical Networks. In: WOC, pp. 383–385 (2003)
Alharbi, F., Ansari, N.: Low complexity distributed bandwidth allocation for resilient packet ring networks. In: IEEE HPSR, pp. 277–281 (2004)
Byrant, S., Pate, P.: PWE3 Architecture, IETF, draft-ietf-pwe3-arch-07.txt (2003)
Martini, L., El-Aawar, N., Heron, G.: Encapsulation Methods for Transport of Ethernet Frames Over MPLS Networks, IETF, draft-ietf-pwe3-ethernet-encap-09.txt (2005)
ITU-T Workshop on Next Generation Networks: What, When and How?, ITU-T (2003) http://www.itu.int
Garey, M.J., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Franscisco (1979)
Martello, S., Pisinger, D., Toth, P.: Dynamic Programming and strong bounds for the 0-1 knapsack problem. Management Science, 414–424 (1999)
Martello, S., Pisinger, D., Toth, P.: New Trends in exact algorithms for the 0-1 knapsack problem. European Journal of Operational Research, 325–332 (2000)
Ji, M., Yu, S.-h.: An innovative packet processing methodology: Policy-based Flow Switching. In: SPIE proceedings, Beijing, P.R.China, vol. 5626, pp. 730–737 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ji, M., Yu, Sh. (2005). A Revenue-Aware Bandwidth Allocation Model and Algorithm in IP Networks. In: Yang, L.T., Zhou, X., Zhao, W., Wu, Z., Zhu, Y., Lin, M. (eds) Embedded Software and Systems. ICESS 2005. Lecture Notes in Computer Science, vol 3820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599555_62
Download citation
DOI: https://doi.org/10.1007/11599555_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30881-2
Online ISBN: 978-3-540-32297-9
eBook Packages: Computer ScienceComputer Science (R0)