Minimize Packet Loss Research Articles

Adaptive Dead Time Compensation on Congestion Control of TCP Networks: An Unified Solution

This paper presents a simple and effective control scheme for TCP congestion control that minimizes packet losses and guarantees an efficient network utilization. Contrary to most of the control strategies presented in literature, which are in general defined and tuned for an specific case of study, the structure proposed in this paper is capable to deal with most of the situations giving a good performance: small buffer high-speed networks, networks with high delays between sender and receiver, mobile networks and stress operation. To do it, a simple adaptive model for the queue dynamics of TCP protocol is developed and a Smith predictor-based controller, simple from the implementation standpoint, is designed to perform the congestion control. Simulations using NS-2 network simulator allow to validate the proposed model and controller in several case studies.

IMeX: Intergateway Cross-Layer Handoffs in Internet-Based Infrastructure Wireless Mesh Networks

Wireless mesh networks (WMNs) have recently emerged to be a cost-effective solution to support large-scale wireless Internet access. Handoff management plays an important role in WMNs in delivering Quality of Service to mobile users. In this paper, the handoff support in Internet-based infrastructure WMNs is investigated. Previous solutions on handoff management in infrastructure WMNs mainly focus on intragateway mobility (e.g., single gateway is assumed in IEEE 802.11s WMNs). Furthermore, new handoff issues involved in intergateway mobility in WMNs (e.g., the network-layer handoff detection issue) have not been properly addressed. In this paper, a new architectural design, IMeX, is proposed to facilitate intergateway handoff management in Internet-based infrastructure WMNs. The proposed IMeX architecture is designed to specifically address the special handoff challenge in Internet-based WMNs. It can facilitate parallel executions of handoffs from multilayers, in conjunction with a data caching mechanism which guarantees minimum packet loss during handoffs. The required number and optimal placement of special mesh routers that form the IMeX architecture are modeled as a set covering problem which is solved based on a greedy algorithm. A comprehensive simulation study shows that the IMeX architecture enables fast handoffs and reestablishment of session communications in the intergateway mobility environment. Performance results demonstrate that the proposed IMeX architecture, with both the parallel handoff execution and data caching mechanism, outperforms the conventional WMN handoff schemes in terms of reducing handoff delays caused in multilayers and improving end-to-end performance of applications in WMNs.

토너먼트 스케줄링을 이용한 무선싱크 혼잡제어

무선 싱크 노드에서 중요도가 낮은 데이터 패킷들을 업 스트림 할 때 혼잡과 지연이 발생하며, 이것은 에너지 효율, 메모리, 버퍼 크기 및 처리율 등에 영향을 미친다. 본 논문에서는 토너먼트 스케줄링을 이용한 새로운 무선 싱크 혼잡 제어 메커니즘을 제안한다. 제안된 기법은 스트림 결정 모듈과 이를 적용하는 서비스 차별화 모듈로 구성된다. 토너먼트에서 승리한 최종 승자는 혼잡을 효율적으로 제어할 뿐만 아니라 혼잡 지연에 따른 패킷 손실을 최소화한다. 또한 승자는 에너지 소모를 감소시키고, QoS를 향상시킨다. 본 논문에서는 시뮬레이션을 통해서 혼잡지시자 기반 제어기법, 신뢰도 기반 제어 기법, 최선 전송 제어 기법, 그리고 제안된 기법의 효율성을 살펴보며, 결과를 통하여 제안된 기법의 성능이 효율적임을 제시한다. The up-streams of the continuous streaming of data packets with lower importance level in the wireless sink node can cause congestion and delay, they affect on energy efficiency, memory size, buffer size, and throughput. This paper proposes a new wireless sink congestion control mechanism based on tournament scheduling. The proposed method consists of two module parts: stream decision module part and service differentiation module part. The final winner in the tournament controls congestion effectively, minimizes packet loss due to congestion, decreases energy consumption, and improves QoS. The simulation result shows that the proposed method is more effective and has better performance compared with those of congestion descriptor-based control method, reliability-based control method, and best-effort transmission control method.

A New Highly Secure and Efficient Routing Algorithm for Wireless Sensor Network

