Searching the Shortest Pair of Edge-Disjoint Paths in a Communication Network. A Fuzzy Approach

Valdés, Lissette; Quintana, Alfonso Ariza; Allende, Sira; Joya, Gonzalo

doi:10.1007/978-3-030-20518-8_53

Cited by 2 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Parallel to this work, this Strategy 8 has already been applied to the problem of searching for the shortest pair of disjoint edge paths in a communication network [5]. It has proven its effectiveness in managing a network with two types of traffic.…”

Section: Related Workmentioning

confidence: 98%

“…This fuzzy version of Dijkstra's algorithm can be considered as classical since it does not incorporate any consideration of uncertainty in its execution, but it incorporates uncertainty in the value of the variables (here considered as fuzzy) and in the definition of the mathematical operation between them. A very basic application of this work can be found in [5], where a pair of shortest-disjoint paths is identified with a simpler version of the Modified Dijkstra Algorithm. However, the complete description of the algorithm, the operation of the fuzzybased costs and their comparison with other classic approaches are firstly described in a scientific journal.…”

Section: Introductionmentioning

confidence: 99%

“…Normalized Mean Used Bandwidth, [5]: It is the mean value of the Used Bandwidth in a particular link, over a considered time interval. This value is normalized by the capacity of the link and is weighted according to the ratio between the network's larger capacity and the current link capacity.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions

et al. 2021

Self Cite

View full text Add to dashboard Cite

A communication network management system takes the measurements of its state variables at specific instants of time, considering them constant in the interval between two consecutive measurements. Nevertheless, this assumption is not true, since these variables evolve in real time. Therefore, uncertainty is inherent in the processing of the measurements during the intervals so that they cannot be efficiently managed using crisp variables. In this paper, we face this problem by modeling the communications network as a type-V fuzzy graph, where both the nodes and the links are described with precision, but the cost of each link is modeled as a triangular fuzzy number. Different fuzzy cost allocation functions and fuzzy optimization strategies are described and applied to the search for the shortest path between two nodes. An experimental study has been conducted using two representative networks: the backbone network of Nippon Telegraph and Telephone Corporation (NTT) and the National Science Foundation’s Network (NFSNET). In these networks, our fuzzy cost functions and strategies have been compared with the well-known crisp equivalents. The optimal search strategies are based on the proposed Fuzzy Dijkstra Algorithm (FDA), which is described deeply. The simulation results demonstrate that in all cases the fuzzy alternatives surpass or equal the crisp equivalents with statistically significant values. Specifically, the so-called Strategy 8 presents the best throughput, as it significantly exceeds the performance of all those evaluated, achieving a Global Mean Delivery Rate (GMDR) close to 1.

show abstract

Section: Related Workmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions

et al. 2021

Self Cite

View full text Add to dashboard Cite

show abstract

“…To clarify the description of the routes computation, we suppose that the source end node n i has its next-hop router to be r and the last router to the receiver end node n j to be t. Router r could be one of the nearby routers available to n i . Therefore, we can view the source as r and the destination as t. The job of the SDN controller is to identify a number of routes between r and t. The proposed algorithm is built upon the shortest paths pair routing proposed in [28]. The notations are as follows, H is the set of potential routers from among available routes, Γ(u) is the set of neighbor routers of u, K represents routes, r represents source, t represents the destination, u and v are intermediate routers in the route from r to t and v is the predecessor of u, d(x) stands for the cost of the link to router x, e stands for the link between a pair of routers (v, u), and C(v, u) represents cost between routers v and u.…”

Section: Proposed Frameworkmentioning

confidence: 99%

“…The job of the SDN controller is to identify a number of routes between r and t . The proposed algorithm is built upon the shortest paths pair routing proposed in [ 28 ]. The notations are as follows, H is the set of potential routers from among available routes,

is the set of neighbor routers of u , K represents routes, r represents source, t represents the destination, u and v are intermediate routers in the route from r to t and v is the predecessor of u ,

stands for the cost of the link to router x , e stands for the link between a pair of routers

, and

represents cost between routers v and u .…”

Section: Proposed Frameworkmentioning

confidence: 99%

Secure Route-Obfuscation Mechanism with Information-Theoretic Security for Internet of Things

Rauf

Wang

Sajid

et al. 2020

Sensors

View full text Add to dashboard Cite

As accessibility of networked devices becomes more and more ubiquitous, groundbreaking applications of the Internet of Things (IoT) find their place in many aspects of our society. The exploitation of these devices is the main reason for the cyberattacks in IoT networks. Security design is still an open problem and a crucial step in making IoT applications successful. In dicey environments, such as e-health, smart grid, and smart cities, real-time commands must reach the end devices in the scale of milliseconds. Traditional public-key cryptosystem, albeit necessary in the context of general Internet security, falls short in establishing new session keys in the scale of milliseconds for critical messages. In this paper, a systematic perspective for securing IoT communication, specifically satisfying the real-time constraint against certain adversaries in realistic settings. First, at the network layer, we propose a secret random route computation scheme using the software-defined network (SDN) based on a capability scheme using the network actions. The computed routes are random in the eyes of the eavesdropper. Second, at the application layer, the source breaks command messages into secret shares and sends them through the network to the destination. Only the legitimate destination device can reconstruct the command. The secret sharing scheme is efficient compared to PKI and comes with information-theoretic security against adversaries. Our proof formalizes the notion of security of the proposed scheme, and our simulations validate our design.

show abstract

Searching the Shortest Pair of Edge-Disjoint Paths in a Communication Network. A Fuzzy Approach

Cited by 2 publications

References 6 publications

Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions

Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions

Secure Route-Obfuscation Mechanism with Information-Theoretic Security for Internet of Things

Contact Info

Product

Resources

About