Reducing Data Transmission Time in SCTP-CMT Protocol using Particle Swarm Optimization Algorithm

Transcription

1 Reducing Data Transmission Time in SCTP-CMT Protocol using Particle Swarm Optimization Algorithm Nabiollah Kiani Kori 1, Mohammad reza Soltan Aghaei 2 1- Department of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Iran nabi_kiani@yahoo.com 2- Esfahan (Khorasgan) Branch, Islamic Azad University, Esfahan, Iran msoltanaghaii@yahoo.com Received: May 2015 Revised: June 2015 Accepted: June 2015 ABSTRACT: Supporting multiple paths for concurrent data transmission is one of the most important features of the SCTP_CMT protocol. Generally, the priority of paths or best main path are not considered in this protocol; only the priority of data and communication currents are taken into account. Thus, choosing the best main path is very important. In this study, a method is introduced for the selection of path with the highest quality of service based on the features of all the lines. Prolonged data transmission time caused by failure to select optimal main path of the SCTP_CMT in dissimilar lines was reduced through the particle swarm optimization algorithm. The results of simulation in OMNET++ and MATLAB environment showed that the data transmission speed to select the main path in the proposed algorithm was decreased. KEYWORDS: Communication Networks, Network Protocols, SCTP_CMT protocol, PSO algorithm, Main path. 1. INTRODUCTION With the advancement of technology and communication networks, human has been facing new challenges every day. Issues such as security, accuracy and speed are the main challenges. The field of computer networks has an important role in the development of digital systems that alters the concepts of accuracy, speed and security operations. The use of computer networks poses many challenges, including how to define a standard and efficient protocol for communication. Several protocols have been presented so far, among which the TCP 1 protocol is the most important and famous one [1]. For more efficient use of the TCP, which enables sending the serial data, a new protocol called the SCTP 2 _CMT 3 was presented [2]. In this protocol, the data can be sent simultaneously using a main path and some alternative paths [3]. Standardization and widespread use of this protocol still remain challenging. In the SCTP_CMT protocol in the current methods, a path is selected as the main path and it is known as the main path up to the last transmission [4]. Ignoring the momentary condition of lines and a dynamic decision-making system with high 1 Transmission Control protocol 2 Stream Control Transmissions Protocol 3 Concurrent Multipath Transfer accuracy can cause mistakes in the selection of main path in the protocol. This can cause a greater failure in data transmission and ultimately increase the data transmission time. In this paper, a method is proposed to select the main path over different optimization iterations using the PSO 4 algorithm. The real-time evaluation of all lines features in the SCTP_CMT protocol helps selecting the optimal path as the main path for data transmission. Moreover, we will review the literature and present the proposed method and simulation technique. Finally, the proposed method in this study is compared with the current methods in the SCTP_CMT protocol [5]. 2. RELATED WORK TCP/IP protocol is the most popular communication protocol in the recent years, which uses one path to send information between the transmitter and receiver. Emerging protocols such as SCTP use different paths to send data that can increase the productivity and efficiency of data transmission. Previous researches have added features such as Multi-Homing and CMT to this communication protocol. To the authors knowledge so far no research has been conducted to solve the challenge of specifying the primary path with 4 Particle swarm Optimization 43