In today’s world the security vulnerabilities are increasing day by day. It is really difficult to route the packet with minimum packet loss with less power consumption and high energy efficiency. In this paper a new routing protocol is presented which would route the packets in a highly efficient way by introducing the concept of friend list, unauthenticated list and question mark list. The algorithm will avoid the malicious node by studying the network in an intelligent way. The algorithm works by sending challenges and sharing friend list to provide a list of trusted nodes to the source node through which data is transmitted [1]. The proposed algorithm is also compared with the existing algorithms namely Trust-Based Multipath Routing (TMR), Disjoint Multipath Routing (DMR). Message Trust-Based Multipath Routing(MTMR) and the performance analysis proves that the proposed method will have better performance with respect to number of hops, route discovery time, power consumed, energy efficiency and packet loss.

Efficient Broadcasting in Mobile Ad Hoc Networks Using Context Aware Adaptive Routing Protocol during Network Partitions

Problem statement: In mobile ado network, broadcasting is a common operation for route establishment and for sending control and emergency messages. Reliable Broadcasting in mobile ad hoc networks requires delivery of messages from different sources to all the nodes of the network within bounded time. The nodes are highly mobile and the network is highly dynamic and decentralized. Most of the existing routing protocols in MANET have the assumption that a path exists between the sender and the receiver. But the decentralized mobile ad hoc network is characterized by frequent network partitions. Providing reliable broadcasting is a challenging task. Approach: In study, a new context aware adaptive routing protocol is designed for broadcasting. The protocol is based on the idea of exploiting nodes as carriers of messages among network partitions to achieve guaranteed delivery. The choice of the best carrier is made dynamically by using Kalman filter based prediction techniques and utility theory. Results: Simulation results show that the proposed protocol achieves better packet deliver ratio with reduced control overhead and packet loss during network partition. Conclusion: The proposed routing protocol chooses the carrier node dynamically based on the context information, it provides reliable broadcasting to all the nodes with minimum packet loss and control overhead.

Increased Throughput for Load based Channel Aware Routing in MANETs with Reusable Paths

he widespread applications of Mobile Ad hoc Networks (MANETs) have lead to the development of many protocols in this field. Routing protocols for ad hoc networks have generally ignored channel fading. This paper proposes a routing protocol which calculates the channels non-fading duration for routing which attempts to minimize packet loss due to fading and also reuse the path with some security mechanisms to increase the throughput. Specifically, in the proposed work the faded paths can be reused when they become available again, rather than being discarded, also the loads are balanced on the link. The Channel Aware - Ad hoc On-demand Multipath Distance Vector (CA-AOMDV) used for channel average non-fading duration as the routing metric. The Load Based Channel Aware - Ad hoc On-demand Multipath Distance Vector (LBCA-AOMDV) is used for increasing throughput and packet delivery ratio. The NS-2 is used to perform both the simulation and evaluation of the performance of proposed protocol and to compare it with existing protocols. The simulation result demonstrates improvement in the throughput, packet delivery ratio, security and reduction of packet loss on routing.

An Optical Packet Switch with a Limited Number of TWCs and Internal Wavelengths for the Hybrid Buffer

A hybrid buffer structured optical packet switch and its scheduling algorithm are presented for a limited number of tunable wavelength convertors (TWCs) and internal wavelengths. The hybrid buffer consists of the fiber delay line (FDL) buffer and the electronic buffer. With the proposed algorithm, it could lead realizable packet loss reduction that the LAUC-VF algorithm with only the FDL buffer does not reach. Also, we optimized the number of TWCs and internal wavelengths of the hybrid buffer structured OPS. For the fully shared TWC structure, the optimum number of TWCs and internal wavelengths to guarantee minimum packet loss is evaluated to prevent resource waste under the hybrid buffer.

Reliable routing for low-power smart space communications

Smart space (SS) communication has rapidly emerged as an exciting new paradigm that includes ubiquitous, grid and pervasive computing to provide intelligence, insight and vision for the emerging world of intelligent environments, products, services and human interaction. Dependable networking of a SS environment can be ensured through reliable routing, efficient selection of error-free links, rapid recovery from broken links and the avoidance of congested gateways. Since link failure and packet loss are inevitable in SS wireless sensor networks (WSNs), the authors have developed an efficient scheme to achieve a reliable data collection for SSs composed of low capacity wireless sensor nodes. WSNs must tolerate a certain lack of reliability without a significant effect on packet delivery performance, data aggregation accuracy or energy consumption. An effective hybrid scheme is presented that adaptively reduces control traffic with a metric that measures the reception success ratio of representative data packets. Based on this approach, the proposed routing scheme can achieve reduced energy consumption while ensuring minimal packet loss in environments featuring high link failure rates. The performance of the proposed routing scheme is experimentally investigated using both simulations and a test bed of TelosB motes. It is shown to be more robust and energy efficient than the network layer provided by TinyOS2.x. The results show that the scheme is able to maintain better than 95% connectivity in an interference-prone medium while achieving a 35% energy saving.

A Novel Method of Feedback Reducing and Cross-layer Scheduling Based on Traffic Rates for Relay System

This paper studies the scheduling schemes in multiuser downlink relay systems with orthogonal frequency division multiple access (OFDMA) where base station (BS) supports different traffic rates for different users. We formulate the problem as a cross-layer design of joint feedback reducing and OFDMA scheduling to support traffic rates and minimize packet loss rate. In most previous scheduling mechanisms with feedback, the parameters of traffic arrival process were not taken into account, consequently, the requirement of user traffic can not be guaranteed. In this paper, a dynamic threshold feedback mechanism (DTFM) based on traffic rates is proposed, of which the user with channel gain being larger than the dynamic threshold is only allowed to send its channel state information, thereby reducing the number of required feedback users and the computational burden of exhaustive search for best users at the BS. A cross-layer scheduling algorithm of traffic and queue proportional fairness (TQPF) taking into consideration the traffic fairness, the user queue length and the user transmission rate (related to its channel quality) is then proposed. Finally, a method of feedback reducing and cross-layer scheduling, i.e., TQPF based on DTFM (TQPF-DTFM), is proposed. Theoretical and simulation results show that DTFM reduces feedback by more than 90%, and TQPF-DTFM successfully meets user traffic rates that is, the user with high traffic rate can obtain more transmission rate than the user with low traffic rate and deceases packet loss rate of the system by almost 50% than the conventional methods.

무선 네트워크 환경에서 효과적인 영상 스트리밍을 위한 And-Or 트리 기반의 LT 부호화 심볼 패킷화 알고리즘

본 논문에서는 무선 네트워크 환경에서의 패킷 손실에 따른 영상 스트리밍 서비스의 영상 열화를 최소화 시키는 And-Or 트리 기반의 LT 패킷화 알고리즘을 제안한다. 심볼들의 효율적인 패킷화를 위해 And-Or 트리를 통한 심볼들 간의 관계를 분석하고 이 관계를 바탕으로 LT 부호화 심볼들이 포함된 패킷들 간의 의존성을 줄여 패킷손실에 대한 영향을 최소화 시키는 패킷화 알고리즘을 설계한다. 마지막으로 무선 네트워크 환경에서 영상 스트리밍 시스템을 통해 제안한 패킷화 알고리즘이 기존의 패킷화 알고리즘보다 더 향상된 복호화 성능과 영상 화질을 제공할 수 있음을 보인다. In this paper, we propose a robust And-Or tree-based Luby transform encoded symbol packetization algorithm to minimize the quality degradation of video streaming service caused by packet losses over wireless network. To achieve this goal, the relationship among Luby transform encoded symbols are analyzed by using And-Or tree, and the proposed packetization algorithm is designed to minimize packet loss effects by reducing the dependency among packets conveying Luby transform encoded symbols. Finally, experimental results are provided to show the performance of the proposed algorithm.

A Robust Luby Transform Encoding Pattern-Aware Symbol Packetization Algorithm for Video Streaming Over Wireless Network

In this paper, we propose a Luby transform encoding pattern-aware symbol packetization algorithm to minimize the quality degradation of video streaming service caused by packet losses over wireless network. To achieve this goal, the relationship among Luby transform encoded symbols is analyzed based on Luby transform encoding pattern, and the proposed packetization algorithm is designed to minimize packet loss effects by reducing the dependency among packets conveying Luby transform encoded symbols. Finally, experimental results are provided to show the performance of the proposed algorithm.

HYBRID BACKUP MODEL WITH GENETIC BRANCH POINT OPTIMIZATION FOR SINGLE ELEMENT FAILURE IN MPLS NETWORKS

In this paper, we present an approach for enhancing current MPLS resilience, called Hybrid Backup model (HB), in order to restore a QoS protection path from both node or link failures. At present, there are three main MPLS fault management methods, i.e., global, reverse and local backup models. Firstly, the global backup model is the cheapest model but it suffers from high packet losses and long restoration time. Secondly, the reverse backup model improves the packet loss problem; however, the delay problem still remains. Thirdly, the local backup method is seemed to be the best choice in case of the minimum restoration time and packet losses, nevertheless, it has high cost in term of number of path switch label switching router (PSL), path merge label switching router (PML), label usage, and bandwidth reserved. Therefore, we proposed a new approach based on hybrid of four switching types which are global, global reverse, local and local reverse switching types. To evaluate number and location of branch point, branch point optimization based on Genetic Algorithm is then proposed. The proposed model can be reduce the cost of the local backup model, while it still maintains fast restoration and low packet losses. Furthermore, it can improve some significant network performances such as bandwidth reserved, rejection probability, and total throughput. According to performance comparison between all backup models, numerical and simulation results are presented to support the proposed backup model.

