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.
Jean Walrand mostly deals with Computer network, Queue, Mathematical optimization, Throughput and Distributed computing. His Network packet, Asynchronous communication, Asynchronous Transfer Mode, Network congestion and Packet switching investigations are all subjects of Computer network research. His Packet switching study incorporates themes from End-to-end principle, Convergence, Window and Fairness measure.
His work carried out in the field of Queue brings together such families of science as Traffic policing, Server, Bandwidth and Optimal control. His Mathematical optimization research is multidisciplinary, incorporating elements of Dynamic demand and Combinatorics. His Throughput study also includes fields such as
Jean Walrand focuses on Computer network, Queue, Mathematical optimization, Distributed computing and Queueing theory. His Computer network study integrates concerns from other disciplines, such as Wireless network and Throughput. His studies examine the connections between Wireless network and genetics, as well as such issues in Distributed algorithm, with regards to Algorithm.
His Queue study combines topics from a wide range of disciplines, such as Discrete mathematics and Ergodic theory. In his study, Markov process is strongly linked to Markov chain, which falls under the umbrella field of Mathematical optimization. The Distributed computing study combines topics in areas such as Wireless ad hoc network, Scheduling and Asynchronous communication.
Jean Walrand mostly deals with Distributed computing, Mathematical optimization, Incentive, Control and Scheduling. His Distributed computing research is multidisciplinary, incorporating perspectives in Unit cost, Stochastic game, Dynamic priority scheduling, Fair-share scheduling and Computer network. Jean Walrand has included themes like Cloud computing and Throughput in his Computer network study.
The concepts of his Mathematical optimization study are interwoven with issues in Queue, Sequence and Joint probability distribution. His work in the fields of M/G/1 queue overlaps with other areas such as Volumetric flow rate. His studies deal with areas such as Queueing theory and Server as well as Scheduling.
His main research concerns Distributed computing, Scheduling, Control, Queueing theory and Context. His biological study spans a wide range of topics, including Game theory, Dynamic priority scheduling, Fair-share scheduling, Incentive and Computer network. His Node study in the realm of Computer network connects with subjects such as Population.
Jean Walrand studied Scheduling and Server that intersect with System parameters, Gradient projection, Fork–join queue and Network model. Jean Walrand interconnects Optimal control, SIMPLE and Data science in the investigation of issues within Control. The study incorporates disciplines such as Disjoint sets, Network topology, Ergodic theory, Mathematical optimization and Queue in addition to Queueing theory.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Fair end-to-end window-based congestion control
Jeonghoon Mo;Jean Walrand.
IEEE ACM Transactions on Networking (2000)
Achieving 100% throughput in an input-queued switch
N. McKeown;A. Mekkittikul;V. Anantharam;J. Walrand.
IEEE Transactions on Communications (1999)
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
Libin Jiang;Jean Walrand.
allerton conference on communication, control, and computing (2010)
Automated vehicle control developments in the PATH program
S.E. Shladover;C.A. Desoer;J.K. Hedrick;M. Tomizuka.
IEEE Transactions on Vehicular Technology (1991)
Effective bandwidths for multiclass Markov fluids and other ATM sources
George Kesidis;Jean Walrand;Cheng-Shang Chang.
IEEE ACM Transactions on Networking (1993)
Achieving 100% throughput in an input-queued switch
N. McKeown;V. Anantharam;J. Walrand.
international conference on computer communications (1996)
High-Performance Communication Networks
Jean Walrand;Pravin Varaiya.
Comparison of Multichannel MAC Protocols
Jeonghoon Mo;H.-S.W. So;J. Walrand.
IEEE Transactions on Mobile Computing (2008)
Analysis and comparison of TCP Reno and Vegas
J. Mo;R.J. La;V. Anantharam;J. Walrand.
international conference on computer communications (1999)
Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards
V. Anantharam;P. Varaiya;J. Walrand.
IEEE Transactions on Automatic Control (1987)
If you think any of the details on this page are incorrect, let us know.
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: