Searcharxiv⌕ Search

arXiv subjects

Yatindra Nath Singh

Publications and source records attributed to Yatindra Nath Singh.

At least 19 recordsLinked to original sources

Effect of Hotspot Traffic on Blocking Probability in Elastic Optical Networks

In a circuit-switched network, traffic can be characterized by several factors that define how communication resources are allocated and utilized during a connection. The amount of traffic basically determines how frequently connection requests arrive, how long the setup connection remains active, and the bandwidth used. The Poisson Arrival Process models traffic arrival events at random intervals. It assumes that events happen independently of one another. This model is ideal for simulating traffic in networks where arrivals happen independently and randomly, such as the start of phone calls, data requests, or packet transmissions. The Poisson Arrival Process and uniformly choosing source and destination pair is been used most commonly by researchers to generate traffic in a network to test various promising routing and spectrum assignment algorithms. It checks the algorithm in uniformly loaded conditions and estimate its baseline performance. In real real-world scenario, a bunch of network nodes can start experiencing heavy data traffic compared to the rest of the network. This can lead to latency issues, or even outages if the network is not optimized to handle the load at these nodes which are also called hotspots. In other terms, hotspot in a network is an area or set of nodes within the network that have a higher likelihood of being involved in communication or data transmission compared to other areas. In this paper, we have tried to find what are the various factors involved in increasing the blocking probability in hotspot traffic scenarios. We have also compared the results with the uniform traffic load conditions in same topology.

cs.NI↗

RMCSA Algorithm for Congestion-Aware and Service Latency Aware Dynamic Service Provisioning in Software-Defined SDM-EONs

The implementation of 5G and the future deployment of 6G necessitate the utilization of optical networks that possess substantial capacity and exhibit minimal latency. The dynamic arrival and departure of connection requests in optical networks result in particular central links experiencing more traffic and congestion than non-central links. The occurrence of congested links leads to service blocking despite the availability of resources within the network, restricting the efficient utilization of network resources. The available algorithms in the literature that aim to balance load among network links offer a trade-off between blocking performance and algorithmic complexity, thus increasing service provisioning time. This work proposes a dynamic routing-based congestion-aware routing, modulation, core, and spectrum assignment (RMCSA) algorithm for space division multiplexing elastic optical networks (SDM-EONs). The algorithm finds alternative candidate paths based on real-time link occupancy metrics to minimize blocking due to link congestion under dynamic traffic scenarios. As a result, the algorithm reduces the formation of congestion hotspots in the network owing to link-betweenness centrality. We have performed extensive simulations using two realistic network topologies to compare the performance of the proposed algorithm with relevant RMCSA algorithms available in the literature. The simulation results verify the superior performance of our proposed algorithm compared to the benchmark Yen's K-shortest paths and K-Disjoint shortest paths RMCSA algorithms in connection blocking ratio and spectrum utilization efficiency. To expedite the route-finding process, we present a novel caching strategy that allows the proposed algorithm to demonstrate a much-reduced service delay time compared to the recently developed adaptive link weight-based load-balancing RMCSA algorithm.

cs.NI↗

ReputeStream: Mitigating Free-Riding through Reputation-Based Multi-Layer P2P Live Streaming

This paper presents a novel algorithm for peer-to-peer (P2P) live streaming that addresses the limitations of single-layer systems through a multi-layered approach. The proposed solution adapts to diverse user capabilities and bandwidth conditions while tackling common P2P challenges such as free-riding, malicious behavior, churn, and flash crowds. By implementing a reputation-based system, the algorithm promotes fair resource sharing and active participation. The algorithm also incorporates a request-to-join mechanism to effectively manage flash crowds. In addition, a dynamic reputation system improves network efficiency by strategically positioning high-reputation peers closer to video sources or other significant contributors.

cs.NI↗

Design of Minimum Correlated, Maximal Clique Sets of One-Dimensional Uni-polar (Optical) Orthogonal Codes

This paper proposes an algorithm to search a family of multiple sets of minimum correlated one dimensional uni-polar (optical) orthogonal codes (1-DUOC) or optical orthogonal codes (OOC) with fixed as well as variable code parameters. The cardinality of each set is equal to upper bound. The codes within a set can be searched for general values of code length, code weight, auto-correlation constraint and cross-correlation constraint. Each set forms a maximal clique of the codes within given range of correlation properties . These one-dimensional uni-polar orthogonal codes can find their application as signature sequences for spectral spreading purpose in incoherent optical code division multiple access (CDMA) systems.

cs.IT↗

Adaptive Invariant Extended Kalman Filter with Noise Covariance Tuning for Attitude Estimation

Attitude estimation is crucial in aerospace engineering, robotics, and virtual reality applications, but faces difficulties due to nonlinear system dynamics and sensor limitations. This paper addresses the challenge of attitude estimation using quaternion-based adaptive right invariant extended Kalman filtering (RI-EKF) that integrates data from inertial and magnetometer sensors. Our approach applies the expectation-maximization (EM) algorithm to estimate noise covariance, exploiting RI-EKF symmetry properties. We analyze the adaptive RI-EKF's stability, convergence, and accuracy, validating its performance through simulations and comparison with the left invariant EKF. Monte Carlo simulations validate the effectiveness of our noise covariance estimation technique across various window lengths.

