Fast dynamic algorithm for storage allocation in telecommunication networks

Yoshiaki Tanaka, Olivier Berlage

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

This paper studies a video storage problem that occurs in Video-on-Demand (VOD) networks and in other distributed database systems. Videos should be stored in order to respect various constraints, especially available storage and transmission capacities. We show there exists an algorithm to solve this combinatorial problem through a pricing mechanism and that it converges to a solution under some general conditions. Simulation results with up to 43-node networks and up to 300 videos show that the algorithm is fast.

Original languageEnglish
Pages (from-to)1025-1032
Number of pages8
JournalIEICE Transactions on Communications
VolumeE78-B
Issue number7
Publication statusPublished - 1995 Jul
Externally publishedYes

Fingerprint

Telecommunication networks
Distributed database systems
Video on demand
Costs

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Fast dynamic algorithm for storage allocation in telecommunication networks. / Tanaka, Yoshiaki; Berlage, Olivier.

In: IEICE Transactions on Communications, Vol. E78-B, No. 7, 07.1995, p. 1025-1032.

Research output: Contribution to journalArticle

@article{abc26ee1d41a4c50838fddf2ba832ad2,
title = "Fast dynamic algorithm for storage allocation in telecommunication networks",
abstract = "This paper studies a video storage problem that occurs in Video-on-Demand (VOD) networks and in other distributed database systems. Videos should be stored in order to respect various constraints, especially available storage and transmission capacities. We show there exists an algorithm to solve this combinatorial problem through a pricing mechanism and that it converges to a solution under some general conditions. Simulation results with up to 43-node networks and up to 300 videos show that the algorithm is fast.",
author = "Yoshiaki Tanaka and Olivier Berlage",
year = "1995",
month = "7",
language = "English",
volume = "E78-B",
pages = "1025--1032",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "7",

}

TY - JOUR

T1 - Fast dynamic algorithm for storage allocation in telecommunication networks

AU - Tanaka, Yoshiaki

AU - Berlage, Olivier

PY - 1995/7

Y1 - 1995/7

N2 - This paper studies a video storage problem that occurs in Video-on-Demand (VOD) networks and in other distributed database systems. Videos should be stored in order to respect various constraints, especially available storage and transmission capacities. We show there exists an algorithm to solve this combinatorial problem through a pricing mechanism and that it converges to a solution under some general conditions. Simulation results with up to 43-node networks and up to 300 videos show that the algorithm is fast.

AB - This paper studies a video storage problem that occurs in Video-on-Demand (VOD) networks and in other distributed database systems. Videos should be stored in order to respect various constraints, especially available storage and transmission capacities. We show there exists an algorithm to solve this combinatorial problem through a pricing mechanism and that it converges to a solution under some general conditions. Simulation results with up to 43-node networks and up to 300 videos show that the algorithm is fast.

UR - http://www.scopus.com/inward/record.url?scp=0029336040&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029336040&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0029336040

VL - E78-B

SP - 1025

EP - 1032

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 7

ER -