Call preemption in communication networks

Garay, Juan A.; Gopal, I.

doi:10.1109/infcom.1992.263457

Cited by 96 publications

(66 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The competitive ratio of this algorithm is O(log n), where n is the number of nodes in the network. The first competitive algorithm in the throughput model was given in [10] for the case of a single-link network and extended in [9] for a line network. A competitive algorithm for general topology networks in the throughput model was presented in [4].…”

Section: Unicast Routingmentioning

confidence: 99%

An online throughput-competitive algorithm for multicast routing and admission control

Goel¹,

Henzinger

Plotkin³

2005

Journal of Algorithms

View full text Add to dashboard Cite

We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of requests accepted by the optimum offline algorithm to the expected number of requests accepted by our algorithm is O((log n + log log M)(log n + log M) log n), where M is the number of multicast groups and n is the number of nodes in the graph. We show that this is close to optimum by presenting an Ω(log n log M) lower bound on this ratio for any randomized online algorithm against an oblivious adversary, when M is much larger than the link capacities. Our lower bound applies even in the restricted case where the link capacities are much larger than bandwidth requested by a single multicast. We also present a simple proof showing that it is impossible to be competitive against an adaptive online adversary. As in the previous online routing algorithms, our algorithm uses edge-costs when deciding on which is the best path to use. In contrast to the previous competitive algorithms in the throughput model, our cost is not a direct function of the edge load. The new cost definition allows us to decouple the effects of routing and admission decisions of different multicast groups.

show abstract

Section: Unicast Routingmentioning

confidence: 99%

An online throughput-competitive algorithm for multicast routing and admission control

Goel¹,

Henzinger

Plotkin³

2005

Journal of Algorithms

View full text Add to dashboard Cite

show abstract

“…Authors in [8] also demonstrated that, for the connection admission problems, if the holding time of the request is unknown when the request arrives, it is impossible to find a c-competitive algorithm if throughput is considered as the performance function. In this paper, we assume that the holding time of the request (the duration of each request) becomes known when the request arrives at the system.…”

Section: Online Problem and Competitivenessmentioning

confidence: 99%

“…Since the connection requests arrive one by one over time, it manifests the typical on-line feature [6,7], i.e., the system has to make the acceptance/rejection decision at the arrival time of the request without the advanced knowledge of the future requests. To achieve higher bandwidth utilization and/or lower blocking rate of the system, the preemptive feature [8,9,10] is deployed as to provide more "valuable" connections at the expense of less profitable ones already in services, when the total bandwidth requested exceeds the system capacity so that not all requests can be served at the same time. When and how to reject/preempt connections, and simultaneously guarantee the throughput performance, are more challenging in the on-line problem domain as there is no contribution to the throughput performance if the request is rejected/preempted.…”

Section: Introductionmentioning

confidence: 99%

Throughput Competitiveness of WCDMA Channel Assignment

Cherng

Shueh

Chen

2003

Personal Wireless Communications

View full text Add to dashboard Cite

Abstract. Efficient and effective resource utilization is important in the bandwidth allocation of the communication network, especially when the resources are scarce such as the radio channels in the wireless links. Channel assignment in Wideband CDMA transmission schemes, i.e., the bandwidth allocation in the 3G wireless links, can be transformed into the Orthogonal Variable Spreading Factor code assignment to the connection requests. The code assignment problem presents a typical on-line feature that the decision to accept/reject the request has to be made at the arrival time of the request without the knowledge of future requests. An algorithm for an on-line problem is considered competitive if its performance is within some constant fraction of the performance of any other algorithm for the same input sequences. The study in deriving a competitive algorithm is valuable as it guarantees a lower bound of the system performance in all circumstances. This paper presents an online competitive algorithm called Left Right Aggressive (LRA) for the OVSF code assignment problem in the wireless links regarding system throughput as the performance indicator. With preemption allowed, the proposed algorithm achieves the constant competitive ratio of 2/(1-2β), where β is the fraction of the maximum requested bandwidth to the system capacity. The simulation results demonstrate that it is promising to achieve better throughput performance and lower preemption ratio in request patterns of Poisson distribution.

show abstract

“…The goal of the online algorithm is to choose a path that will be used for transmitting each file, and to decide on the transmission rate. The main difference between this model and the (well-studied) models for online routing and admission control [1,3,15,16] is that here we do not assume that the sources have prespecified transmission rate requirements, i.e., we can deal with nonstreaming types of information. We will study the idealized case where the transmission delays are all zero, and data cannot be buffered along its route.…”

Section: Introductionmentioning

confidence: 99%

Scheduling data transfers in a network and the set scheduling problem

Goel

Henzinger

Plotkin

et al. 2003

Journal of Algorithms

View full text Add to dashboard Cite

In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and maxstretch within a constant factor of optimum.

show abstract

Call preemption in communication networks

Cited by 96 publications

References 6 publications

An online throughput-competitive algorithm for multicast routing and admission control

An online throughput-competitive algorithm for multicast routing and admission control

Throughput Competitiveness of WCDMA Channel Assignment

Scheduling data transfers in a network and the set scheduling problem

Contact Info

Product

Resources

About