Q. Wang, J. Vincent, and G. King


  1. [1] P. Paul & S.V. Raghavan, Survey of QoS routing, Proc. 15thInternational Conf. on Computer Communication, Mumbai,Maharashtra, India, August 12–14, 2002, 50–75.
  2. [2] S. Chen & K. Nahrstedt, Distributed QoS routing with imprecise state information, Proc. 7th Int. Conference on Computer Communications and Networks (IC3N), Lafayette, Louisiana, USA, October 1998.
  3. [3] I. Matta & A.U. Shankar, Dynamic routing of real-time virtualcircuits, Proc. IEEE International Conference on Network Protocols (ICNP96), Columbus, OH, 1996, 132–139.
  4. [4] H. Ahmadi, J. Chen, & R. Ruerin, Dynamic routing and callcontrol in high-speed integrated networks, Proc. Workshop on Systems Engineering and Traffic Engineering, ITC’13, Copenhagen, Denmark, June 1991, 19–26.
  5. [5] A. Shaikh, Efficient dynamic routing in wide-area networks,Ph.D. Thesis, University of Michigan, 1999.
  6. [6] G. Apostolopoulos, Cost and performance trade-offs of qualityof service routing, Ph.D. Thesis, University of Maryland, 1999.
  7. [7] J.X. Wang, W.P. Wang, J. Chen, & S.Q. Chen, An effectiverandomized QoS routing algorithm on networks with inaccuratelink state information, Journal of Computer Science andTechnology, 17(1), January 2002, 38–46.
  8. [8] H. Lorenz & A. Orda, QoS routing in networks with uncertainparameters, Proc. IEEE Conf. on Computer CommunicationsINFOCOM98, San Francisco, USA, 1, 1998, 3–10.
  9. [9] X.M. Bruin, Mechanisms to reduce routing information in-accuracy effects: Application to MPLS and WDM networks,Ph.D. Thesis, Computer Architecture Department, TechnicalUniversity of Catalonia, Barcelona, June 2003.
  10. [10] Q. Wang, J. Vincent, & G. King, A prediction approach toperformance improvement of quality-of-service routing underinaccurate link state information, 2nd Int. Conf. Informationand Communication Technology, Cairo, Egypt, 2004.
  11. [11] A. Shaikh, J. Rexford, & K. Shin, Evaluating the impactof stale link state on quality-of-service routing, IEEE/ACMTransactions on Networking, 9(2), April 2001. doi:10.1109/90.917073
  12. [12] G. Apostolopoulos, R. Guerin, S. Kamat, & S. Tripathi,Improving QoS routing performance under inaccurate link stateinformation, Proc. 16th Int. Teletraffic Congress, Edinburgh,Scotland, June, 1999.
  13. [13] B. Lekovic & P.V. Mieghem, Link state update policies forQuality of Service routing, Proc. 8th IEEE Symp. on Communi-cations and Vehicular Technology in the Benelux (SCVT2001),Delft, The Netherlands, October 2001, 123–128.
  14. [14] L. Burgstahler & M. Neubauer, New modifications of the ex-ponential moving average algorithm for bandwidth estimation,Proc. the 15th ITC Specialist Seminar on Internet Traffic En-gineering and Traffic Management, Wurzburg, 2002, 210–219.
  15. [15] T. Anjali, C. Scoglio, J.C. De Oliveira, L.C. Chen, I.F. Akyildiz, J.A. Smith, G. Uhl, & A. Sciuto, A new path selection algorithm for MPLS networks based on available bandwidth estimation,Proc. International Workshop on Quality of Future Internet Services/International Workshop on Internet Charging and QoS Technology (QofIS/ICQT 2002), LNCS 2511, 2002, 205–214.
  16. [16] W. Leland, M. Taqqu, W. Willinger, & D. Wilson, On the self-similar nature of ethernet traffic, IEEE/ACM Transactions onNetworking, 2(1), 1994, 1–15. doi:10.1109/90.282603
  17. [17] M. Grossglauser & J.C. Bolot, On the relevance of long-rangedependence in network traffic, Proc. ACM SIGCOMM ’96, 26(4), 1996, 15–24. doi:10.1145/248157.248159
  18. [18] Q. Ma & P. Steenkiste, Quality-of-service routing for trafficwith performance guarantees, Proc. 5th Int. IFIP Workshop on Quality of Service, New York, USA, May 1997.
  19. [19] S. Chen & K. Nahrstedt, An overview of quality-of-servicerouting for the next generation high-speed networks: Problemsand solutions, IEEE Network Magazine, Special Issue on Transmission and Distribution of Digital Video, 1998.
  20. [20] V. Paxson & S. Floyd, Wide-area traffic: The failure of Poissonmodelling, IEEE/ACM Transactions on Networking, 3, 1995, 226–244. doi:10.1109/90.392383
  21. [21] V. Paxson & S. Floyd, Why we don’t know how to simulatethe Internet, Proc. the 1997 Winter Simulation Conference, Atlanta, GA, USA, December 1997.
  22. [22] W. Zegura, K.L. Calvert, & S. Bhattacharjee, How to model aninternetwork, Proc. IEEE Conf. on Computer Communications INFOCOM 96, San Francisco, CA, USA, 1996, 594–602.
  23. [23] F. Salama, Multicast routing for real-time communicationon high-speed networks, Ph.D. Thesis, North Carolina State University, 1996.
  24. [24] Q. Wang, Performance improvement of quality of servicerouting under inaccurate link state information, Ph.D. Thesis,Southampton Institute, 2005.
  25. [25] E. Box & G.M. Jenkins, Time series analysis forecasting andcontrol (San Francisco: California Holden-Day, 1970).
  26. [26] Y. Zhang, V. Paxson, S. Shenker, & L. Breslau, The stationarityof Internet path properties: Routing, loss, and throughput, ACIRI Technical Report, May 2000.
  27. [27] A. Feldmann, Impact of non-Poisson arrival sequences for calladmission algorithms with and without delay, Proc. IEEE Global Telecommunications Conference (GLOBECOM), London, England, November 1996, 617–622. doi:10.1109/GLOCOM.1996.594436
  28. [28] R. Bos, S.D. Waele, & P.M.T. Broersen, Autoregressive spectralestimation by application of the burg algorithm to irregularlysampled data, IEEE Transactions on Instrumentation and Measurement, 51 (6), December 2002. doi:10.1109/TIM.2002.808031

Important Links:

Go Back