Searching for authors named "Leandros Tassiulas" – sorted by Relevance.
47 documents found, showing 1 through 10.
Next 10 →
-
Scheduling for Quality of Service based Service Differentiation
- …Service differentiation is a major feature of modern networks. The quality of service received by a user depends on his requirement, the revenue he generates and also the congestion of the network. It is imperative that a service differentiation scheme be associated with a notion of fairness. The un…
- Add To MetaCart
-
Dynamic Scheduling for Minimum Delay in Tandem and Parallel Constrained Queueing Models
- …this paper. The servers are dependent in the sense that they can not provide service all of them simultaneously. A collection of sets of servers is prespecified and the set of servers that provide service at each time instant is constrained to belong to that collection. We call these queueing system…
- Add To MetaCart
-
Fair Allocation of Utilities in Multirate Multicast Networks
- …We study fairness in a multicast network. We assume that different receivers of the same session can receive information at di erent rates. We study fair allocation of utilities, where utility of a bandwidth is an arbitrary function of the bandwidth. The utility function is not strictly increasing, …
- Cited by 13 (5 self) – Add To MetaCart
-
Improving the Capacity in Wireless Networks Through Integrated Channel Base Station and Power Assignment
- …The limited availability of radio frequency spectrum will require the future wireless systems to use more efficient and sophisticated resource allocation methods to increase network capacity. In this work we propose a Joint Resource Allocation Algorithm (JRAA) that makes the channel base station and…
- Cited by 3 (0 self) – Add To MetaCart
-
MNCM a new class of efficient scheduling algorithms for input-buffered switches with no speedup
- …In this paper, we use fluid model techniques to establish some new results for the throughput of input-buffered switches. In particular, we introduce a new class of deterministic maximal size matching algorithms that achieves 100% throughput. Dai and Prabhakar [3] has shown that any maximal size mat…
- Cited by 4 (0 self) – Add To MetaCart
-
Adaptive Resource Allocation in SDMA-based Wireless Broadband Networks with OFDM Signaling
- …The increasing popularity of wireless broadband access in local and wide area networks is the main expression of the need for flexible and ubiquitous wireless connectivity. In order to satisfy user resource requirements in the presence of volatility of the wireless medium, sophisticated multiple acc…
- Cited by 3 (0 self) – Add To MetaCart
-
Any Work-conserving Policy Stabilizes the Ring with Spatial Reuse
- …We consider the ring network with spatial reuse. Traffic streams may enter and exit the network at any node. We adopt an arrival traffic model with deterministic constraints on its sample paths, which conforms to the output traffic of a leaky bucket rate control mechanism. A transmission policy spec…
- Cited by 24 (2 self) – Add To MetaCart
-
Maxmin Fair Scheduling in Wireless Networks
- …We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in …
- Cited by 52 (2 self) – Add To MetaCart
-
Pricing and Peering Strategies of Differentiated Services Content Networks
- …Web sites disseminate some of their information to surrogate caches in order to reduce the latency observed during the delivery of the information. The surrogates classify publishers under several classes with respect to their willingness-to-pay. Surrogate partitions the total cache capacity among d…
- Add To MetaCart
-
On Optimal Cooperative Route Caching in Large, Memory-Limited Wireless Ad Hoc Networks
- …Caching is a popular mechanism for enhancing performance in various layers and applications of computer networking. We introduce both a model and algorithms for caching routing information in large, memory-limited wireless ad hoc networks. Each host can cache only a small fraction of the network and…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
