Scientific Research

An Academic Publisher

**Design and Simulation of a Topology Aggregation Algorithm in Multi-Domain Optical Networks** ()

Share and Cite:

*Communications and Network*,

**9**, 235-248. doi: 10.4236/cn.2017.94017.

1. Introduction

The scale of optical networks is rapidly expanding with the development of internet technology. It will be difficult to manage the increasing burden and overhead of networks if all the nodes are located at one domain [1] . Large-scale networks are generally made up of different operators’ networks. Considering network management and security, the internal topology information of networks is usually invisible [2] . A network system is often divided into different domains, providing a tendency of multi-domain optical network for optical transmission [3] .

An important motivation of this study is to provide a better scalability for the rapid expansion of current internet users. Topology aggregation is one of the impetuses to solve the problems in scalability and security of large-scale multi-domain optical networks [4] . The basic principle is to aggregate topology information of single domain and to inform other domains, effectively hiding confidential information while reducing the information exchanged among domains [5] . The aggregated virtual topology is a concise description of nodes and links of the physical topology. At present, typical aggregation models include: virtual node aggregation, total topology aggregation, full mesh aggregation, star aggregation, spanning tree aggregation, hybrid aggregation, etc. [6] . The existing topology aggregation algorithms mainly include: single point substitution algorithm (SP), stretching factor algorithm, linear segment fitting algorithm(LS), polynomial fitting algorithm, cubic spline curve fitting algorithm, aggregation algorithm based on polymerization coefficient, aggregation algorithm based on weighted dominating set and so on [7] . While the above algorithms target at a better balance between the aggregation and accuracy, the error in accuracy is still considerable and greatly affects the accuracy of routing selection. Therefore, it’s necessary to improve the balance between the aggregation and accuracy. The novelty of the new proposed algorithm is to measure the aggregation accuracy with the distortion area, which makes the measurement of topology aggregation more accurate. It’s different from using the success rate of routing algorithm to measure the performance of topology aggregation algorithm, because the routing algorithm can influence the aggregation accuracy of topology aggregation algorithm to some extent.

2. ML-S Algorithm

2.1. Stair Generation Algorithm

This algorithm is capable to provide detailed description of topology information. To describe a link $l\left(u,v\right)$ of a domain, a pair of QoS values $\left({d}_{l},{w}_{l}\right)$ are used, in which ${d}_{l}$ and ${w}_{l}$ represent the delay and bandwidth of the link, respectively. The demand of delay and bandwidth for an arbitrary service request is represented by $r\left({r}_{d},{r}_{w}\right)$ . When ${r}_{d}\ge {d}_{l}$ , ${r}_{w}\le {w}_{l}$ , the link can provide services for the request.

If there are N optional paths between nodes a and b, $p=\left\{p1,p2,\cdots ,PN\right\}$ represents all physical paths between them. Each path is denoted by a pair of parameters ( ${d}_{pi}$ , ${w}_{pi}$ ), and the weight of the path is defined by:

$\{\begin{array}{l}{w}_{pi}={\mathrm{min}}_{\left(u,v\right)\in pi}{w}_{\left(u,v\right)}\\ {d}_{pi}={\displaystyle {\sum}_{\left(u,v\right)\in pi}{d}_{\left(u,v\right)}}\end{array}$ (1)

Figure 1 shows a simple network physical topology. In the basic process of stair generation algorithm, nodes a and b are selected to maintain, and all links and nodes between them are aggregated into virtual topology.

To analyze, the first step is to find all the physical paths between a and b as shown in Table 1, and then abstract them into a logical path with weights. The first physical path is optimal if the bandwidth is the only factor under consideration. While the sixth physical path is the best if the delay is concerned. By the same token, the QoS values of any physical paths cannot fully represent the routing information between node a and b, when bandwidth and delay are both counted. In other words, it’s impossible to find the optimal path under both conditions.

In Figure 2, the bandwidth is plotted over the delay, and the topology information is represented by a set of inflection points forming a stair shape.

What determine the shape of the stair are not all the paths, but the path {p6, p2, p3, p5, p1}. Thus they are defined as the stair representation points. In the

Figure 1. Sketch of physical and virtual topologies.

Figure 2. Original stair figure [8] .

Table 1. All paths between nodes a and b.

coordinate plane, the lower right of the stair is defined as an acceptable service request area (ASA) and the upper left is defined as an unaccepted service request area (UASA).

The original stair can accurately reflect the real information of network topology, but the redundancy is not acceptable. Further fitting on its basis is required [9] . Inevitably, the compression of topology information will impair the descriptive accuracy of network resource, i.e. topology distortion. There are two kinds of topology distortion, one is the rejection of connection requests when service is available (Error Rejected Area, ERA), also known as underestimation distortion; another is blind acceptance of connection requests when service is not accessible (Crank Back Area, CBA), namely overestimation distortion [10] . The underestimation distortion often results in a waste of the available resources of the network, and overestimation distortion misleads the service requests into an area without the physical path meeting its QoS requirements.

As the two important indexes of the aggregation algorithm used to describe the accuracy of original network topology information, Error Rejected Ratio (ERR) and Crank Back Ratio (CBR) can reflect the influence of underestimation and overestimation distortions on network performance better. The calculation formulas are:

$\text{ERR}=\frac{\text{Number}\text{\hspace{0.17em}}\text{of}\text{\hspace{0.17em}}\text{feasible}\text{\hspace{0.17em}}\text{requests}\text{\hspace{0.17em}}\text{rejected}}{\text{Number}\text{\hspace{0.17em}}\text{of}\text{\hspace{0.17em}}\text{overall}\text{\hspace{0.17em}}\text{feasible}\text{\hspace{0.17em}}\text{requests}}$ (2)

$\text{CBR}=\frac{\text{Number}\text{\hspace{0.17em}}\text{of}\text{\hspace{0.17em}}\text{unfeasible}\text{\hspace{0.17em}}\text{requests}\text{\hspace{0.17em}}\text{accepted}}{\text{Number}\text{\hspace{0.17em}}\text{of}\text{\hspace{0.17em}}\text{requests}\text{\hspace{0.17em}}\text{accepted}}$ (3)

The two indicators, ERR and CBR, constituting the description accuracy of the network, combine the aggregation degree, and the balance between the aggregation degree and description accuracy. They are the focus of this study [11] .

2.2. Stair Fitting Algorithm

As a part of the ML-S algorithm, stair fitting algorithm has advantages of fixed redundancy and low complexity. It can be applied to the network with uncomplicated topological structure. Schematic diagram of stair fitting algorithm is showed in Figure 3. Stair fitting algorithm generates a new even stair to approximate original stair. ${p}_{down}\left({D}_{\mathrm{min}},{W}_{\mathrm{min}}\right)$ and ${p}_{up}\left({D}_{\mathrm{max}},{W}_{\mathrm{max}}\right)$ represent the highest and lowest points of the original stair, and ${f}_{L}$ denotes the equation of the fitting segment L. ${f}_{L}^{-1}$ is its inversion function.

The basic procedures of stair fitting algorithm are:

Step 1: Use least square method to generate a line segment L, and use the two endpoints ${p}_{down}^{L}\left({D}_{\mathrm{min}}^{L},{W}_{\mathrm{min}}^{L}\right)$ and ${p}_{up}^{L}\left({D}_{\mathrm{max}}^{L},{W}_{\mathrm{max}}^{L}\right)$ to represent it. ${W}_{\mathrm{min}}^{L}={f}_{L}\left({D}_{\mathrm{min}}\right)$ ; ${D}_{\mathrm{min}}^{L}={D}_{\mathrm{min}}$ ; ${D}_{\mathrm{max}}^{L}={f}_{L}^{-1}\left({W}_{\mathrm{max}}\right)$ ; ${W}_{\mathrm{max}}^{L}={W}_{\mathrm{max}}$ .

Step 2: Define a new parameter ${\delta}_{L}=\left({D}_{\mathrm{max}}^{L}-{D}_{\mathrm{min}}^{L}\right)/\left(n-1\right)$ to represent the length of each step of the new stair, n is the number of representation points on the original stair.

Step 3: The delay of the new fitted stair is as follows:

${D}_{1}^{L}={D}_{\mathrm{min}}^{L}$

${D}_{2}^{L}={D}_{\mathrm{min}}^{L}+\left(2-1\right){\delta}^{L}$

${D}_{n}^{L}={D}_{\mathrm{min}}^{L}+\left(n-1\right){\delta}^{L}={D}_{\mathrm{max}}^{L}$

Step 4: The corresponding bandwidth value of each delay is calculated by ${W}_{i}^{L}={f}_{L}\left({D}_{i}^{L}\right)$ .

A new fitted stair is calculated accordingly and its redundancy is fixed. It can be represented by the five parameters ( ${D}_{\mathrm{min}}$ , ${D}_{\mathrm{max}}$ , ${W}_{\mathrm{min}}$ , ${W}_{\mathrm{max}}$ , $n$ ).

2.3. Multiline Fitting Algorithm

Multiline fitting algorithm is an improvement of the least squares fitting algorithm. Due to the fixed redundancy of the least squares fitting algorithm, there is only one line segment. However, the algorithm can induce a considerable topology distortion for complex network topology structures. The main reason of the distortion is the inhomogeneity and mutability of the stair. To this end, multiline fitting algorithm is proposed in Figure 4.

Figure 3. Schematic diagram of stair fitting algorithm [12] .

Figure 4. Schematic diagram of multiline fitting algorithm [13] .

Compared with the least square fitting algorithm, the number of fitting line segment is greater than or equal to 1. The change in quantity is determined by the inflection points, which regulate the shape of the stair greatly and are defined as the mutation points. Because the determination of mutation points decides the fitting accuracy, the key of this fitting algorithm lies in the selection of mutation points (Equation (4)):

$\underset{j=1}{\overset{n}{\sum}}{\left({w}_{v}-{w}_{j}\right)}^{2}}\le \text{thesetvalue}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\left(2\le i\le n\right)$ (4)

For each inflection point, the true bandwidth of delay ${d}_{j}$ is ${w}_{j}$ . ${w}_{v}$ is the fitted bandwidth for delay ${d}_{j}$ . The fitted bandwidth based on mutation point i is decided by the least squares fitting algorithm at both ends of the point. Equation (4) shows the variance of the real stair and the fitting curve. The variance is inversely proportional to the fitting. If the variance is less than the set value, the fitting effect is preferable and satisfies the conditions, with i becoming a mutation point. Otherwise, i is an ordinary inflection point. Equation (5) is the fitting line segment of both ends of the mutation point.

$\{\begin{array}{l}{w}_{i1}={k}_{1}{d}_{j}+{b}_{1}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\left(\forall {d}_{j}\in \left\{{d}_{1},{d}_{2},\cdots ,{d}_{i-1}\right\}\right)\\ {w}_{i2}={k}_{2}{d}_{j}+{b}_{2}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}\left(\forall {d}_{j}\in \left\{{d}_{i},{d}_{i+1},\cdots ,{d}_{n}\right\}\right)\end{array}$ (5)

The basic procedure of multiline fitting algorithm:

Step 1: Define variable i, set its initial value to 1, which is the number of mutation points.

Step 2: Use Equation (4) to determine the ith point of the stair. If no mutation point is found, go to Step 7.

Step 3: Use the least squares fitting algorithm to generate a line segment between the first inflection point of the unfitted stair and the previous inflection point of the mutation point. The point at each end of the line segment is (a_{i}, b_{i}) and (c_{i}, d_{i}), respectively.

Step 4: The shape of the original stair remains unchanged between the fitting line’s end point and the mutation point.

Step 5: Plus the value of i by 1, $i=i+1$ .

Step 6: Calculate the next mutation point of the stair by Equation (4). If the mutation point could not be found, utilize the least squares fitting algorithm to generate a line segment between the last mutation point and the last inflection point of the stair. The point at each end of the line segment is (a, b) and (c, d), respectively. Algorithm ends. Otherwise, go to Step 3.

Step 7: Use the least squares fitting algorithm to generate a line segment between the first inflection point and the last inflection point of the stair. The point at each end of the line segment is (a_{0}, b_{0}) and (c_{0}, d_{0}), respectively. Algorithm ends.

Flow chart of multiline fitting algorithm is shown in Figure 5.

Figure 5. Flow chart of multiline fitting algorithm.

The initial redundancy of multiline fitting algorithm is two points, which increase with the number of mutation points. Adding a mutation point will lead to one more fitting line and subsequently increase the redundancy by two points.

2.4. ML-S Algorithm

The redundancy of the stair fitting algorithm is fixed and its complexity is low, thereby suitable for the network with simple topology structure. However, the redundancy of multiline fitting algorithm is positively correlated with the number of mutation points, making it applicable to the network with complex topology structure. Combining the characteristics of both algorithms, we design an algorithm―ML-S―aiming at the elegant balance of aggregation degree and accuracy. The entire network topology is composed of several parts, with appropriate aggregation algorithm for each part. For parts with fewer mutation points, the multiline fitting algorithm with high accuracy is adopted. Because of the small number of mutation points, the redundancy is low. On the contrary, stair fitting algorithm can provide a better balance of aggregation degree and accuracy.

The basic procedure of ML-S algorithm:

Step 1: Use the stair generation algorithm to produce the stair map of the original topology.

Step 2: Use Equation (4) to calculate the number of mutation points (m) in the original topology. The network topology is divided into N parts according to the number of inflection points, N = roundup (m/10). And there are n inflection points per part, n = m/N.

Step 3: Define a variable i with an initial value 1, representing part i of the topology.

Step 4: Calculate the number of mutation points (k) in part i of the topology. If k < n/4, go to Step 5; Otherwise, go to Step 6.

Step 5: Use the stair fitting algorithm to fit the original stair in part i and add 1 to i, $i=i+1$ . When $i\le N$ , go to Step 4; otherwise, end algorithm.

Step 6: Use the multiline fitting algorithm to fit the original stair in part i and add 1 to i, $i=i+1$ . When $i\le N$ , go to Step 4; otherwise, end algorithm.

Flow chart of ML-S algorithm is shown in Figure 6.

2.5. Complexity Analysis

Complexity includes time complexity and space complexity, space complexity refers to redundancy on performance indicators, so here's an analysis of the time complexity. In order to make quantitative analysis and easier to understand, it is necessary to redescribe the network model used in this paper.

The entire network is composed of many domains, $N\left(G,{L}_{d}\right)$ represents the entire network. G is the set of all domains, $G=\left\{{g}_{i}|{g}_{i}=\left({V}_{i},{E}_{i},{B}_{i}\right),1\le i\le \left|G\right|\right\}$ shows that the network is divided into $\left|G\right|$ domains. ${V}_{i}$ , ${E}_{i}$ and ${B}_{i}$ represent nodes set, links set, and boundary nodes set respectively in domain

Figure 6. Flow chart of ML-S algorithm.

${g}_{i}$ . $\left|{V}_{i}\right|$ , $\left|{E}_{i}\right|$ and $\left|{B}_{i}\right|$ represent the number of nodes, links and boundary nodes respectively in domain ${g}_{i}$ . The number of mutation points is $\left|{M}_{i}\right|$ in domain ${g}_{i}$ . The number of mutation points is $\left|{m}_{j}\right|$ in part j of domain ${g}_{i}$ .

The time complexity of the four aggregation algorithms depends mainly on the calculation times of least squares algorithm. least squares algorithm’s time complexity is $O\left(\left|E\right|\right)$ ; Because stair fitting algorithm only calculate least squares algorithm once, stair fitting algorithm’s time complexity is also $O\left(\left|E\right|\right)$ ; Analogously, multiline fitting algorithm’s time complexity is $O\left(\left|M\right|\left|E\right|\right)$ ; ML-S algorithm’s time complexity is $O\left(a\left|m\right|\left|E\right|+b\left|E\right|\right)$ , a and b represent calculation times of multiline fitting algorithm and stair fitting algorithm respectively.

3. Simulation

3.1. Experimental Scheme 1

The simulation of the experimental Scheme 1 is carried out in the fixed network topology. The selected topologies are five nodes network topology (5 nodes, 8 links), NFSNET network topology (14 nodes, 21 links), and EON network topology (19 nodes, 38 links).

The simulation parameters of network model are set as follows: the bandwidth of each physical link is randomly generated between [1, 20] units, each unit can represent a certain number of Mbps; the delay of each physical link is randomly generated between [5, 20] units, each unit can represent a certain number of ms; randomly select 10% - 20% nodes of each domain to be boundary nodes and generate random links to connect all the boundary nodes; 500 random requests were randomly generated between the designated boundary nodes of the network topology. In order to guarantee that the distortion area is fully measured, random requests need to satisfy Equation (6):

$R=\left\{\left({R}_{D},{R}_{W}\right)|{d}_{\mathrm{min}}\le {R}_{D}\le {d}_{\mathrm{max}}\cap {w}_{\mathrm{min}}\le {R}_{W}\le {w}_{\mathrm{max}}\right\}$ (6)

Under the same conditions of network resource allocation, the algorithm performance indexes of the least squares algorithm, stair fitting algorithm, multiline fitting algorithm, and ML-S algorithm are compared (ERR, CBR, ERR + CBR, Redundancy).

The following conclusions can be drawn from the data in Figure 7: In the fixed topology, ML-S algorithm on the three performance indicators (CBR, ERR, and CBR + ERR) is superior to least squares algorithm and stair fitting algorithm, mainly because it takes into account the inhomogeneity and mutability of the stair, and selects some significant mutation points to achieve more accurate description of the topology. ML-S is close to the multiline fitting algorithm with optimal distortion performance, the main reason is multiline fitting algorithm is a vital part of ML-S algorithm and ML-S algorithm takes full advantage of great

Figure 7. Performance comparison of the least squares algorithm, stair fitting algorithm, multiline fitting algorithm, and ML-S algorithm.

distortion performance of multiline fitting algorithm; Because of stair fitting algorithm helps to suppress the redundancy of ML-S algorithm, ML-S algorithm is far better than multiline fitting algorithm in redundancy. Compared with the least squares algorithm and stair fitting method, ML-S algorithm obtains a significant improvement on the description of topology information with less redundancy, though redundancy rate is relatively increased. In terms of the balance between aggregation degree and accuracy, ML-S algorithm is significantly better than other algorithms, making a good balance between two aspects.

3.2. Experimental Scheme 2

The simulation of the experiment Scheme 2 is carried out in the random network topology. Using Waxman model to generate network topology randomly, the model is close to the real network and is widely used in simulation of various network routing algorithms. The generation rules of network model are as follows: All nodes of each domain are randomly distributed within a specified area, and each node is determined by randomly generated coordinates. The probability $p\left(u,v\right)$ of direct link between two nodes is:

$p\left(u,v\right)=\beta \mathrm{exp}\frac{-d\left(u,v\right)}{L\alpha}$ (7)

$d\left(u,v\right)$ represents the distance between node u and v; L represents the maximum distance between the two nodes in the model; $\alpha $ and $\beta $ are parameters within the range (0, 1). $\alpha $ represents the ratio of the number of longer links to shorter links, Increasing $\alpha $ will increase the number of long links, while the number of shorter links will decrease correspondingly. $\beta $ represents the link density in the topology, $\beta $ guarantees the uniformity of link distribution.

To simulate the experiment, 50 Waxman topologies were randomly generated each time. The number of nodes in the domain were selected as {10, 20, 30, 40, 50, 60, 70, 80, 90, 100} in turn. Firstly, measure 50 ERR and CBR values of 50 Waxman topologies have 10 nodes in the domain and calculate the average value of the 50 ERR and CBR values as final experimental data. In the same way, to get other ERR and CBR values of Waxman topologies have different nodes in the domain from 20 nodes to 100 nodes. Between the designated boundary nodes of the network topology, 500 random requests were randomly generated. In order to ensure distortion area is fully measured, the random requests need to satisfy Equation (6).

Under the same network resource allocation conditions, the algorithm performance indexes of the least squares algorithm, stair fitting algorithm, multiline fitting algorithm and ML-S algorithm are compared (ERR, CBR, ERR+CBR, Redundancy).

In order to verify the stability of ML-S algorithm, we designed the comparison experiment 2, the following conclusions can be drawn from the data in Figure 8: In the random topology, ML-S algorithm on the three performance indicators

Figure 8. Performance comparison of the least squares algorithm, stair fitting algorithm, multiline fitting algorithm, and ML-S algorithm.

(CBR, ERR, and CBR + ERR) is superior to least squares algorithm and stair fitting algorithm, mainly because the redundancy of ML-S algorithm is not fixed but the redundancy of least squares algorithm and stair fitting algorithm is fixed, ML-S improves the accuracy of network topology description by adding redundancy properly. ML-S is close to the multiline fitting algorithm with optimal distortion performance and the index tends to be stable with the number of nodes in the domain increases, the main reason is ML-S algorithm dynamically chooses algorithm that is more accurate and less redundant. For parts with fewer mutation points, the multiline fitting algorithm with high accuracy is adopted. On the contrary, stair fitting algorithm is adopted; Because of the smaller number of mutation points, ML-S algorithm is far better than the multiline fitting algorithm in redundancy and the index tends to be stable with the increase of the node number in the domain. The ML-S algorithm has reduced CBR and ERR approximately to half compared with the least squares algorithm and the stair fitting algorithm, greatly improving access success rate for feasible requests. ML-S algorithm not only reduces the waste of network resources, but also improves the overall performance of the network.

4. Conclusion

