✦ LIBER ✦

Network capacity allocation for traffic with time priorities

✍ Scribed by Xian Liu

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 99 KB
Volume: 13
Category: Article
ISSN: 1055-7148
DOI: 10.1002/nem.501

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The packet switching techniques are undergoing evolution. The conventional ‘best effort’ approach will no longer be the dominant service. The next generation of IP networks must provide QoS to customers. Inadequacy is obvious when the conventional capacity allocation (CA) models are applied to the new IP architecture. In this paper, we propose several CA models that characterize: (1) the service priority scheme; (2) the service preemption scheme; and (3) the non‐Poisson traffic in which the packets follow heavy tailed distributions. Copyright © 2003 John Wiley & Sons, Ltd.

📜 SIMILAR VOLUMES

Cognitive Engine with Dynamic Priority R

Cognitive Engine with Dynamic Priority Resource Allocation for Wireless Networks

✍ Ching-Huei Jiang; Ro-Min Weng 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 656 KB

Priority-based Dynamic Lightpath Allocat

Priority-based Dynamic Lightpath Allocation for Survivable WDM Networks

✍ Arunita Jaekel 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 183 KB

Hopfield neural-network-based dynamic re

Hopfield neural-network-based dynamic resource allocation scheme for non-real-time traffic in wireless networks

✍ José F. Monserrat; Daniel Calabuig; Lorenzo Rubio; Narcís Cardona 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 647 KB

## Abstract Dynamic resource allocation (DRA) plays a fundamental role in current and future wireless networks, including 3G systems. In this paper, a scheduling DRA scheme for non‐real‐time (NRT) packet services in wireless system is proposed based on the use of Hopfield neural networks (HNN). The

Throughput guarantees for multi-priority

Throughput guarantees for multi-priority traffic in ad hoc networks

✍ Yaling Yang; Robin Kravets 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 593 KB

In this paper, we present MPARC (Multi-Priority Admission and Rate Control), a novel joint admission control and rate policing protocol for multi-priority ad hoc networks. MPARC is based on our novel bandwidth allocation model, which captures the bandwidth allocation for saturated, unsaturated and s

A distributed laxity-based priority sche

A distributed laxity-based priority scheduling scheme for time-sensitive traffic in mobile ad hoc networks

✍ I. Karthigeyan; B.S. Manoj; C. Siva Ram Murthy 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Characteristics of Mobile Ad hoc Networks such as shared broadcast channel, bandwidth and battery power limitations, highly dynamic topology, and location dependent errors, make provisioning of quality of service (QoS) in such networks very difficult. The Medium Access Control (MAC) layer plays a ve

Traffic network equilibrium with capacit

Traffic network equilibrium with capacity constraints and generalized Wardrop equilibrium

✍ Yong He; Ju He; Daoli Zhu; Jing Zhou 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 248 KB

The traffic network equilibrium problem with capacity constraints is investigated with the help of generalized Lagrangian theory of variational inequality in our paper. It is proved to be equivalent to the generalized Wardrop equilibrium solution. This result is very useful in transportation analysi