Author
Dharmendra Singh Yadav
Bio: Dharmendra Singh Yadav is an academic researcher from Indian Institute of Space Science and Technology. The author has contributed to research in topics: Backup & Path protection. The author has an hindex of 8, co-authored 18 publications receiving 173 citations.
Papers
More filters
TL;DR: It has been conclusively established that the proposed routing and spectrum assignment strategies (LLRSA and RFARSA) outperform the existing strategies in terms of all the metrics.
29 citations
TL;DR: In this article, the authors present a strategy for survivability which optimizes primary and backup spectrum allocations and multiple backup route assignments for surviving a connection request, named as Backup Spectrum Reservation with MultiPath Protection (BSR-MPP), which searches multiple backup routes over advance reserved backup resources when an optical connection is concerned.
26 citations
TL;DR: A comparative study of the proposed mixed connection recovery algorithm namely Adaptive Backup Routing over Reserved Resources (ABRRR) under the network parameters of Blocking Probability, Dual Restorability, and Resource Utilization Ratio (RUR) establishes that the use of ABRRR leads to lower Blocking probability, higher Dual Restoration, and minimized RUR compared to the existing strategies.
20 citations
TL;DR: A modified resource allocation strategy, namely, hybrid connection algorithm, for achieving efficient restoration in WDM optical networks, provides 100% restoration efficiency and much better performance than the existing techniques.
16 citations
TL;DR: Quasi Path Restoration provides a reasonable trade-off between bandwidth blocking probability and connection recoverability and is compared with Shared Path Protection and Primary First-Fit Backup Last Fit strategies in terms of Bandwidth Blocking Probability (BBP) and average frequency slots per connection request.
16 citations
Cited by
More filters
TL;DR: The results reveal that by using load-aware path selection and first-fit frequency-slice and time-slot assignment strategies the best compromise between blocking probability and initial delay is obtained.
Abstract: As elastic optical networks (EONs) are expected to convey high bitrate connections, a failure in these networks causes vast data losses. Thus, addressing the problem of survivability in EONs is of great importance. In this paper, survivability of an EON with multiclass traffic is investigated, where each traffic type needs specific protection mechanism and scheduling strategy. In particular, a connection request may demand for dedicated path protection, shared backup path protection, or restoration mechanism. Besides, it can tolerate a pre-determined delay and be scheduled at future time slots, referred to as advance reservation, or must be served immediately without any delay, referred to as immediate reservation. Accordingly, we formulate an integer linear programming (ILP) to solve the routing, spectrum and modulation level assignment, and scheduling problems in both static and dynamic operation scenarios. In addition, to reduce the complexity of the ILP formulation in large scale networks, we propose a number of heuristic algorithms, in which two and three methods are considered for path selection and resource allocation, respectively. We evaluate the proposed heuristic algorithms in a small scale network by comparing their performance with the ILP formulation, then we apply them in a realistic large scale network. We compare all algorithms in terms of blocking probability, initial delay, and spectrum efficiency. Our results reveal that by using load-aware path selection and first-fit frequency-slice and time-slot assignment strategies the best compromise between blocking probability and initial delay is obtained.
49 citations
TL;DR: A new fog layer among optical elements is proposed that utilizes the resources of the optical network to remove deadlock and ensure optimum resource utilization and latency measures can enable future computing with optical fog systems.
35 citations
TL;DR: It has been conclusively established that the proposed routing and spectrum assignment strategies (LLRSA and RFARSA) outperform the existing strategies in terms of all the metrics.
29 citations
TL;DR: The proposed SADQ is the first scheme in optical networks to employ exhaustive differentiation at the levels of routing, spectrum allocation, and survivability in a single algorithm and is compared with two existing benchmark routing and spectrum allocation schemes designed under EONs.
27 citations
TL;DR: Two energy-efficient heuristics are proposed to address the issues of inter-core crosstalk, and fragmentation within the core respectively- to ensure quality transmission of the optical signal for dynamic traffic in space division multiplexing elastic optical network (SDM-EON), while maintaining survivability of the network against single link failure.
Abstract: In this paper, we have proposed two energy-efficient heuristics: (i) CMDE-RSCA (crosstalk-aware), and (ii) FMDE-RSCA (fragmentation-aware) to address the issues of inter-core crosstalk, and fragmentation within the core respectively- to ensure quality transmission of the optical signal for dynamic traffic in space division multiplexing elastic optical network (SDM-EON), while maintaining survivability of the network against single link failure. These heuristics based on multipath based survivability are compared with three existing survivable approaches based on p-cycles and shared path in terms of bandwidth blocking, energy consumption, crosstalk, and fragmentation. Both these algorithms outperform all three existing heuristics in terms of all parameters. In between CMDE-RSCA and FMDE-RSCA, CMDE-RSCA leads to consume lesser energy, whereas FMDE-RSCA produces lesser bandwidth blocking.
25 citations