Jean Walrand

Professor

Research Areas

• Communications & Networking (COMNET), Performance evaluation
• Game theory

Research Centers

• Connectivity Lab

Teaching Schedule (Spring 2008)

• EE 122. Introduction to Communication Networks, MW 530-700P, 150 GSPP
• EE 126. Probabilily and Random Processes, TuTh 330-5P, 3106 Etcheverry

Biography

He received his Ph.D. in EECS from UC Berkeley. He is the author of An Introduction to Queueing Networks (Prentice Hall, 1988) and of Communication Networks: A First Course (2nd ed. McGraw-Hill,1998) and co-author of High-Performance Communication Networks (2nd ed, Morgan Kaufman, 2000). Prof. Walrand is a Fellow of the Belgian American Education Foundation and of the IEEE and a recipient of the Lanchester Prize and of the Stephen O. Rice Prize.

Selected Publications

• R. Gupta, J. Musacchio, and J. Walrand, "Sufficient rate constraints for QoS flows in ad-hoc networks," Ad Hoc Networks, vol. 5, no. 4, pp. 429-4435, May 2007.
• M. Malboubi, A. Bahai, M. Ergen, P. Varaiya, and J. Walrand, "Unequal importance image communication over heterogeneous networks," in Proc. 2007 IEEE 65th Vehicular Technology Conf.--Spring (VTC2007-Spring), Piscataway, NJ: IEEE Press, 2007, pp. 629-633.
• A. Dimakis, R. Jain, and J. Walrand, "Mechanisms for efficient allocation in divisible capacity networks," in Proc. 2006 IEEE 45th Conf. on Decision and Control, Piscataway, NJ: IEEE Press, 2006, pp. 1264-1269.
• A. Dimakis and J. Walrand, "Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits," Advances in Applied Probability, vol. 38, no. 2, pp. 505-521, June 2006.
• L. He and J. Walrand, "Pricing and revenue sharing strategies for Internet service providers," IEEE J. Selected Areas in Communications, vol. 24, no. 5, pp. 942-951, May 2006.
• Z. Jia, R. Gupta, J. Walrand, and P. Varaiya, "Bandwidth guaranteed routing for ad-hoc networks with interference consideration," in Proc. 10th IEEE Symp. on Computers and Communications, Los Alamitos, CA: IEEE Computer Society, 2005, pp. 3-9.
• J. Mo and J. Walrand, "Fair end-to-end window-based congestion control," IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 556-567, Oct. 2000.
• J. Walrand and P. Varaiya, High-Performance Communication Networks, 2 ed., The Morgan Kaufmann Series in Networking, San Francisco, CA: Morgan Kaufmann, 2000.
• N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, "Stephen O. Rice Prize Paper Award: Achieving 100% throughput in an input-queued switch," IEEE Trans. on Communications, vol. 47, no. 8, pp. 1260-1267, Aug. 1999.
• J. Walrand, Communication Networks: A First Course, 2 ed., McGraw-Hill Science, Engineering, and Math Series, Boston, MA: McGraw-Hill, 1998.
• C. Courcoubetis, G. Kesidis, A. Ridder, J. Walrand, and R. Weber, "Admission control and routing in ATM networks using inferences from measured buffer occupancy," IEEE Trans. Communications, vol. 43, no. 2-4, pt. 3, pp. 1778-1784, Feb. 1995.
• G. Kesidis, J. Walrand, and C. Chang, "Effective bandwidths for multiclass Markov fluids and other ATM sources," IEEE/ACM Trans. Networking, vol. 1, no. 4, pp. 424-428, Aug. 1993.
• S. Parekh and J. Walrand, "A quick simulation method for excessive backlogs in networks of queues," IEEE Trans. Automatic Control, vol. 34, no. 1, pp. 54-66, Jan. 1989.
• J. Walrand, An Introduction to Queueing Networks, Englewood Cliffs, NJ: Prentice Hall, 1988.
• R. R. Weber, P. Varaiya, and J. Walrand, "Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime," J. Applied Probability, vol. 23, no. 3, pp. 841-847, Sep. 1986.
• P. Varaiya, J. Walrand, and C. Buyukkoc, "Extensions of the multiarmed bandit problem: The discounted case," IEEE Trans. Automatic Control, vol. AC-30, no. 5, pp. 426-439, May 1985.
• J. Walrand and P. Varaiya, "Optimal causal coding-decoding problems," IEEE Trans. Information Theory, vol. IT-29, no. 6, pp. 814-820, Nov. 1983.
• J. Walrand and P. Varaiya, "Flows in queueing networks: A Martingale approach," Mathematics of Operations Research, vol. 6, no. 3, pp. 387-404, Aug. 1981.
• J. Walrand and P. Varaiya, "Sojourn times and the overtaking condition in Jacksonian networks," Advances in Applied Probability, vol. 12, no. 4, pp. 1000-1018, Dec. 1980.