Adaptive QoS provisioning by pricing incentive QoS routing for next generation networks
暂无分享,去创建一个
[1] Satish K. Tripathi,et al. Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.
[2] Lixia Zhang,et al. A Framework for Integrated Services Operation over Diffserv Networks , 2000, RFC.
[3] Marwan Krunz,et al. Bandwidth-delay constrained path selection under inaccurate state information , 2003, TNET.
[4] George D. Stamoulis,et al. Integration of pricing and flow control for available bit rate services in ATM networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.
[5] Mike Shand,et al. Flooding optimizations in link-state routing protocols , 2001 .
[6] Alpár Jüttner,et al. Lagrange relaxation based method for the QoS routing problem , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[7] Nirwan Ansari,et al. Routing-oriented update schEme (ROSE) for link state updating , 2008, IEEE Transactions on Communications.
[8] Jon Crowcroft,et al. Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..
[9] Peter Steenkiste,et al. Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .
[10] Xin Yuan. Heuristic algorithms for multiconstrained quality-of-service routing , 2002, IEEE/ACM Trans. Netw..
[11] Gang Liu,et al. A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[12] Scott Shenker,et al. Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .
[13] Deborah Estrin,et al. Pricing in computer networks: motivation, formulation, and example , 1993, TNET.
[14] Ariel Orda,et al. Precomputation schemes for QoS routing , 2003, TNET.
[15] Nirwan Ansari,et al. Efficient and reliable link state information dissemination , 2004, IEEE Communications Letters.
[16] Marwan Krunz,et al. Routing multimedia traffic with QoS guarantees , 2003, IEEE Trans. Multim..
[17] Raif O. Onvural,et al. Algorithm for efficient generation of link-state updates in ATM networks , 1997, Comput. Networks ISDN Syst..
[18] Norio Shiratori,et al. QoS based routing algorithm in integrated services packet networks , 1997, Proceedings 1997 International Conference on Network Protocols.
[19] Richard G. Ogier,et al. A reliable, efficient topology broadcast protocol for dynamic networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[20] David L. Black,et al. An Architecture for Differentiated Service , 1998 .
[21] Nirwan Ansari,et al. Achieving 100% success ratio in finding the delay constrained least cost path , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..
[22] Klara Nahrstedt,et al. An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..
[23] Klara Nahrstedt,et al. QoS extension to BGP , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..
[24] Peter Steenkiste,et al. Evaluation and characterization of available bandwidth probing techniques , 2003, IEEE J. Sel. Areas Commun..
[25] Anees Shaikh,et al. Evaluating the impact of stale link state on quality-of-service routing , 2001, TNET.
[26] Xin Wang,et al. Pricing network resources for adaptive applications , 2006, IEEE/ACM Transactions on Networking.
[27] Pierre A. Humblet,et al. Topology Broadcast Algorithms , 1989, Comput. Networks.
[28] Henning Schulzrinne,et al. Pricing network resources for adaptive applications in a differentiated services network , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[29] Stan Zachary,et al. Distributed admission control , 2000, IEEE Journal on Selected Areas in Communications.
[30] David Eppstein,et al. Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[31] Hui Zhang,et al. Endpoint admission control: architectural issues and performance , 2000, SIGCOMM 2000.
[32] Nirwan Ansari,et al. Finding all hops k-shortest paths , 2003, 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490).
[33] Tijana Timotijevic,et al. Bandwidth overhead of probe technology guaranteeing QoS in packet networks , 2003 .
[34] Ezhan Karasan,et al. GoS-based pricing and resource allocation for multimedia broadband networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[35] Symeon Papavassiliou,et al. A flexible and distributed architecture for adaptive end-to-end QoS provisioning in next-generation networks , 2005, IEEE Journal on Selected Areas in Communications.
[36] Antonio Capone,et al. Throughput analysis of end-to-end measurement-based admission control in IP , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[37] John Moy. Flooding Over a Subset Topology , 2001 .
[38] Nirwan Ansari,et al. Finding all hops shortest paths , 2004, IEEE Communications Letters.
[39] Peter Marbach,et al. Priority service and max-min fairness , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.