2 the highest QoS 5 based on the characteristics of all the lines in the SCTP_CMT. Generally, random and stable selection of the main path among the concurrent transmission lines of multiple paths has been practiced using the SCTP_CMT protocols. Table1 presents the related literature with regards to the objectives and techniques. Table 1. Literature related to the selection of the main path and sending through multiple paths in the SCTP_CMT Purpose Research Researcher A method for providing high quality services and QoS based on a Cross- Layer path selections scheme. Presenting an algorithm called RAB to select a multi-path data transmission lines. Investigating the effect of lines bandwidth on the performance of retransmission at sending from several concurrent paths in a Wireless Environment. Investigating the challenges of concurrent transmission from multiple dissimilar paths in SCTP_CMT. Providing methods to transmit data from multi-path with minimal bandwidth and latency in computer networks. Asef [6] Jang [7] Qiao [8] Adhari [4] Wang [9] Liu [10] Razzaq [11] The concepts of protocol SCTP_CMT and PSO algorithm will be discussed in sections 2.1 and SCTP_CMT protocol and selection of the main path As mentioned earlier, data transmission from several paths concurrently can be accomplished through the CMT feature in the SCTP protocol. All the available paths are used simultaneously for the data transmission, which is called Load Sharing [5]. Load sharing and parallel concurrent transfer can be done in different ways and at different layers and the transport layer, and the SCTP protocol is the best for this operation. For example, if several active paths exist between two terminals, only one path can be used to transfer data through the TCP protocol [12]. When the SCTP protocol is used for data transmission in a connection that covers all paths, one path is used as the main and the others are used intermittently for re-transmission of the lost data. Finally, in the SCTP_CMT method all paths are used simultaneously when we want to use the SCTP protocol, [13]. 5 Quality of Service In the SCTP protocol, at first a session is created for each type of exchange and a packet is sent by the sender A including the INIT_CHUNK and the receiver B replies with a INIT_ACK [14]. Note that the receiver B does not store information in any case; instead, all the regulatory information in the cookie, called as COOKIE_ECHO, is sent to the receiver B together with the INIT_ACK. At the B receptor side, the cookie is approved and completed by the COOKIE_ACK and sends to the transmitter; the process is called 4-phase handshaking, presented in Fig. 1 [15]. Fig phase handshaking in the SCTP_CMT protocol. In the TCP, whenever the server receives a synchronization message, the TCP is enabled and resources are determined [16]. But in the SCTP, source dedication is delayed until the third packet is received, i.e. until the sender's IP address is specified. There are several challenges for the use of SCTP_CMT. One of the most important challenges is its use for dissimilar lines [17]. In the current method for the SCTP_CMT, main path is determined in the beginning of transmission and all through the process. In real-world data transmission, lines change constantly due to the dissimilarity of their properties and at every moment, one of the lines can be the best to be selected as the main path. In this study, we evaluated the path selection when the lines are dissimilar and introduce a method to select the main path based on the lines condition PSO Algorithm PSO is a heuristic optimization technique working based on the population. The main idea of this method was proposed for the first time in 1995 by James Kennedy and Eberhart that inspired swarm intelligence of fish and birds in search of food [18]. Some of the birds and the fish look for food in a random environment, where there is only one piece of food that none of the birds is aware of exact place but they know their distance to the food. One of the best strategies is to follow the bird that is closer to the food. This theory is the main strategy of the PSO algorithm. In this study, the standard PSO algorithm was used. In the basic algorithm, the bird moves in the search space and every 44

3 particle keeps his best personal experience including speed and position vectors and the whole particle group maintains the best collective experience in every moment [18]. The vector of velocity is updated constantly based on three factors: speed of the previous step, the best personal experience and the collective experience. Then, the position of each particle is updated based on the new speed. Since in this algorithm particles gradually move towards the best driven solution, if this solution is a local optimum, all the particles will move towards it. The standard way to exit from this local optimization is to present the standard PSO algorithm [18]. 3. THE PROPOSED METHOD In this study, a method is proposed based on the PSO algorithm for the selection of the best main path in the SCTP_CMT protocol. In this section, we review and describe the process of design, performance and simulation of the proposed method The operation of the proposed method In the method proposed, at first features like the Delay and Bitrate are collected. Yes Start Selecting the initial characteristics of SCTP_CMT lines as the initial particles population Iteration = 1 Running a cost function and calculation of the fitness to combine the selection of the main path in SCTP_CMT for each particle Checking the lines combination solutions and extraction cost of each solution Creating mutation and production of new particles Cost<0.5 No Iteration = Iteration + 1 Iteration<100 No Choosing the best main path in the SCTP-CMT End Yes the main paths is suggested to the PSO algorithm as the primary particle, and the designed cost function is applied to each of the particles. The findings on the fitness of each particle presented in. Fig. 2 describes how the method works. The best particles are extracted and a mutation is conducted on the particles. Then fitness of each particle is re-evaluated over 100 iterations. If this level of fitness is less than 0.5, the method is terminated and the particle that costs less than 0.5 is selected as optimal for the main path and an alternative in the proposed method. Otherwise, the mutation is performed again and the cycle continues. Then, with respect to the matters described in this section, design and simulation to evaluate the presented method in this research are discussed Simulation of the proposed method The MATLAB software was used for the simulation of the proposed method [19]. Also, the SCTP_CMT was simulated as an example in the simulator software OMNET++ provided by Dreibholz [20]. In order to stimulate the current method, a set of input and output parameters of the method should first be extracted and then, the proposed adjust parameters of the PSO algorithm should be collected. The designed parameters for the selection of the best main path and alternative paths in the SCTP_CMT protocol in the current method are presented in Table 2. Table 2.The most important designed parameters for the proposed method in this study. Populati on Size Particle s Cost Minim al Cost Functio n Optimiza tion Iterations 80 All possibl e paths 0.5 Divisio n of Bitrae per line by Delay per line 100 Iterations After coding and simulation of the proposed method, simulation was performed and discussed. The results for data transmission are shown in Fig. 3. As shown in Fig. 3, the cost of the main path in the proposed PSO method for the SCTP_CMT protocol declines constantly over 100 repetitions in optimization and finally after 100 iterations, the optimal path is selected as the main path. Fig. 2. The main path selection procedure for the SCTP_CMT protocol in the proposed PSO algorithm. Then, some main paths are randomly extracted. Each of 45

