Research on MPLS Network Topology Aggregation Algorithm With The Effective Connected Dominating Sets

Using dominating set can aggregate the complex physical network topologies into simple virtual topologies and reduce the cost of the networks. In the Multi-Protocol Label Switching (MPLS) network, the dominating set constructed based on label router can effectively aggregate MPLS network topology and reduce the amount of Label Switching Path (LSP), so as to save the expenses of network maintain information. However, simply considering the size of dominating set can't guarantee the best performance of the networks after aggregating. Therefore, an improved algorithm based on breadth-first search spanning tree is proposed, considering the size of the dominating set, bandwidth performance of the nodes and path length between nodes, which can effectively extend the MPLS network, with excellent bandwidth performance and reduce the data transmission delay.

Download Full-text

Cost Effective Domination in the Join, Corona and Composition of Graphs

European Journal of Pure and Applied Mathematics ◽

10.29020/nybg.ejpam.v12i3.3443 ◽

2019 ◽

Vol 12 (3) ◽

pp. 978-998

Author(s):

Ferdinand P. Jamil ◽

Hearty Nuenay Maglanque

Keyword(s):

Connected Graph ◽

Dominating Set ◽

Domination Number ◽

Cost Effective ◽

Minimal Cost ◽

Dominating Sets ◽

Maximum Cardinality ◽

Minimum Cardinality ◽

The Cost ◽

Domination Numbers

Let $G$ be a connected graph. A cost effective dominating set in a graph $G$ is any set $S$ of vertices in $G$ satisfying the condition that each vertex in $S$ is adjacent to at least as many vertices outside $S$ as inside $S$ and every vertex outside $S$ is adjacent to at least one vertex in $S$. The minimum cardinality of a cost effective dominating set is the cost effective domination number of $G$. The maximum cardinality of a cost effective dominating set is the upper cost effective domination number of $G$. A cost effective dominating set is said to be minimal if it does not contain a proper subset which is itself a cost effective dominating in $G$. The maximum cardinality of a minimal cost effective dominating set in a graph $G$ is the minimal cost effective domination number of $G$.In this paper, we characterized the cost effective dominating sets in the join, corona and composition of graphs. As direct consequences, we the bounds or the exact cost effective domination numbers, minimal cost effective domination numbers and upper cost effective domination numbers of these graphs were obtained.

Download Full-text

ENHANCEMENT OF AUTONOMOUS SYSTEM FOR INTER PROVIDER SERVICE USING MULTI-PROTOCOL LABEL SWITCHING

i-manager’s Journal on Wireless Communication Networks ◽

10.26634/jwcn.6.2.13966 ◽

2017 ◽

Vol 6 (2) ◽

pp. 21

Author(s):

M. SWARNALATHA ◽

JAMES KOMALA ◽

◽

Keyword(s):

Autonomous System ◽

Label Switching ◽

Multi Protocol Label Switching

Download Full-text

A DIFFSERV-AWAREFORM OF MULTI-PROTOCOL LABEL SWITCHING TRAFFIC ENGINEERING OVER VIRTUAL PRIVATE NETWORKS

Menoufia Journal of Electronic Engineering Research ◽

10.21608/mjeer.2019.62724 ◽

2019 ◽

Vol 28 (1) ◽

pp. 61-84

Author(s):

Ayman Abdelaal ◽

Fathi Abdel-Samie ◽

Moawad Dessouki

Keyword(s):

Traffic Engineering ◽

Virtual Private Networks ◽

Label Switching ◽

Multi Protocol Label Switching

Download Full-text

An optimization Algorithm for the Same Primary and Backup Routing of Label Switching Path Based on KSP in PTN

2020 IEEE 5th International Symposium on Smart and Wireless Systems within the Conferences on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS-SWS) ◽

10.1109/idaacs-sws50031.2020.9297070 ◽

2020 ◽

Author(s):

Zaoning Wang ◽

Ming Wei ◽

Xing Li ◽

Chunzhi Wang

Keyword(s):

Optimization Algorithm ◽

Label Switching ◽

Switching Path

Download Full-text

Optimal Coordination of Over-Current Relays in Microgrids Using Unsupervised Learning Techniques

Applied Sciences ◽

10.3390/app11031241 ◽

2021 ◽

Vol 11 (3) ◽

pp. 1241

Author(s):

Sergio D. Saldarriaga-Zuluaga ◽

Jesús M. López-Lezama ◽

Nicolás Muñoz-Galeano

Keyword(s):

Unsupervised Learning ◽

Distributed Generation ◽

Network Topology ◽

International Electrotechnical Commission ◽

Number Of Clusters ◽

Learning Techniques ◽

Topology Changes ◽

Network Topologies ◽

Optimal Coordination ◽

Operational Modes

Microgrids constitute complex systems that integrate distributed generation (DG) and feature different operational modes. The optimal coordination of directional over-current relays (DOCRs) in microgrids is a challenging task, especially if topology changes are taken into account. This paper proposes an adaptive protection approach that takes advantage of multiple setting groups that are available in commercial DOCRs to account for network topology changes in microgrids. Because the number of possible topologies is greater than the available setting groups, unsupervised learning techniques are explored to classify network topologies into a number of clusters that is equal to the number of setting groups. Subsequently, optimal settings are calculated for every topology cluster. Every setting is saved in the DOCRs as a different setting group that would be activated when a corresponding topology takes place. Several tests are performed on a benchmark IEC (International Electrotechnical Commission) microgrid, evidencing the applicability of the proposed approach.

Download Full-text