Zobrazeno 1 - 10
of 2 237
pro vyhledávání: '"DSRFLOW"'
Publikováno v:
International Journal of Communication Networks and Information Security (IJCNIS). 5
In Ad Hoc networks, route failure may occur due to less received power, mobility, congestion and node failures. Many approaches have been proposed in literature to solve this problem, where a node predicts pre-emptively the route failure that occurs
Autor:
Stefano Previdi, John Leddy, Satoru Matsushima, Darren Dukes, Clarence Filsfils, Daniel Voyer
Segment Routing can be applied to the IPv6 data plane using a new type of Routing Extension Header. This document describes the Segment Routing Extension Header and how it is used by Segment Routing capable nodes.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::127250b76905a3f836e86ba9c273ef44
https://doi.org/10.17487/rfc8754
https://doi.org/10.17487/rfc8754
Autor:
Ahmed Bashandy, Bruno Decraene, Les Ginsberg, Stefano Previdi, Hannes Gredler, Clarence Filsfils
Segment Routing (SR) allows for a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological sub-paths, called "segments". These segments are advertised by the link-state routing protocols (IS-IS and O
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4201e6579ed17a89e3d92e35f41f402f
https://doi.org/10.17487/rfc8667
https://doi.org/10.17487/rfc8667
Autor:
Stephane Litkowski, Bruno Decraene, Ahmed Bashandy, Stefano Previdi, Rob Shakir, Clarence Filsfils
Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with an SR header. In the MPLS dataplane, the SR header is instantiated through a l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6923d9926e96bdec4aa22405f62aef17
https://doi.org/10.17487/rfc8660
https://doi.org/10.17487/rfc8660
Publikováno v:
IEEE Transactions on Cloud Computing. 6:464-477
In recent years cloud computing provides a new way to address the constraints of limited energy, capabilities, and resources. Distributed hash table (DHT) based distributed networks have become increasingly important for efficient communication in la
Publikováno v:
Simulation Modelling Practice and Theory. 80:50-65
Ad-hoc network consists of a group of mobile nodes with a restricted power supply resources that can communicate with each other without any established infrastructure or centralized administration. The unbalanced distribution of traffic loads among
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 37:217-230
Detailed routing is an important stage in very large scale integrated physical design. Due to the extreme scaling of transistor feature size and the complicated design rules, ensuring routing completion without design rule checking (DRC) violations b
Publikováno v:
Ad Hoc Networks. 67:1-10
Greedy Forward is a well-known technique used by most of the geographic routing algorithms to forward packets to the node that is geographically closer to the destination node. It is the simplest form of the proposed geographic routing algorithms and
Publikováno v:
Multimedia Tools and Applications. 77:16927-16946
Sensor networks designed especially for the multimedia applications require high data rate and better Quality of Service (QoS). Offering a reliable and energy efficient routing technique in a harsh and complex three-dimensional (3-D) environment for
Publikováno v:
Indian Journal of Science and Technology. 10:1-6
Objectives: To provide characteristics of several routing algorithms by discussing the benefits and limitations in relevance to various metrics namely number of packets send, Packets dropped, delivery ratio and throughput. Methods/Statistical analysi