The proposed ML-S algorithm has better balance of aggregation degree and accuracy. Based on the stair generation algorithm, stair fitting algorithm, and multiline fitting algorithm, the ML-S algorithm improves the accuracy of network topology description by adding redundancy properly according to the specific topology information of each domain. The ML-S algorithm also dynamically chooses algorithm that is more accurate and less redundant. Compared with other algorithms in both fixed topology and random topology, the simulation results show that the ML-S algorithm has a stable and decent aggregation performance and achieves a better balance between the aggregation degree and accuracy. On overall distortion performance indicators, ML-S algorithm can reduce nearly 60% compared with least squares algorithm and stair fitting algorithm. On redundancy, ML-S algorithm can reduce nearly 50% compared with multiline fitting algorithm. Moreover, the proposed algorithm should be further studied in the following aspects. Firstly, dynamic updating mechanism of topology might be considered in the process of topology aggregation. Secondly, the topology aggregation algorithm with multi-parameter combination should be designed in addition to delay and bandwidth.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] |
Zhao, J.P. and Wang, C.J. (2017) Topology Optimization for Minimizing the Maximum Dynamic Response in the Time Domain Using Aggregation Functional Method. Computers and Structures, 190, 41-60.
https://doi.org/10.1016/j.compstruc.2017.05.002 |

[2] |
Quan, B.S., Li, H. and Le, Z.C. (2014) A Topology Aggregation Scheme in Multi-Domain WDM-TDM Networks. Advanced Materials Research, 926-930, 2919-2923. https://doi.org/10.4028/www.scientific.net/AMR.926-930.2919 |

[3] | Nakata, Y., Shin’ichi, A. and Masayuki, M. (2015) Analyzing the Evolution and the Future of the Internet Topology Focusing on Flow Hierarchy. Journal of Computer Networks and Communications, 2015, Article ID: 736870, 18 p. |

[4] | Das, S. and Sahni, S. (2017) Two-Aggregator Topology Optimization Using Multiple Paths in Data Center Networks. IEEE Transactions on Cloud Computing, 99, 1. |

[5] |
Krätschmer, V., Schied, A. and Zähle, H. (2017) Domains of Weak Continuity of Statistical Functionals with a View toward Robust Statistics. Journal of Multivariate Analysis, 158, 1-19. https://doi.org/10.1016/j.jmva.2017.02.005 |

[6] |
Gao, C.Y., Cankaya, H.C. and Jue, J.P. (2014) Survivable Inter-Domain Routing Based on Topology Aggregation With Intra-Domain Disjointness Information in Multi-Domain Optical Networks. Journal of Optical Communications and Networking, 6, 619-628. https://doi.org/10.1364/JOCN.6.000619 |

[7] |
Costa, L.R., Ramos, G.N. and Drummond, A.C. (2016) Leveraging Adaptive Modulation with Multi-Hop Routing in Elastic Optical Networks. Computer Networks, 105, 124-137. https://doi.org/10.1016/j.comnet.2016.05.025 |

[8] |
Tang, Y., Chen, S.G. (2004) QoS Information Approximation for Aggregated Networks. IEEE International Conference on Communications, Paris, 20-24 June 2004, Vol. 4, 2107-2111. https://doi.org/10.1109/ICC.2004.1312890 |

[9] |
Zuffo, M., Doria, F., Botti, S., Bergamaschi, G. and Freccero, M. (2017) G-Quadruplex Fluorescence Sensing by Core-Extended Naphthalene Diimides. Biochimica et Biophysica Acta, 1861, 1303-1311.
https://doi.org/10.1016/j.bbagen.2016.11.034 |

[10] |
Feng, J., Ma, S.-Q., Fan, M.-H. and Wang, K.-N. Research on MPLS Network Topology Aggregation Algorithm With the Effective Connected Dominating Sets. Applied Mechanics and Materials, 155-156, 1025-1029.
https://doi.org/10.4028/www.scientific.net/AMM.155-156.1025 |

[11] |
Hong, S.J. and Jue, J.P. Effective Virtual Optical Network Embedding Based on Topology Aggregation in Multi-Domain Optical Networks. Optical Fiber Communication Conference, San Francisco, California, 9-13 March 2014.
https://doi.org/10.1364/OFC.2014.M3H.3 |

[12] |
Zhang, J.J., Han, Y.B. and Wang, L.G. Topology Aggregation Methods Based on Fitting Staircase. International Conference on Computer and Electrical Engineering, Phuket, 20-22 December 2008, 344-348. https://doi.org/10.1109/ICCEE.2008.105 |

[13] | Cai, M.M., Tang, L.R. and Wu, R.Z. (2011) A Novel Topology Aggregation Algorithm in Multi-QoS Restricted Multi-Domain Optical Networks. 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing, Wuhan, 23-25 September 2011. |

Copyright © 2020 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.