An Experimental Analysis of Random Early Discard (RED) Queue for Congestion Control

Active Queue Management (AQM) is receiving wide attention as a promising technique to prevent and avoid congestion collapse in packet-switched networks. By providing advanced warning of incipient congestion, end nodes can respond to congestion before router buffer overflows and hence ensure improved performance. Random Early Discard (RED) is an IETF recommended active queue management scheme that is expected to provide several Internet performance advantages such as minimizing packet loss and router queuing delay, avoiding global synchronization of sources, guaranteeing high link utilization and fairness. It tends to drop packets from each connection in proportion to the transmission rate the flow has on the output link. It does not minimize the number of dropped packets as expected, but it manages to achieve improved performance when compared to the Tail Drop. In this paper, extensive experimental analysis has been carried out on RED using Network Simulator (NS-2) in relation to congestion control and decision has been settled where RED can perform better.

An Integrated Multi-layer Approach for Seamless Soft Handoff in Mobile Ad Hoc Networks

The handoff problem in ad hoc networks needs to be treated through an integrated multi-layer approach, due to its major differences with respect to the counterpart in infrastructure-based networks. In this paper, an integrated framework through the cross layer approach is presented to deal with the handoff problem in heterogeneous wireless networks with multiple interfaces. Further, extensive study has been conducted to evaluate our proposed handoff solution through simulation, emulation with real wireless hardware in the loop, and hardware tests using commercial-off-the-shelf Android phones and GSM base station systems. It has been shown through our study that transparent user application can be achieved using our handoff approach with low latency, minimum packet losses and only necessary control overhead.

무선랜 환경에서 서비스 연속성 지원을 위한 IMS 기반 핸드오버 지원 방안

본 논문은 단일 무선랜 인터페이스를 갖는 IMS 단말에서 서비스 연속성을 지원하기 위해 패킷 손실을 최소화하는 L3 핸드오버 지원방안을 제안한다. 기존 IMS 서비스 연속성 지원 방안은 하나의 단말 내에 존재하는 다수의 인터페이스를 통해 서로 다른 접속망을 경유하여 IMS 코어 네트워크와의 통신이 가능한 상태에서 이동성 제공이 가능하다. 하지만, 단일 인터페이스를 갖는 무선랜 단말은 동시에 하나 이상의 접속망을 통해 IMS 코어 네트워크와 통신을 할 수 없다. 제안 방안은 Candidate Access Router Discovery(CARD) 매커니즘을 이용하여 타겟 WLAN 영역에서 단말이 사용할 IP를 미리 구성하고, 서비스 연속성 서버가 단말을 대신하여 타겟 WLAN 영역에서의 L3 연결 과정 및 IMS 서버로의 등록절차를 수행한다. 이후 서비스 연속성 제공을 위해 SIP 기반의 세션 제어 메커니즘을 수행한다. 제안된 핸드오버 제공 방안의 성능 검증을 위해 기존 서비스 연속성 제공 방안과 제안 방안에 대한 핸드오버 지연(latency), 시그널링 비용(cost)을 비교 분석하였다. This paper proposes a L3 handover method to minimize packet loss for supporting service continuity to IMS Terminal which has a single WLAN interface. The existing IMS based handover solution is able to support handover between different access networks in case that a terminal has multiple interfaces. That is, WLAN terminals need multiple interfaces to connect with one or more access networks. This proposed method configures IP address for the terminal in target WLAN previously by using Candidate Access Router Discovery(CARD) mechanism. Also, in the proposed method, service continuity server performs L3 connection establishment in target WLAN and registration to IMS server instead of the terminal. And then session control mechanism based on SIP is performed to support service continuity. We analyzed handover latency and signaling cost in the proposed method and existing method to show the improved performance by the proposed method.

Tournament‐based congestion control protocol for multimedia streaming in ubiquitous sensor networks

