On-Line Competitive Algorithms for Call Admission in Optical Networks

Baruch Awerbuch; Yossi Azar; Amos Fiat; Stefano Leonardi; Alon Rosen

doi:10.1007/s00453-001-0039-1

ScienceGate Book Chapters

JOURNAL ARTICLE

On-Line Competitive Algorithms for Call Admission in Optical Networks

Baruch Awerbuch Yossi Azar Amos Fiat Stefano Leonardi Alon Rosen

Year: 2001 Journal: Algorithmica Vol: 31 (1)Pages: 29-43 Publisher: Springer Science+Business Media

DOI: 10.1007/s00453-001-0039-1

Get Full-Text PDF Get Analytical Report

Keywords:

Theory of computation Computer science Logarithm Network topology Competitive analysis Telecommunications network Line (geometry) Algorithm Computer network Mathematics Upper and lower bounds

Metrics

Cited By

2.63

FWCI (Field Weighted Citation Impact)

Refs

0.91

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Advanced Optical Network Technologies

Physical Sciences → Engineering → Electrical and Electronic Engineering

On-Line Competitive Algorithms for Call Admission in Optical Networks

Metrics

Citation History

Topics

Related Documents

On-line competitive algorithms for call admission in optical networks

Genetic algorithms and call admission to telecommunications networks

Randomized competitive algorithms for admission control in general networks

Simple On-Line Algorithms for Call Control in Cellular Networks

Competitive analysis of on-line randomized call control in cellular networks