A Model for Stream Overflows in Circuit-Switched Communication Networks

Ramesh BHANDARI

A Model for Stream Overflows in Circuit-Switched Communication Networks

Ramesh BHANDARI

Full Text Views

0

Cite this

Summary :

In the design and analysis of circuit-switched alternate-routing networks a fundamental and important problem is the decomposition of the overflow traffic from a given trunk-group (or link) into its component traffic streams. Decomposition is required because the individual streams corresponding to different sources of traffic can in principle be routed to different links depending upon the routing algorithms. Because the exact solution of this problem is intractable, several approximate methods have been given in the past. However, these approximate methods yield either incomplete solutions or solutions that are not tractable enough to be implementable in today's large networks. In this paper, we describe a model which provides a complete solution for the individual streams overflowing a group of trunks when this group of trunks is offered a number of independent traffic streams with varying peakedness values (peakedness=variance/mean, where mean and variance are the first two moments of a given traffic stream (or distribution); these moments adequately describe a given traffic distribution for teletraffic calculations). The derived formulas are simple and easily implementable in algorithms for the design of today's networks which can require large amounts of computation.

Publication: IEICE TRANSACTIONS on Communications Vol.E80-B No.2 pp.324-331

Publication Date: 1997/02/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Telecommunications Network Planning and Design)

Category: Network performance and traffic theory

Cite this

Copy

Ramesh BHANDARI, "A Model for Stream Overflows in Circuit-Switched Communication Networks" in IEICE TRANSACTIONS on Communications, vol. E80-B, no. 2, pp. 324-331, February 1997, doi: .
Abstract: In the design and analysis of circuit-switched alternate-routing networks a fundamental and important problem is the decomposition of the overflow traffic from a given trunk-group (or link) into its component traffic streams. Decomposition is required because the individual streams corresponding to different sources of traffic can in principle be routed to different links depending upon the routing algorithms. Because the exact solution of this problem is intractable, several approximate methods have been given in the past. However, these approximate methods yield either incomplete solutions or solutions that are not tractable enough to be implementable in today's large networks. In this paper, we describe a model which provides a complete solution for the individual streams overflowing a group of trunks when this group of trunks is offered a number of independent traffic streams with varying peakedness values (peakedness=variance/mean, where mean and variance are the first two moments of a given traffic stream (or distribution); these moments adequately describe a given traffic distribution for teletraffic calculations). The derived formulas are simple and easily implementable in algorithms for the design of today's networks which can require large amounts of computation.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e80-b_2_324/_p

Copy

@ARTICLE{e80-b_2_324,
author={Ramesh BHANDARI, },
journal={IEICE TRANSACTIONS on Communications},
title={A Model for Stream Overflows in Circuit-Switched Communication Networks},
year={1997},
volume={E80-B},
number={2},
pages={324-331},
abstract={In the design and analysis of circuit-switched alternate-routing networks a fundamental and important problem is the decomposition of the overflow traffic from a given trunk-group (or link) into its component traffic streams. Decomposition is required because the individual streams corresponding to different sources of traffic can in principle be routed to different links depending upon the routing algorithms. Because the exact solution of this problem is intractable, several approximate methods have been given in the past. However, these approximate methods yield either incomplete solutions or solutions that are not tractable enough to be implementable in today's large networks. In this paper, we describe a model which provides a complete solution for the individual streams overflowing a group of trunks when this group of trunks is offered a number of independent traffic streams with varying peakedness values (peakedness=variance/mean, where mean and variance are the first two moments of a given traffic stream (or distribution); these moments adequately describe a given traffic distribution for teletraffic calculations). The derived formulas are simple and easily implementable in algorithms for the design of today's networks which can require large amounts of computation.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - A Model for Stream Overflows in Circuit-Switched Communication Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 324
EP - 331
AU - Ramesh BHANDARI
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E80-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 1997
AB - In the design and analysis of circuit-switched alternate-routing networks a fundamental and important problem is the decomposition of the overflow traffic from a given trunk-group (or link) into its component traffic streams. Decomposition is required because the individual streams corresponding to different sources of traffic can in principle be routed to different links depending upon the routing algorithms. Because the exact solution of this problem is intractable, several approximate methods have been given in the past. However, these approximate methods yield either incomplete solutions or solutions that are not tractable enough to be implementable in today's large networks. In this paper, we describe a model which provides a complete solution for the individual streams overflowing a group of trunks when this group of trunks is offered a number of independent traffic streams with varying peakedness values (peakedness=variance/mean, where mean and variance are the first two moments of a given traffic stream (or distribution); these moments adequately describe a given traffic distribution for teletraffic calculations). The derived formulas are simple and easily implementable in algorithms for the design of today's networks which can require large amounts of computation.
ER -