Packet reordering adversely affects the behavior and performance of the Transmission Control Protocol (TCP), the predominant transport protocol on today's Internet. This shortcoming is becoming a problem of increasing importance, as packet reordering is on the rise on some Internet paths. The issue at the heart of TCP's poor performance in the presence of packet reordering is its inability to d...

Vehicular Adhoc Networks (VANETs) are special type of Mobile Adhoc networks (MANETs) where node movement is in pre ordered fashion but with high velocity in comparison to MANETs where nodes move in random manner. Due to high mobility of nodes, reliable data streaming in vehicular networks is a complex and challenging task. Moreover, transmission of data is difficult because of varying requireme...

The evaluation of packet loss compensation techniques for distributed speech recognition requires an effective model of packet loss that is capable of reproducing the burst-like occurrence of loss. Several models have been applied to this task and are based on two or three state Markov chains or Markov models. This work reviews these models in terms of their channel characteristics such as the ...

The evaluation of packet loss compensation techniques for distributed speech recognition requires an effective model of packet loss that is capable of reproducing the burst-like occurrence of loss. Several models have been applied to this task and are based on two or three state Markov chains or Markov models. This work reviews these models in terms of their channel characteristics such as the ...

Estimate of packet-loss rates between arbitrary Internet hosts is critical for many large-scale distributed applications, including overlay routing, P2P media streaming, VoIP, and edge-server location in CDNs. iPlane has been recently proposed to estimate delay, packet-loss rates, and bandwidth between arbitrary hosts [1]. To our knowledge, iPlane is the only published technique for estimating ...

We investigate packet loss in mobile ad hoc networks via simulation. Ad-hoc on-demand distance vector (AODV) and destination-sequenced distance vector (DSDV) are chosen as representatives of the on-demand and proactive routing protocols respectively. The effects of congestion and mobility in various network contexts are explored. The results indicate that DSDV loses 10% to 20% more packets than...

While random access presents a promising solution for efficient uplink channel access, the preamble collision rate can significantly increase when massive number of devices simultaneously access the channel. To address this issue and improve the reliability of the random access, an adaptive packet aggregation method is proposed. With the proposed method, a device does not trigger a random acces...

In this work, the perceived quality of VoIP communications is studied. The distributions of the number of consecutive received and lost packets, respectively named gap and burst, of a VoIP communication are modeled with discrete two-state and four-state Markov chains. Algorithms for estimating the transition probabilities between states and from these, the packet loss rate and the respective ga...

This paper explores packet loss recovery for automatic speech recognition (ASR) in spoken dialog systems, assuming an architecture in which a lightweight client communicates with a remote ASR server. Speech is transmitted with source and channel codes optimized for the ASR application, i.e., to minimize word error rate. Unequal amounts of forward error correction, depending on the data’s effect...

The OLSR protocol, as specified in RFC 3626 [1], a proactive, table-driven routing protocol, is a distributed algorithm that relies on all participating nodes obeying to a set of rules. Those rules could be broken easily by some malicious nodes in order to gain some advantage in the network or simply disrupt its proper operation. In this paper, we present a method to detect packet loss on links...