JWJean Walrand

Jean Walrand

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Jean Walrand has a total of 41 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Concise Tutorial on Traffic Shaping and Scheduling in Time-Sensitive Networks

    by Jean Walrand

    Over the last two decades, IEEE has been defining standards for Time-Sensitive Networking (TSN). These standards combine traffic shaping and scheduling mechanisms to guarantee bounded delays across an Ethernet network. Time-Sensitive Networks are designed for applications where delays are critical, such as process control, networks for vehicles and aircraft, and virtual reality applications. Many industrial companies are currently actively implementing TSN standards. The goal of this paper is to provide a concise and self-contained description of the TSN mechanisms and how they affect the network performance metrics. The paper is intended for practicing engineers wanting to improve their understanding of TSN and for students curious about these mechanisms.


  • Open Access

    A Quick Tutorial on Time-Sensitive Networks

    by Jean Walrand

    This is a short tutorial on IEEE Time Sensitive Networking standards that are being explored by industry for applications that include inter-vehicle networks, process automation, and virtual reality. The key mechanisms of the standards are traffic shaping and scheduling. The paper explains these mechanisms and illustrates them. Moreover, the paper provides guidelines on how to combine these mechanisms in a network.

  • An Approximate Dynamic Programming Approach to Repeated Games with Vector Losses

    by Vijay Kamble, Patrick Loiseau, Jean Walrand

    We describe an approximate dynamic programming (ADP) approach to compute approximations of the optimal strategies and of the minimal losses that can be guaranteed in discounted repeated games with vector-valued losses. Among other applications, such vector-valued games prominently arise in the analysis of worst-case regret in repeated decision making in unknown environments, also known as the adversarial online learning framework. At the core of our approach is a characterization of the lower Pareto frontier of the set of expected losses that a player can guarantee in these games as the unique fixed point of a set-valued dynamic programming operator. When applied to the problem of worst-case regret minimization with discounted losses, our approach yields algorithms that achieve markedly improved performance bounds compared with off-the-shelf online learning algorithms like Hedge. These results thus suggest the significant potential of ADP-based approaches in adversarial online learning.


  • Open Access

    Correction to: Probability in Electrical Engineering and Computer Science (Funding Information)

    by Jean Walrand

    This book is an open access publication. This title is freely available in an open access edition with generous support from the Library of the University of California, Berkeley.

  • Convergence of a Distributed Kiefer-Wolfowitz Algorithm

    by Jean Walrand

    This paper proposes a proof of the convergence of a distributed and asynchronous version of the Kiefer-Wolfowitz algorithm where the agents do not exchange information with one another.


  • Open Access

    Correction to: Probability in Electrical Engineering and Computer Science

    by Jean Walrand

    The author of this book used Python materials and would like to acknowledge the source. The below mentioned text has been added to the copyright page of the updated version.

  • Top Cited Papers

    An Architecture for In-Vehicle Networks

    by Jean C Walrand, Max Turner, Roy Myers

    As vehicles get equipped with increasingly complex sensors and processors, the communication requirements become more demanding. Traditionally, vehicles have used specialized networking technologies designed to guarantee bounded latencies, such as the Controller Area Network (CAN) bus. Recently, some have used dedicated technologies to transport signals from cameras, lidars, radars, and ultrasonic sensors. In parallel, IEEE working groups are defining Ethernet standards for time-sensitive networks (TSN). This paper describes an Ethernet-based architecture with provable guaranteed performance and simple configuration that is suitable for supporting the communication requirements of in-vehicle networks.


  • Open Access

    Route Planning: A

    by Jean Walrand

    This chapter is concerned with making successive decisions in the presence of uncertainty. The decisions affect the cost at each step but also the “state” of the system. We start with a simple example: choosing a route with uncertain travel times. We then examine a more general model: controlling a Markov chain.Section 13.1 presents a model of route section when the travel times are random. Section 13.2 shows one formulation where one plans the trip long in advance. Section 13.3 explains how the problem changes if one is able to adjust the route based on real-time information. That section introduces the main ideas of stochastic dynamic programming. Section 13.4 discusses a generalization of the route planning problem: a Markov decision problem. Section 13.5 solves the problem when the horizon is infinite.

  • Open Access

    Route Planning: B

    by Jean Walrand

    There is a class of control problems that admit a particularly elegant solution: the linear quadratic Gaussian (LQG) problems. In these problems, the state dynamics and observations are linear, the cost is quadratic, and the noise is Gaussian. Section 14.1 explains the theory of LQG problems when one observes the state. Section 14.2 discusses the situation when the observations are noisy and shows the remarkable certainty equivalence property of the solution. Section 14.3 explains how noisy observations affect Markov decision problems.

  • Open Access

    Perspective and Complements

    by Jean Walrand

    We have explored a number of topics motivated by concrete applications. It is time to stitch together these ideas into a complete panorama. In addition, we provide some complements.Section 15.1 discusses the general question of inference: what can one deduce from observations? Section 15.2 explains the important notion of sufficient statistic: what is the relevant data in a set of observations? Section 15.3 presents the theory of Markov chains where the number of states is infinite. Section 15.4 explains the Poisson process. Section 15.5 discusses the boosting algorithm for choosing among experts. What drug should you further research; what noisy channel should one use? These are examples of multi-armed bandit problems. In such problems one faces the trade-off between exploiting known possibilities versus exploring potentially more rewarding but less well understood alternatives. Section 15.6 explains a key results for such multi-armed bandit problems. Information Theory studies the limits of communication systems: how fast can one transmit bits reliably over a noisy channel? How many bits should be transmitted to convey some information? Section 15.7 introduces some key concepts and results of Information Theory. When estimating the likelihood of errors or the reliability of some estimates, one usually has to calculate bounds on the probability that a random variable exceeds a given value. Section 15.8 discusses some useful probability bounds. Section 15.9 explains the main ideas of the theory of martingales and shows how it provides a proof of the law of large numbers.