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

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

Journal: :J. Inf. Sci. Eng. 2015
David Chunhu Li Li-Der Chou Li-Ming Tseng Yi-Ming Chen

Energy efficient routing protocols can potentially reduce the amount of energy consumed in packet forwarding. However, existing literature lacks studies on improving green performance of geocast routings for the Internet of Vehicles. Therefore, this study proposes an energy efficient min delay (EEMD)-based geocast routing protocol to find optimal relay nodes by incorporating energy consumption ...

2000
Paul Boustead Joe F. Chicharo

Optical switching will enable core Internet packet switching to scale with future transmission rate increases. Currently proposed optical ATM switches do not allow packet reassembly, which is necessary for packet level forwarding. This results in the requirement to create end to end ATM virtual connections for flows even if they contain only one packet. In electronically switched networks MPOA ...

Journal: :CoRR 2015
Adyasha Behera Amrutanshu Panigrahi

In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegan...

Journal: :IEEE Trans. Computers 2000
Asger Munk Nielsen David W. Matula Chung Nan Lyu Guy Even

ÐThis paper presents a floating-point addition algorithm and adder pipeline design employing a packet forwarding pipeline paradigm. The packet forwarding format and the proposed algorithms constitute a new paradigm for handling data hazards in deeply pipelined floating-point pipelines. The addition and rounding algorithms employ a four stage execution phase pipeline with each stage suitable for...

2002
Naouel Ben Salem Levente Buttyán Jean-Pierre Hubaux Markus Jakobsson

We assume the existence, in each node, of a tamper resistant hardware module called security module that maintains a nuglet counter. The nuglets are used to charge/reward the packet forwarding service. When a node sends an own packet, it decreases its counter by n (the number of intermediate nodes in the path) and each of the forwarding nodes increases its counter by 1. We conducted C++ simulat...

2010
Hugo E. T. Carvalho Rodrigo S. Couto Lyno Henrique G. Ferraz Natalia C. Fernandes Marcelo D. D. Moreira Igor M. Moraes Miguel Elias M. Campista Luı́s Henrique M. K. Costa Otto Carlos M. B. Duarte

Network virtualization allows the development of systems with several virtual routers (VR) over the same physical router. Each virtual router can execute, at the same time, different protocol stacks without disrupting the coexisting routers. The main purpose of this work is to analyze Xen capabilities and limitations and compare its efficiency with native solutions. Tests are performed in order...

2008
Martín Casado Teemu Koponen Daekyeong Moon Scott Shenker

For routers and switches to handle ever-increasing bandwidth requirements, the packet “fast-path” must be handled with specialized hardware. There have been two approaches to building such packet forwarding hardware. The first is to embed particular algorithms in hardware; this is what most commodity forwarding chips do (e.g., those from Broadcom, Marvell, and Fulcrum). These chips have led to ...

2017
Anirudh Sivaraman

This week we’ll talk about the data plane. Recall that the routing layer broadly consists of two parts: (1) the control plane that computes routes using distributed protocols such as the distance vector and link state protocols, and (2) the data plane that forwards packets based on routes computed by these protocols. The control plane kicks in every time the topology changes (e.g., a new router...

Journal: :Ad Hoc & Sensor Wireless Networks 2006
Yeng-Zhong Lee Mario Gerla Jason Chen Jiwei Chen Biao Zhou Antonio Caruso

Popular ad hoc routing protocols such as DSDV and AODV use “predecessor” based forwarding, namely, the packet is forwarded to the predecessor that advertised the shortest path to destination during the last update. However, if the predecessor moves, the routing table entry becomes invalid and predecessor based forwarding fails! To overcome the stale forward table problem, in this paper we propo...

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

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