SUMMARYCongestion in the ubiquitous sensor network occurs when traffic load exceeds available capacity at any point in a network. Congestion causes overall channel quality to degrade and loss rates to rise, leads to buffer drops and increases latencies. Therefore, congestion and latency have effects on energy efficiency, memory size, buffer size, and throughput. This paper proposes a new method, called TCCP (Tournament‐based Congestion Control Protocol), to minimize congestion in the ubiquitous sensor network. In this paper, the winner is the stream with the highest importance level in the competition of ubiquitous sensor network. In general, there are a lot of congestion and delay in the continuous streaming of multimedia streams with lower importance level. The proposed method consists of three parts: tournament decision, best‐fit control strategy and service differentiation. The final winner in the tournament controls congestion effectively, minimizes packet loss due to congestion, decreases energy consumption, and improves QoS. The simulation result shows that the proposed method is more effective and has better performance compared with those of CCF (congestion control and fairness), PCCP (priority based congestion control protocol), and CODA (congestion detection and avoidance). Copyright © 2010 John Wiley & Sons, Ltd.

Wavelength Converted Broadcast-Selective Buffering Contention Resolution in Synchronous WDM OPS Networks

In this paper, we propose a new composed buffer structure termed as wavelength converted broadcast-selective (WCBS). It copies each packet after conversion to all fiber delay lines, and makes the packet management flexible and efficient. By rearranging the packet waiting queue, the highest priority packet can leave the buffer without considering the existing queue, which makes preemption possible. Moreover, we construct an OPS node architecture employing the as-proposed WCBS buffer in output-buffered pattern. Some proper switching strategies are introduced to operate the switching node effectively. An analysis model is established to describe the packets in the node. The minimum packet loss performances under different traffic loads with different buffer parameters are calculated. The results are further verified by simulations. It implies that the WCBS buffer improves the performance of high priority packets effectively, especially when the high priority packet load is low.

PERFORMANCE EVALUATION OF INTEGRATED MACRO AND MICRO MOBILITY PROTOCOLS FOR WIDE AREA WIRELESS NETWORKS

The success of next generation wireless networks will rely much on advanced mechanisms for seamless mobility support among emerging heterogeneous technologies. Currently, Mobile IP is the most promising solution for mobility management in the Internet. Several IP micro mobility approaches have been proposed to enhance the performance of Mobile IP which supports quality of service, minimum packet loss, limited handoff delay and scalability and power conservation but they are not scalable for macro mobility. A practical solution would therefore require integration of Mobile IP and Micro mobility protocols where Mobile IP handles macro mobility and micro mobility protocols handles micro mobility. In this paper an integrated mobility management protocol for IP based wireless networks is proposed and analyzed. Simulation results presented in this paper are based on ns 2.

A New Reactive FMIPv6 Mechanism for Minimizing Packet Loss

This paper considers a new reactive fast handover MIPv6 (FMIPv6) mechanism to minimize packet loss of the existing mechanism. The primary idea of the proposed reactive FMIPv6 mechanism is that the serving access router buffers packets toward the mobile node (MN) as soon as the link layer between MN and serving base station is disconnected. To implement the proposed mechanism, the router discovery message exchanged between MN and serving access router is extended. In addition, the IEEE 802.21 Media Independent Handover Function event service message is defined newly. Through analytic performance evaluation and experiments, the proposed reactive FMIPv6 mechanism can be shown to minimize packet loss much than the existing mechanism.

New Approach to Dynamic and Seamless Management of Network and Computational Resources in a Heterogeneous Grid Environment

Progress in the field of distributed computing and development of advanced Grid services has a significant influence on the concrete results of cooperation between distributed computing centers in various parts of the world. Advanced applications using remote access to distributed computing resources, data repositories and laboratories impose strong requirements on data networks. Very often these requirements can be met only by technologically advanced optical networks. Guaranteed availability of bandwidth for data transfer between computing nodes, low and stable over time and the minimum packet loss are just some of the parameters that are important for the new generation networks. Moreover, the problem of scalability, particularly in the context of an increase of the size of Grid systems with high requirements to the network, significantly affects the complexity of infrastructure management systems, mainly due to the heterogeneity of the environment and the potential administrative divisions. In order to increase processing efficiency of distributed computing, it is necessary to automate processes related to the management of infrastructure components. This is particularly important in the context of Grid environments connected via optical networks. Depending on the type of computing application, it is a network layer which is responsible for allocating inter-connections between computing sites with particular requirements on duration and the requested bandwidth. The possibility of a dynamic allocation of connections between computing sites is an essential element which allows for the efficient and effective use of optical networks in complex computational processes.