Search Results - "Walrand, Jean"
-
1
A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
Published in IEEE/ACM transactions on networking (01-06-2010)“…In multihop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex…”
Get full text
Journal Article -
2
An efficient Nash-implementation mechanism for network resource allocation
Published in Automatica (Oxford) (01-08-2010)“…We propose a mechanism for auctioning bundles of multiple divisible goods in a network where buyers want the same amount of bandwidth on each link in their…”
Get full text
Journal Article -
3
A Concise Tutorial on Traffic Shaping and Scheduling in Time-Sensitive Networks
Published in IEEE Communications surveys and tutorials (01-01-2023)“…Over the last two decades, IEEE has been defining standards for Time-Sensitive Networking (TSN). These standards combine traffic shaping and scheduling…”
Get full text
Journal Article -
4
Convergence of a Distributed Kiefer-Wolfowitz Algorithm
Published in Stochastic systems (01-12-2021)“…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…”
Get full text
Journal Article -
5
An Architecture for In-Vehicle Networks
Published in IEEE transactions on vehicular technology (01-07-2021)“…As vehicles get equipped with increasingly complex sensors and processors, the communication requirements become more demanding. Traditionally, vehicles have…”
Get full text
Journal Article -
6
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
Published in 2008 46th Annual Allerton Conference on Communication, Control, and Computing (01-09-2008)“…In multi-hop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex…”
Get full text
Conference Proceeding -
7
Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits
Published in Advances in applied probability (01-06-2006)“…We consider the stability of the longest-queue-first scheduling policy (LQF), a natural and low-complexity scheduling policy, for a generalized switch model…”
Get full text
Journal Article -
8
Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions
Published in IEEE/ACM transactions on networking (01-06-2011)“…It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task…”
Get full text
Journal Article -
9
Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
Published in Journal of applied probability (01-06-2016)“…We consider the stability of robust scheduling policies for multiclass queueing networks. These are open networks with arbitrary routeing matrix and several…”
Get full text
Journal Article -
10
Robust scheduling for flexible processing networks
Published in Advances in applied probability (01-06-2017)“…Modern processing networks often consist of heterogeneous servers with widely varying capabilities, and process job flows with complex structure and…”
Get full text
Journal Article -
11
Internet QoS and Regulations
Published in IEEE/ACM transactions on networking (01-12-2010)“…This paper investigates Internet service provider (ISP) incentives with a single-service class and with two-service classes in the Internet. We consider…”
Get full text
Journal Article -
12
How Bad Are Selfish Investments in Network Security?
Published in IEEE/ACM transactions on networking (01-04-2011)“…We study a network security game where strategic players choose their investments in security. Since a player's investment can reduce the propagation of…”
Get full text
Journal Article -
13
-
14
-
15
Approximately optimal scheduling of an M/G/1 queue with heavy tails
Published in Queueing systems (01-07-2015)“…Distributions with a heavy tail are difficult to estimate. If the design of an optimal scheduling policy is sensitive to the details of heavy tail…”
Get full text
Journal Article -
16
Distributed Random Access Algorithm: Scheduling and Congestion Control
Published in IEEE transactions on information theory (01-12-2010)“…This paper provides proofs of the rate stability, Harris recurrence, and ε-optimality of carrier sense multiple access (CSMA) algorithms where the random…”
Get full text
Journal Article -
17
Human-in-the-Loop Mobile Networks: A Survey of Recent Advancements
Published in IEEE journal on selected areas in communications (01-04-2017)“…Recent developments of smart devices and mobile applications have significantly increased the level at which human users interact with mobile systems. As a…”
Get full text
Journal Article -
18
Fair end-to-end window-based congestion control
Published in IEEE/ACM transactions on networking (01-10-2000)“…In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packet-switched networks with first come-first…”
Get full text
Journal Article -
19
FLUID LIMITS TO ANALYZE LONG-TERM FLOW RATES OF A STOCHASTIC NETWORK WITH INGRESS DISCARDING
Published in The Annals of applied probability (01-08-2013)“…We study a simple rate control scheme for a multiclass queuing network for which customers are partitioned into distinct flows that are queued separately at…”
Get full text
Journal Article -
20
Parametric Prediction from Parametric Agents
Published in Operations research (01-03-2018)“…We consider a problem of prediction based on opinions elicited from heterogeneous rational agents with private information. Making an accurate prediction with…”
Get full text
Journal Article