Practical Routing Protocol Models to Improve Network Performance and Adequacy ()

Mohammad Alhihi^{}

Philadelphia University, Amman, Jordan.

**DOI: **10.4236/jcc.2017.56007
PDF HTML XML
1,319
Downloads
2,159
Views
Citations

Philadelphia University, Amman, Jordan.

The telecommunications network has become an essential facility of our daily life, which is the reason why a good number of the recent researches are directed to it. In this paper, the performance of routing protocols for selected network and the optimum way of utilizing the network resources is proposed, through improving the routing method protocols to obtain the most accurate communication models, which give the best network performance, taking into consideration that the protocol time interval to recalculate the future routing step is agreed to be our performance criteria, which is then used to determine the total amount of incoming traffic normalized at the best network performance with respect to the network capacity as well. Moreover, adaptive routing evaluation methods have been mathematically investigated in this work for telecommunication networks (TN), more precisely, developing the infrared radiation (IR) routing methods for hybrid TN applications, in terms of implementation conditions at a certain guaranteed quality of service, where we give a particular interest in analyzing routing methods based on the fact that the distribution information is contained in the routing variables, rather than in the state variables. The protocol that deals with the unbalanced traffic distribution over TN nodes has been investigated in this paper as well, and simulation results show good progress in the proposed protocol over the traditional protocols.

Share and Cite:

Alhihi, M. (2017) Practical Routing Protocol Models to Improve Network Performance and Adequacy. *Journal of Computer and Communications*, **5**, 114-124. doi: 10.4236/jcc.2017.56007.

1. Introduction

Telecommunication network (NT) routing protocols are such an old topic that controls the network performance, which is discussed in many old and recent research work, for example, in 1998 [1] , deferent multi-hop wireless ad hoc network routing protocols are compared for different scenarios to investigate the best protocol that gives the best network performance. This good work was directly followed with such important work deals with the same field in [2] , where the needed dynamic routing protocols were investigated and the performance compression in mobile network between dynamic source routing and ad hoc on-demand distant vector routing was provided as well.

In [3] the protocols of attacking and defending the network were proposed to show how important to choose the routing protocol in ad hoc network.

Most recent work is aimed at power efficient protocols for different applications, such as wireless sensor network [4] [5] , and [6] proposed novel protocols for wireless networks resulted in good power saving and better automatic repeat request (ARQ) through improving the routing mechanism. In [7] , mobile network routing protocol was introduced and it shows how the routing protocols do improve the power and bandwidth efficiently even for such small networks as a result of improving the PER.

Routing protocols is becoming more and more updated research work because its ability to adapt with other techniques, such as cooperative network and network coding network [7] and [8] .

The rest of the paper is organized as follows: Section 2 deals with the experimental study of the developed models and routing methods in TN, which shows how the proposed protocol works in different scenarios, hence Section 2 is divided to two sub-sections, which are 2.1 which shows the Block diagram of the experimental model and 2.2 which shows how to check the adequacy of the developed routing models. Section 3 gives the conclusion for the paper.

In this paper, the performance of routing protocols for selected network and the optimum way of utilizing the network resources is proposed, unlike [9] where an exact algorithm based on the Branch and Bound principle is proposed and then improved by the Lookahead technique.

Both [10] and [11] propose sensor network for underwater application, where in [10] the network architecture for underwater acoustic sensor networks was shown, over different layers such as MAC and routing protocols for the application layer over the acoustic channel, and in [11] depth division-policy was applied to obtain an efficient and scalable version of depth-based routing protocol to reduce the consumed energy and the delay in communication from end-to- end, for underwater sensor network.

In [12] the multipath routing in layer 2 networks was investigated using a non-shortest-path routing approach, equal preference multipath that can generate more paths than equal cost multipath.

Network performance is identified as the property of TN to provide a given information transmission probability from a source to a destination with maintaining the quality of service transmission [13] .

Moreover, in this paper, the protocol time interval to recalculate the future routing step is agreed to be our performance criteria, and hence the obtained results are based on this. In general, the value of the network performance depends on the network configuration, bandwidth, the network atmosphere, and the network variables as shown in Equation (1):

$P\left(k\right)={\displaystyle \underset{i=1}{\overset{N}{\sum}}{\displaystyle \underset{j=1}{\overset{N}{\sum}}{c}_{i,j}\left(k\right){u}_{i,j}^{j}\left(k\right)}}\text{,}\text{}\text{}\text{}\text{}\text{}\text{}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{where}\text{\hspace{0.17em}}i\ne j\text{.}$ (1)

where $P\left(k\right)$ is the network performance, ${u}_{i,l}^{j}\left(k\right)$ is the routing variables taking into consideration that communication input stream availability is assumed, otherwise, the routing variables are zeroes, and ${C}_{i,l}^{j}\left(k\right)$ is the network bandwidth.

Relative performance of the network at the time interval can be written as

${P}_{\text{\u043e\u0442\u043d}}\left(k\right)=\frac{P\left(k\right)\Delta t}{{Y}_{\text{\u0432\u0445}\Sigma}\left(k\right)}\text{\hspace{0.17em}},\text{\hspace{0.17em}}\text{}\text{\hspace{0.17em}}\text{and}\text{\hspace{0.17em}}{Y}_{\text{\u0432\u0445}\Sigma}\left(k\right)\ne 0\text{\hspace{0.17em}}\text{\hspace{0.17em}}$ , (2)

where ${Y}_{\text{\u0432\u0445}\Sigma}\left(k\right)$ is the total load value supplied to the network at M time interval and it is:

${Y}_{\text{\u0432\u0445}\Sigma}\left(k\right)={\displaystyle \underset{i=1}{\overset{N}{\sum}}{\displaystyle \underset{j=1}{\overset{N}{\sum}}{y}_{\text{\u0432\u0445}i,j}\left(k\right)}},\text{\hspace{0.17em}}\text{\hspace{0.17em}}i\ne j$ , (3)

where ${y}_{\text{\u0432\u0445}i,j}\left(k\right)$ is the volume load entering the node ${V}_{i}$ and intended site ${V}_{j}$ . Unlike ${y}_{i,j}\left(k\right)$ which indicates the real amounts of data, rather than the predicted value.

In order to further comparative analysis of simulation results for different network configurations, we introduce network performance ${P}_{\text{\u043d}}\left(k\right)$ and the total amount of incoming traffic ${Y}_{\text{\u0432\u0445\u043d}}\left(k\right)$ normalized with respect to the maximum possible in the network performance values, that is, with respect to its capacity:

${P}_{\text{\u043d}}\left(k\right)=\frac{P\left(k\right)}{C\left(k\right)}100\%$ (4)

and

${Y}_{\text{\u0432\u0445\u043d}}\left(k\right)=\frac{{Y}_{\text{\u0432\u0445}\Sigma}\left(k\right)}{C\left(k\right)\Delta t}100\%$ (5)

where $C\left(k\right)$ - is the bandwidth at $k$ -M time interval. Normalized performance during simulation ${T}_{\text{\u043c}}$ , consisting of $v$ at the time slots ${T}_{\text{\u043c}}=v\Delta t$ are defined as follows:

${P}_{\text{\u043d}}=\frac{{\displaystyle \underset{k=1}{\overset{v}{\sum}}P\left(k\right)}}{{\displaystyle \underset{k=1}{\overset{v}{\sum}}C\left(k\right)}}100\%$ . (6)

where ${P}_{\text{\u043d}}$ is the normalized performance. Similarly, the normalized load volume entering the network during the simulation ${T}_{\text{\u043c}}=v\Delta t$

${Y}_{\text{\u0432\u0445\u043d}}=\frac{{\displaystyle \underset{k=1}{\overset{v}{\sum}}{Y}_{\text{\u0432\u0445}\Sigma}\left(k\right)}}{\Delta t{\displaystyle \underset{k=1}{\overset{v}{\sum}}C\left(k\right)}}100\%$ . (7)

So, as network performance can be regarded as an indicator for firstly, the resources efficiency usage represented by the network utilization capacity of the nodes buffer memory, and secondly, the paths transmission bandwidth. The first indicator is expressed in terms of the state variables, and the second indicator is expressed through the route variables. The node ${V}_{i}$ utilization rate capacity of the buffer memory ${R}_{i}$ can be defined as:

${R}_{i}=\frac{1}{{x}_{i}^{\mathrm{max}}}\left({\displaystyle \underset{j=1}{\overset{N}{\sum}}{x}_{i,j}\left(k\right)}\right),\text{\hspace{0.17em}}\text{\hspace{0.17em}}j\ne i$ (8)

