Add to ORKGWe present the first online algorithm with a polylogarithmic competitive ratio for the problem of online routing of packets in unidirectional grids. The goal is to maximize the throughput, i.e., the number of delivered packets. Our online algorithm is deterministic, centralized, handles packets with deadlines, allows bounded buffers, uses adaptive routing, and may drop packets before they reach their destination. All previous online algorithms for packet routing on a unidirectional line with polylogarithmic com-petitive ratios are randomized [AZ05, AKK09, EM10]. Our algorithm is the first deterministic online algorithm with a polylogarithmic competitive ratio
We study situations in which an algorithm must make decisions about how to best route and schedule d...
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of ...
Abstract. We consider the task of transmitting structured information over bounded-capacity links. O...
We study online scheduling policies for buffer management models, in which packets are arriving over...
Combinatorial optimization is the discipline that studies problems in which one seeks to minimize or...
We study online multicommodity routing problems in networks, in which commodities have to be routed ...
We present the first polylog-competitive online algorithm for the general multicast problem in the t...
Abstract We study the problem of online packet routing and information gathering in lines, rings and...
We present the first polylog-competitive online algorithm for the general multicast admission contro...
AbstractThis paper presents online algorithms for routing and bandwidth allocation which simultaneou...
In this paper we present a deterministic protocol for routing arbitrary permutations in arbitrary ne...
We present the first polylog-competitive online algorithm for the general multicast admission contro...
The critical problem in creating practical online SIMD mesh routing algorithms is to minimize both t...
In this work, we study the problem of buffer management in network switches from an algorithmic pers...
Abstract. Given an arbitrary network, and a routing problem with congestion C and dilation D, a long...
We study situations in which an algorithm must make decisions about how to best route and schedule d...
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of ...
Abstract. We consider the task of transmitting structured information over bounded-capacity links. O...
We study online scheduling policies for buffer management models, in which packets are arriving over...
Combinatorial optimization is the discipline that studies problems in which one seeks to minimize or...
We study online multicommodity routing problems in networks, in which commodities have to be routed ...
We present the first polylog-competitive online algorithm for the general multicast problem in the t...
Abstract We study the problem of online packet routing and information gathering in lines, rings and...
We present the first polylog-competitive online algorithm for the general multicast admission contro...
AbstractThis paper presents online algorithms for routing and bandwidth allocation which simultaneou...
In this paper we present a deterministic protocol for routing arbitrary permutations in arbitrary ne...
We present the first polylog-competitive online algorithm for the general multicast admission contro...
The critical problem in creating practical online SIMD mesh routing algorithms is to minimize both t...
In this work, we study the problem of buffer management in network switches from an algorithmic pers...
Abstract. Given an arbitrary network, and a routing problem with congestion C and dilation D, a long...
We study situations in which an algorithm must make decisions about how to best route and schedule d...
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of ...
Abstract. We consider the task of transmitting structured information over bounded-capacity links. O...