eess.SP↗

Robust Attitude Estimation with Quaternion Left-Invariant EKF and Noise Covariance Tuning

Accurate estimation of noise parameters is critical for optimal filter performance, especially in systems where true noise parameter values are unknown or time-varying. This article presents a quaternion left-invariant extended Kalman filter (LI-EKF) for attitude estimation, integrated with an adaptive noise covariance estimation algorithm. By employing an iterative expectation-maximization (EM) approach, the filter can effectively estimate both process and measurement noise covariances. Extensive simulations demonstrate the superiority of the proposed method in terms of attitude estimation accuracy and robustness to initial parameter misspecification. The adaptive LI-EKF's ability to adapt to time-varying noise characteristics makes it a promising solution for various applications requiring reliable attitude estimation, such as aerospace, robotics, and autonomous systems.

eess.SP↗

Reputation-Driven Peer-to-Peer Live Streaming Architecture for Preventing Free-Riding

We present a peer-to-peer (P2P) live-streaming architecture designed to address challenges such as free-riding, malicious peers, churn, and network instability through the integration of a reputation system. The proposed algorithm incentivizes active peer participation while discouraging opportunistic behaviors, with a reputation mechanism that rewards altruistic peers and penalizes free riders and malicious actors. To manage peer dynamics, the algorithm continuously updates the strategies and adjusts to changing neighbors. It also implements a request-to-join mechanism for flash crowd scenarios, allowing the source node to delegate requests to child nodes, forming an interconnected tree structure that efficiently handles high demand and maintains system stability. The decentralized reputation mechanism promotes long-term sustainability in the P2P live streaming system.

cs.NI↗

Optical Networks

Optical networks play a crucial role in todays digital topography, enabling the high-speed and reliable transmission of vast amounts of data over optical fibre for long distances. This paper provides an overview of optical networks, especially emphasising on their evolution with time.

cs.NI↗

Application of S-band for Protection in Multi-band Flexible-Grid Optical Networks

The core network is experiencing bandwidth capacity constraints as internet traffic grows. As a result, the notion of a Multi-band flexible-grid optical network was established to increase the lifespan of an optical core network. In this paper, we use the C+L band for working traffic transmission and the S-band for protection against failure. Furthermore, we compare the proposed method with the existing ones.

cs.NI↗

Generalized Distance Metric for Various DHT Routing Algorithms in Peer-to-Peer Networks

We present a generalized distance metric that can be used to implement routing strategies and identify routing table entries to reach the root node for a given key, in a DHT (Distributed Hash Table) network based on either Chord, Kademlia, Tapestry, or Pastry. The generalization shows that all the above four DHT algorithms are in fact, the same algorithm but with different parameters in distance representation. We also proposes that nodes can have routing tables of varying sizes based on their memory capabilities but with the fact that each node must have at least two entries, one for the node closest from it, and the other for the node from whom it is closest in each ring components for all the algorithms. Messages will always reach the correct root nodes by following the above rule. We also further observe that in any network, if the distance metric to define the root node in the DHT is same at all the nodes, then the root node for a key will also be the same, irrespective of the size of the routing table at different nodes.

cs.NI↗

Credit Blockchain for Faster Transactions in P2P Energy Trading

P2P trading of energy can be a good alternative to incentivize distributed non-conventional energy production and meet the burgeoning energy demand. For efficient P2P trading, a free market for trading needs to be established while ensuring the information reliability, security, and privacy. Blockchain has been used to provide this framework, but it consumes very high energy and is slow. Further, until now, no blockchain model has considered the role of conventional electric utility companies in P2P trading. In this paper, we have introduced a credit blockchain that reduces energy consumption by employing a new mechanism to update transactions and increases speed by providing interest free loans to buyers. This model also integrates the electric utility companies within the P2P trading framework, thereby increasing members trading options. We have also discussed the pricing strategies for trading. All the above assertions have been verified through simulations, demonstrating that this model will promote P2P trading by providing enhanced security, speed, and greater trading options. The proposed model will also help trade energy at prices beneficial for both sellers and buyers.

cs.NI↗

Protected Working Groups-based Resilient Resource Provisioning in MCF-enabled SDM-EONs

Space Division Multiplexed- Elastic Optical Networks using Multicore Fibers are a promising and viable solution to meet the increasing heterogeneous bandwidth demands. The extra capacity gained due to spatial parameters in SDM-EONs could encounter detrimental losses if any link fails and timely restoration is not done. This paper proposes a Protected and Unprotected Working Core Groups assignment (PWCG/ UPWCG) scheme for differentiated connection requests in multicore fiber-enabled SDM-EONs. A PWCG is inherently protected by resources in a Dedicated Spare Core Group (DSCG). First, we divide the cores into three groups using traffic and crosstalk considerations. In the second step, we use the obtained core groups for resource provisioning in dynamic network scenarios. The effectiveness of our proposed technique is compared with a Link Disjoint Path Protection (LDPP) technique, and the simulation study verifies our assertions and the findings.