where ${x}_{i}^{\mathrm{max}}$ is the maximum allowable amount of information that can be stored in a buffer node device ${V}_{i}$ and ${x}_{i,j}\left(k\right)$ is the data volume which represents the network information.

However, given the particular interest in analyzing routing methods to the way in which there is a distribution of information flows and the fact that the information contained in the routing variables, rather than the state variables, special importance attaches to indicators that are based on these variables: bandwidth utilization of a separate tract transmission ${E}_{i,j}$ lots of traffic passed through it ${K}_{i,j}\left(k\right)$ and channel utilization of network resources on the whole ${K}_{\text{ECP}}\left(k\right)$ on $k$ -M time interval as it can be summarized in [13] :

${K}_{i,j}\left(k\right)={\displaystyle \underset{m=1}{\overset{N}{\sum}}{u}_{i,j}^{m}\left(k\right)},m\ne i,$ (9)

${K}_{\text{ECP}}\left(k\right)=\frac{{\displaystyle \underset{i=1}{\overset{N}{\sum}}{\displaystyle \underset{j=1}{\overset{N}{\sum}}{K}_{i,j}\left(k\right)}}}{{N}_{\text{\u0442\u0440}}},i\ne j,$ (10)

where ${N}_{\text{\u0442\u0440}}$ is the number of transmission paths in a full mesh network where ${N}_{\text{\u0442\u0440}}=N\left(N-1\right)$ . According to Equations (8) and (10) the parameters reflecting the degree of utilization of the channel resources can be obtained directly on the basis of the vectors $U\left(k\right)$ calculated based on the physical meaning of their components. Opportunity evaluation in the models of utilization of network resources is particularly important in the practice routing methods which is based on the shortest path algorithms.

As the main problem in such protocols, is the inefficiency resulted from the unbalanced distribution of traffic over nodes or over transmission time intervals.

In this regard, the introduction of performance ${K}_{i,j}$ E and ${K}_{\text{ECP}}$ opens the possibilities for the evaluation and comparative analysis methods to develop an active protocol that can deal with this problem.

The proposed protocol deals with the problem of unbalanced distribution of the traffic over the nodes. The practical implementation of the introduced shortest path model satisfies the condition of Equation (11) [14]

${K}_{i,j}\left(k\right)\le {K}_{\mathrm{max}}\le 1$ , (11)

which provides a reduction in the degree of channel resources utilization, communication routes that are part of the shortest paths, and encourages the use of bypass routes resulting to mitigating the effect of the congestion in the networks. The value ${K}_{\mathrm{max}}$ in such setting is determined by the configuration and the particular network traffic selected for each network separately.

2. Experimental Study of the Developed Models and Routing Methods in TN

2.1. Block Diagram of the Experimental Model

The proposed work in this paper is based on experimental study of the developed models, where the routing methods have been carried out by means of mathematical modeling and simulation. The degree of the modeling process detailed information that exchanges in the TN, is obtained by the experimental method as well, which directly reflects the content of the developed models and routing methods, i.e., collecting and processing information on the state of the network, calculation and implementation of the routing tables, …, etc. A number of issues such as queuing mechanisms, and mechanisms for restricting traffic alignment were not considered because their effect is assumed to be the same for all traditional and proposed protocols.

The block diagram of the experiment is shown in Figure 1. The central unit (block 4) is the unit for forming the routing tables, which its operation is based on the algorithm proposed models and routing methods. The optimization interval $\left({t}_{0},{t}_{\u043a}\right)$ which is proposed to solve the routing problem is changing from ${t}_{0}={t}_{h}$ to ${t}_{\u043a}={t}_{h}+T$ where $T=a\Delta t$ is the projection period, and $h$ is the current number of time interval $\Delta t$ or the modeling phase. The total simulation

Figure 1. Block diagram of the experimental model.

time is ${T}_{\text{\u043c}}=v\Delta t$ as realized by routing the prediction model, has the property that generates the set of the routing tables as shown in Figure 1.

Initial data for constructing information MT is entering the current blocks 2, 3, 5, and 6 Figure 1, forming the current status of the network, which is expressed as a matrix and the initial value $B\left(k\right)$ loading buffer queues at the nodes $X\left(0\right)$ , and on the projected value of the incoming load $Y\left(k\right)$ , where the predicted accuracy is governed by unit 3. In general, the prediction error values are determined by the incoming flow, in which the prediction is realized. However, in our proposed patterns study and routing techniques; it is assumed that ${Y}_{\text{\u0432\u0445}}\left(k\right)$ dynamic load changes is known with some specified error $\Delta Y\left(k\right)$ , due to the deterministic nature of the proposed routing patterns.

