نتایج جستجو برای: packet fake routing

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

2002
Ken-ichi Kitayama Kiyoshi Onohara Masayuki Murata

We will focus on the novel applications of optical code base MPLS, so-called OC-MPLS to demonstrate its versatile capability. The OC-photonic label can be used as an identifier of the data encapsulated in an optical frame. The OC-photonic label is an optical code consisting of a sequence of optical chip pulses, and its recognition is performed based upon ultrafast time-domain optical correlatio...

2013
Praveen Lalwani Piyush Kumar Shukla

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes in which different routing protocols are used to form the communication network. So, far there are numerous routing protocols are discovered in which AODV performs superior than all. Ad-hoc network suffer from the bunch of issues in which congestion and security are the major issues of concern which leads to severe degrada...

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

Journal: :J. Parallel Distrib. Comput. 2005
Michihiro Koibuchi Juan Carlos Martínez Jose Flich Antonio Robles Pedro López José Duato

Adaptive routing, which dynamically selects the route of a packet, has been widely studied for interconnection networks in massively parallel computers and system area networks. Although adaptive routing has the advantage of providing high bandwidth, it may deliver packets out-of-order, which some message passing libraries don’t accept. In this paper, we propose two mechanisms called 1) FIFO tr...

Journal: :CIT 2013
Sumathy Subramaniam R. Saravanan Pooja K. Prakash

Mobile Ad hoc Network is an impromptu wireless network consisting of mobile, self governing independent nodes. Routing in Mobile Ad hoc Networks has been a major concern due to its dynamic topology, lossy and unreliable links. In traditional routing, a single specific node is selected in prior as the potential next-hop forwarder for a packet. Unlike traditional routing, a category of routing te...

2016
Nagaraj M. Lutimath Chandrakant Naikodi

One of the important research characteristic in the Mobile Ad hoc NETworks (MANETs) is routing. Development of efficient routing protocol is a necessity to improve the performance of routing. We propose an Efficient Interference Aware Multipath Dynamic Source Routing Protocol (EIAM-DSR) based on Dynamic Source Routing (DSR) protocol for MANETs. The main aim of the proposed routing protocol is t...

1997
Olav Lysne

Nodes communicating over HIC may either be interconnected directly by the use of one HIC-link, or indirectly by a network of HIC-routers. The HIC routers forwards packets in a way referred to as wormhole routing. This is a technique that has roots in an early work by Kermani and Kleinrock [8]. The idea in wormhole routing is that instead of storing each packet of data completely in each routing...

2015

In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet. The number of RREQ packet in the network gets added due to the increased amount of link fail...

2015
Bhupinder Kaur Vaibhav Pandey

Most existing routing protocols follow the shortest route for routing between sources to destination with minimum hop count. However the delay between two communicating nodes, energy consumption of nodes and network lifetime are never considered through this shortest route. It makes difficult to select a long lasting route between the nodes in network. To achieve optimal path, we have proposed ...

2007
Antonios Symvonis Jonathon Tidswell

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

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

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