Network Design for Simultaneous Traffic Flow Requirements

Yiu Kwok THAM

Network Design for Simultaneous Traffic Flow Requirements

Yiu Kwok THAM

Full Text Views

0

Share
Cite this

Summary :

We consider the problem of designing a physically diverse network that can support any two simultaneous node-to-node traffic flow requirements as called for by special events such as communication link failures or surges in network traffic. The design objective is to obtain a network with the minimum level of network capacity, yet robust enough to handle any two simultaneous traffic flow requirements between any nodes. To arrive at the minimum necessary network capacity,we introduce the concept of nodal requirement. Based on nodal requirements, we can build what may be called uniform protection subnetworks for equal nodal requirements. Successive uniform protection subnetworks can be built for incremental nodal requirements. This direct approach supersedes the extant work on building fully connected networks or loops from maximum spanning trees that can cope with only one traffic flow requirement. Our nodal requirements approach generalizes well to multiple simultaneous traffic flow requirements. Hub subnetworks are introduced to provide protection for networks with a unique node that has the largest nodal requirement. Further, a heuristic is considered and analyzed that assigns edge capacities of the protection network directly based on the largest two traffic flow requirements incident on the end nodes of an edge. The heuristic is attractive in being simple to implement.

Publication: IEICE TRANSACTIONS on Communications Vol.E80-B No.6 pp.930-938

Publication Date: 1997/06/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: Communication Networks and Services

Cite this

Copy

Yiu Kwok THAM, "Network Design for Simultaneous Traffic Flow Requirements" in IEICE TRANSACTIONS on Communications, vol. E80-B, no. 6, pp. 930-938, June 1997, doi: .
Abstract: We consider the problem of designing a physically diverse network that can support any two simultaneous node-to-node traffic flow requirements as called for by special events such as communication link failures or surges in network traffic. The design objective is to obtain a network with the minimum level of network capacity, yet robust enough to handle any two simultaneous traffic flow requirements between any nodes. To arrive at the minimum necessary network capacity,we introduce the concept of nodal requirement. Based on nodal requirements, we can build what may be called uniform protection subnetworks for equal nodal requirements. Successive uniform protection subnetworks can be built for incremental nodal requirements. This direct approach supersedes the extant work on building fully connected networks or loops from maximum spanning trees that can cope with only one traffic flow requirement. Our nodal requirements approach generalizes well to multiple simultaneous traffic flow requirements. Hub subnetworks are introduced to provide protection for networks with a unique node that has the largest nodal requirement. Further, a heuristic is considered and analyzed that assigns edge capacities of the protection network directly based on the largest two traffic flow requirements incident on the end nodes of an edge. The heuristic is attractive in being simple to implement.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e80-b_6_930/_p

Copy

@ARTICLE{e80-b_6_930,
author={Yiu Kwok THAM, },
journal={IEICE TRANSACTIONS on Communications},
title={Network Design for Simultaneous Traffic Flow Requirements},
year={1997},
volume={E80-B},
number={6},
pages={930-938},
abstract={We consider the problem of designing a physically diverse network that can support any two simultaneous node-to-node traffic flow requirements as called for by special events such as communication link failures or surges in network traffic. The design objective is to obtain a network with the minimum level of network capacity, yet robust enough to handle any two simultaneous traffic flow requirements between any nodes. To arrive at the minimum necessary network capacity,we introduce the concept of nodal requirement. Based on nodal requirements, we can build what may be called uniform protection subnetworks for equal nodal requirements. Successive uniform protection subnetworks can be built for incremental nodal requirements. This direct approach supersedes the extant work on building fully connected networks or loops from maximum spanning trees that can cope with only one traffic flow requirement. Our nodal requirements approach generalizes well to multiple simultaneous traffic flow requirements. Hub subnetworks are introduced to provide protection for networks with a unique node that has the largest nodal requirement. Further, a heuristic is considered and analyzed that assigns edge capacities of the protection network directly based on the largest two traffic flow requirements incident on the end nodes of an edge. The heuristic is attractive in being simple to implement.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - Network Design for Simultaneous Traffic Flow Requirements
T2 - IEICE TRANSACTIONS on Communications
SP - 930
EP - 938
AU - Yiu Kwok THAM
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E80-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 1997
AB - We consider the problem of designing a physically diverse network that can support any two simultaneous node-to-node traffic flow requirements as called for by special events such as communication link failures or surges in network traffic. The design objective is to obtain a network with the minimum level of network capacity, yet robust enough to handle any two simultaneous traffic flow requirements between any nodes. To arrive at the minimum necessary network capacity,we introduce the concept of nodal requirement. Based on nodal requirements, we can build what may be called uniform protection subnetworks for equal nodal requirements. Successive uniform protection subnetworks can be built for incremental nodal requirements. This direct approach supersedes the extant work on building fully connected networks or loops from maximum spanning trees that can cope with only one traffic flow requirement. Our nodal requirements approach generalizes well to multiple simultaneous traffic flow requirements. Hub subnetworks are introduced to provide protection for networks with a unique node that has the largest nodal requirement. Further, a heuristic is considered and analyzed that assigns edge capacities of the protection network directly based on the largest two traffic flow requirements incident on the end nodes of an edge. The heuristic is attractive in being simple to implement.
ER -