Though the process proceeds to the network load is random, it allocates a separate task of synthesis vectors ${Y}_{\text{\u0432\u0445}}\left(k\right)$ . During the simulation of the routing process it assumes that the volume entering the network load is a function of time and it is a random process with parameters

$M\left[{y}_{\text{\u0432\u0445}i,j}\left(k\right)\right]={y}_{\text{\u0432\u0445\u0441\u0440}i,j}\left(k\right)\text{}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{and}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}D\left[{y}_{\text{\u0432\u0445}i,j}\left(k\right)\right]={\sigma}_{y\text{}i,j}^{2}\left(k\right)$ .

As the study that [15] [16] showed the statistical characteristics of the telecommunications traffic; the volume of the load entering the network is a random variable whose distribution law in most cases can be approximated by the normal or the log-normal law. Taking into consideration that for the proposal of Gaussian model traffic description applicability in TN, a large number of independent sources of active (up to several thousand) are required as specified in [16] . In the absence of a specified number of sources per hour or lower activity of the amount of traffic on the network; an approximated lognormal Gaussian model traffic distribution is proposed in [16] .

The requirement for a high number of active sources is due to the central limit theorem: The law of the probability distribution of the independent random variables summation with the same order of unlimited, increases in terms of independence from the laws of distribution tends to a normal distribution. On the practical side prerequisite to the use of this theorem, it appears that the level of wide area network (WAN) streams arrive at the router from aggregating multiple nodes, each of which its density reaches up to 10,000 subscriber terminals [17] . Also it is important to notice that in multiservice network streams, entering the network by subscribers are heterogeneous (data, voice, video on demand, video conferencing), among which highlight the difficult prevailing traffic type. As a result, it can be regarded as distributed according to the law, which is close to normal. We are talking about a truncated normal law, which is due to the physical meaning of the variables ${y}_{\text{\u0432\u0445}i,j}\left(k\right)$ where ${y}_{\text{\u0432\u0445}i,j}\left(k\right)>0$ .

During the experimental studies of the proposed models and routing methods by means of mathematical modeling; the simulation method is used as the input load datasets with the two distribution laws. Thus, in the simulation process of information exchange in the TN; the collected resulting data in this work is for:

・ Network structure and capacities of transmission paths on the basis of which the matrix is formed $B\left(k\right)$ .

・ Boot buffer queues at the network nodes $X\left(0\right)$ .

・ The value of the incoming user traffic ${Y}_{\text{\u0432\u0445}}\left(k\right)$ and the accuracy of its prediction $\Delta Y\left(k\right)$ .

・ Prediction interval and the interval $T$ recalculation $\Delta t$ .

・ The total time of simulation ${T}_{\text{\u043c}}$ and size $v$ .

In the modeling process at each stage, it is possible to monitor and assess the state of the network $X\left(h\right)$ , utilization of channel resources of ${K}_{i,j}\left(h\right)$ and ${K}_{\text{ECP}}\left(h\right)$ , and the introduction of an effective performance, in terms of network performance for its relative and normalized values.

2.2. Check the Adequacy of the Developed Routing Models

The purpose of checking the adequacy design for mathematical routing methods for NT models is to determine their correctness and, ultimately, the possibility of (borders) application.

In the absence of the possibility of direct implementation of the proposed research models and methods for routing in the existing TN, and obtaining experimental data to support or disprove their validity, we consider a number of key factors by which to judge the adequacy of the proposed models and methods.

The adequacy of the model and the accuracy obtained with the help of the results provided by:

・ Using modern and proven mathematical apparatus: the theory of differential-difference equations, systems theory and optimal control theory.

・ Sound (correct) the selection criteria and optimal performance.

・ The large number of factors is considered, which is expressed in the form of restrictions, each of which is grounded and has a clear physical meaning.

Simulation of the proposed routing method performed for different network structures, however, in this case, as shown by the results of the simulation, the maximum efficiency of the proposed methods based on models in state-space emerged in the implementation of irregular network structures, which are often used in practice. By irregular network structures include structures in which the vertices have different degrees, as opposed to regular, and fully connected.

The most typical representative of the irregular structure is the so-called “fish” as shown in Figure 2, [16] [18] .