cs.NI↗

Availability-Aware Dynamic RSA with Protection using Consecutive Sub-Channels

Flexible grid Optical Networks provide efficient spectrum utilization by employing the mechanisms to provide flexibility in the optical channel (spectrum slot) sizes. One of the research problems in Flexible grid Optical Networks is their survivability against failure. On the other hand, p-Cycles have not found practical use due to the significant compute time required for finding optimal configuration for the size of networks seen in real-life. Therefore, for real-time scenarios, we can write heuristics which can assign protection to the new working paths without disturbing the existing traffic on all the other routes in flexible grid networks. The provisioning of protection to each link or path of the lightpath requests can be done using Dynamic Cycles (D-Cycles) or Dynamic Shared Backup Resource Protection (D-SBRP). However, protecting each link or path can lead to the wastage of the resources in the network.

cs.NI↗

Optimal Slot Size under Various Bandwidth Distributions in the Flexible-grid Optical Networks

Flexible grid Optical Networks are efficient mechanism to provide flexibility in the optical spectrum utilization. For such networks, the slot width size as specified by the ITU-T G.694.1 is 12.5 GHz. However, one should question if it is the optimal grid size? In this paper, under different bandwidth distribution scenarios, we review which slot size give appropriate spectrum efficiency. Moreover, we present a study of the slot sizes with varying incoming traffic having some bandwidth requirement under different scenarios.

cs.NI↗

Dynamic Routing and Spectrum Assignment based on the Availability of Consecutive Sub-channels in Flexi-grid Optical Networks

Using Optical Orthogonal Frequency Multiplexing (O-OFDM), variable bandwidth channels can be created in Elastic Optical Networks (EON). This allows the use of spectrum more efficiently by allocating integral multiple of basic bandwidth slots to the lightpath requests. Consequently, such networks are also called flexible grid optical networks. It also adds a constraint of keeping all the allocated slots together when deciding the routes for the requests. This constraint called the contiguity constraint makes the routing and spectrum algorithms more challenging. In any network, the lightpath requests will arrive and depart dynamically and will invariably lead to spectrum fragmentation, and hence network will have a reduction in maximum possible utilization due to increased blocking probability. In this paper, we have presented an improvised RSA algorithm that leads to lesser fragmentation. It is evident from the results that the presented RSA algorithm uses adaptive parameters to reduce the blocking probability and fragmentation compared to other algorithms reported in the recent past.

cs.NI↗

Analysis of Network Robustness for Finite Sized Wireless Sensor Networks

Studying network robustness for wireless sensor networks(WSNs) is an exciting topic of research as sensor nodes often fail due to hardware degradation, resource constraints, and environmental changes. The application of spectral graph theory to networked systems has generated several important results. However, previous research has often failed to consider the network parameters, which is crucial to study the real network applications. Network criticality is one of the effective metrics to quantify the network robustness against such failures and attacks. In this work, we derive the exact formulas of network criticality for WSNs using r-nearest neighbor networks and we show the effect of nearest neighbors and network dimension on robustness using analytical and numerical evaluations. Furthermore, we also show how symmetric and static approximations can wrongly designate the network robustness when implemented to WSNs.

eess.SY↗

Network Criticality Analysis for Finite Sized Wireless Sensor Networks

The topology of a sensor network changes very frequently due to node failures because of power constraints or physical destruction. Robustness to topology changes is one of the important design factors of wireless sensor networks which makes them suitable to military, communications, health and surveillance applications. Network criticality is a measure which capture the properties of network robustness to environmental changes. In this work, we derived the analytical formulas for network criticality, normalized network criticality and studied the network robustness for r-nearest neighbor cycle and r-nearest neighbor torus networks. Further, we compared our analytical results with simulation results and studied the effect of number of nodes, nearest neighbors and network dimension on the network criticality and normalized network criticality.

cs.NI↗

A Vectored Fragmentation Metric for Elastic Optical Networks

When circuits are set up and dismantled dynamically in elastic optical networks, spectrum tends to become fragmented in the fiber links. The fragmentation limits the available path choices and may lead to significant blocking of connection requests. There are two types of fragmentation in the network spectrum in the links due to contiguity constraints and over the paths due to continuity. Study of fragmentation and its management is essential to operate the networks efficiently. This paper proposes a vectored fragmentation metric for characterizing the fragmentation, which covers both types of fragmentation. We discuss the characteristics of this metric in both transient and steady-state of the dynamic network. We also test the proposed metric for connection requests granularity range, arrival rates and holding times, to establish functionality of this metric. We also compare the link-based fragmentation metric with our Vectored Fragmentation Metric to understand the better representation.

cs.NI↗