On the Edge Importance Using Its Traffic Based on a Distribution Function along Shortest Paths in a Network

Peng CHENG; Shigeru MASUYAMA

On the Edge Importance Using Its Traffic Based on a Distribution Function along Shortest Paths in a Network

Peng CHENG, Shigeru MASUYAMA

Full Text Views

0

Share
Cite this

Summary :

We model a road network as a directed graph G(V,E) with a source s and a sink t, where each edge e has a positive length l(e) and each vertex v has a distribution function α_v with respect to the traffic entering and leaving v. This paper proposes a polynomial time algorithm for evaluating the importance of each edge e E whicn is defined to be the traffic f(e) passing through e in order to assign the required traffic F_st(0) from s to t along only shortest s-t paths in accordance with the distribution function α_v at each vertex v.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E78-A No.3 pp.440-443

Publication Date: 1995/03/25

Publicized

Online ISSN

DOI

Type of Manuscript: LETTER

Category: Graphs, Networks and Matroids

Cite this

Copy

Peng CHENG, Shigeru MASUYAMA, "On the Edge Importance Using Its Traffic Based on a Distribution Function along Shortest Paths in a Network" in IEICE TRANSACTIONS on Fundamentals, vol. E78-A, no. 3, pp. 440-443, March 1995, doi: .
Abstract: We model a road network as a directed graph G(V,E) with a source s and a sink t, where each edge e has a positive length l(e) and each vertex v has a distribution function α_v with respect to the traffic entering and leaving v. This paper proposes a polynomial time algorithm for evaluating the importance of each edge e E whicn is defined to be the traffic f(e) passing through e in order to assign the required traffic F_st(0) from s to t along only shortest s-t paths in accordance with the distribution function α_v at each vertex v.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e78-a_3_440/_p

Copy

@ARTICLE{e78-a_3_440,
author={Peng CHENG, Shigeru MASUYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Edge Importance Using Its Traffic Based on a Distribution Function along Shortest Paths in a Network},
year={1995},
volume={E78-A},
number={3},
pages={440-443},
abstract={We model a road network as a directed graph G(V,E) with a source s and a sink t, where each edge e has a positive length l(e) and each vertex v has a distribution function α_v with respect to the traffic entering and leaving v. This paper proposes a polynomial time algorithm for evaluating the importance of each edge e E whicn is defined to be the traffic f(e) passing through e in order to assign the required traffic F_st(0) from s to t along only shortest s-t paths in accordance with the distribution function α_v at each vertex v.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - On the Edge Importance Using Its Traffic Based on a Distribution Function along Shortest Paths in a Network
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 440
EP - 443
AU - Peng CHENG
AU - Shigeru MASUYAMA
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E78-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1995
AB - We model a road network as a directed graph G(V,E) with a source s and a sink t, where each edge e has a positive length l(e) and each vertex v has a distribution function α_v with respect to the traffic entering and leaving v. This paper proposes a polynomial time algorithm for evaluating the importance of each edge e E whicn is defined to be the traffic f(e) passing through e in order to assign the required traffic F_st(0) from s to t along only shortest s-t paths in accordance with the distribution function α_v at each vertex v.
ER -