scholarly journals Parameterized Verification of Track Topology Aggregation Protocols

2013 ◽  
pp. 35-49 ◽  
Author(s):  
Sergio Feo-Arenis ◽  
Bernd Westphal
Keyword(s):  
Parameterized Verification ◽  
Topology Aggregation

scholarly journals An Automatic Proving Approach to Parameterized Verification

2018 ◽  
Vol 19 (4) ◽  
pp. 1-25 ◽  
Author(s):  
Yongjian Li ◽  
Kaiqiang Duan ◽  
David N. Jansen ◽  
Jun Pang ◽  
Lijun Zhang ◽  
...  
Keyword(s):  
Parameterized Verification

Topology aggregation for combined additive and restrictive metrics

2006 ◽  
Vol 50 (17) ◽  
pp. 3284-3299 ◽  
Author(s):  
Daniel Bauer ◽  
John N. Daigle ◽  
Ilias Iliadis ◽  
Paolo Scotton
Keyword(s):  
Topology Aggregation

Topology-Information Periodic Updates in Multi-Domain ASON Networks with Topology Aggregation

2008 ◽  
Vol 27 (4) ◽  
pp. 265-277 ◽  
Author(s):  
Guido Maier ◽  
Chiara Busca ◽  
Achille Pattavina
Keyword(s):  
Topology Aggregation ◽  
Topology Information

scholarly journals Parameterized verification of algorithms for oblivious robots on a ring

2017 ◽  
Author(s):  
Arnaud Sangnier ◽  
Nathalie Sznajder ◽  
Maria Potop-Butucaru ◽  
Sebastien Tixeuil
Keyword(s):  
Parameterized Verification

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

2012 ◽  
Vol 155-156 ◽  
pp. 1025-1029 ◽  
Author(s):  
Jing Feng ◽  
Sheng Qian Ma ◽  
Man Hong Fan ◽  
Ke Ning Wang
Keyword(s):  
Network Topology ◽  
Dominating Set ◽  
Dominating Sets ◽  
Breadth First Search ◽  
Label Switching ◽  
Switching Path ◽  
Topology Aggregation ◽  
Multi Protocol Label Switching ◽  
Network Topologies ◽  
The Cost

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.

Sign in / Sign up

Export Citation Format

Share Document