In this paper we consider the design of semi-static inter-cell interference coordination schemes for LTE networks. In this approach, base stations coordinate the power settings per resource block over long time spans such as seconds. In order to optimize the power settings, one needs to employ models which predict the rate of terminals over the next coordination period under the usage of a give...

In this paper, we propose a design and implementation method for priority queuing mechanisms on FPGAs. First, we describe behavior of WFQ (weighted fair queuing) with several parameters in a model called concurrent periodic EFSMs. Then, we derive a parameter condition for the concurrent EFSMs to execute their transitions without deadlocks in the specified time period repeatedly under the specif...

In this paper, we suggested an algorithm to guarantee QoS (Quality of Service) and provide priority for users in 1xEV-DO systems. On forward link, a selected user is served in a TDM fashion with full base station power. The transmission rate depends on the forward link channel quality of each access terminal, which is reported by DRC channel. 1xEV-DO systems adopted an efficient scheduling algo...

The problem of allocating network resources to application sessions backlogged at an individual switch has a great impact on the end-to-end delay and throughput guarantees offered by the network. There exists a class of algorithms based on Weighted Fair Queueing (WFQ) for scheduling packets which are work-conserving and they guarantee fairness to the backlogged sessions. These algorithms also a...

We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the...

With the advent of the IEEE 802.11 wireless networks that provide high speed connectivity, demand for supporting multiple real-time traffic applications over wireless LANs has been increasing. A natural question is how to provide fair resource allocation to real-time traffic in wireless LANs. Wireless networks are subject to unpredictable location-dependent error bursts, which is different from...

In this paper, we present the first end-to-end fairness analysis of a network of fair servers. We argue that it is difficult to extend existing single-node fairness analysis to an end-to-end analysis of a network where each node may employ a different fair scheduling algorithm. We then present a two-step approach for end-to-end fairness analysis of heterogeneous networks. First, we define a cla...

Due to the availability of multiple sensing units on a single radio board of the modern sensor motes, some sensor networks need to handle heterogeneous traffic within the same application. This diverse traffic could have different priorities in terms of transmission rate, required bandwidth, packet loss, etc. Because of the multi-hop transmission characteristic of this prioritized heterogeneous...

The scheduling scheme of a switch affects the delay, throughput and fairness of a network and thus has a great impact on the quality of service (QoS). In Part I, we present a theoretical analysis of a burst scheduling for ATM switches and proved QoS guarantees on throughput and fairness of the applications. Here, we use simulation to demonstrate the superiority of the burst based weighted fair ...

ATM network performance hinges on user sessions, or virtual connections, adhering to the traac contracts established by the admission control policy. This paper considers eecient mechanisms for enforcing these contracts by shaping the incoming cell streams. While shaping eeectively accommodates variation in a connection's traac ow, this smoothing function introduces implementation complexity, s...