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

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

2004
Ben P. Milner Alastair Bruce James

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 ...

2001
Takashi Yamaguchi Ken-ichi Baba Masayuki Murata Ken-ichi Kitayama

In this paper, we comparatively evaluate two photonic packet switch architectures with WDM-FDL buffers for synchronized variable length packets. The first one is an output buffer type switch, which stores packets in the FDL buffer attached to each output port. Another is a shared buffer type switch, which stores packets in the shared FDL buffer. The performance of a switch is greatly influenced...

1994
Antonios Symvonis

In this paper we present the multistage off-line method, a new and rather natural way to model off-line packet routing problems, which reduces the problem of off-line packet routing to that of finding edge disjoint paths on a multistage graph. The multistage off-line method can model any kind of routing pattern on any graph and can incorporate the size of the maximum queue allowed in any proces...

Security is the major area of concern in communication channel. Security is very crucial in wireless sensor networks which are deployed in remote environments. Adversary can disrupt the communication within multi hop sensor networks by launching the attack. The common attacks which disrupt the communication of nodes are packet dropping, packet modification, packet fake routing, badmouthing atta...

2003
Tsuyoshi Horiguchi Hideyuki Takahashi Keisuke Hayashi Chiaki Yamaguchi

An Ising model is proposed for a packet routing control with priority links for computer networks within a framework of statistical physics. An energy function for the Ising model is defined in order to express competition among a queue length and a distance from a node, where a packet exists, to a destination node of that packet. We use a mean-field approximation for the system in order to int...

2003
Jarmo Harju

-Many packet scheduling mechanisms have been proposed to provide rate and delay control to flows. The mechanisms providing strict delay bounds require per-flow state and complex packet classification, which hamper their deployment on a large scale. This paper presents a scheduling mechanism for delay control that does not require per-flow state in interior network nodes (a.k.a. corestateless ne...

Journal: :JNW 2012
Vincenzo Eramo Lorenzo Piazzo Angelo Germoni Antonio Cianfrani Marco Listanti

In this paper we investigate the performance of an Optical Code Division Multiplexing/Wavelength Division Multiplexing (WDM/OCDM) Optical Packet Switch when impairment due to both Multiple Access Interference and Beat noise are taken into account. Analytical models are introduced to dimension the switch resources, in particular the number of optical codes carried on each wavelength. The Packet ...

2010
J. D. Mallapur

----------------------------------------------------------------------ABSTRACT------------------------------------------------------------------In wireless networks, resource management is a very complicated issue because of scarcity in resources. This paper presents a fuzzy based packet dropping scheme for wireless networks in the context of future generation cellular networks. In this scheme,...

Journal: :CoRR 2017
Ning Li José-Fernán Martínez Vicente Hernández Díaz José Antonio Sánchez Fernández

In the Vehicular ad hoc networks (VANETs), due to the high mobility of vehicles, the network parameters change frequently and the information which the sender maintains may outdate when it wants to transmit data packet to the receiver, so for improving the routing effective, we propose the probability prediction based reliable (PRO) opportunistic routing for VANETs. The PRO routing algorithm c...

2001
Yihan Li Shivendra S. Panwar H. Jonathan Chao

Virtual Output Queuing is widely used by fixed-length highspeed switches to overcome head-of-line blocking. This is done by means of matching algorithms. Maximum matching algorithms have good performance, but their implementation complexity is quite high. Maximal matching algorithms need speedup to guarantee good performance. Iterative algorithms (such as PIM and iSLIP) use multiple iterations ...

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

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