نتایج جستجو برای: packet length

تعداد نتایج: 347989  

2008
A. Jayasumana

This document presents two improved metrics for packet reordering, namely, Reorder Density (RD) and Reorder Buffer-occupancy Density (RBD). A threshold is used to clearly define when a packet is considered lost, to bound computational complexity at O(N), and to keep the memory requirement for evaluation independent of N, where N is the length of the packet sequence. RD is a comprehensive metric...

Journal: :Optics express 2004
Harald Øverby

A crucial issue in optical packet switched (OPS) networks is packet losses at the network layer caused by contentions. This paper presents the network layer packet redundancy scheme (NLPRS), which is a novel approach to reduce the end-to-end data packet loss rate in OPS networks. By introducing redundancy packets in the OPS network, the NLPRS enables a possible reconstruction of data packets th...

2012
Zhi Xu Hung-Yuan Hsu Xin Chen Sencun Zhu Ali R. Hurson

Packet traceback in mobile ad hoc networks (MANETs) is a technique for identifying the source and intermediaries of a packet forwarding path. While many IP traceback techniques have been introduced for packet attribution in the Internet, they are not directly applicable in MANETs due to unique challenges of MANET environments. In this work, we make the first effort to quantitatively analyze the...

Journal: :Theor. Comput. Sci. 2017
Antonio Fernández Chryssis Georgiou Dariusz R. Kowalski Elli Zavou

In this work we consider the communication over a wireless link, between a sender and a receiver, being disrupted by a jammer. The objective of the sender is to transmit as much data as possible to the receiver in the most efficient way. The data is sent as the payload of packets, and becomes useless if the packet is jammed. We consider a jammer with constrained power, defined by parameters ρ a...

Journal: :IEEE Trans. Wireless Communications 2014
Yalcin Sadi Sinem Coleri Ergen

Traditional approach to the minimum length scheduling problem ignores the packet level details of transmission protocols, meaning that a packet transmission can be divided into several data chunks each of which is transmitted at different rate due to the difference in the set of concurrently transmitting nodes. This solution requires including packet headers for each data chunk resulting in bot...

2013
Kajal Yadav Gaurav Shrivastava

Mobile Ad hoc network [MANET] consists of mobile nodes without any fixed infrastructure, communicating through wireless medium. In MANET, Congestion occurs in any intermediate nodes when data packets travel from source to destination and they incur higher packet loss rate and long delay, which cause the degradations in performance of a network. Congestion can be controlled by Active Queue Manag...

2011
Mari Carmen Domingo

© 2011 Mari Carmen Domingo 299 Energy consumption is a key issue in body sensor networks (BSNs) since energy-constrained sensors monitor the vital signs of human beings in healthcare applications. In this paper, packet size optimization for BSNs has been analyzed to improve the efficiency of energy consumption. Existing studies on packet size optimization in wireless sensor networks cannot be a...

Journal: :IEICE Transactions 2007
Tatsuya Mori Tetsuya Takine Jianping Pan Ryoichi Kawahara Masato Uchida Shigeki Goto

With the rapid increase of link speed in recent years, packet sampling has become a very attractive and scalable means in collecting flow statistics; however, it also makes inferring original flow characteristics much more difficult. In this paper, we develop techniques and schemes to identify flows with a very large number of packets (also known as heavy-hitter flows) from sampled flow statist...

2013
Suoping Li Yongqiang Zhou

Selective-Repeat ARQ (Automatic Repeat reQuest) protocol is the most efficient error control technology in wireless because it allows the transmitter to retransmit only negatively acknowledges (NACK) packets. In this paper, by analyzing the transmission mechanism of SR-ARQ, the discrete-time Geom/G/1/ queue model is established sententiously based on equivalent delay under the condition that th...

Journal: :CoRR 2016
Jingmei Ai Thomas Honold Haiteng Liu

As shown in [31], one of the five isomorphism types of optimal binary subspace codes of size 77 for packet length v = 6, constant dimension k = 3 and minimum subspace distance d = 4 can be constructed by first expurgating and then augmenting the corresponding lifted Gabidulin code in a fairly simple way. The method was refined in [36, 29] to yield an essentially computer-free construction of a ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید