On-line competitive algorithms for call admission in optical networks

Baxuch Awerbuch; Yossi Azar; Amos Fiat; Stefano Leonardi; Adi Rosén

doi:10.1007/3-540-61680-2_73

ScienceGate Book Chapters

BOOK-CHAPTER

On-line competitive algorithms for call admission in optical networks

Baxuch Awerbuch Yossi Azar Amos Fiat Stefano Leonardi Adi Rosén

Year: 1996 Lecture notes in computer science Pages: 431-444 Publisher: Springer Science+Business Media

DOI: 10.1007/3-540-61680-2_73

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Logarithm Network topology Competitive analysis Line (geometry) Algorithm Theoretical computer science Computer network Mathematics Upper and lower bounds

Metrics

Cited By

6.75

FWCI (Field Weighted Citation Impact)

Refs

0.98

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

Mobile Agent-Based Network Management

Physical Sciences → Computer Science → Computer Networks and Communications

Caching and Content Delivery

Physical Sciences → Computer Science → Computer Networks and Communications

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