MPTCP is proposed by IETF working group, it allows a single TCP stream to be split across multiple
paths. It has obvious benefits in performance and reliability. MPTCP has implemented in Linux-based
distributions that can be compiled and installed to be used for both real and experimental scenarios. In this
article, we provide performance analyses for MPTCP with a laptop connected to WiFi access point and 3G
cellular network at the same time. We prove experimentally that MPTCP outperforms regular TCP for
WiFi or 3G interfaces. We also compare four types of congestion control algorithms for MPTCP that are
also implemented in the Linux Kernel. Results show that Alias Linked Increase Congestion Control
algorithm outperforms the others in the normal traffic load while Balanced Linked Adaptation algorithm
outperforms the rest when the paths are shared with heavy traffic, which is not supported by MPTCP.
PERFORMANCE EVALUATION OF SELECTED E2E TCP CONGESTION CONTROL MECHANISM OVER ...ijwmn
TCP is one of the main protocols that govern the Internet traffic nowadays. However, it suffers significant
performance degradation over wireless links. Since wireless networks are leading the communication
technologies recently, it is imperative to introduce effective solutions for the TCP congestion control
mechanisms over such networks. In this research four End-to-End TCP implementations are discussed,
they are TCP Westwood, Hybla, Highspeed, and NewReno. The performance of these variants is compared
using LTE emulated environment in terms of throughput, delay, and fairness. Ns-3 simulator is used to
simulate the LTE networks environment. The simulation results showed that TCP Highspeed achieves the
best throughput results. Although TCP Westwood recorded the lowest latency values comparing to others,
it behaved unfairly among different traffic flows. Moreover, TCP Hybla demonstrated the best fairness
behaviour among other TCP variants
IMPACT OF CONTENTION WINDOW ON CONGESTION CONTROL ALGORITHMS FOR WIRELESS ADH...cscpconf
TCP congestion control mechanism is highly dependent on MAC layer Backoff algorithms that
predict the optimal Contention Window size to increase the TCP performance in wireless adhoc
network. This paper critically examines the impact of Contention Window in TCP congestion
control approaches. The modified TCP congestion control method gives the stability of
congestion window which provides higher throughput and shorter delay than the traditional TCP. Various Backoff algorithms that are used to adjust Contention Window are simulatedusing NS2 along with modified TCP and their performance are analyzed to depict the influence of Contention Window in TCP performance considering the metrics such as throughput, delay, packet loss and end-to-end delay
Recital Study of Various Congestion Control Protocols in wireless networkiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Improving Performance of TCP in Wireless Environment using TCP-PIDES Editor
Improving the performance of the transmission
control protocol (TCP) in wireless environment has been an
active research area. Main reason behind performance
degradation of TCP is not having ability to detect actual reason
of packet losses in wireless environment. In this paper, we are
providing a simulation results for TCP-P (TCP-Performance).
TCP-P is intelligent protocol in wireless environment which
is able to distinguish actual reasons for packet losses and
applies an appropriate solution to packet loss.
TCP-P deals with main three issues, Congestion in
network, Disconnection in network and random packet losses.
TCP-P consists of Congestion avoidance algorithm and
Disconnection detection algorithm with some changes in TCP
header part. If congestion is occurring in network then
congestion avoidance algorithm is applied. In congestion
avoidance algorithm, TCP-P calculates number of sending
packets and receiving acknowledgements and accordingly set
a sending buffer value, so that it can prevent system from
happening congestion. In disconnection detection algorithm,
TCP-P senses medium continuously to detect a happening
disconnection in network. TCP-P modifies header of TCP
packet so that loss packet can itself notify sender that it is
lost.This paper describes the design of TCP-P, and presents
results from experiments using the NS-2 network simulator.
Results from simulations show that TCP-P is 4% more
efficient than TCP-Tahoe, 5% more efficient than TCP-Vegas,
7% more efficient than TCP-Sack and equally efficient in
performance as of TCP-Reno and TCP-New Reno. But we can
say TCP-P is more efficient than TCP-Reno and TCP-New
Reno since it is able to solve more issues of TCP in wireless
environment.
Differentiated Classes of Service and Flow Management using An Hybrid Broker1IDES Editor
Recently, mobile networks have been overloaded
with a considerable amount of data traffic. The current paper
proposes a management service for mobile environments,
using policies and quality metrics, which ensure a better usage
of network resources with a more fine-grained management
based on flows with different classes of service and
transmission rates. This management of flows is supported
through a closed innovative control loop among a flexible
brokerage service in the network, and agents at the mobile
terminals. It also allows the terminals to make well-informed
decisions about their connections to enhance the number of
connected flows per technology and the individual service level
offered to each flow. Our results indicate that the proposed
solution optimizes the usage of available 4G network resources
among a high number of differentiated flows in several
scenarios where access technologies are extremely overloaded
whilst protecting, through a low complexity scheme, the flows
associated to users that have celebrated more expensive
contracts with their network operators.
PERFORMANCE EVALUATION OF SELECTED E2E TCP CONGESTION CONTROL MECHANISM OVER ...ijwmn
TCP is one of the main protocols that govern the Internet traffic nowadays. However, it suffers significant
performance degradation over wireless links. Since wireless networks are leading the communication
technologies recently, it is imperative to introduce effective solutions for the TCP congestion control
mechanisms over such networks. In this research four End-to-End TCP implementations are discussed,
they are TCP Westwood, Hybla, Highspeed, and NewReno. The performance of these variants is compared
using LTE emulated environment in terms of throughput, delay, and fairness. Ns-3 simulator is used to
simulate the LTE networks environment. The simulation results showed that TCP Highspeed achieves the
best throughput results. Although TCP Westwood recorded the lowest latency values comparing to others,
it behaved unfairly among different traffic flows. Moreover, TCP Hybla demonstrated the best fairness
behaviour among other TCP variants
IMPACT OF CONTENTION WINDOW ON CONGESTION CONTROL ALGORITHMS FOR WIRELESS ADH...cscpconf
TCP congestion control mechanism is highly dependent on MAC layer Backoff algorithms that
predict the optimal Contention Window size to increase the TCP performance in wireless adhoc
network. This paper critically examines the impact of Contention Window in TCP congestion
control approaches. The modified TCP congestion control method gives the stability of
congestion window which provides higher throughput and shorter delay than the traditional TCP. Various Backoff algorithms that are used to adjust Contention Window are simulatedusing NS2 along with modified TCP and their performance are analyzed to depict the influence of Contention Window in TCP performance considering the metrics such as throughput, delay, packet loss and end-to-end delay
Recital Study of Various Congestion Control Protocols in wireless networkiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Improving Performance of TCP in Wireless Environment using TCP-PIDES Editor
Improving the performance of the transmission
control protocol (TCP) in wireless environment has been an
active research area. Main reason behind performance
degradation of TCP is not having ability to detect actual reason
of packet losses in wireless environment. In this paper, we are
providing a simulation results for TCP-P (TCP-Performance).
TCP-P is intelligent protocol in wireless environment which
is able to distinguish actual reasons for packet losses and
applies an appropriate solution to packet loss.
TCP-P deals with main three issues, Congestion in
network, Disconnection in network and random packet losses.
TCP-P consists of Congestion avoidance algorithm and
Disconnection detection algorithm with some changes in TCP
header part. If congestion is occurring in network then
congestion avoidance algorithm is applied. In congestion
avoidance algorithm, TCP-P calculates number of sending
packets and receiving acknowledgements and accordingly set
a sending buffer value, so that it can prevent system from
happening congestion. In disconnection detection algorithm,
TCP-P senses medium continuously to detect a happening
disconnection in network. TCP-P modifies header of TCP
packet so that loss packet can itself notify sender that it is
lost.This paper describes the design of TCP-P, and presents
results from experiments using the NS-2 network simulator.
Results from simulations show that TCP-P is 4% more
efficient than TCP-Tahoe, 5% more efficient than TCP-Vegas,
7% more efficient than TCP-Sack and equally efficient in
performance as of TCP-Reno and TCP-New Reno. But we can
say TCP-P is more efficient than TCP-Reno and TCP-New
Reno since it is able to solve more issues of TCP in wireless
environment.
Differentiated Classes of Service and Flow Management using An Hybrid Broker1IDES Editor
Recently, mobile networks have been overloaded
with a considerable amount of data traffic. The current paper
proposes a management service for mobile environments,
using policies and quality metrics, which ensure a better usage
of network resources with a more fine-grained management
based on flows with different classes of service and
transmission rates. This management of flows is supported
through a closed innovative control loop among a flexible
brokerage service in the network, and agents at the mobile
terminals. It also allows the terminals to make well-informed
decisions about their connections to enhance the number of
connected flows per technology and the individual service level
offered to each flow. Our results indicate that the proposed
solution optimizes the usage of available 4G network resources
among a high number of differentiated flows in several
scenarios where access technologies are extremely overloaded
whilst protecting, through a low complexity scheme, the flows
associated to users that have celebrated more expensive
contracts with their network operators.
Design, implementation and evaluation of icmp based available network bandwid...IJCNCJournal
We propose a method to measure available network ba
ndwidth using the Internet Control Message
Protocol (ICMP). The recently proposed ImTCP techni
que uses Transmission Control Protocol (TCP) data
packets and the corresponding acknowledgement respo
nses to measure the available bandwidth between
sender and receiver. Since ImTCP needs to change th
e sender’s TCP implementation, it needs
modifications to sender’s operating system kernel.
Moreover, ImTCP cannot measure available bandwidth
accurately if the receiver sends delayed acknowledg
ments. These problems stem from the use of TCP. In
this paper, we discuss an ICMP-based method that ov
ercomes these limitations. We evaluate the
performance of the proposed method in an experiment
al network and show that it generates less
measurement traffic and requires less time for band
width measurement than PathLoad. We also show that
proposed method can measure the available bandwidth
even if the bandwidth changes during
measurement
Implementing True Zero Cycle Branching in Scalar and Superscalar Pipelined Pr...IDES Editor
In this paper, we have proposed a novel architectural
technique which can be used to boost performance of modern
day processors. It is especially useful in certain code constructs
like small loops and try-catch blocks. The technique is aimed
at improving performance by reducing the number of
instructions that need to enter the pipeline itself. We also
demonstrate its working in a scalar pipelined soft-core
processor developed by us. Lastly, we present how a superscalar
microprocessor can take advantage of this technique and
increase its performance.
Design A Congestion Aware Routing Algorithm for Synchronous Cam Designijtsrd
The effect of process variation (PV) on delay is a major reason to decay the performance in advanced technologies. The performance of front routing algorithms is determined with or without PV for different traffic patterns. The saturation throughput and average message delay are used as performance metrics to evaluate the throughput. PV decreases the saturation throughput and increases the average message delay. Adaptive routing algorithm should be manipulated with the PV. A novel PV delay and congestion aware routing (PDCR) algorithm is presented for asynchronous network-on-chip (NOC) design. The routing algorithm performs various adaptive routing algorithms in the average delay and saturation throughput for different traffic patterns. A low-power content-addressable memory (CAM) by a new algorithm is proposed for associativity between the input tag and the corresponding address of the output data. The proposed architecture is depends on a recently developed sparse clustered network by utilizing binary connections that on-average eliminates most of the parallel comparisons performed during a search. P. Mounica | R. Umamaheswari | R. Madhavi | R. Nischala | N. Ramesh Babu"Design A Congestion Aware Routing Algorithm for Synchronous Cam Design" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11547.pdf http://www.ijtsrd.com/engineering/electronics-and-communication-engineering/11547/design-a-congestion-aware-routing-algorithm-for-synchronous-cam-design/p-mounica
RED: A HIGH LINK UTILIZATION AND FAIR ALGORITHMEditor IJCATR
Internet and its applications are an integral part of our daily life .These days they are widely used for various purposes such as
communication, public services, entertainments, distant educations, etc., each possessing different quality of service (QoS) requirements.
How to provide finer congestion control for network emerges as a major problem. To prevent the problem of congestion control and
synchronization various active queue management (AQM) techniques are used. AQM algorithms execute on network routers and detect
initial congestion by monitoring some functions. When congestion occurs on the link the AQM algorithms detects and provides signals to
the end systems. Various algorithms have been proposed in recent years but RED is one of the most influential techniques among all the
existing ones. This review paper provides the functioning mechanism of the RED technique with the help of its algorithm & its variants
Throughput and Handover Latency Evaluation for Multicast Proxy Mobile IPV6journalBEEI
The objective of this paper is to present performance analysis of a new enhanced mobile multicast network mobility management scheme. The initial developed network mobility management called Proxy Mobile IPv6 (PMIPv6) is based on unicast network support. This paper enabled multicast support in network mobility management and named it as MPMIPv6. Additionally this enhancement also provides better network performance with the new context transfer operations and fast reroute operations. In brief, this paper also describes other current mobile multicast schemes. The new scheme is evaluated using mathematical analysis and NS3.19 simulator. Theoretically this scheme reduces service recovery time, total signalling cost, handover latency, and packet loss for multicast communication. However for this paper, the analysed parameters are throughput and handover latency. Both mathematical and simulation results exhibit better network performance for multicast environment compared to the standard benchmark scheme.
ETFRC: Enhanced TFRC for Media Traffic over InternetCSCJournals
The evident increase in media traffic over Internet is expected to worsen its congestion state. TCP-friendly rate control protocol TFRC is one of the most promising congestion control techniques developed so far. TFRC has been thoroughly tested in terms of being TCP-friendly, responsive, and fair. Yet, its impact on the visual quality and the peak signal-to- noise ratio PSNR of the media traffic traversing Internet is still questionable. In this paper we aimed to point out the enhancements required for TFRC that enables producing the maximum PSNR value for Internet media traffic. Firstly, we suspected the default value of n that represents the number of loss intervals used in calculating the loss event rate in the TFRC equation. This value is recommended to be set to 8 according to the latest RFC of TFRC. We investigated the effect of modifying the TFRC mechanism on the resulting PSNR of the transmitted video over Internet using TFRC via switching n across the values from 2 to 16. We investigated the effect of such variation over a simulated network environment to study its effect on the resulting PSNR for a number of arbitrary video sequences. Our simulations results showed that running TFRC with n=11 led to reaching the maximum PSNR values among all the examined values of n including its default value. Secondly, we tested the impact on the PSNR of another modification in the TFRC mechanism via switching both values of n and Nfb which is frequency of feedback messages sent by TFRC receiver to its sender every round-trip time RTT. The default value of Nfb is 1; hence we scanned every possible combination of n and Nfb ranging from 2 to 16, and from 1 to 4, respectively and recorded the produced PSNR. It was obvious that several other combinations of n and Nfb produced higher PSNR values other than their default values in the request for comment RFC of TFRC. We hereby suggest using an enhanced TFRC that we abbreviated as ETFRC which has the values of n and Nfb value set to 4 and 11 respectively as a replacement for the traditional TFRC to enable reaching higher PSNR for media traffic over Internet.
ADAPTIVE HANDOVER HYSTERESIS AND CALL ADMISSION CONTROL FOR MOBILE RELAY NODESIJCNCJournal
The aim of equipping a wireless network with a mobile relay node is to support broadband wireless communications for vehicular users and their devices. The high mobility of vehicular users, possibly at a very high velocity in the area in which two cells overlap, could cause the network to suffer from a reduced handover success rate and, hence, increased radio link failure. The combined impact of these problems is service interruptions to vehicular users. Thus, the handover schemes are crucial in solving these problems. In this work, we first present the adaptive handover hysteresis scheme for the wireless network with mobile relay nodes in the high-speed train scenario. Specifically, our proposed adaptive hysteresis scheme is based on the velocity of the train. Second, the handover call dropping probability is reduced by introducing a modified call admission control scheme to support radio resource reservation for handover calls that prioritizes handover calls of mobile relay over the other calls. The proposed solution in which adaptive parameter is combined with call admission control is evaluated by system level simulation. Our simulation results illustrate an increased handover success rate and reduced radio link failures.
HIDING A MESSAGE IN MP3 USING LSB WITH 1, 2, 3 AND 4 BITSIJCNCJournal
Steganography is the art of hiding information in ways that prevent the detection of hidden messages. This
paper presentsa new method which randomly selects position in MP3 file to hide a text secret messageby
using Least Significant Bit (LSB) technique. The text secret message isused in start and ends locations a
unique signature or key.The methodology focuses to embed one bit, two bits, three bitsor four bits from
secret message into MP3 file by using LSB techniques. The evaluation and performancemethods are based
on robustness (BER and correlation), Imperceptibility (PSNR) and hiding capacity (Ratio between Sizes of
text message and MP3 Cover) indicators.The experimental results show the new method is more security.
Moreover the contribution of this paper is the provision of a robustness-based classification of LSB
steganography models depending on their occurrence in the embedding position.
PERFORMANCE ANALYSIS OF THE LINK-ADAPTIVE COOPERATIVE AMPLIFY-AND-FORWARD REL...IJCNCJournal
This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks that
employ adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift keying (M-PSK)
digital modulation techniques in Nakagami-m fading channel. In particular, we present and compared the
analysis of CAF relay networks with different cooperative diversity and opportunistic routing strategies
such as regular Maximal Ratio Combining (MRC), Selection Diversity Combining (SDC), Opportunistic
Relay Selection with Maximal Ratio Combining (ORS-MRC) and Opportunistic Relay Selection with
Selection Diversity Combining (ORS-SDC). We advocate a simple yet unified numerical approach based on
the marginal moment generating function (MGF) of the total received SNR to compute the average symbol
error rate (ASER), mean achievable spectral efficiency, and outage probability performance metrics.
Design, implementation and evaluation of icmp based available network bandwid...IJCNCJournal
We propose a method to measure available network ba
ndwidth using the Internet Control Message
Protocol (ICMP). The recently proposed ImTCP techni
que uses Transmission Control Protocol (TCP) data
packets and the corresponding acknowledgement respo
nses to measure the available bandwidth between
sender and receiver. Since ImTCP needs to change th
e sender’s TCP implementation, it needs
modifications to sender’s operating system kernel.
Moreover, ImTCP cannot measure available bandwidth
accurately if the receiver sends delayed acknowledg
ments. These problems stem from the use of TCP. In
this paper, we discuss an ICMP-based method that ov
ercomes these limitations. We evaluate the
performance of the proposed method in an experiment
al network and show that it generates less
measurement traffic and requires less time for band
width measurement than PathLoad. We also show that
proposed method can measure the available bandwidth
even if the bandwidth changes during
measurement
Implementing True Zero Cycle Branching in Scalar and Superscalar Pipelined Pr...IDES Editor
In this paper, we have proposed a novel architectural
technique which can be used to boost performance of modern
day processors. It is especially useful in certain code constructs
like small loops and try-catch blocks. The technique is aimed
at improving performance by reducing the number of
instructions that need to enter the pipeline itself. We also
demonstrate its working in a scalar pipelined soft-core
processor developed by us. Lastly, we present how a superscalar
microprocessor can take advantage of this technique and
increase its performance.
Design A Congestion Aware Routing Algorithm for Synchronous Cam Designijtsrd
The effect of process variation (PV) on delay is a major reason to decay the performance in advanced technologies. The performance of front routing algorithms is determined with or without PV for different traffic patterns. The saturation throughput and average message delay are used as performance metrics to evaluate the throughput. PV decreases the saturation throughput and increases the average message delay. Adaptive routing algorithm should be manipulated with the PV. A novel PV delay and congestion aware routing (PDCR) algorithm is presented for asynchronous network-on-chip (NOC) design. The routing algorithm performs various adaptive routing algorithms in the average delay and saturation throughput for different traffic patterns. A low-power content-addressable memory (CAM) by a new algorithm is proposed for associativity between the input tag and the corresponding address of the output data. The proposed architecture is depends on a recently developed sparse clustered network by utilizing binary connections that on-average eliminates most of the parallel comparisons performed during a search. P. Mounica | R. Umamaheswari | R. Madhavi | R. Nischala | N. Ramesh Babu"Design A Congestion Aware Routing Algorithm for Synchronous Cam Design" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11547.pdf http://www.ijtsrd.com/engineering/electronics-and-communication-engineering/11547/design-a-congestion-aware-routing-algorithm-for-synchronous-cam-design/p-mounica
RED: A HIGH LINK UTILIZATION AND FAIR ALGORITHMEditor IJCATR
Internet and its applications are an integral part of our daily life .These days they are widely used for various purposes such as
communication, public services, entertainments, distant educations, etc., each possessing different quality of service (QoS) requirements.
How to provide finer congestion control for network emerges as a major problem. To prevent the problem of congestion control and
synchronization various active queue management (AQM) techniques are used. AQM algorithms execute on network routers and detect
initial congestion by monitoring some functions. When congestion occurs on the link the AQM algorithms detects and provides signals to
the end systems. Various algorithms have been proposed in recent years but RED is one of the most influential techniques among all the
existing ones. This review paper provides the functioning mechanism of the RED technique with the help of its algorithm & its variants
Throughput and Handover Latency Evaluation for Multicast Proxy Mobile IPV6journalBEEI
The objective of this paper is to present performance analysis of a new enhanced mobile multicast network mobility management scheme. The initial developed network mobility management called Proxy Mobile IPv6 (PMIPv6) is based on unicast network support. This paper enabled multicast support in network mobility management and named it as MPMIPv6. Additionally this enhancement also provides better network performance with the new context transfer operations and fast reroute operations. In brief, this paper also describes other current mobile multicast schemes. The new scheme is evaluated using mathematical analysis and NS3.19 simulator. Theoretically this scheme reduces service recovery time, total signalling cost, handover latency, and packet loss for multicast communication. However for this paper, the analysed parameters are throughput and handover latency. Both mathematical and simulation results exhibit better network performance for multicast environment compared to the standard benchmark scheme.
ETFRC: Enhanced TFRC for Media Traffic over InternetCSCJournals
The evident increase in media traffic over Internet is expected to worsen its congestion state. TCP-friendly rate control protocol TFRC is one of the most promising congestion control techniques developed so far. TFRC has been thoroughly tested in terms of being TCP-friendly, responsive, and fair. Yet, its impact on the visual quality and the peak signal-to- noise ratio PSNR of the media traffic traversing Internet is still questionable. In this paper we aimed to point out the enhancements required for TFRC that enables producing the maximum PSNR value for Internet media traffic. Firstly, we suspected the default value of n that represents the number of loss intervals used in calculating the loss event rate in the TFRC equation. This value is recommended to be set to 8 according to the latest RFC of TFRC. We investigated the effect of modifying the TFRC mechanism on the resulting PSNR of the transmitted video over Internet using TFRC via switching n across the values from 2 to 16. We investigated the effect of such variation over a simulated network environment to study its effect on the resulting PSNR for a number of arbitrary video sequences. Our simulations results showed that running TFRC with n=11 led to reaching the maximum PSNR values among all the examined values of n including its default value. Secondly, we tested the impact on the PSNR of another modification in the TFRC mechanism via switching both values of n and Nfb which is frequency of feedback messages sent by TFRC receiver to its sender every round-trip time RTT. The default value of Nfb is 1; hence we scanned every possible combination of n and Nfb ranging from 2 to 16, and from 1 to 4, respectively and recorded the produced PSNR. It was obvious that several other combinations of n and Nfb produced higher PSNR values other than their default values in the request for comment RFC of TFRC. We hereby suggest using an enhanced TFRC that we abbreviated as ETFRC which has the values of n and Nfb value set to 4 and 11 respectively as a replacement for the traditional TFRC to enable reaching higher PSNR for media traffic over Internet.
ADAPTIVE HANDOVER HYSTERESIS AND CALL ADMISSION CONTROL FOR MOBILE RELAY NODESIJCNCJournal
The aim of equipping a wireless network with a mobile relay node is to support broadband wireless communications for vehicular users and their devices. The high mobility of vehicular users, possibly at a very high velocity in the area in which two cells overlap, could cause the network to suffer from a reduced handover success rate and, hence, increased radio link failure. The combined impact of these problems is service interruptions to vehicular users. Thus, the handover schemes are crucial in solving these problems. In this work, we first present the adaptive handover hysteresis scheme for the wireless network with mobile relay nodes in the high-speed train scenario. Specifically, our proposed adaptive hysteresis scheme is based on the velocity of the train. Second, the handover call dropping probability is reduced by introducing a modified call admission control scheme to support radio resource reservation for handover calls that prioritizes handover calls of mobile relay over the other calls. The proposed solution in which adaptive parameter is combined with call admission control is evaluated by system level simulation. Our simulation results illustrate an increased handover success rate and reduced radio link failures.
HIDING A MESSAGE IN MP3 USING LSB WITH 1, 2, 3 AND 4 BITSIJCNCJournal
Steganography is the art of hiding information in ways that prevent the detection of hidden messages. This
paper presentsa new method which randomly selects position in MP3 file to hide a text secret messageby
using Least Significant Bit (LSB) technique. The text secret message isused in start and ends locations a
unique signature or key.The methodology focuses to embed one bit, two bits, three bitsor four bits from
secret message into MP3 file by using LSB techniques. The evaluation and performancemethods are based
on robustness (BER and correlation), Imperceptibility (PSNR) and hiding capacity (Ratio between Sizes of
text message and MP3 Cover) indicators.The experimental results show the new method is more security.
Moreover the contribution of this paper is the provision of a robustness-based classification of LSB
steganography models depending on their occurrence in the embedding position.
PERFORMANCE ANALYSIS OF THE LINK-ADAPTIVE COOPERATIVE AMPLIFY-AND-FORWARD REL...IJCNCJournal
This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks that
employ adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift keying (M-PSK)
digital modulation techniques in Nakagami-m fading channel. In particular, we present and compared the
analysis of CAF relay networks with different cooperative diversity and opportunistic routing strategies
such as regular Maximal Ratio Combining (MRC), Selection Diversity Combining (SDC), Opportunistic
Relay Selection with Maximal Ratio Combining (ORS-MRC) and Opportunistic Relay Selection with
Selection Diversity Combining (ORS-SDC). We advocate a simple yet unified numerical approach based on
the marginal moment generating function (MGF) of the total received SNR to compute the average symbol
error rate (ASER), mean achievable spectral efficiency, and outage probability performance metrics.
Using spectral radius ratio for node degreeIJCNCJournal
In this paper, we show that the spectral radius ratio for node degree could be used to analyze the variation of node degree during the evolution of complex networks. We focus on three commonly studied models of complex networks: random networks, scale-free networks and small-world networks. The spectral radius ratio for node degree is defined as the ratio of the principal (largest) eigenvalue of the adjacency matrix of a network graph to that of the average node degree. During the evolution of each of the above three categories of networks (using the appropriate evolution model for each category), we observe the spectral radius ratio for node degree to exhibit high-very high positive correlation (0.75 or above) to that of the
coefficient of variation of node degree (ratio of the standard deviation of node degree and average node degree). We show that the spectral radius ratio for node degree could be used as the basis to tune the operating parameters of the evolution models for each of the three categories of complex networks as well as analyze the impact of specific operating parameters for each model.
Sensor nodes are highly mobile, which makes the application running on them face network related problems like node failure, link failure, network level disconnection, scarcity of resources etc. Node failure and Network fault are need to be monitored continuously by supervising the network status especially for critical applications like Health Monitoring System. We propose Node Monitoring protocol (NMP) to monitor the node good conditions using agents and ensure that node gets promised quality of service. These Nodes senses environment and communicates important data to the sink or base station. To establish the correct event time, these nodes need to be synchronized with global clock. Therefore, time synchronization is very important parameter. We have built a simulating environment for Validating Node Monitoring Protocol (NMP) to assess the reliability of Health Monitoring systems. Formal Specification and Description Language tool (SDL) has been used to validate the NMP at design time in order to increase the confidence and efficiency of the system.
On the approximation of the sum of lognormals by a log skew normal distributionIJCNCJournal
Several methods have been proposed to approximate the sum of lognormal RVs. However the accuracy of each method relies highly on the region of the resulting distribution being examined, and the individual lognormal parameters, i.e., mean and variance. There is no such method which can provide the needed accuracy for all cases. This paper propose a universal yet very simple approximation method for the sum of Lognormals based on log skew normal approximation. The main contribution on this work is to propose an analytical method for log skew normal parameters estimation. The proposed method provides highly accurate approximation to the sum of lognormal distributions over the whole range of dB spreads for any correlation coefficient. Simulation results show that our method outperforms all previously proposed methods and provides an accuracy within 0.01 dB for all cases.
Maximizing network interruption in wirelessIJCNCJournal
With the colossal growth of wireless sensor networks (WSNs) in different applications starting from home
automation to military affairs, the pressure on ensuring security in such a network is paramount.
Considering the security challenges, it is really a hard-hitting effort to develop a secured WSN system.
Moreover, as the information technology is getting popular, the intruders are also planning new ideas to
break the system security, to harm the network and to make the system quality down with the target of
taking the control of the network to corrupt it or to get benefits from it anyway. The intruders corrupt the
system only when the security breaking cost (SBC) is lower compared with the benefits they attained or the
harm it can make to others. In this paper, the authors define the term “maximizing network interruption
problem” and propose a technique, called the grid point approximation algorithm, to estimate the SBC of a
multi-hop WSN so that it can be made tougher for an intruder to break the system security. It is assumed
that the intruder has the complete picture of the entire network. The technique is designed from the
intruder’s point of view for completely jamming all the sensor nodes in the network through placing
jammers or malicious nodes strategically and at the same time keeping the number of jammer nodes to
minimum or near minimum. To the best of the authors’ knowledge, there is no work proposed so far of the
same kind. Experimental results with the changes of the different network parameters show that the
proposed algorithm is able to provide excellent performances to achieve the targets.
A NOVEL METHOD TO TEST DEPENDABLE COMPOSED SERVICE COMPONENTSIJCNCJournal
Assessing Web service systems performance and their dependability are crucial for the development of
today’s applications. Testing the performance and Fault Tolerance Mechanisms (FTMs) of composed
service components is hard to be measured at design time due to service instability is often caused by the
nature of the network conditions. Using a real internet environment for testing systems is difficult to set up
and control. We have introduced a fault injection toolkit that emulates a WAN within a LAN environment
between composed service components and offers full control over the emulated environment in addition to
the capability to inject network-related faults and application specific faults. The toolkit also generates
background workloads on the system under test so as to produce more realistic results. We describe an
experiment that has been performed to examine the impact of fault tolerance protocols deployed at a
service client by using our toolkit system.
PERFORMANCE EVALUATION OF WIRELESS SENSOR NETWORK UNDER HELLO FLOOD ATTACKIJCNCJournal
Wireless sensor network (WSN) is highly used in many fields. The network consists of tiny lightweight
sensor nodes and is largely used to scan or detect or monitor environments. Since these sensor nodes are
tiny and lightweight, they put some limitations on resources such as usage of power, processing given task,
radio frequency range. These limitations allow network vulnerable to many different types of attacks such
as hello flood attack, black hole, Sybil attack, sinkhole, and many more. Among these attacks, hello flood is
one of the most important attacks. In this paper,we have analyzed the performance of hello flood attack and
compared the network performance as number of attackers increases. Network performance is evaluated
by modifying the ad-hoc on demand distance vector (AODV) routing protocol by using NS2 simulator. It
has been tested under different scenarios like no attacker, single attacker, and multiple attackers to know
how the network performance changes. The simulation results show that as the number of attackers
increases the performance in terms of throughput and delay changes.
Peer-to-Peer streaming technology has become one of the major Internet applications as it offers the opportunity of broadcasting high quality video content to a large number of peers with low costs. It is widely accepted that with the efficient utilization of peers and server's upload capacities, peers can enjoy watching a high bit rate video with minimal end-to-end delay. In this paper, we present a practical scheduling algorithm that works in the challenging condition where no spare capacity is available, i.e., it maximally utilizes the resources and broadcasts the maximum streaming rate. Each peer contacts with only a small number of neighbours in the overlay network and autonomously subscribes to sub-streams according to a budget-model in such a way that the number of peers forwarding exactly one sub-stream will be maximized. The hop-count delay is also taken into account to construct a short depth trees. Finally, we show through simulation that peers dynamically converge to an efficient overlay structure with a short hop-count delay. Moreover, the proposed scheme gives nice features in the homogeneous case and overcomes SplitStream in all simulated scenarios.
Advancements in Complementary Metal Oxide Semiconductor (CMOS) technology have enabled Wireless Sensor Networks (WSN) to gather, process and transport multimedia (MM) data as well and not just limited to handling ordinary scalar data anymore. This new generation of WSN type is called Wireless Multimedia Sensor Networks (WMSNs). Better and yet relatively cheaper sensors – sensors that are able to sense both scalar data and multimedia data with more advanced functionalities such as being able to handle rather intense computations easily - have sprung up. In this paper, the applications, architectures, challenges and issues faced in the design of WMSNs are explored. Security and privacy issues, over all requirements, proposed and implemented solutions so far, some of the successful achievements and other related works in the field are also highlighted. Open research areas are pointed out and a few solution suggestions to the still persistent problems are made, which, to the best of my knowledge, so far haven’t been explored yet.
These days considering expansion of networks, dissemination of information has become one of significant cases for researchers. In social networks in addition to social structures and people effectiveness on each other, Profit increase of sales, publishing a news or rumor, spread or diffusion of an idea can be mentioned. In social societies, people affect each other and with an individual’s membership, his friends
may join that group as well. In publishing a piece of news, independent of its nature there are different ways to expand it. Since information isn’t always suitable and positive, this article is trying to introduce the immunization mechanism against this information. The meaning of immunization is a kind of Slow Publishing of such information in network. Therefor it has been tried in this article to slow down the
publishing of information or even stop them. With comparison of presented methods for immunization and also presenting rate delay parameter, the immunization of methods were evaluated and we identified the most effective immunization method. Among existing methods for immunization and recommended methods, recommended methods also have an effective role in preventing spread of malicious rumor.
ENHANCEMENT OF TRANSMISSION RANGE ASSIGNMENT FOR CLUSTERED WIRELESS SENSOR NE...IJCNCJournal
Transmitter range assignment in clustered wireless networks is the bottleneck of the balance between
energy conservation and the connectivity to deliver data to the sink or gateway node. The aim of this
research is to optimize the energy consumption through reducing the transmission ranges of the nodes,
while maintaining high probability to have end-to-end connectivity to the network’s data sink. We modified
the approach given in [1] to achieve more than 25% power saving through reducing cluster head (CH)
transmission range of the backbone nodes in a multihop wireless sensor network with ensuring at least
95% end-to-end connectivity probability.
APPROXIMATING NASH EQUILIBRIUM UNIQUENESS OF POWER CONTROL IN PRACTICAL WSNSIJCNCJournal
Transmission power has a major impact on link and communication reliability and network lifetime in Wireless Sensor Networks. We study power control in a multi-hop Wireless Sensor Network where nodes' communication interfere with each other. Our objective is to determine each node's transmission power level that will reduce the communication interference and keep energy consumption to a minimum. We propose a potential game approach to obtain the unique equilibrium of the network transmission power allocation. The unique equilibrium is located in a continuous domain. However, radio transceivers accept only discrete values for transmission power level setting. We study the viability and performance of mapping the continuous solution from the potential game to the discrete domain required by the radio. We demonstrate the success of our approach through TOSSIM simulation when nodes use the Collection Tree Protocol for routing the data. Also, we show results of our method from the Indriya testbed. We compare it with the case where the motes use Collection Tree Protocol with the maximum transmission power.
A predictive framework for cyber security analytics using attack graphsIJCNCJournal
Security metrics serve as a powerful tool for organizations to understand the effectiveness of protecting computer networks. However majority of these measurement techniques don’t adequately help corporations to make informed risk management decisions. In this paper we present a stochastic security framework for obtaining quantitative measures of security by taking into account the dynamic attributes associated with vulnerabilities that can change over time. Our model is novel as existing research in attack graph analysis do not consider the temporal aspects associated with the vulnerabilities, such as the availability of exploits and patches which can affect the overall network security based on how the vulnerabilities are interconnected and leveraged to compromise the system. In order to have a more realistic representation of how the security state of the network would vary over time, a nonhomogeneous model is developed which incorporates a time dependent covariate, namely the vulnerability age. The daily transition-probability matrices are estimated using Frei's Vulnerability Lifecycle model. We also leverage the trusted CVSS metric domain to analyze how the total exploitability and impact measures evolve over a time period for a given network.
In this paper, an application-based QoS evaluation approach for heterogeneous networks is proposed.It is possible to expand the network capacity and coverage in a dynamic fashion by applying heterogeneous wireless network architecture. However, the Quality of Service (QoS) evaluation of this type of network architecture is very challenging due to the presence of different communication technologies. Different communication technologies have different characteristics and the applications that utilize them have unique QoS requirements. Although, the communication technologies have different performance measurement parameters, the applications using these radio access networks have the same QoS requirements. As a result, it would be easier to evaluate the QoS of the access networks and the overall network configuration based on the performance of applications running on them. Using such applicationbased QoS evaluation approach, the heterogeneous nature of the underlying networks and the diversity of their traffic can be adequately taken into account. Through simulation studies, we show that the application performance based assessment approach facilitates better QoS management and monitoring of heterogeneous network configurations.
PERFORMANCE ASSESSMENT OF CHAOTIC SEQUENCE DERIVED FROM BIFURCATION DEPENDENT...IJCNCJournal
In CDMA system, m-sequence and Gold codes are often utilized for spreading-despreading and
scrambling-descrambling operations. In a previous work, a design framework was created for generating
large family of codes from logistic map, which have comparable autocorrelation and cross correlation to
m-sequence and Gold codes. The purpose of this work is to evaluate the performance of these chaotic
codes in a CDMA environment. In the bit error rate (BER) simulation, matched filter, decorrelator and
MMSE receiver have been utilized. The received signal was modelled for synchronous CDMA uplink for
simulation simplicity purpose. Additive White Gaussian Noise channel model was assumed for the
simulation.
ENERGY SAVINGS IN APPLICATIONS FOR WIRELESS SENSOR NETWORKS TIME CRITICAL REQ...IJCNCJournal
Along with handling and poor storage capacity, each sensor in wireless sensor network (WSN) is equipped
with a limited power source and very difficult to be replaced in most application environments. Improving
the energy savings in applications for wireless sensor networks is necessary. In this paper, we mainly focus
on energy consumption savings in applications for wireless sensor networks time critical requirements. Our
Paper accompanying analysis of advanced technologies for energy saving techniques for the optimization
of energy efficiency together with the data transmission is optimal. Moreover, we propose improvements to
increase energy savings in applications for wireless sensor networks require time critical (LEACH
improvements). Simulation results show that our proposed protocol significantly better than LEACH about
the formation of clusters in each round, the average power, the number of nodes alive and average total
received data in base stations.
As Wireless Sensor Networks are penetrating into the industrial domain, many research opportunities are emerging. One such essential and challenging application is that of node localization. A feed-forward neural network based methodology is adopted in this paper. The Received Signal Strength Indicator (RSSI) values of the anchor node beacons are used. The number of anchor nodes and their configurations has an impact on the accuracy of the localization system, which is also addressed in this paper. Five different training algorithms are evaluated to find the training algorithm that gives the best result. The multi-layer Perceptron (MLP) neural network model was trained using Matlab. In order to evaluate the performance of the proposed method in real time, the model obtained was then implemented on the Arduino microcontroller. With four anchor nodes, an average 2D localization error of 0.2953 m has been achieved with a 12-12-2 neural network structure. The proposed method can also be implemented on any other embedded microcontroller system.
Multi-path TCP (MP-TCP) has the prospective to
significantly advance applications performance by using multiple
paths evidently. Multipath TCP was intended and employed as a
backward compatible replacement for TCP. For this reason, it
exposes the standard socket API to the applications that cannot
control the utilization of the different paths. This is a key feature
for applications that are unaware of the multipath nature of the
network. On the contrary, this is a limitation for applications
that could benefit from specific knowledge to use multiple paths
in a way that fits their needs. Therefore, hosts are often
connected by multiple paths, but TCP restricts communications
to a single path per transport connection. Resource usage within
the network would be more efficient where these multiple paths
able to be used concurrently. This should enhance user
experience through improved resilience to network failure and
higher throughput. In this paper, we have focused on MPTCP
and discussed the performance issues and its solution. We believe
our concept will be useful for future works of MPTCP
performance evaluation.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
Towards Seamless TCP Congestion Avoidance in Multiprotocol EnvironmentsIDES Editor
In this paper we explore the area of congestion
avoidance in computer networks. We provide a brief overview
of the current state of the art in congestion avoidance and also
list our extension to the TCP congestion avoidance mechanism.
This extension was previously published on an international
forum and in this paper we describe an improved version which
allows multiprotocol support. We list preliminary results
carried out in a simulation environment.
New introduced approach called Advanced Notification
Congestion System (ACNS) allows TCP flows prioritization
based on the TCP flow age and priority carried in the header
of the network layer protocol. The aim of this approach is to
provide more bandwidth for young and high prioritized TCP
flows by means of penalizing old greedy flows with a low
priority. Using ACNS, substantial network performance
increase can be achieved.
Performance Evaluation of TCP with Adaptive Pacing and LRED in Multihop Wirel...ijwmn
Transmission Control Protocol (TCP) was designed to provide reliable end-to-end delivery of
data over unreliable networks. In practice, most TCP deployments have been carefully designed in the
context of wired networks. Ignoring the properties of wireless and Ad-hoc Networks can lead to TCP
implementations with poor performance. In a wireless network, however packet losses occur more often
due to unreliable wireless links than due to congestion. When using TCP over wireless links, each packet
loss on the wireless link results in congestion control measures being invoked at the source. This causes
severe performance degradation. If there is any packet loss in wireless networks, then the reason for that
has to be found out. If there is congestion, then only congestion control mechanism has to be applied.
This work shows the performance of TCP with Adaptive Pacing (TCP-AP) and Link Random Early
Discard (LRED) as queuing model in multihop transmission when the source and destination nodes are
in mobile nature. The adaptive pacing technique seeks to improve spatial reuse. The LRED technique
seeks to react earlier to link overload. This paper consists of simulated environment results under
different network scenarios. This work proves that the combination of TCP-AP and LRED give much
better result than as the individual technique. Simulations are done with the use of NS-2.
A Machine Learning based Network Sharing System Design with MPTCPIJMREMJournal
The information and communication technologies (ICT) integrate different types of wireless communication to
provide IT-enabled services and applications. The great majority end devices are equipped with multiple network
interfaces such as Wi-Fi and 4G. Our goal is to integrate the available network interfaces and technologies to
enhance seamless communication efficiency and increase resources utilization. We proposed a heterogeneous
network management algorithm based on machine learning methods which includes roaming and sharing
functions. The roaming function provides the multiple network resources in physical and media access control
layers. The sharing function supports multiple network resources allocation and the service handover process
based on the Multi-Path TCP protocol. The simulation result also shows that the proposed scheme can increase
the network bandwidth utilization effectively. The sharing system could be used in home, mobile and vehicular
environments to realize ubiquitous social sharing networks.
A Machine Learning based Network Sharing System Design with MPTCPIJMREMJournal
The information and communication technologies (ICT) integrate different types of wireless communication to provide IT-enabled services and applications. The great majority end devices are equipped with multiple network interfaces such as Wi-Fi and 4G. Our goal is to integrate the available network interfaces and technologies to enhance seamless communication efficiency and increase resources utilization. We proposed a heterogeneous network management algorithm based on machine learning methods which includes roaming and sharing functions. The roaming function provides the multiple network resources in physical and media access control layers. The sharing function supports multiple network resources allocation and the service handover process based on the Multi-Path TCP protocol. The simulation result also shows that the proposed scheme can increase the network bandwidth utilization effectively. The sharing system could be used in home, mobile and vehicular environments to realize ubiquitous social sharing networks.
VEGAS: Better Performance than other TCP Congestion Control Algorithms on MANETsCSCJournals
The wireless communication TCP/IP protocol is an important role in developing communication systems and which provides better and reliable communication capabilities in almost all kinds of networking environment. The wireless networking technology and the new kind of requirements in communication systems need some extensions to the original design of TCP for on coming technology development. In this paper we have analyzed six TCP Congestion Control Algorithms and their performance on Mobile Ad-hoc Networks (MANET). More specifically, we describe the performance behavior of BIC, Cubic, TCP Compound, Vegas, Reno and Westwood congestion control algorithms. The evaluation is simulated through Network Simulator (NS2) and the performance of these congestion control algorithms is analyzed with suitable metrics.
Effective Router Assisted Congestion Control for SDN IJECEIAES
Router Assisted Congestion Control (RACC) was designed to improve endto-end congestion control performance by using prior knowledge on network condition. However, the traditional Internet does not provide such information, which makes this approach is not feasible to deliver. Our paper addresses this network information deficiency issue by proposing a new congestion control method that works on the Software Defined Network (SDN) framework. We call this proposed method as PACEC (Path Associativity Centralized Congestion Control). In SDN, global view of the network information contains the network topology including link properties (i.e., type, capacity, power consumption, etc.). PACEC uses this information to determine the feedback signal, in order for the source to start sending data at a high rate and to quickly reach fair-share rate. The simulation shows that the efficiency and fairness of PACEC are better than Transmission Control Protocol (TCP) and Rate Control Protocol (RCP).
Enhancing HTTP Web Protocol Performance with Updated Transport Layer TechniquesIJCNCJournal
Popular Internet applications such as web browsing, and web video download use HTTP protocol as application over the standard Transport Control Protocol (TCP). Traditional TCP behavior is unsuitable for this style of application because their transmission rate and traffic pattern are different from conventional bulk transfer applications. Previous works have analyzed the interaction of these applications with the congestion control algorithms in TCP and the proposed Congestion Window Validation (CWV) as a solution. However, this method was incomplete and has been shown to present drawbacks. This paper focuses on the ‘newCWV’ which was designed to address these drawbacks. NewCWV provides a practical mechanism to estimate the available path capacity and suggests a more appropriate congestion control behavior. This paper describes how this algorithm was implemented in the Linux TCP/IP stack and tested by experiments, where results indicate that, with newCWV, the browsing can get 50% faster in an uncongested network.
Enhancing HTTP Web Protocol Performance with Updated Transport Layer TechniquesIJCNCJournal
Popular Internet applications such as web browsing, and web video download use HTTP protocol as application over the standard Transport Control Protocol (TCP). Traditional TCP behavior is unsuitable for this style of application because their transmission rate and traffic pattern are different from conventional bulk transfer applications. Previous works have analyzed the interaction of these applications with the congestion control algorithms in TCP and the proposed Congestion Window Validation (CWV) as a solution. However, this method was incomplete and has been shown to present drawbacks. This paper focuses on the ‘newCWV’ which was designed to address these drawbacks. NewCWV provides a practical mechanism to estimate the available path capacity and suggests a more appropriate congestion control behavior. This paper describes how this algorithm was implemented in the Linux TCP/IP stack and tested by experiments, where results indicate that, with newCWV, the browsing can get 50% faster in an uncongested network.
Enhancing HTTP Web Protocol Performance with Updated Transport Layer TechniquesIJCNCJournal
Popular Internet applications such as web browsing, and web video download use HTTP protocol as application over the standard Transport Control Protocol (TCP). Traditional TCP behavior is unsuitable for this style of application because their transmission rate and traffic pattern are different from conventional bulk transfer applications. Previous works have analyzed the interaction of these applications with the congestion control algorithms in TCP and the proposed Congestion Window Validation (CWV) as a solution. However, this method was incomplete and has been shown to present drawbacks. This paper focuses on the ‘newCWV’ which was designed to address these drawbacks. NewCWV provides a practical mechanism to estimate the available path capacity and suggests a more appropriate congestion control behavior. This paper describes how this algorithm was implemented in the Linux TCP/IP stack and tested by experiments, where results indicate that, with newCWV, the browsing can get 50% faster in an uncongested network.
A widely used TCP protocol is originally developed for wired networks. It has many variants to detect and control congestion in the network. However, Congestion control in all TCP variants does not show similar performance in MANET as in wired network because of the fault detection of congestion. In this paper, we do a performance comparison between TCP variants NEW RENO, SACK and Vegas in AODV and DSR reactive (On-Demand) routing protocols. Network traffic between nodes is provided by using File Transfer Protocol (FTP) application. Multiple scenarios are created and the average values of each performance parameter are used to evaluate the performance. The results show that TCP variants perform better in terms of throughput and Packet drop with DSR routing protocol compared with AODV routing protocol. TCP variants show a lower Jitter in AODV compared with DSR.
A COMPARISON OF CONGESTION CONTROL VARIANTS OF TCP IN REACTIVE ROUTING PROTOC...ijcsit
A widely used TCP protocol is originally developed for wired networks. It has many variants to detect and
control congestion in the network. However, Congestion control in all TCP variants does not show similar
performance in MANET as in wired network because of the fault detection of congestion. In this paper, we
do a performance comparison between TCP variants NEW RENO, SACK and Vegas in AODV and DSR
reactive (On-Demand) routing protocols. Network traffic between nodes is provided by using File Transfer
Protocol (FTP) application. Multiple scenarios are created and the average values of each performance
parameter are used to evaluate the performance. The results show that TCP variants perform better in
terms of throughput and Packet drop with DSR routing protocol compared with AODV routing protocol.
TCP variants show a lower Jitter in AODV compared with DSR.
A widely used TCP protocol is originally developed for wired networks. It has many variants to detect and control congestion in the network. However, Congestion control in all TCP variants does not show similar performance in MANET as in wired network because of the fault detection of congestion. In this paper, we do a performance comparison between TCP variants NEW RENO, SACK and Vegas in AODV and DSR reactive (On-Demand) routing protocols. Network traffic between nodes is provided by using File Transfer Protocol (FTP) application. Multiple scenarios are created and the average values of each performance parameter are used to evaluate the performance. The results show that TCP variants perform better in terms of throughput and Packet drop with DSR routing protocol compared with AODV routing protocol. TCP variants show a lower Jitter in AODV compared with DSR.
Similar to PERFORMANCE ANALYSIS OF MULTI-PATH TCP NETWORK (20)
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Automobile Management System Project Report.pdfKamal Acharya
The proposed project is developed to manage the automobile in the automobile dealer company. The main module in this project is login, automobile management, customer management, sales, complaints and reports. The first module is the login. The automobile showroom owner should login to the project for usage. The username and password are verified and if it is correct, next form opens. If the username and password are not correct, it shows the error message.
When a customer search for a automobile, if the automobile is available, they will be taken to a page that shows the details of the automobile including automobile name, automobile ID, quantity, price etc. “Automobile Management System” is useful for maintaining automobiles, customers effectively and hence helps for establishing good relation between customer and automobile organization. It contains various customized modules for effectively maintaining automobiles and stock information accurately and safely.
When the automobile is sold to the customer, stock will be reduced automatically. When a new purchase is made, stock will be increased automatically. While selecting automobiles for sale, the proposed software will automatically check for total number of available stock of that particular item, if the total stock of that particular item is less than 5, software will notify the user to purchase the particular item.
Also when the user tries to sale items which are not in stock, the system will prompt the user that the stock is not enough. Customers of this system can search for a automobile; can purchase a automobile easily by selecting fast. On the other hand the stock of automobiles can be maintained perfectly by the automobile shop manager overcoming the drawbacks of existing system.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
TECHNICAL TRAINING MANUAL GENERAL FAMILIARIZATION COURSEDuvanRamosGarzon1
AIRCRAFT GENERAL
The Single Aisle is the most advanced family aircraft in service today, with fly-by-wire flight controls.
The A318, A319, A320 and A321 are twin-engine subsonic medium range aircraft.
The family offers a choice of engines
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
1. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
DOI : 10.5121/ijcnc.2016.8213 145
PERFORMANCE ANALYSIS OF MULTI-PATH TCP
NETWORK
Hamzah M A Hijawi and Mohammad M. N. Hamarsheh
Department of Computer Science, Arab American University, Jenin, Palestine
ABSTRACT
MPTCP is proposed by IETF working group, it allows a single TCP stream to be split across multiple
paths. It has obvious benefits in performance and reliability. MPTCP has implemented in Linux-based
distributions that can be compiled and installed to be used for both real and experimental scenarios. In this
article, we provide performance analyses for MPTCP with a laptop connected to WiFi access point and 3G
cellular network at the same time. We prove experimentally that MPTCP outperforms regular TCP for
WiFi or 3G interfaces. We also compare four types of congestion control algorithms for MPTCP that are
also implemented in the Linux Kernel. Results show that Alias Linked Increase Congestion Control
algorithm outperforms the others in the normal traffic load while Balanced Linked Adaptation algorithm
outperforms the rest when the paths are shared with heavy traffic, which is not supported by MPTCP.
KEYWORDS
TCP, MPTCP, Multi-homed, Congestion Controls
1. INTRODUCTION
Transmission control protocol TCP is widely used on the internet today. Most applications use
TCP as a reliable transfer protocol to transmit data across the internet. TCP has been evolving
since the first design from the 1970s. One of the early design decisions in TCP still frustrating
users; the separation between transport and network layers is not completely transparent.
However, in order to differentiate between individual data streams among incoming traffic, the
receiver demultiplexes packets based on the five tuples; source IP, destination IP, source port,
destination port and the protocol identifier, this is also called socket. Thus, any TCP connection is
a single path and bounded to a unique socket between the source and destination [1]. This means
that after the connection is established if for some reason the IP address is changed in the source
or destination then the whole connection will fail.
Today networks are becoming multipath, most of the servers are multi-homed, mobile devices
have multiple wireless interfaces like WiFi and GSM, and data centers have many redundant
links. This type of redundancy evolves the need for a new TCP design to make it operational over
multipath, this is called multipath TCP [2]. MPTCP is a major modification to TCP, which allows
multiple paths to be used simultaneously by a single TCP transport connection. It was first
proposed by IETF [3]. MPTCP has obvious benefits for reliability in case of link failures and for
load balancing in case of multi-homed servers and data centers. MPTCP also can achieve better
performance and it is more robust than a single path TCP while maintaining compatibility with
existing applications. This is achieved by providing a regular TCP interface to applications and let
the transport layer handles the multipath connections. MPTCP is presented as a sublayer under
TCP layer, it spreads data over multi-paths which are called sub-flows [3].
2. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
146
The design of MPTCP has been influenced by many requirements. Mainly, application and
network compatibilities [2]. Application compatibility means that applications that currently run
over TCP should work over MPTCP without any change. Network compatibility means that
MPTCP should work with any network on which TCP operates.
MPTCP connection is established by using three-way handshake with TCP options.
MP_CAPABLE option in the SYN packet indicates that the source can perform multipath TCP. If
the destination also supports multipath TCP, then it replies with SYNACK packet, which also
contains MP_CAPABLE option, after that source replies with ACK packet which again contains
MP_CAPABLE option to confirm that the connection will use MPTCP. Other options like using
a random key in the three-way handshake can be used for security purposes. Once the connection
established any of participants can create additional sub-flow if it finds a new path to the
destination by sending a new SYN packet with MP_JOIN option and information on which
MPTCP session to join. Once the connection has more than one sub-flow, it is up to the system
on each end to decide how to split the traffic between sub-flows. Each sub-flow looks like a
normal TCP connection; it has its own sequence numbers and congestion control which are
different from other sub-flows. New sub-flow can come up if a new path is available and can
vanish if one of the paths becomes unavailable [4].
One of the most important components of TCP is its congestion control mechanism, which allows
it to adjust throughput according to the network congestions. Each TCP connection maintains a
variable called congestion window. It governs the amount of traffic that the sender can send
without waiting for an acknowledgment from the receiver. The same approach is applied in
MPTCP in which each sub-flow has its own congestion window and it is updated dynamically
according to the congestion in the path it takes to reach the destination. Few congestion control
algorithms for MPTCP has been developed like coupled congestion control [5], opportunistic
linked-increases congestion control [6, 7], balanced linked adaptation congestion control [8] and
delay based congestion control [9].
The main goal of this paper is to evaluate the new emerging MPTCP protocol over single and
multiple interfaces. The throughput of different scenarios is measured using the Linux operating
system. Outputs from all scenarios are compared with each other and the performance of different
MPTCP congestion control algorithms is compared.
2. RELATED WORK
MPTCP is a new approach towards efficient load balancing, it does balance at the end nodes as
part of TCP process. MPTCP was described in RFC 6897 [4], an active working group in the
IETF. Many attempts have been made in order to implement MPTCP in the Linux Kernel. An
effort was made in [10]where the Kernel can be tuned and customized by system call variables.
With the possibility of using multiple paths for TCP, concerns have arisen about congestion
controls on these paths. An effort was made to implement effective and robust congestion control
mechanisms that effectively use the paths without harming the original TCP path. In [11], it was
shown that implementing some congestion control algorithms for multipath TCP could be
harmful. Equally-Weighted TCP EWTCP is an example of these harmful algorithms [12]. It is a
weighted version of multipath TCP which distributes the data fairly compared to the regular
MPTCP. It is not very efficient because it doesn’t split traffic evenly across the available paths.
COUPLED congestion control algorithm makes better decisions than EWTCP and solved some
fairness problems [5]. The weakness of this algorithm is obvious when the available paths have
different throughputs like the case in WiFi and GSM. It makes unequal round trip times (RTTs)
because the COUPLED algorithm tends to send all its traffic on the less congested path, which
makes the use of low throughput path inefficient. The proposed solution to these problems is
3. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
147
given in [12]. It is called SEMI-COUPLED congestion control algorithm. It is implemented based
on some design goals like good path selection, balanced congestion, and compatibility with
existing regular TCP.
A practical multipath congestion control algorithm is proposed in [13]. It focuses on improving
throughput and balance the congestion. It also compares the proposed algorithm with other three
congestion control algorithms: Fully coupled, linked increases and uncoupled TCP. The
simulation was carried out using CWNDSim. It was shown that the proposed algorithm
succeeded in keeping total throughput close to the target rate, and the traffic is pushed into the
less congested path. An overview of fully functional MPTCP is provided in [2]. The results
performed on the Linux machines that implemented MPTCP protocol in their Kernels. They
studied the most used cases for MPTCP which are the mobile devices and data canters. The data
transfer measurements of the mobile focus on the typical mode of operation in which the mobile
device is connected to WiFi, then connection goes down and the device switched to 3G. The
results were compared with the single path TCP and showed a smooth handover in the case of
MPTCP, this is because data keeps flowing despite the interface changed. The other scenario is
load balancing in the datacenter; the comparison was made with standard TCP, two flows
MPTCP, and four flows MPTCP when tested on EC2 test bed with 40 instances. They showed
that MPTCP with four paths outperforms both standard TCP and two paths MPTCP.
3. MPTCP CONGESTION CONTROL
MPTCP distributes loads through the creation of multiple sub-flows across potential paths
between source and destination. Congestion control in MPTCP is different from regular TCP. The
simplest way is to run the standard TCP congestion control on each sub-flow. However, this
solution is not efficient as it will give the multi-path flow more than its fair share if more than one
sub-flow across the same bottleneck link which is also shared with standard TCP
flow.Furthermore, it is desirable that the source with multiple paths will transfer more traffic
using the least congested path, achieving the resource pooling where a group of links behaves like
one shared link with bigger capacity [5].
Any multipath congestion control algorithm must meet a set of requirements which are
summarized in three different goals. The first goal is improving the throughput; a multipath
connection should perform at least as well as single path TCP would on the best of available
paths, this means that in the worst case the MPTCP would have throughput same as standard
TCP. The second goal does not harm;a multipath sub-flow should not take capacity more than
single path TCP would on the same link, this ensure that multipath sub-flow will not harm other
flows. The third goal is balancing the congestion; the multipath flow should move as much as
traffic to the least congested paths [3, 5, 11]. The first and second goals together ensure the
fairness at bottlenecks while the third goal achieves the concept of the resource pooling.
However, if each multipath flow sends more traffic through its least congested path, the network
traffic will move away from congested paths resulting in improvements in robustness and overall
network throughput.
Many congestion control algorithms were proposed, most of them were implemented in Linux
Kernels. The following four congestion control algorithms were implemented in most of Linux
distributions [10].
4. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
148
3.1 Alias Linked Increase Congestion Control
Alias Linked Increase Algorithm LIA couples the congested control algorithms that are running
on different sub-flows by linking their increase functions and dynamically adapts the congestion
window [5],the algorithm is only applied to the increase part of the congestion avoidance phase.
The resultis an algorithm that is fair to standard TCP at bottlenecks and at the same time moving
the traffic away from congested paths.
The additive increase and subtractive decrease behaviors can be described asfollows:
• For each ACK received on sub-flow i, the congestion window cwndi is increased by:
. .
,
.
!"#
$ (1)
Where:
α: A parameter that describes the aggressiveness of the multipath flow.
Back: Number of acknowledged bytes.
Mssi: Maximum segment size on sub-flow i.
n:Total number of sub-flows.
• For each loss on sub-flow i, decrease cwndi by cwndi/2.
Formula (1) describes the increase behavior of the algorithm in Bytes, thefirst argument computes
the window increase value for the multipath sub-flow and the second one computes the
increasevalue for TCP in the same scenario. Taking the minimum of these values ensures that any
multipath sub-flow will not take capacity more than single path TCP, hence achieving the second
design goal. Alpha is a parameter used to adjust the aggressiveness of the multipath flow, its
valueis chosen such that the total throughput of the multipath flow is equal to the throughput
which TCP would get on the best path and this meets the first design goal.
According to the first term in formula (1), the total throughput for a multipath flow depends on
alpha, maximum segment sizes, and round trip times of its paths. In order to meet the first design
goal, it is impossible to choose a single value of alpha that achieves the desired throughput at
each time. Hence, alpha is computed based on the observed behaviors of all paths as shown in
formula (2), alpha is derived by equalizing the rate of multipath flow with TCP flow running on
the same path.
&∑ () *++,- .
/01
2 3
4556 7
89
2 3
455
:
6 (2)
Where:
;< =>>6 ?:Maximim value of any possible path.
@ =>>+,-
: Summation of all possible values of all paths.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
149
3.2 Opportunistic Alias Linked Increase Congestion Control
Through analysis and measurements provided in [7], it was proven that current LIA
implementation forces a tradeoff between optimal resource pooling and the responsiveness, both
goals can’t be achieved at the same time, this leads to the fairness problem to TCP users.
However, upgrading part of users from standard TCP to MPTCP can reduce the throughput for
other users without any benefit to MPTCP users and can also violate the third design goal.
OLIA, the opportunistic linked increases algorithm wasintroduced as an alternative for
LIA,it a window based congestion control algorithm. It couples the increase of congestion
windows and uses the same behavior in regular TCP in case of loss. This algorithm is only
applied to the increase part of the congestion avoidance phase, slow start algorithm is the same as
the one used in regular TCP with a small modification in case of multiple paths are established [6,
7].The additive increase behavior can be described as follows:
• For each ACK received on path i, increase congestion window cwndiby:
ABC
4556
&D E.&
2 3F
455F
..6
+ (3)
Where:
cwndp:Window size of a path p with largest congestion window.
RTTp:Round trip time of a path p with largest congestion window.
αi: Adjust parameter for a path i.
n: is the total number of sub-flows.
• For each loss on sub-flow i, decrease cwndi by cwndi/2.
The first term in formula (3) provides the optimal resource pooling, it is a TCPcompatible version
that compensates for different RTTs. The second term with alpha guarantees the responsiveness
and non-flappiness of the algorithm.
3.3 Balanced Linked Adaptation Congestion Control
Recent MPTCP congestion protocols like LIA and OLIA suffer from either unfairness to the
single path TCP or unresponsiveness to network changes under certain conditions especially
when all paths used for MPTCP have the same round trip time. However, the trade-off between
these two issues is inevitable. Balances linked adaptation algorithm BALIA judiciously balances
this trade-off [8],it strikes a good balance between friendliness and responsiveness. The additive
increase and subtractive decrease behaviors of BALIA can be described as follows:
• For each ACK on path i, increase cwndi by:
H
I
=>> .J∑ 0 K
6L . D
MN /
O
E . D
PN /
Q
E (4)
Where:
<+ =
() *+
STT+
6. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
150
;+ =
;<{<V }
xY
n: is the total number of sub-flows.
• For each loss on path i, decrease cwndi by:
D
!"#
O
E . {;+, 1.5} (5)
If there is only a single path available then ;+ will be one and the increment and
decrement formulas will be reduced to those of TCP Reno algorithm.
3.4 Delay-Based Congestion Control
A Delay-based congestion control algorithm called wVegas is introduced in [9]. Unlike LIA
which is based on packet loss events, wVegas uses packet queuing delay as a congestion signal.
Compared with loss based congestion control algorithms described previously, wVegas is more
sensitive to the changes of network congestions, and can achieve more timely traffic shifting and
faster convergence. The following operations must be performed at the end of each transmission
round:
• For a sub-flowi, calculate the difference between the expected sending rate and actual sending
rate.
* + = D
!"#
]/ ^_=>>
−
!"#
=>>
E . a;bc_STT+ (6)
Where, RTTi is the average RTT on the last round on sub-flow i, and base_RTTi is the RTT of
a sub-flow i when the path is not congested.
If the sub-flow is in the slow start phase and the diffi is larger than a threshold called gamma,
the algorithm must enter the congestion avoidance phase.
• In the congestion avoidance phase, if the diffi is not less than unfairness ;i, then the rate must
be updated.
d;ec+ =
!"#
=>>
(7)
)c fℎe+ =
hijk
lml/n o/l^ mp /nn +
(8)
;+ = )c fℎe+ . eqe;r_; (9)
If diffiis larger than ;i, then () *+ = cwndY – 1 else,() *+ = cwndY + 1
• The last task that wVegas tries to do is improving the accuracy of base_RTTi by making the
congestion window back off once detecting a queuing delay larger than some thresholds. By
this task, bottleneck link can drain off the backlogged packets. However, all flows involved
have a chance to obtain the most accurate propagation delay. wVegas first calculates the
queuing delay as follows:
xycyc_*cr;z+ = STT+ − a;bc_STT+ (10)
7. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
If the current queuing delay is less than the saved
replaced by the current one. If the current queuing delay is twice
following operation:
cwndY = &cwndY.. &0.5. . &
]/ ^
4. EXPERIMENTAL RESULTS
Experimental evaluation of MPTCP is performed using Ubuntu Linux. The
with Ubuntu Kernel, which supports MPTCP [
using a laptop that had WiFi and 3G
figure 1. Ubuntu 14.04 is installed on
Kernel is replaced with multipath TCP v0.90 Kernel.Each of the network interfaces has a speed of
4Mbps.
4.1 Comparison between Regular TCP and MPTCP
In this experiment, we downloaded a 1GB file from a server through the internet in three different
scenarios. The first scenario by
using regular TCP over 3G interface, a
the same time. The comparison of
figure shows that using MPTCP over all available interfaces can enhance the throughput
expected. It also shows that the
throughput.Sometimes the throughput
using a link with shared capacity to the
called ifstat [14], the summation of
drawn as an average value for each ten readings;
clear that that the 3G link stability is not as good as the W
performance of the MPTCP link.
International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
If the current queuing delay is less than the saved queue_delayi then the queue_delay
replaced by the current one. If the current queuing delay is twice queue_delayi then pe
]/ ^_=>>
=>>
.
ESULTS
Experimental evaluation of MPTCP is performed using Ubuntu Linux. The Kernel is replaced
with Ubuntu Kernel, which supports MPTCP [10]. Multiple experimental scenarios are done
using a laptop that had WiFi and 3G interfaces. The topology of the system used is described in
Ubuntu 14.04 is installed on a laptop which represents the FTP client, and the Linux
Kernel is replaced with multipath TCP v0.90 Kernel.Each of the network interfaces has a speed of
Figure 1: System Topology
4.1 Comparison between Regular TCP and MPTCP
In this experiment, we downloaded a 1GB file from a server through the internet in three different
using regular TCP over WiFi interface, thesecond
g regular TCP over 3G interface, and the last scenario by using MPTCP over WiFi and 3G at
ison of the throughput for the three scenarios is shown in Figure 2
that using MPTCP over all available interfaces can enhance the throughput
the throughput using MPTCP is almost the sum of each path
throughput.Sometimes the throughput is less than the sum because the experiments are
shared capacity to the internet. Throughput is monitored using a Linux tool
the summation of download speed for each network interface is collected
for each ten readings; this is to make the graph smoother.
ility is not as good as the WiFi link and this is reflected on the
. This explains the odd behaviour at 150, 300 and 550 s.
International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
151
queue_delayi must be
then perform the
(11)
Kernel is replaced
]. Multiple experimental scenarios are done
. The topology of the system used is described in
represents the FTP client, and the Linux
Kernel is replaced with multipath TCP v0.90 Kernel.Each of the network interfaces has a speed of
In this experiment, we downloaded a 1GB file from a server through the internet in three different
second scenario by
sing MPTCP over WiFi and 3G at
is shown in Figure 2. The
that using MPTCP over all available interfaces can enhance the throughput as
ughput using MPTCP is almost the sum of each path
experiments are done
Throughput is monitored using a Linux tool
is collected and
is to make the graph smoother. It is also
flected on the
This explains the odd behaviour at 150, 300 and 550 s.
8. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
152
Figure 2: Throughput using MPTCP at normal traffic
4.2 Heavy Load Comparison
In this experiment, we use the FTP to download 1GB file using MPTCP over WiFi and 3G
interfaces. While the file is downloading, YouTube video fileat time 300 seconds is started and
consumes most of the bandwidth. The same scenario was repeated with standard TCP. Figure 3
shows the throughput for both cases. The figure shows that the file gets better throughput in case
of MPTCP as expected. YouTube server does not support MPTCP and the video download was
using WiFi interface only. Thus, the total capacity of the3G interface is used for the FTP
download and the WiFi is shared between FTP and video download. Before time 150seconds, the
through put of the MPTCP is not steady because of the shared link capacity.When YouTube
video started at about 280seconds, the throughput dropped to 60 KB/s for standard TCP and to
170 KB/sfor MPTCP, this shows how using multi-paths can enhance MPTCP applications
throughput without affecting the behavior of standard TCPat congestion bottlenecks.
9. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
153
Figure 3: Throughput using MPTCP at heavy traffic
4.3 MPTCP sub-flows over Single Interface
In this experiment, the download throughput is monitored using MPTCP with one sub-flow over a
WiFi interface. It is compared withdownload throughput of two sub-flows over the same
interface. Results show a good enhancement on throughput as the number of sub-flows increase
over the same path. Figure 4 shows that the download speed in case of MPTCP with two sub-
flows is increased by 70 KB/s when it is compared with MPTCP with 1 sub-flow.
Figure 4: MPTCP sub-flows
10. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
154
4.4 Application Layer Handover
The throughput of TCP with application layer handover is monitored and compared with that of
MPTCP. The throughput of TCP protocol is monitored while downloading a 1GB file from the
server using a TCP connection on WiFi interface. The WiFi access point is switched off during
the download. The application detected that WiFi interface went down and reconnected with a
new TCP connection (switched) to the 3G interface. The same scenario is implemented again
with MPTCP enabled. Figure 5 shows the results from both cases, the handover occurs between
100 – 130 seconds with MPTCP and data keeps flowing despite the lossof one of the interfaces. It
is shown that at the handover time, the download speed does not go to zero in thecase of
MPTCP.In thecase of TCP, the throughput goes to zero for all of the handover periodsuntil anew
connection is established.
Figure 5: MPTCP handover
4.5 Congestion Controls Algorithms Comparison
In this experiment, a comparison of the throughput when downloading a 1 GB file is made
between the four different congestion control algorithms discussed in section three. The file is
downloaded 4 times, each time different congestion control algorithm is used. These are LIA,
OLIA, BALIA and wVegas. WiFi and 3G interfaces are both utilized for MPTCP at normal
traffic load. Experiment results show that LIA has thebest throughput most of the time (150s –
480s) as shown in figure 6. BALIA also has a good throughput for the time from 0s to 320s at this
type of load. OLIA and wVegas did not show good throughput at this load and were not stable
most of the time.
11. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
155
Figure 6: Throughput comparison between MPTCP congestion controls algorithms
4.6 Congestion Controls Algorithms Comparisonunder Heavy Traffic
The congestion control algorithms are designed to improve the throughput at heavy load. The
throughput is monitored at heavy load while downloading the 1GB file four different times. Each
time one of the congestion control algorithm is used and a YouTube video file is started at time
300 seconds to consume most of the bandwidth.The throughput in each case is compared with all
other cases to show the behaviour of the four different congestion control algorithms under heavy
traffic scenario to test how each of them reacts under extreme cases.
Figure 7: Throughput comparison between MPTCP congestion controls algorithms under Heavy Traffic
Load
12. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
156
Figure 7 shows the comparison results, it clearly shows that BALIA outperforms other congestion
algorithms when the paths are shared with heavy trafficthat is not supported by MPTCP. This
explains the trade-off between friendliness and responsiveness in the old congestion control
implementations in LIA and OLIA. Wvegasoutperforms LIA and OLIA, this is because it uses
packet questing delay as a congestion signal instead of loss based, and this makes wVegas more
sensitive to the changes in the network congestions and can achieve more timely traffic shifting
and faster convergence.
6. CONCLUSIONS
MPTCP is one of the most significant changes to TCP in the past years, it allows TCP streams to
be split over multiple paths to improve the performance of TCP applications and increase
throughput and reliability. MPTCP is implemented in the Linux Kernel and can be compiled and
installed on most of Linux distributions. In this article, we did a performance analysis of
MPTCP.It is shown experimentally that using MPTCP outperforms normal TCP and has many
advantages in different scenarios. The throughput of different congestion MPTCP algorithms is
also compared.
REFERENCES
[1] Postel, Jon. "RFC793: Transmission Control Protocol. USC." Information Sciences Institute 27
(1981): 123-150.
[2] Bonaventure, Olivier, Mark Handley, and Costin Raiciu. "An overview of Multipath TCP.”; login: 37,
no. 5 (2012): 17-23.
[3] Ford, C. Raiciu, and M. Handley. "TCP Extensions for Multipath Operation with Multiple Addresses"
draft-ietf-mptcpmultiaddress (work in progress)." (2010).
[4] Scharf, Michael, and Alan Ford. Multipath TCP (MPTCP) application interface considerations. No.
RFC 6897. 2013.
[5] Raiciu, C., M. Handley, and D. Wischik. "RFC 6356, Coupled Congestion Control for Multipath
Transport Protocols." (2011).
[6] Khalili, Ramin, Nicolas Gast, and Miroslav Popovic. "Opportunistic Linked-Increases Congestion
Control Algorithm for MPTCP." (2013).
[7] Khalili, Ramin, Nicolas Gast, Miroslav Popovic, Utkarsh Upadhyay, and Jean-Yves Le Boudec.
"MPTCP is not pareto-optimal: performance issues and a possible solution." In Proceedings of the 8th
international conference on Emerging networking experiments and technologies, pp. 1-12. ACM,
2012.
[8] Walid, A., Q. Peng, J. Hwang, and S. Low. "Balanced Linked Adaptation Congestion Control
Algorithm for MPTCP." Working Draft, IETF Secretariat, Internet-Draft draft-walid-
mptcpcongestion-control-03, July (2015).
[9] Cao, Yu, Mingwei Xu, and Xiaoming Fu. "Delay-based congestion control for multipath TCP." In
Network Protocols (ICNP), 2012 20th IEEE International Conference on, pp. 1-10. IEEE, 2012.
[10] "MPTCP Linux Kernel Implementation." MultiPath TCP. Accessed March 01, 2016.
http://mptcp.info.ucl.ac.be/.
[11] Wischik, Damon, Costin Raiciu, Adam Greenhalgh, and Mark Handley. "Design, Implementation and
Evaluation of Congestion Control for Multipath TCP." In NSDI, vol. 11, pp. 8-8. 2011.
[12] Honda, Michio, Yoshifumi Nishida, Lars Eggert, Pasi Sarolahti, and Hideyuki Tokuda. "Multipath
congestion control for shared bottleneck." In Proc. PFLDNeT workshop, pp. 19-24. 2009.
[13] Raiciu, Costin, Damon Wischik, and Mark Handley. "Practical congestion control for multipath
transport protocols." University College London, London/United Kingdom, Tech. Rep (2009).
[14] "Ifstat(1) - Linux Man Page." Ifstat(1): Report InterFace STATistics. Accessed March 01, 2016.
http://linux.die.net/man/1/ifstat.
13. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.2, March 2016
157
AUTHORS
Hamzah M A Hijawi received his BS in computer system engineering from Birzeit University, Ramallah,
Palestine, in 2011. He is currently working with Exalt technologies as a software engineer since 2010 for
Cisco Systems, Inc. as a software engineer for deep packet inspection project NBAR, and currently
pursuing his Master of Computer Science from Arab American University, Jenin, Palestine. His researches
interest include computer networking, information security, wireless sensor network and data Mining.
Mohammad M N Hamarsheh received his BS in electrical and computer engineering from An-najah
National University, Nablus, Palestine, in 1999, and his MS and PhD degrees in computer and
communication engineering and communications and network engineering, in 2002 and 2006, respectively
from University Putra Malaysia, Serdang, Malaysia. He worked as the head of the FBG fabrication unit
with Photronix, Cyberjaya, Malaysia. He was involved in optical CDMA and fiber Bragg grating research
and development. He worked as a lecturer with faculty of information science and technology, Multimedia
University, Malaysia, from 2005 to 2008. He is currently an assistant professor at Arab American
University, Jenin, Palestine. His research interests include computer networking and security, optical code
division multiple access systems, fiber Bragg gratings, dense wavelength division multiplexing, and
polarization effect on optical fiber communication.