2010•Journal of Optical Communications and NetworkingRequires access

Telecom Mesh Network Upgrade to Manage Traffic Growth

Rajesh Roy, Avishek Nag, Biswanath Mukherjee

Open publisher page 10 citations

Abstract

Telecom mesh networks require periodic upgrades to support increasing traffic. Such upgrades, which are referred to as network engineering (NE), determine the additional network resources that must be provided to meet the network performance while minimizing the incremental network cost. To facilitate such network growth, considering dynamic routing, attention should be directed toward critical cut sets rather than individual links. Our analysis in this paper shows how capacity exhaustion of critical cut sets indicates urgency of the need for upgrading a mesh network. To handle traffic growth, we also introduce a new parameter called the network-cut exhaustion probability. This parameter is efficient and appropriate to assist incremental growth of the existing network as well as new network design. Finally, we provide an algorithm to calculate the urgency and the pointers to specific locations that require upgrade under desired performance constraints.

About this research paper

What this paper is about

Telecom mesh networks require periodic upgrades to support increasing traffic. Such upgrades, which are referred to as network engineering (NE), determine the additional network resources that must be provided to meet the network performance while minimizing the incremental network cost. To facilitate such network growth, considering dynamic routing, attention should be directed toward critical cut sets rather than individual links. Our analysis in this paper shows how capacity exhaustion of critical cut sets indicates urgency of the need for upgrading a mesh network. To handle traffic growth, we also introduce a new parameter called the network-cut exhaustion probability. This parameter is efficient and appropriate to assist incremental growth of the existing network as well as new network design. Finally, we provide an algorithm to calculate the urgency and the pointers to specific locations that require upgrade under desired performance constraints.

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Telecom mesh networks require periodic upgrades to support increasing traffic. Such upgrades, which are referred to as network engineering (NE), determine the additional network resources that must be provided to meet the network performance while minimizing the incremental network cost. To facilitate such network growth, considering dynamic routing, attention should be directed toward critical cut sets rather than individual links. Our analysis in this paper shows how capacity exhaustion of critical cut sets indicates urgency of the need for upgrading a mesh network. To handle traffic growth, we also introduce a new parameter called the network-cut exhaustion probability. This parameter is efficient and appropriate to assist incremental growth of the existing network as well as new network design. Finally, we provide an algorithm to calculate the urgency and the pointers to specific locations that require upgrade under desired performance constraints.

Key concepts: Upgrade, Computer science, Computer network, Network management, Network traffic control, Networking hardware, Network planning and design, Network management station

Related papers

Back to paper searchBrowse research topicsOriginal source
Telecom Mesh Network Upgrade to Manage Traffic Growth — Research Paper | ScholarLens