| Reference: | [1] P.J. Bickel and K.A. Doksum, Mathematical Statistics: Basic Ideas and Selected Topics, Prentice Hall, 1977.
[2] J. Boyle, RSVP Extensions for CIDR Aggregated Data Flow, Internet work in progress, June 1997.
[3] K. Gopalan and T. Chiueh, Delay Budget Allocation in Dlay Bounded Network Paths, Technical Report TR-113, Experimental Computer Sys-tems Labs, Dept. of Computer Science, State University of New York, Stony Brook, NY, June 2002.
[4] D. Mitra and Q. Wang, Stochastic Traffic Engineering, with Applications to Network Revenue Management, Proceedings of IEEE INFOCOM`03, San Francisco, 2-10, CA, 2003.
[5] MATLAB 6.5, the Mathworks, Inc., 2002.
[6] E. Mulyana, U. Killat, A Hybrid Genetic Algorithm Approach for OSPF Weight Setting Problem, 2nd POLISH-GERMAN TELETRAFFIC SYM-POSIUM PGTS, 9th Polish Teletraffic Symposium, 2002, found in inter-net.
[7] E. Mulyana and U. Killat, An Alternative Genetic Algorithm to Optimize OSPF Weights, July 2002, found in internet.
[8] W. Ogryczak, T. Śliwiński and A. Wierzbicki, Fair Resource Allocation Schemes and Network Dimensioning Problems, Journal of Telecommu-nication and Information Technology, 34-42, Mar. 2003.
[9] A. Orda, Routing with End-to-End QoS Guarantees in Broadband Net-works, IEEE/ACM Transaction on Networking, Vol. 7, No. 3, 365-374, June 1999.
[10] K.G. Ramakrishnan and M.A. Rodrigues, Optimal Routing in Shortest Path Data Networks, Bell Labs Technical Journal, 117–138, January, June 2001.
[11] S. Rooney, Connection closures: Adding application-defined behavior to network connections, Internet work in progress, April 1997.
[12] P. Thomas, D. Teneketzis, J. K. Mackie-Mason, A Market-Based Ap-proach to Optimal Resource Allocation in Integrated-Services Connec-tion-Oriented Networks, Operations Research, Vol. 50, No. 4, 603-616, July-August 2002.
[13] C.H. Wang, Mathematical Models of Pareto Optimal Path Selection on All-IP Networks, Master Thesis, National Chengchi University, Taipei, 2004.
[14] L. W. Winston, Operations Research Applications and Algorithms, Bel-mont, CA: THOMSON BROOKS/COLE, 2004. |
