A Synthesis of an Optimal File Transfer on a File Transmission Net

Yoshihiro KANEKO; Shoji SHINODA; Kazuo HORIUCHI

A Synthesis of an Optimal File Transfer on a File Transmission Net

Yoshihiro KANEKO, Shoji SHINODA, Kazuo HORIUCHI

Full Text Views

0

Share
Cite this

Summary :

A file transmission net N is a directed communication net with vertex set V and arc set B such that each arc e has positive cost c_a(e) and each vertex u in V has two parameters of positive cost c_v(u) and nonnegative integral demand d(u). Some information to be distributed through N is supposed to have been written in a file and the written file is denoted by J, where the file means an abstract concept of information carrier. In this paper, we define concepts of file transfer, positive demand vertex set U and mother vertex set M, and we consider a problem of distributing d(v) copies of J through a file transfer on N from a vertex v₁ to every vertex v in V. As a result, for N such that MU, we propose an O(nm+n² log n) algorithm, where n=|V| and m=|B|, for synthesizing a file transfer whose total cost of transmitting and making copies of J is minimum on N.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.3 pp.377-386

Publication Date: 1993/03/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on the 5th Karuizawa Workshop on Circuits and Systems)

Category

Cite this

Copy

Yoshihiro KANEKO, Shoji SHINODA, Kazuo HORIUCHI, "A Synthesis of an Optimal File Transfer on a File Transmission Net" in IEICE TRANSACTIONS on Fundamentals, vol. E76-A, no. 3, pp. 377-386, March 1993, doi: .
Abstract: A file transmission net N is a directed communication net with vertex set V and arc set B such that each arc e has positive cost c_a(e) and each vertex u in V has two parameters of positive cost c_v(u) and nonnegative integral demand d(u). Some information to be distributed through N is supposed to have been written in a file and the written file is denoted by J, where the file means an abstract concept of information carrier. In this paper, we define concepts of file transfer, positive demand vertex set U and mother vertex set M, and we consider a problem of distributing d(v) copies of J through a file transfer on N from a vertex v₁ to every vertex v in V. As a result, for N such that MU, we propose an O(nm+n² log n) algorithm, where n=|V| and m=|B|, for synthesizing a file transfer whose total cost of transmitting and making copies of J is minimum on N.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e76-a_3_377/_p

Copy

@ARTICLE{e76-a_3_377,
author={Yoshihiro KANEKO, Shoji SHINODA, Kazuo HORIUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Synthesis of an Optimal File Transfer on a File Transmission Net},
year={1993},
volume={E76-A},
number={3},
pages={377-386},
abstract={A file transmission net N is a directed communication net with vertex set V and arc set B such that each arc e has positive cost c_a(e) and each vertex u in V has two parameters of positive cost c_v(u) and nonnegative integral demand d(u). Some information to be distributed through N is supposed to have been written in a file and the written file is denoted by J, where the file means an abstract concept of information carrier. In this paper, we define concepts of file transfer, positive demand vertex set U and mother vertex set M, and we consider a problem of distributing d(v) copies of J through a file transfer on N from a vertex v₁ to every vertex v in V. As a result, for N such that MU, we propose an O(nm+n² log n) algorithm, where n=|V| and m=|B|, for synthesizing a file transfer whose total cost of transmitting and making copies of J is minimum on N.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - A Synthesis of an Optimal File Transfer on a File Transmission Net
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 377
EP - 386
AU - Yoshihiro KANEKO
AU - Shoji SHINODA
AU - Kazuo HORIUCHI
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1993
AB - A file transmission net N is a directed communication net with vertex set V and arc set B such that each arc e has positive cost c_a(e) and each vertex u in V has two parameters of positive cost c_v(u) and nonnegative integral demand d(u). Some information to be distributed through N is supposed to have been written in a file and the written file is denoted by J, where the file means an abstract concept of information carrier. In this paper, we define concepts of file transfer, positive demand vertex set U and mother vertex set M, and we consider a problem of distributing d(v) copies of J through a file transfer on N from a vertex v₁ to every vertex v in V. As a result, for N such that MU, we propose an O(nm+n² log n) algorithm, where n=|V| and m=|B|, for synthesizing a file transfer whose total cost of transmitting and making copies of J is minimum on N.
ER -