World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
69
Citations
23695
World Ranking
1944
National Ranking
984

Research.com Recognitions

  • 2012 - IEEE Koji Kobayashi Computers and Communications Award “For contributions to the theory and algorithms for highspeed switching and network resource allocation.”
  • 1993 - IEEE Fellow For the development of highly efficient techniques for the analysis, control, and simulation of stochastic networks and stochastic resource allocation problems.

Overview

Jean Walrand is affiliated with the University of California, Berkeley in the United States. Their research spans multiple areas within computer science and engineering, with a focus on networks and communication systems.

The primary fields of study for Jean Walrand include Computer Science, with 15 publications, and Engineering, represented by 6 publications. Their work further drills down into subfields such as Computer Networks and Communications, Electrical and Electronic Engineering, Hardware and Architecture, Artificial Intelligence, and Management Science and Operations Research.

Key topics addressed in their research encompass Network Time Synchronization Technologies, Real-Time Systems Scheduling, Vehicular Ad Hoc Networks (VANETs), Wireless Networks and Protocols, Advanced Wireless Network Optimization, Cooperative Communication and Network Coding, and Mobile Agent-Based Network Management.

Jean Walrand has published papers in a variety of venues. Frequent venues include arXiv (Cornell University) with three publications, IEEE Transactions on Vehicular Technology, IEEE Communications Surveys & Tutorials, Operations Research, and Stochastic Systems.

Some recent papers authored by Jean Walrand include:

  • An Architecture for In-Vehicle Networks, 2021, IEEE Transactions on Vehicular Technology
  • A Concise Tutorial on Traffic Shaping and Scheduling in Time-Sensitive Networks, 2023, IEEE Communications Surveys & Tutorials
  • Convergence of a Distributed Kiefer-Wolfowitz Algorithm, 2021, Stochastic Systems

The scientist has collaborated frequently with other researchers, including Max Turner, Roy Myers, Piotr Gawłowicz, Adam Wolisz, and Quanyan Zhu.

In addition to journal articles, Jean Walrand has contributed to book literature. A notable publication is "Network Games, Control and Optimization," published in 2021 by Springer Science+Business Media.

Their work has been recognized with several awards, such as the IEEE Koji Kobayashi Computers and Communications Award in 2012, awarded for contributions related to high-speed switching and network resource allocation. They were also named an IEEE Fellow in 1993 for developing efficient techniques for the analysis, control, and simulation of stochastic networks and resource allocation problems.

Best Publications

  • Fair end-to-end window-based congestion control

    Jeonghoon Mo;Jean Walrand

  • Achieving 100% throughput in an input-queued switch

    N. McKeown;A. Mekkittikul;V. Anantharam;J. Walrand

  • Automated vehicle control developments in the PATH program

    S.E. Shladover;C.A. Desoer;J.K. Hedrick;M. Tomizuka

  • A distributed CSMA algorithm for throughput and utility maximization in wireless networks

    Libin Jiang;Jean Walrand

  • Effective bandwidths for multiclass Markov fluids and other ATM sources

    George Kesidis;Jean Walrand;Cheng-Shang Chang

  • Achieving 100% throughput in an input-queued switch

    N. McKeown;V. Anantharam;J. Walrand

  • High-Performance Communication Networks

    Jean Walrand;Pravin Varaiya

  • Analysis and comparison of TCP Reno and Vegas

    J. Mo;R.J. La;V. Anantharam;J. Walrand

  • Comparison of Multichannel MAC Protocols

    Jeonghoon Mo;H.-S.W. So;J. Walrand

  • Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards

    V. Anantharam;P. Varaiya;J. Walrand

  • Knowledge-Defined Networking

    Albert Mestres;Alberto Rodriguez-Natal;Josep Carner;Pere Barlet-Ros

  • A simple dynamic routing problem

    A. Ephremides;P. Varaiya;J. Walrand

  • The cμ rule revisited

    C. Buyukkoc;P. Varaiya;J. Walrand

  • Extensions of the multiarmed bandit problem: The discounted case

    P. Varaiya;J. Walrand;C. Buyukkoc

  • Communication Networks: A First Course

    Jean Walrand

  • A quick simulation method for excessive backlogs in networks of queues

    S. Parekh;J. Walrand

  • Incentive mechanisms for smartphone collaboration in data acquisition and distributed computing

    Lingjie Duan;Takeshi Kubo;Kohei Sugiyama;Jianwei Huang

  • Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits

    Antonis Dimakis;Jean Walrand

  • McMAC: A Parallel Rendezvous Multi-Channel MAC Protocol

    Hoi-Sheung;W. So;J. Walrand;Jeonghoon Mo

  • Comparison of multi-channel MAC protocols

    Jeonghoon Mo;Hoi-Sheung Wilson So;Jean Walrand

  • Knowledge-Defined Networking

    Albert Mestres;Alberto Rodriguez-Natal;Josep Carner;Pere Barlet-Ros

Frequent Co-Authors

Pravin Varaiya
Pravin Varaiya University of California, Berkeley
Costas Courcoubetis
Costas Courcoubetis Chinese University of Hong Kong, Shenzhen
George Kesidis
George Kesidis Pennsylvania State University
Jianwei Huang
Jianwei Huang Chinese University of Hong Kong, Shenzhen
Venkat Anantharam
Venkat Anantharam University of California, Berkeley
R. Srikant
R. Srikant University of Illinois at Urbana-Champaign
Lingjie Duan
Lingjie Duan Singapore University of Technology and Design
David G. Messerschmitt
David G. Messerschmitt University of California, Berkeley
Kannan Ramchandran
Kannan Ramchandran University of California, Berkeley
Nicholas Bambos
Nicholas Bambos Stanford University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

If you're interested in flexible learning options or exploring additional fields related to Computer Science, there are a variety of online degree pathways to consider. Many students begin with associates degrees online, which can typically be completed in a shorter time frame and serve as a stepping stone toward higher qualifications.

For those wanting a more business-focused approach, pursuing an online business degree with financial aid can lead to roles in tech management, entrepreneurship, or administration. If affordability is a primary concern, searching for the cheapest online bachelor degree options can help reduce student debt while earning a respected qualification.

Engineering and tech-related fields are closely linked to computer science careers. Those interested in a technical route may look for the cheapest engineering degree online to gain practical and in-demand skills. Whichever pathway you choose, online programs can offer the flexibility and affordability needed to achieve your career goals.

Best Scientists Citing Jean Walrand

Trending Scientists

Recently Published Articles