نتایج جستجو برای: distance vector routing
تعداد نتایج: 474064 فیلتر نتایج به سال:
In this paper, we make a survey of Distance Vector Multicast Routing Protocol (DVMRP) andfind that it is not optimal in the aspect of network cost (NC). Therefore, we propose a modified version of DVMRP, called “Group Membership Near First-DVMRP” (GMNF-DVMRP), to decrease the NC of the multicast tree formed by DVMRP. A simulation is implemented to compare our modified version and the original D...
Routing overlays have the potential to circumvent Internet pathologies to construct faster or more reliable paths. We suggest that overlay routing protocols have yet to become ubiquitous because they do not incorporate mechanisms for finding and negotiating with mutually advantageous peers: nodes in the overlay that can benefit equally from each other. We show that mutually advantageous peers e...
| In this paper, we consider the deeection worm routing problem on n n meshes. In deeection routing a message cannot be queued and it is always moving until it reaches its destination. In worm routing, the message is considered to be a worm; a sequence of k its which, during the routing, follow the head of the worm which knows the destination address. We show how to derive a deeection worm rout...
In this paper we consider the problem of reliable communication in wireless routing protocols. Many routing protocols for wireless networks use assumptions, that are known to be invalid in this special kind of networks. These shortcomings are not detected in the protocol evaluation, because common simulation tools are also based on these assumptions. In this paper we present a more realistic si...
We evaluate several routing protocols for mobile, wireless, ad hoc networks via packet level simulations. The protocol suite includes routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector, used for dynamic networks. Performance is evaluated with respect to fraction of packets delivered, end-to-end delay and rout...
We evaluate several routing protocols for mobile, wireless, ad hoc networks via packet level simulations. The protocol suite includes routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector, used for dynamic networks. Performance is evaluated with respect to fraction of packets delivered, end-to-end delay and rout...
Ad hoc networks are mobile wireless networks where each node is acting as a router. The existing routing protocols such as Destination sequences distance vector, Optimized list state routing protocols, Ad hoc on demand routing protocol, Ad hoc on demand multipath routing protocol, Dynamic source routing are optimized versions of distance vector or link state routing protocols. In this paper, ex...
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes. However, the distance measure cannot be applied on star graphs directly, since there are many routing path patterns when the distances of two pairs of nodes are the same. Thus, on star graphs, we define the safety ve...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید