On application of least-delay variation problem in ethernet networks using SDN concept

INFORMATION AND COMMUNICATION TECHNOLOGIES AND SERVICES VOLUME: 14 |NUMBER: 4 |2016 |SPECIAL ISSUE On Application of Least-delay Variation Problem in Ethernet Networks Using SDN Concept Tomas HEGR, Milos KOZAK, Leos BOHAC Department of Telecommunications, Faculty of Electrical Engineering, Czech Technical University in Prague, Technicka 2, 106 27 Prague, Czech Republic [email protected], milos.k[email protected], b[email protected] DOI: 10.15598/aeee.v14i4.1807 Abstract. The goal of this paper is to present an application idea of SDN in Smart Grids, particularly, in the area of L2 multicast as defined by IEC 61850-9-2. Authors propose an Integer Linear Formulation (ILP) dealing with a Least-Delay-Variation multicast forwarding problem that has a potential to utilize Ethernet networks in a new way. The proposed ILP formulation is numerically evaluated on random graph topologies and results are compared to a shortest path tree approach that is traditionally a product of Spanning Tree Protocols. Results confirm the correctness of the ILP formulation and illustrate dependency of a solution quality on the selected graph models, especially, in a case of scale-free topologies. Keywords Ethernet, IEC 61850, multicast, smart grids, steiner problem. 1. Introduction The applicability of the ISO/IEC/IEEE 8802-3 Ethernet in mission-critical environments like Smart Grids (SG) has been immensely studied for one decade already. For the popularity, manageability, and low cost of Ethernet in data networks the industrial systems become more Ethernet orientated. Published works in power engineering shown the use of Ethernet, marked out by the IEC 61850, for a real-time control with strict limits of transmission delays [1]. Additionally, network components have to support many distinct protocols or technologies to run real-time applications on the Ethernet reliably. Typically, these protocols seek to prevent loops, increase network resilience, propagate forwarding information, or to optimize traffic flows to reach desired Quality of Service (QoS) in the network. Although these tasks are already solved, the complexity of such systems requires highly specialized personnel, and troubleshooting is difficult. Currently, many network problems and challenges are intensively researched using a concept of SoftwareDefined Networking (SDN). The SDN concept has a potential to fulfill SG demands and to simplify overall network management. SDN is still subject of research, and it spreads into many forms depending on the researcher’s or vendor’s perspective. Regardless of the used means, from our point of view, the SDN presents a tool that allows implementing advanced control algorithms increasing an automation of processes and introducing new services in data networks. The level of automation is even more strengthened by mechanisms contained in the IEC 61850 standard as describes Molina et al. in [2]. One of the potential SDN applications is a multicast distribution of sampled values in the form of a constant data stream from non-conventional transformers as described in IEC 61850-9-2LE [19]. Although the problem of L2 multicast forwarding in Ethernet networks is tackled by Multiple MAC Registration Protocol [3], it still relies on an underlying spanning tree that is rigid. This approach using spanning tree underutilizes network resources. In contrast, SDN allows implementing an arbitrarily calculated multicast tree in the network giving the possibility to optimize traffic flow according to relevant requirements. Therefore, authors propose an ILP formulation minimizing the variation of propagation delay along branches of a multicast tree for studied network topologies. The ILP formulation was specifically designed for a Least-Delay-Variation Steiner problem. The motivation is to find such a network configuration that ensures delivery of generated packets to multicast subscribers most likely at the same time. This approach has a c 2016 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 397 INFORMATION AND COMMUNICATION TECHNOLOGIES AND SERVICES VOLUME: 14 |NUMBER: 4 |2016 |SPECIAL ISSUE direct implication in power engineering, e.g. multisynchrophasor SAS in island operation during a blackout and reconnecting phase. The goal of this work is to investigate an impact of different random graph topologies on qualitative parameters of computed multicast trees. The paper is structured as follows. In Section 2. , we discuss related published works. Section 3. details network model and closes up proposed ILP formulations. Section 4. presents achieved results, and we conclude our paper with a summary in Section 5. 2. Related Work The network control in SG based on SDN is promising and supported by recent publications. The main research topics are focused on how SDN can help to increase SG resilience, meaning both data network and power grids, for example in [4]. The crucial problem of ISO/IEC/IEEE 8802-3 Ethernet-based networks is their non-deterministic nature, but critical services run on them; therefore, researchers have focused on delivering required level of QoS to application flows [5]. Dorsch et al. introduced and evaluated algorithms for fast rerouting of cases when critical flows are placed in a regular network [6]. The objective of finding a multicast tree as a subgraph which takes into account only a subset of nodes is defined as Steiner problem. The Steiner problem is a very well studied NP-complete problem regarding proposed algorithms. Authors of heuristics often consider different objectives and constraints when optimizing a multicast forwarding problem such as path delay, total cost of the tree or maximal congestion. The vast majority of algorithms is source-specific focusing on minimization of tree cost with at least one constraint. Almost all basic heuristics use or come out from Minimum-Spanning Tree (MST) [7]. Historically, two kinds of problems related to the delay variation were studied: Delayand Delay VariationBounded Multicast Tree (DVBMT) and (DVBST). The latter additionally considers tree cost for an objective in optimization formulation [15]. Rouskas and Baldine defined the DVBMT in [9], where they proved the DVMA to be NP-complete [9]. Authors proposed Delay Variation Multicast Algorithm (DVMA) that has a series of successors improving time complexity. These are Core Based Tree algorithms presented in [10], or metaheuristics for example Genetic Algorithm published in [11] or an approach using Simulated Annealing proposed in [12]. The DVBST problem became a main topic of various algorithms [13], [14] and [15]. Currently, authors focus on more complex variations of the multicast forwarding problem considering multiple objectives with multiple constraints. Published algorithms address the increasing level of the problem complexity by combined metaheuristics. Recently, Xu and Qu presented in [16] an extensive survey of metaheuristics together with a proposal of multiobjective simulated annealing based genetic local search algorithm that represent the combined approach. Concurrently, the multicast forwarding problem is drifting from the traditional network layers up to the application layer, since the trend of overlay networks and applications not relying on lower layers is more apparent than ever as published in [17] by Lin et al. In the context of methods used in this paper, Park et al. published an ILP formulation of a multi-QoS DVBST variant used for multicast routing in sparse-splitting optical networks [18]. Authors claim the ILP is widely used to solve multicast routing optimization problems in optical networks. 3. Mathematical Formulation A multicast publisher generates a stream of sampled values defined by IEC 61850-9-2LE [19], forming a constant flow, to the group of L2 multicast subscribers. For the purpose of modeling, the algorithm anticipates a static set of subscribers. The static set of subscribers is assumed as well in [19]. In contrast to some papers, network nodes which are subscribers can forward the traffic to further nodes. The following text describes a network model that is used later in ILP formulations. To compare qualitative parameters on various graphs and setups, we propose ILP formulations for the Least-Delay-Variation (LDV) problem and ILP formulation of an agnostic approach based on Shortest Path Tree (SPT). The delay and delay-variation constraints are not considered in any of the following mathematical formulations. 3.1. Network Model Let’s consider directed connected graph G= (V, L) where Vis a set of network nodes and Lis a set of network links. The set of nodes Vrepresents interconnecting nodes, e.g., Ethernet switches. The publisher and subscribers are connected to these nodes. The multicast tree T(vp, S)is a sub-graph of G compounded of a multicast source node (publisher) vp∈V, and multicast destination nodes (subscribers) S⊆V\{vp}where the set S∪ {vp}is called multicast group. The set Sand the publisher node vpare interconnected by links through a subset of Steiner tree nodes M⊂Vwhich form a part of T(vp, S). All links are bidirectional, each directed link `= (u, v), ` ∈Lgoing from u∈Vto v∈Vhas a c 2016 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 398 INFORMATION AND COMMUNICATION TECHNOLOGIES AND SERVICES VOLUME: 14 |NUMBER: 4 |2016 |SPECIAL ISSUE counterpart `0= (v, u)in the opposite direction from v∈Vto u∈V. Each node v∈Vis incident to a set of ingress links ω+(v)and egress links ω−(v). A real nonnegative value is assigned to every link `∈Lin form of a link delay d`→R+. The link delay function d`is a measure of link propagation delay. The function is naturally symmetrical, therefore d`=d`0, ` ∈L, `0∈L. Let PT(vp, s), s ∈Sbe a set of links `∈Lon a path from node vpto node sin the tree T(vp, S)and M(vp, s)⊂Vis a set of Steiner nodes along this particular path. The total end-to-end transmission delay DT(PT(vp, s)) is then a sum of all link delays along the path as given in expression Eq. (1). DT(vp, s) = X `∈PT(vp,s) d`.(1) The delay-variation δTof the multicast tree T(vp, S) is defined as a maximum difference among end-to-end delays along paths of all node pairs in vp×Sas is described by expression Eq. (2). δT(vp, S) = max{|DT(vp, u)−DT(P(vp, v))||∀u, v ∈S}(2) 1) SPT-Based Formulation At first, we define an ILP formulation producing SPT with a root node in the multicast publisher vp. The objective is to minimize total tree size, as defined by expression Eq. (3), where y`∈ {0,1}with y`= 1 if a traffic from vpto vs∈Sis forwarded on link `. min X l∈L yl.(3) This formulation uses flow constraints approach Eq. (4). Each flow, from the publisher to a subscriber, is a set of node pairs PS ={{vp, vs}|vs∈S}, and these sets of node pairs are used for calculation of the objective function. A flow at link `from node vpto destination vs∈Sis denoted as ϕps `and this variable can take a value of forwarded bandwidth b, i.e., ϕps `is defined in positive domain Eq. (8). X `∈ω+(v) ϕps `−X `∈ω−(v) ϕps `=     bif v=vp −bif v=vs 0otherwise , v∈V, vs∈S. (4) The rest of the ILP formulation in Eq. (5) and Eq. (6) and Eq. (7) ensures that the found solution will be a tree aggregating all flows through the binary vector y`. ϕps `≤y`(p, s)∈ PS, ` ∈L, (5) y`< ϕps `+ 1 (p, s)∈ PS, ` ∈L, (6) X `∈ω+(v) y`≤1v∈V, (7) ϕps `≥0 (p, s)∈ PS, ` ∈L. (8) 2) Least-Delay-Variation Formulation The objective of the Least-Delay-Variation multicast forwarding problem is to minimize variation of total propagation delay along all paths in T(vp, S), as expressed in Eq. (9). min(δT(vp, S)) = min(δTmax −δTmin )(9) The ILP fomulation of LDV multicast forwarding is based on the SPT-formulation, but this algorithm is extended by a set of constrains detailed in this sections. The expression Eq. (10) tightens δT(vp, S)for all pairs in PS using link delays defined in vector d`. In order to map propagation delays to links selected in a solution process, we use in formulations Eq. (11) and Eq. (12) an additional conversion vector xps `, defined in Eq. (13), with xps `= 1 if a flow is forwarded at link `from node vpto vs∈S. δTmin ≤X `∈L d`xps `≤δTmax (p, s)∈ PS,(10) ϕps `≤xps ``∈L, (p, s)∈ PS,(11) xps `< ϕps `+ 1 `∈L, (p, s)∈ PS,(12) xps `∈ {0,1}(p, s)∈ PS, ` ∈L. (13) The modification of the objective function from Eq. (3) to Eq. (9) may cause the emergence of loops in a final solution. Therefore, we introduce auxiliary constraints that help to avoid stand-alone loops in the solution. The primary constraint Eq. (18) assures that all links assigned to a particular flow ϕps `iare virtually labeled in non-decreasing order in vector ops `. The constraints are limited only to a set of neighboring pairs of ingress/egress links IO ={{`i, `o}|`i∈ω+(v), `o∈ω−(v), v ∈V}. The constrains Eq. (14), Eq. (15) and Eq. (16) express that `iand `oare ingress and egress links along a specific flow (p, s)∈ PS. Typically, this information can be obtained by logical operation AND for these decision variables. However, operation AND is non-linear operation; therefore, we applied a standard linearization approach. To accomplish this side step, we have used an auxiliary variable aps, defined in Eq. (17), that bonds similarly to xps `links with an assigned flow and the order c 2016 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 399 INFORMATION AND COMMUNICATION TECHNOLOGIES AND SERVICES VOLUME: 14 |NUMBER: 4 |2016 |SPECIAL ISSUE constraint. ϕps `i−b≥aps i`i∈ω+(v), v ∈V, (p, s)∈ PS,(14) ϕps `o−b≥aps o`o∈ω−(v), v ∈V, (p, s)∈ PS,(15) aps i+aps o−1≤aps io (i, o)∈ IO,(p, s)∈ PS,(16) aps io ∈ {0,1}(i, o)∈ IO,(p, s)∈ PS,(17) ops `i−ops `o≥aps io (i, o)∈ IO, `i∈ω+(v) `o∈ω−(v), v ∈V, (p, s)∈ PS.(18) 4. Evaluation The variation of packet propagation delay is impacted by various network parameters such as network topology and its parameters. Four different random models were chosen with respect to a sufficient variability of evaluated instances. Random graph topologies were obtained using Erdos-Renyi [21], Watts and Strogatz as a small-world model [22], Barabasi-Albert [23] and a planar Dorogovtsev-Mendes [24] model as scalefree representatives. Graphs and their main robustness characteristics are listed in Tab. 1. Each graph model was randomly generated 10 times with similar parameters and for each instance was generated 9 multicast groups with uniformly placed subscribers in a range from 10 % to 90 % of graph nodes. A propagation delay was randomly assigned to each link in a range from 5 to 500 ns. This propagation delay is approximately proportional to a delay on an Ethernet segments with length from 1 to 100 m. The multicast publisher was randomly placed in a graph center. Due to the exponential time complexity of the ILP, the network size was limited. Depending on the network model and link density, we were able to numerically evaluate, in a reasonable time, instances with sizes in a range from 10 to 20 nodes. 4.1. Numerical Results In order to show benefits of suggested algorithm, we implemented agnostic based Shortest-Path Tree (SPT) and objective-aware called Least-Delay Variation (LDV) algorithms. Formulations proposed in Section 3. were implemented in OPL language and evaluated using CPLEX Optimizer. Implemented algorithms were run on 21600 instances in total. The following algorithm outputs on these instances are statistically evaluated and compared. Results of the LDV algorithm give the best possible solution for a given network and multicast group. The resultant configuration can be proactively deployed into an SDN-enabled network and with proper QoS settings it leads in long-term to the desired LDV multicast tree. On the other hand, the SPT approach can be seen as the best approximation of an arbitrary SpanningTree Protocol. The difference in solutions provided by algorithms is shown in Fig. 1. 10 20 30 40 50 60 70 80 90 Multicast group size [%] 0 200 400 600 800 1000 1200 1400 1600 1800 Delay variation [ns] SPT, Barabasi-Albert SPT, Dorogovtsev-Mendes SPT, Erdos-Renyi SPT, Watts-Strogatz LDV, Barabasi-Albert LDV, Dorogovtsev-Mendes LDV, Erdos-Renyi LDV, Watts-Strogatz Fig. 2: Effect of multicast group size on the mean value of least delay variations at graph size n= 20. At first, we analyze an effect of the multicast group size on the achieved delay variation that is depicted in Fig. 2. LDV delivers better results than the SPT approach. That can be seen in the lower delay variation for LDV and is mainly due to the character of graph models. The Watts-Strogatz network has highest diameter and lowest nodal connectivity thus it produces solutions with long paths. Simply, there is not enough of alternative paths in the topology. On the other hand, the Barabasi-Albert model shows much better results, since the model generates a lot of links and the LDV can find alternative paths. Remaining two topologies show delay-variation differences somewhere in the middle, proving that the number of links in a graph is a major factor in this setup. The impact of multicast group size is evident. The higher penetration of subscribers, the greater the delay variation. The growth is slowing down with an amount of subscribers, as the number of free links is decreasing. The second case, where we investigate the effect of the multicast group size on a mean path delay DT(vp, u), u ∈S, is rather opposite in its progress. The chart in Fig. 3 shows an unusual drop in the path delay for instances with low penetration of subscribers at graph models with the power-law distribution of node degrees (Barabasi-Albert, Dorogovtsev-Mendes). The path delay is decreasing significantly at LDV in contrast to the SPT approach. The LDV uses more links, particularly in the beginning when the link variability is higher; therefore, it produces paths with higher propagation delays. As the network topologies are always finite, the number of links in the solution is limited as well, and paths cannot grow to infinite lengths. Due to the uniformly placed multicast subscribers, SPT fluctuates almost at constant levels in all graph instances. c 2016 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 400 INFORMATION AND COMMUNICATION TECHNOLOGIES AND SERVICES VOLUME: 14 |NUMBER: 4 |2016 |SPECIAL ISSUE Tab. 1: Graph models used for evaluation purposes. All values are means of 10 generated graph instances. The probability of link selection in Erdos-Renyi is 7 %. Each node in Watts-Strogatz is connected to 3 nearest neighbors in a ring topology and each link is rewired with the probability of 30 %. Each new node in Barabasi-Albert is attached by 3 links to existing nodes. Graph characteristics presented in the table describes fundamental properties. Refer to [20] for a detailed explanation. Graph model |V| |L| Average nodal degree Diameter Link Connectivity Link Density Links Per Node Nodal Connectivity BarabasiAlbert 10 42.00 8.40 ±3.11 2.60 ±0.52 2.20 0.47 4.20 2.20 15 72.00 9.60 ±4.51 3.00 ±0.38 2.10 0.34 4.80 2.10 20 102.00 10.20 ±5.48 3.10 ±0.32 2.10 0.27 5.10 2.10 DorogovtsevMendes 10 34.00 6.80 ±3.67 2.80 ±0.63 2.00 0.38 3.40 2.00 15 54.00 7.20 ±3.96 3.80 ±0.63 2.00 0.26 3.60 2.00 20 74.00 7.40 ±5.01 4.20 ±0.42 2.00 0.19 3.70 2.00 ErdosRenyi 10 21.00 4.20 ±1.98 5.10 ±0.74 1.10 0.23 2.10 1.10 15 31.40 4.19 ±1.97 7.70 ±1.42 1.00 0.15 2.09 1.00 20 44.40 4.44 ±4.44 9.00 ±1.83 1.00 0.12 2.22 1.00 WattsStrogatz 10 20.00 4.00 ±1.21 5.70 ±0.67 1.10 0.22 2.00 1.10 15 30.00 4.00 ±1.46 9.20 ±1.14 1.00 0.14 2.00 1.00 20 40.00 4.00 ±1.46 11.60 ±1.65 1.00 0.11 2.00 1.00 422 19 404 476 482 215 319 159 51 62 422 482 319 421 441 19 215 421 481 96 367 233 470 159 441 481 458 404 96 458 243 51 367 243 357 261 476 233 357 62 470 261 0 1 2 3 4 5 6 7 8 9 (a) SPT for a Barabasi-Albert graph. 422 19 404 476 482 215 319 159 51 62 422 482 319 421 441 19 215 421 481 96 367 233 470 159 441 481 458 404 96 458 243 51 367 243 357 261 476 233 357 62 470 261 0 1 2 3 4 5 6 7 8 9 (b) LDV multicast tree for a Barabasi-Albert graph. 70 20 496 23 155 485 407 431 310 70 131 64 20 131 198 347 5 496 198 347 23 347 155 347 355 485 5 343 407 355 431 64 310 343 0 1 2 3 4 5 6 7 8 9 (c) SPT for a Dorogovtsev-Mendes graph. 70 20 496 23 155 485 407 431 310 70 131 64 20 131 198 347 5 496 198 347 23 347 155 347 355 485 5 343 407 355 431 64 310 343 0 1 2 3 4 5 6 7 8 9 (d) LDV multicast tree for a Dorogovtsev-Mendes graph. Fig. 1: An example of the difference between solutions found by SPT-based Fig. 1a, Fig. 1c and LDV formulations Fig. 1b, Fig. 1d for Barabasi-Albert model and Dorogovtsev-Mendes models with n= 10 % and 30 % penetration of subscribers. In each graph, the orange node is the multicast publisher, and green nodes are multicast subscribers, and blue nodes represent Steiner nodes. Numbers next to links represent their weight in ns. c 2016 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 401 INFORMATION AND COMMUNICATION TECHNOLOGIES AND SERVICES VOLUME: 14 |NUMBER: 4 |2016 |SPECIAL ISSUE Although the higher link density gives better results concerning LDV, the multicast tree can contain paths infeasible from a jitter perspective. Since none of the ISO/IEC/IEEE 8802-3 Ethernet QoS mechanisms can guarantee exact priority packet handling (switching fabric latency, various queue mechanisms), each node added to the solution potentially increases jitter along the path to a multicast subscriber. 10 20 30 40 50 60 70 80 90 Multicast group size [%] 200 400 600 800 1000 1200 1400 1600 1800 Mean path delay [ns] SPT, Barabasi-Albert SPT, Dorogovtsev-Mendes SPT, Erdos-Renyi SPT, Watts-Strogatz LDV, Barabasi-Albert LDV, Dorogovtsev-Mendes LDV, Erdos-Renyi LDV, Watts-Strogatz Fig. 3: Effect of multicast group size on the mean value of path delays at graph size n= 20. The impact of higher link variability in instances with lower penetration of subscribers is depicted in Fig. 4. The LDV on Barabasi-Albert model produces trees with a greater number of links, i.e., a higher number of hops a multicast packet has to pass. On the other hand, the chart proves that the SPT-based formulation produces trees with a lower number of links in all cases. All curves are converging at the higher number of subscribers since it is not possible to build a tree with a number of links >|V| − 1. 10 20 30 40 50 60 70 80 90 Multicast group size [%] 2 4 6 8 10 12 14 16 18 20 Tree size [-] SPT, Barabasi-Albert SPT, Dorogovtsev-Mendes SPT, Erdos-Renyi SPT, Watts-Strogatz LDV, Barabasi-Albert LDV, Dorogovtsev-Mendes LDV, Erdos-Renyi LDV, Watts-Strogatz Fig. 4: Effect of multicast group size on mean tree size at graph size n= 20. Whereas the impact of multicast group size on the tree size is very well identifiable, the investigation into the effect of the network size was limited only to the window of three sizes (10, 15, 20). Although the range is not excessive the chart in Fig. 5 indicates, that the conclusions from previous perspectives were right. The LDV formulation on Barabasi-Albert and DorogovtsevMendes models tends to construct longer paths as the growing tree size suggests. The size of the LDV tree is almost two times larger than the SPT of those models. Interestingly, all curves seem to be linear in this detail. 10 12 14 16 18 20 Number of nodes [-] 4 6 8 10 12 14 16 Tree size [-] SPT, Barabasi-Albert SPT, Dorogovtsev-Mendes SPT, Erdos-Renyi SPT, Watts-Strogatz LDV, Barabasi-Albert LDV, Dorogovtsev-Mendes LDV, Erdos-Renyi LDV, Watts-Strogatz Fig. 5: Effect of network size on mean tree size at the multicast group size of 20 %. 5. Conclusion The ISO/IEC/IEEE 8802-3 Ethernet as a nondeterministic communication bus poses many challenges in the area of mission-critical applications, for example, L2 multicast defined by IEC 61850-9-2LE. The implementation of the SDN concept in data networks can increase the quality of services in Smart Grids limited by a transfer of communication technologies to Ethernet in last decade. Although SDN is very well studied nowadays, it is only a tool and for such a powerful tool new applications have to be adopted. In this paper, authors proposed an ILP formulation of Least-Delay-Variation (LDV) multicast forwarding problem in Section 3. as a potential application of SDN in SG. Results obtained from a significant number of numerical evaluations were compared with an agnostic approach based on a Shortest-Path Tree (SPT) in Section 4. The analysis of random graph instances using the proposed LDV ILP minimizing delay variation shows improvement compared to currently used approaches based on SPT. Interestingly, the results indicate that scale-free topologies with a higher number of links lead to lower delay variations. We assume that in closed network environments as the IEC 61850 local networks are with specific traffic patterns is possible to avoid high jitter values since the local QoS mechanisms can be tuned very precisely to fulfill the LDV goal by SDN or by traditional management tools. Authors plan to address this potential jitter problem in future research and to focus on metaheuristics as well as exact algorithms on a multi-tree problem conc 2016 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 402 INFORMATION AND COMMUNICATION TECHNOLOGIES AND SERVICES VOLUME: 14 |NUMBER: 4 |2016 |SPECIAL ISSUE sidering a combination of processing and queuing delays with traffic priorities, which could be implemented by SDN. Acknowledgment This work was supported by Student grant at Czech technical university in Prague SGS16/158/OHK3/2T/13. Computational resources were provided by the CESNET LM2015042 and the CERIT Scientific Cloud LM2015085, provided under the programme "Projects of Large Research, Development, and Innovations Infrastructures". References [1] GEORG, H., N. DORSCH, M. PUTZKE and C. WIETFELD. Performance evaluation of time-critical communication networks for Smart Grids based on IEC 61850. In: IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). Turin: IEEE, 2013, pp. 43–48. ISBN 978-1-4673-5944-3. DOI: 10.1109/INFCOM.2013.6567174. [2] MOLINA, E., E. JACOB, J. MATIAS, N. MOREIRA and A. ASTARLOA. Using Software Defined Networking to manage and control IEC 61850-based systems. Computers and Electrical Engineering. 2015, vol. 43, iss. 1, pp. 142–154. ISSN 0045-7906. DOI: 10.1016/j.compeleceng.2014.10.016. [3] IEEE standard 802.1Q-2014 - IEEE Standard for Local and metropolitan area networks–Bridges and Bridged Networks. IEEE, 2014. ISBN 978-0-73819433-2. DOI: 10.1109/IEEESTD.2014.6991462. [4] DONG, X., H. LIN, R. TAN, R. IYER and Z. KALBARCZYK. Software-Defined Networking for Smart Grid Resilience: Opportunities and Challenges. In: Proceedings of the 1st ACM Workshop on Cyber-Physical System Security. New York: ACM, 2015, pp. 61–68. ISBN 978-1-45033448-8. DOI: 10.1145/2732198.2732203. [5] KALMAN, G. Applicability of Software Defined Networking in industrial Ethernet. In: Telecommunications Forum Telfor (TELFOR). Belgrade: IEEE, 2014, pp. 340–343. ISBN 978-1-47996191-7. DOI: 10.1109/TELFOR.2014.7034420. [6] DORSCH, N., F. KURTZ, H. GEORG, C. HOEGERLIN and C. WIETFELD. Softwaredefined networking for Smart Grid communications: Applications, challenges and advantages. In: 2014 IEEE International Conference on Smart Grid Communications (SmartGridComm). Venice: IEEE, 2014, pp. 422–427. ISBN 978-1-4799-4934-2. DOI: 10.1109/SmartGridComm.2014.7007683. [7] VOB, S. Steiner’s problem in graphs: heuristic methods. Discrete Applied Mathematics. 1992, vol. 40, iss. 1, pp. 45–72. ISSN 0166-218X. DOI: 10.1109/IADCC.2010.5423000. [8] KABAT, M. R., M. K. PATEL and C. R. TRIPATHY. A heuristic algorithm for delay delayvariation bounded least cost multicast routing. In: Advance Computing Conference (IACC). Patiala: IEEE, 2010, pp. 261–266. ISBN 978-1-42444790-9. DOI: 10.1016/0166-218X(92)90021-2. [9] ROUSKAS, G. N. and I. BALDINE. Multicast routing with end-to-end delay and delay variation constraints. IEEE Journal on Selected Areas in Communications. 1997, vol. 15, no. 3, pp. 346– 356. ISSN 0733-8716. DOI: 10.1109/49.564133. [10] SHEU, P. R. and S. T. CHEN. A fast and efficient heuristic algorithm for the delayand delay variation bound multicast tree problem. In: Information Networking. Oita: IEEE, 2001, pp. 611–618. ISBN 0-7695-0951-7. DOI: 10.1109/ICO2001.905521. [11] HAMDAN, M. and M. E. EL-HAWARY. Multicast routing with delay and delay variation constraints using genetic algorithm. Canadian Conference on Electrical and Computer Engineering. 2004, vol. 4, iss. 1, pp. 2363–2366. ISSN 0840-7789. DOI: 10.1109/CCECE.2004.1347721. [12] ZHANG, K., H. WANG and F. LIU. Multicast routing for delay and delay variation bounded Steiner tree using simulated annealing. In: IEEE Networking, Sensing and Control. Tuscon: IEEE, 2005, pp. 682–687. ISBN 0-7803-88127. DOI: 10.1109/ICNSC.2005.1461272. [13] MOKBEL, M. F., W. A. EL-HAWEET and E. M. NAZIH. An efficient algorithm for shortest path multicast routing under delay and delay variation constraints. In: Proceedings of the Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS) [online]. 2000. Available at http://wwwusers.cs.umn.edu/mokbel/papers/SPECTS00.pdf. [14] KIM, M., B. YOUNG-CHEOL and C. HYUNSEUNG. On Multicasting Steiner Trees for Delay and Delay Variation Constraints. In: Second International Conference of High Performance Computing and Communications. Munich: Springer, 2006, pp. 447–456. ISBN 978-3540-39372-6. DOI: 10.1007/11847366_46. c 2016 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 403 INFORMATION AND COMMUNICATION TECHNOLOGIES AND SERVICES VOLUME: 14 |NUMBER: 4 |2016 |SPECIAL ISSUE [15] KABAT, M. R., M. K. PATEL and C. R. TRIPATHY. A heuristic algorithm for delay delayvariation bounded least cost multicast routing. In: Advance Computing Conference (IACC). Patiala: IEEE, 2010, pp. 261–266. ISBN 978-1-42444790-9. DOI: 10.1109/IADCC.2010.5423000. [16] XU, Y., R. QU and R. LI. A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems. Annals of Operations Research. 2013, vol. 206, iss. 1, pp. 527–555. ISSN 0254-5330. DOI: 10.1007/s10479-013-1322-7. [17] LIN, H. C., T. M. LIN and C. F. WU. Constructing application-layer multicast trees for minimumdelay message distribution. Information Sciences. 2014, vol. 279, iss. 1, pp. 433–445. ISSN 0020-0255. DOI: 10.1016/j.ins.2014.03.130. [18] PARK, J. W., C. K. HWANG and Y. W. LEE. New ILP formulations for multicast routing in sparse-splitting optical networks. In: 8th international conference on network and service management (CNSM) and 2012 workshop on systems virtualiztion management (svm). Las Vegas: IEEE, 2012, pp. 238–241. ISBN 978-1-4673-3134-0. [19] BRUNNER, C. Implementation Guideline For Digital Interace To Instrument Transformers Using IEC 61850-9-2. UCA International Users Group. [online]. Available at: http://iec61850.ucaiug.org. [20] DIESTEL, R. Graph Theory (Graduate Texts in Mathematics). 1st ed. New York: Springer, 1997. ISBN 0-387-95014-1. [21] BELA, B. Random Graphs. - Modern Graph Theory. 1st ed. New York: Springer, 1998. ISBN 9780-387-98488-9. [22] WATTS, D. J. and S. H. STROGATZ. Collective dynamics of a small-world network. Nature. 1998, vol. 393, iss. 1, pp. 440–442. ISSN 0028-0836. DOI: 10.1038/30918. [23] BARABASI, A. L. and R. ALBERT. Emergence of Scaling in Random Networks. Science. 1999, vol. 286, iss. 5439, pp. 509–512. ISSN 1095-9203. DOI: 10.1126/science.286.5439.509. [24] DROGOVTSEV, S. N. and J. F. F. MENDES. Evolution of networks. Advances in physics. 2002, vol. 51, iss. 1, pp. 1079–1187. ISSN 0001-8732. DOI: 10.1080/00018730110112519. About Authors Tomas HEGR received his M.Sc. in computer science from the Czech Technical University in Prague in 2012. He participates in teaching activities at the department of telecommunication engineering. His research interests involve industrial networks based on Ethernet and Software-Defined Networking in all research areas. Milos KOZAK received the M.Sc. and Ph.D. degrees in electrical engineering from the Czech Technical University, Prague, in 2009 and 2015, respectively. Since 2009 until 2012, he tought optical communication systems and data networks with the Czech Technical University in Prague. His research interest is on the application of high-speed optical transmission systems in a data network. Particularly regenerators placement in all optical networks. Leos BOHAC received the M.Sc. and Ph.D. degrees in electrical engineering from the Czech Technical University, Prague, in 1992 and 2001, respectively. Since 1992, he has been teaching optical communication systems and data networks with the Czech Technical University, Prague. His research interest is on the application of high-speed optical transmission systems in a data network. c 2016 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 404