✦ LIBER ✦

On-Line Competitive Algorithms for Call Admission in Optical Networks

✍ Scribed by B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi and A. Rosén

Book ID: 120137088
Publisher: Springer
Year: 2001
Tongue: English
Weight: 85 KB
Volume: 31
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-001-0039-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Call-Admission Control (CAC) Algorithm

A Call-Admission Control (CAC) Algorithm for Providing Guaranteed QoS in Cellular Networks

✍ Satya Kovvuri; Vijoy Pandey; Dipak Ghosal; Biswanath Mukherjee; Dilip Sarkar 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 164 KB

Simple On-Line Scheduling Algorithms for

Simple On-Line Scheduling Algorithms for All-Optical Broadcast-and-Select Networks

✍ Marsan, Marco Ajmone ;Bianco, Andrea ;Leonardi, Emilio ;Neri, Fabio ;Nucci, Anto 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 891 KB

Immune optimization algorithm for solvin

Immune optimization algorithm for solving joint call admission control problem in next-generation wireless network

✍ Zhu, Si-feng; Liu, Fang; Qi, Yu-tao; Chai, Zheng-yi; Wu, Jian-she 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 338 KB

Dynamic Preemption Call Admission Contro

Dynamic Preemption Call Admission Control Scheme Based on Markov Decision Process in Traffic Groomed Optical Networks

✍ Chuan-Ching Sue; Yuan-Bin Hsu; Pey-Jiuan Ho 📂 Article 📅 2011 🏛 The Optical Society 🌐 English ⚖ 754 KB

Dynamic call and connection admission co

Dynamic call and connection admission control in automatically switched optical network for grid computing applications

✍ Lei Liu; HongXiang Guo; XiaoBin Hong; Jian Wu; JinTong Lin 📂 Article 📅 2011 🏛 Science in China Press (SCP) 🌐 English ⚖ 726 KB

On-line algorithms for the channel assig

On-line algorithms for the channel assignment problem in cellular networks

✍ Pilu Crescenzi; Giorgio Gambosi; Paolo Penna 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 364 KB

We consider the on-line channel assignment problem in the case of cellular networks and we formalize this problem as an on-line load balancing problem for temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we chara