A distinguishing feature of “fish” is the presence of two independent paths between a pair of nodes in Figure 2, on nodes 1 and 5, which are of different

Figure 2. Example for sub-optimal distribution network protocol (fish).

lengths. Specificity classical IP-routing leads to that all flows from node 1 to node 5 will be directed along the shortest path (through node 2), while the path length is a little higher, it will not be involved at all. This example clearly illustrates the disadvantages routing along the shortest path, which, as a challenge to the individual quality indicators as the objective function, leads to suboptimal across the distribution network flows.

Consider the detailed work on the network model example as shown in Figure 2, which will demonstrate the essence of the proposed solutions for the routing problems, resulting to efficiency improvement for the network functions.

Assuming that the network receives information on a service flow with three projected intensity received ${\zeta}_{1,6}\left(0\right)=6$ , ${\zeta}_{1,7}\left(0\right)=6$ , ${\zeta}_{4,2}\left(0\right)=3\text{Mbps}$ . For the propose of simplify; consider a model without the option of prediction choosing the simulation time at ${T}_{\text{M}}=\Delta t=10\text{s}$ .

Based on above, the amount of data entering the network comprise

${y}_{1,6}\left(0\right)=60$ , ${y}_{1,7}\left(0\right)=60$ , ${y}_{4,2}\left(0\right)=30\text{Mbps}$ . Assuming that the network does not boot, i.е., $X\left(0\right)=0$ .

In organizing the routing process according to the shortest path algorithms path 1-2-5-6 will be used for transmission of said stream, 1-2-5-7 and 4-5-2 as shown in Figure 3.

Given that the path from node 1 to the nodes 6 and 7 have a common region whose bandwidth is 10 Mbps, for a time $\Delta t$ streams ${y}_{1,6}\left(0\right)$ and ${y}_{1,7}\left(0\right)$ fully serviced and are in turn the end of the simulation ${x}_{1,6}\left(1\right)$ and ${x}_{1,7}\left(1\right)$ take the value of 10 Mbps.

Application of the developed routing method will provide targeted functionality, with the result of the decision is a vector routing variables are shown in Table 1, which corresponds to the distribution of flows shown in Figure 4.

The model generates a distribution of network resources that the entire amount of data received by the network, will be serviced, and the service information is

Figure 3. The distribution of flows in the network according to a shortest path algorithm.

Table 1. The results of solving the routing problem.

(a)(b)(c)

Figure 4. Flow distribution in accordance with the proposed model routing.

not the same path, but in several simultaneously. As a result, unlike the routing algorithm by the shortest path, there is no accumulation of data in one of the nodes that increases network capacity and prevents overload eventually. This example illustrates the fact that when using the routing of the proposed model is achieved by a balanced use of resources, that is the most uniform loading units and transmission paths.

3. Conclusions

In this work, our practical study introduces the performance of routing protocols for selected network and the optimum way of utilizing the network resources. The achieved performance has been obtained by the proposed routing method protocols that determines the most accurate communication models and hence estimates the expected network best performance.

The protocol time interval was used in this paper to recalculate the future routing step and considers it to be our performance criteria.

The proposed protocol shows how the network capacity improves when choosing the less traffic path (shortest time interval) rather than the shortest one.

The block diagram for the proposed protocol is provided with the proposed check routing model adapted in this work with practical calculations that showed the optimum path between two suggested nodes based on the less traffic path resulting to valuable data rate saving in the whole network.

Finally, the paper shows that the proposed protocols deal with the unbalanced traffic distribution over TN nodes and how good progress this protocol achieves in such scenario.

The future work will be directed to more specific protocols that practically improves the performance of specific applications such as condensed mobile network, intensive wireless sensor network, and other applications such as [19] .

Acknowledgements

The authors of this paper would like to thank the Philadelphia University for their support and for assuring such good researching atmosphere for us. Moreover, authors truly would like to thank the reviewers of this paper for the good advice they provided which improved this work significantly.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] | Broch, J., Maltz, D.A., Johnson, D.B., Hu, Y.-C. and Jetcheva, J. (1998) A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, Dallas, Texas, 25-30 October 1998, 85-97. |

[2] |
Perkins, C.E., Royer, E.M., Das, S.R. and Marina, M.K. (2001) Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks. IEEE Personal Communications, 8, 16-28. https://doi.org/10.1109/98.904895 |