4 As shown in Table 3, the paths are different in terms of delay and transfer rates. Data transfer speed in each path should be determined based on the same features and condition. After the extraction of the raw dataset, they are sent to the proposed algorithm and optimization and selection of optimal main path are performed according to what described in Section 3.1. Fig. 3. Optimization cycles of the proposed method by the PSO for the selection of the best main path in the SCTP_CMT protocol. 4. EVALUATION OF THE PROPOSED METHOD In this section, the set of data used to evaluate the proposed model is presented in section 4.1 and the uses of dataset and evaluation procedure are presented in section 4.2. Finally, in sections 4.3 and 4.4 the obtained results are analyzed and evaluated based on the desired metrics and time reduction in the proposed model compared with the Dreibholz method in the SCTP_CMT protocol Extraction of evaluation datasets To evaluate the proposed method, a set of assumptions are considered in this section. The most important assumption in this study is dependent on the data transmission in dissimilar paths. Each path has different transfer rate and delay. Table 3 presents the set of assumptions and data. Table 3. The initial assumptions and datasets to evaluate the proposed method. Path Send Speed (MB/Second) Bitrate (MB) Delay (Second/MB) SCTP_ Client Router1 SCTP_ Client Router1 Router1P{2} Router2 Router1P{3} Router2 Router2 P{2} SCTP_ Server Router2 P{3} SCTP_ Server Description of Evaluation Method Next, the proposed method was simulated in MATLAB. Then, an example of the SCTP_CMT protocol was simulated in the OMNET++ environment, provided by Dreibholz. After the amount of delay and data transmission rates were determined in the Dreibholz method using a 4-phase handshaking in the SCTP_CMT protocol, and computation of the time required for each handshaking, the data transfer time was specified. The size of each chunk in the 4-phase handshaking is presented in Table 4. Table 4. Chunk size for each of the 4-phase handshaking in the SCTP-CMT protocol. Send Phase Size of Chunk (MB) INIT 2 INIT_Ack 3 Cookie_Echo 1 Cookie_Ack 4 Send Data Chunk 10 After performing the Dreibholz method, the features of each line was entered into the proposed method and the main path was determined. Then, the data transfer time was calculated and collected. The results of the data transmission in the example of SCTP_CMT by Dreibholz were compared with the results of data transfer in the simulator through the variations of the proposed method Results of Research Evaluation After running Dreibholz simulation, in this simulation method, the main path is determined and is maintained to the end. The highlighted lines in Fig.4 show the main path considered in this simulation. As shown in Fig.4, using the multi homing property in the SCTP_CMT protocol, there exist several IPs between every two nodes in the simulation and at every moment, one of these IPs can be chosen as the node in the main path. 46

5 Send Time Majlesi Journal of Electrical Engineering Vol. 9, No. 4, December 2015 Fig. 4. The main path considered for the Dreibholz method in the SCTP_CMT protocol. After determining the main path, we calculated the time required for each stage of handshaking. According to the data taken into account in Tables 3 and 4 for each handshaking process, we calculated each column in the Table 5. Table 5. Data transmission time in the Dreibholz method using a 4-phase handshaking. Router SCTP_Clien 1 Router2 t P{2} P{3} Send Phase Router1 Router 2 SCTP_Serve r INIT INIT_Ack Cookie_Ech o Cookie_Ack Send Data Chunk Total Weight It should be noted that the amount of data in each column is in seconds and as shown in Table 5, the 4- phase handshaking time in the Dreibholz method is calculated and presented only for the main path used in this method. To calculate each column in Table 5, the data transfer rate of each line was divided by the delay and then the packet size for each step of handshaking as presented in Table 4 was divided by the results. For example, to calculate the data transmission time from the node in the SCTP_Client to the node in Router1, the transfer rate and delay of this path is first extracted from Table 3 and divided by each other. Then, the packet size for the INIT phase is extracted from Table 4 and is divided by the amount obtained in the previous step and the result is considered as the time required to send the INIT packet from path SCTP_Client to on Router1 in seconds. The proposed method is then implemented in MATLAB and the main path of the proposed method is extracted. In this example, the path is marked with bold lines in Fig.5. Fig. 5. The main path considered in the proposed method in the SCTP_CMT protocol. To calculate the data transfer time in the proposed method for the 4-phase handshaking, a procedure similar to the Dreibholz is followed, the results of which are presented in Table 6. Table 6. Data transmission time in the proposed method using a 4-phase handshaking. SCTP_Client Router1 Router2 P{3} P{2} Send Phase Router1 Router2 SCTP_Server INIT INIT_Ack Cookie_Echo Cookie_Ack Send Data Chunk Total Weight Analysis of Evaluation Results According to the results obtained in the previous section, total time of data transmission for each stage of handshaking in the example for the proposed method and Dreibholz method was calculated and provided in Fig Send Phase Proposed PSO Method Dreibholz Method Fig. 6. The total time of data transfer for each stage of the 4-phase handshaking for the proposed method in comparison to the Dreibholz method. As shown in Fig. 6, the data transmission time in the example for all stages of the handshaking in the SCTP_CMT protocol is lower compared with the method provided by Dreibholz. Lower time of data transmission in each stage can be interpreted as a 47

6 Send Phase Majlesi Journal of Electrical Engineering Vol. 9, No. 4, December 2015 reduction in the total time of data transmission using the proposed method. Figure 7 shows the total time for data transmission in the proposed method, which is presented and evaluated in comparison to the Dreibholz method Proposed PSO Method Dreibholz Method Methods Send Data Chunk Cookie_Ack Cookie_Echo INIT_Ack INIT Fig. 7. The total time of data transmission for the proposed method in the comparison to the Dreibholz method. The total time of data transmission in the proposed method is seconds, which we could reduce it to seconds using the proposed PSO algorithm to select the main path in the SCTP_CMT protocol. Reducing the time of data transmission in the SCTP_CMT protocol results in the increasing the data transmission speed. It will be one of the important challenges for the standardization and service quality improvement in this protocol in the coming years. Finally, it should be noted that the presented method was only has been run in this study once. Due to the indeterminate response in the optimization algorithms and the particle swarm algorithm, it is anticipated if it be run for several times, the proposed main path may change and require reconsideration. 5. CONCLUSIONS AND FUTURE WORK As mentioned earlier, in the SCTP_CMT protocol, a line is selected as the main path for transmission through multiple simultaneous paths and the other lines act as alternate paths. In the proposed method of this article, the PSO optimization algorithm receives the elementary characteristics of all the lines as input and selects the best main path through optimization operations. The proposed method was simulated in MATLAB. A standard example of Dreibholz SCTP_CMT protocol was also implemented in the OMNET++ simulator environment. The evaluation datasets of the mentioned method were extracted from the simulation of SCTP_CMT example and were sent as input to the proposed method. The evaluation results indicate that the method introduced in this study may reduce the data transmission time compared with the current method of main path selection in the SCTP_CMT protocol. In future studies, concepts such as data mining and other optimization algorithms can be used to provide combination of methods for selection of the main path. REFERENCES [1] Allman, M., Paxson, V. and Stevens, W., TCP congestion control, RFC2581, IETF,Apr [2] Natarajan, P., Ekiz, N., Amer, P., Stewart., R., CMT using SCTP multihoming: transmission policies using a potentially-failed destination state, TR 2 CIS Dept, U of Delaware,2007. [3] Adhari, H., Dreibholz, T., Becke, M. and Rathgeb, E., Evaluation of Concurrent Multipath Transfer over Dissimilar Paths.pdf, [4] Adhari, H.; Dreibholz, T.; Becke, M.; Rathgeb, E. P.; Tuxen, M., Evaluation of Concurrent Multipath Transfer over Dissimilar Paths, Advanced Information Networking and Applications (WAINA), 2011 IEEE Workshops of International Conference on, Vol., No., pp.708,714, March [5] Becke, M., Dreibholz, T., Iyengar, J., Natarajan, P. and T uxen, M., Load sharing for the stream control transmission protocol (sctp), IETF, Network Working Group, Internet-Draft Version 00, July [6] Asefi, M., Mark, J.W., Shen, X, A Cross-Layer Path Selection Scheme for Video Streaming over Vehicular Ad Hoc Networks, in Proceedings of IEEE Vehicular Technology Conference Fall, pp. 1-5, [7] Jang, C., Lee, J, Path Selection Algorithms for Multi-Hop VANETs, in Proceedings of IEEE Vehicular Technology Conference Fall (VTC Fall), pp.1-5, [8] Qiao, Y., et.al., Path selection of SCTP fast retransmission in multi-homed wireless environments, [9] Wang, Y., Li, H., Li, F., et al, RPS: Range-based Path Selection Method for Concurrent Multipath Transfer, in Proceedings of the 6th ACM International Wireless Communications and Mobile Computing Conference, pp , [10] Liu, J., Bai, X., Wang, X, The Strategy for Transmission Path Selection in Concurrent Multipath Transfer, Journal of Electronics & Information Technology,Vol. 34, No. 6, [11] Razzaq, A., Mehaoua, A, Video transport over VANETs: "Multi-stream coding with multi-path and network coding, in Proceedings of the IEEE Conference on Local Computer Networks (LCN 10), pp , [12] Bohacek, S., Hespanha, J. P., Lee, J., Lim, C. and Obraczka, K., TCP-PR: TCP for persistent packet reorderin, in IEEE ICDCS 2003, Rhode Island, May [13] Dreibholz, T., Becke, M., Pulinthanath, J. and Rathgeb, E. P., Applying tcp-friendly congestion control to concurrent multipath transfer, Proceedings of the 24th IEEE International Conference on Advanced Information Networking 48

7 and Applications (AINA), pp , ISSN X, Apr [14] Ford, B., Structured streams: a new transport abstraction, SIGCOMM Comput. Commun. Rev., Vol. 37, No. 4, pp , [15] Stewart, R., Rodriguez, I., Poon, K., Caro, A. and Tuexen, M., Stream control transmission protocol (sctp) specification errata and issues, draft-ietf-tsvwg-sctpimpguide-16.txt, Oct [16] Dunigan, T., Mathis, M. and Tierney, B., A TCP Tuning Deamon, in Supercomputing, Nov [17] Dreibholz, T., Becke, M., Rathgeb, E.P., Txen, M, On the use of concurrent multipath transfer over asymmetric paths, GLOBECOM, IEEE Global Telecommunications Conference,Vol.6, No. 10, pp. 1-6, Dec [18] Prasad, R., Particle swarm optimization in the fine-tuning of fuzzy software cost estimation models, International Journal of Software Engineering (IJSE),Vol. 1, No. 2, [19] Higham, D. J., Higham, N. J., MATLAB Guide, To be published by SIAM, ISBN , [20] Dreibholz, T., Becke, M., Pulinthanath, J. and Rathgeb, E. P., Implementation and evaluation of concurrent multipath transfer for sctp in the inet framework, in Proceedings of the 3rd ACM/ICST International Workshop on OMNeT++, ISBN , Mar