[3] |
Hu, Y.-C., Perrig, A. and Johnoson, D.B. (2003) Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols. Proceedings of the 2nd ACM Workshop on Wireless Security, San Diego, 19 September, 2003, 30-40.
https://doi.org/10.1145/941311.941317 |

[4] |
Attar, H., Stankovic, L. and Stankovic, V. (2012) Cooperative Network-Coding System for Wireless Sensor Networks. IET Communications, 6, 344-352.
https://doi.org/10.1049/iet-com.2011.0143 |

[5] |
Attar, H., Vukobratovic, D., Stankovic, L. and Stankovic, V. (2011) Performance Analysis of Node Cooperation with Network Coding in Wireless Sensor Networks. 4th IFIP International Conference on New Technologies, Mobility and Security, Paris, 7-10 February 2011, 1-4. https://doi.org/10.1109/NTMS.2011.5721048 |

[6] | Alhihi, M. (2017) Network Coding for Wireless Sensor Network Cluster over Rayleigh Fading Channel: Finite State Markov Chain. International Journal of Communications, Network and System Sciences, 10, 1-11. |

[7] |
Attar, H., Stankovic, L., Alhihi, M. and Ameen, A. (2014) Deterministic Network Coding over Long Term Evaluation Advance Communication System. 4th International Conference on Digital Information and Communication Technology and Its Applications (DICTAP), Bangkok, 6-8 May 2014, 56-61.
https://doi.org/10.1109/dictap.2014.6821657 |

[8] |
El-Hihi, M., Attar, H., Solyman, A.A.A. and Stankovic, L. (2016) Network Coding Cooperation Performance Analysis in Wireless Network over a Lossy Channel, M Users and a Destination Scenario. Communications and Network, 8, 257-280.
https://doi.org/10.4236/cn.2016.84023 |

[9] |
Molnar, M. (2016) Exact Algorithm to Solve the Minimum Cost Multi-Constrained Multicast Routing Problem. Journal of Computer and Communications, 4, 57-79.
https://doi.org/10.4236/jcc.2016.414005 |

[10] |
Khosravi, M.R., Salari, R. and Rostami, H. (2016) A Solution for Scalable Routing in Depth Divisions-Based DUSNs via Adding a Scalable Parameter to Control Depth Clusters: Creating an Energy Efficient and Low Delay NI-Independent Communication Protocol. Journal of Computer and Communications, 4, 55-61.
https://doi.org/10.4236/jcc.2016.47008 |

[11] | Sharif-Yazd, M., Khosrav, M.R. and Moghimi, M.K. (2017) A Survey on Underwater Acoustic Sensor Networks: Perspectives on Protocol Design for Signaling, MAC and Routing. Journal of Computer and Communications (JCC), 5, 12-23. |

[12] |
Hou, T.-C. and Tsai, H.-C. (2016) Equal Preference Multi-Path Routing for L2 Hierarchical Networks. Journal of Computer and Communications, 4, 37-56.
https://doi.org/10.4236/jcc.2016.414004 |

[13] | Evseev, O. (2002) Experimental Research of Dynamic Model of Adaptive Datagram Routing in Telecommunications Networks. Radiotekhn Single: Vseukr. Interdepartmental. Scientific and Engineering. Sat, 133, 20-26. |

[14] | Olifer, V.G. and Olifer, N.A. (2001) Art Traffic Optimization. Journal of Set-O LAN Solutions, No. 12, 38-47. |

[15] |
Norros, I. (1995) The Management of Large Flows of Connectionless Traffic on the Basis of Self-Similar Modeling. IEEE International Conference on Communications, ICC’95 Seattle, “Gateway to Globalization”, Seattle, 18-22 June 1995, 451-455.
https://doi.org/10.1109/ICC.1995.525210 |

[16] | Norros, I. and Pruthi, P. (1996) On the Applicability of Gaussian Traffic Models. Proceedings of the 13th Nordic Teletraffic Seminar, Trondheim, 37-50. |

[17] | Gurgenidze, A.T. and Koresh, V.I. (2003) Multiservice Networks and Broadband Services. Science and Engineering, 393-400. |

[18] | Wang, J. (2002) Acquires IP Routing Intelligence. Journaltevyh se-LAN solutions, No. 6, 43-49. |

[19] | Attar, H. (2017) Data Combination over Physical Layer Using Network Coding with PUM Turbo Codes. Journal of Computer and Communications, 5, 32. |

Journals Menu

Copyright © 2021 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.