Spectrum efficient distance-adaptive paths for fixed and fixed-alternate routing in elastic optical networks

Agrawal, Anuj; Bhatia, Vimal; Prakash, Shashi

doi:10.1016/j.yofte.2017.11.001

Cited by 34 publications

(17 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1. Fixed Routing (FR): In FR [14], the fixed shortest route between the s-d node pair is calculated offline by using shortest-path algorithm like Dijkstra's and Bellman-Ford. The algorithms are used to search the route between the nodes for setting up a connection and establishing a light path between the end nodes.…”

Section: Routing Sub-problemmentioning

confidence: 99%

See 1 more Smart Citation

Elastic Optical Network: A Promising Solution for Future Communication Networks Considering Differentiated CoS

Dixit

Batham

Narwaria

2021

Algorithms for Intelligent Systems

View full text Add to dashboard Cite

Section: Routing Sub-problemmentioning

confidence: 99%

“…In FAR [14], more than one route is predefined for each s-d pair in the network. These alternate routes are arranged in the increasing order of their hope-count (or number of links) of the route.…”

Section: Fixed-alternate Routing (Far)mentioning

confidence: 99%

Elastic Optical Network: A Promising Solution for Future Communication Networks Considering Differentiated CoS

Dixit

Batham

Narwaria

2021

Algorithms for Intelligent Systems

View full text Add to dashboard Cite

“…In literature, routing is classified as static and dynamic routing 23 . In static routing, the routes are predefined and known in advance, which can be searched by using classical Dijkstra's algorithm at the time of network planning and designing phase 24 . The static routing is independent of current network state information such as the availability of bandwidth resources on the network links.…”

Section: Related Workmentioning

confidence: 99%

Cost function‐based class of service provisioning strategy in elastic optical networks

Dixit

Batham

Narwaria

2020

Int J Communication

View full text Add to dashboard Cite

SummaryThe recent fog‐and‐cloud computing, Internet of things (IoT), artificial intelligence, machine learning, and store‐and‐forward datacenter applications gradually increase the Internet traffic. The arrival of this traffic is periodic, which remains high during certain time duration (known as peak or working/office hour) each day, resulting in an increase in the resource bottleneck problem, which causes high connections blocking. Due to these, many commercial and business data services may lose their connections which contain the urgent and important information. In order to handle such a critical situation in elastic optical networks (EONs), prioritization of connection requests based on the differentiated class of service (CoS) is a must. In this paper, the network traffic is categorized into three CoS requests. These are CoS1 (real‐time traffic), CoS2 (nonreal‐time traffic), and CoS3 (delay‐tolerant traffic) and proposed a cost function‐based CoS provisioning (CFCoSP) strategy in which the connection requests are served as per an increasing value of cost function. The cost function is a cumulative function of CoS, pathlength, and requested bandwidth demand (i.e., number of frequency slots required). The simulations are performed on INDIAN and ARPANET network topologies under uniform CoS ratio (i.e., CoS1:CoS2:CoS3 = 1:1:1) on the metrics of connection established, bandwidth blocking probability, resource utilization ratio, and network capacity utilization. The simulation results verify that the proposed CFCoSP strategy shows significantly improved performances as compared to an existing non‐cost CoS provisioning (CoSP) strategy on the investigated metrics.

show abstract

“…Typically, fixed routing, alternate routing, and adaptive routing algorithms are used for routing subproblem in EON netwoks. Fixed routing is the simplest routing strategy which precomputes single shortest paths between end pairs based on numbers of hops or actual distance between end pairs [29], [30]. However, alternate routing precomputes more than one shortest paths between end pairs.…”

Section: Introductionmentioning

confidence: 99%

Link Congestion Aware Proactive Routing for Dynamic Traffic in Elastic Optical Networks

et al. 2021

View full text Add to dashboard Cite

Fixed alternate routing is a potential routing scheme for routing and spectrum allocation (RSA) in elastic optical networks (EON) which has less complexity and time consumption compared to adaptive routing scheme. However, adaptive routing scheme efficiently reduces the amount of network bandwidth blocking probabilities (BBPs) which uses traffic engineered paths and tunes according to the current network status. In this paper, an algorithm for routing is proposed for dynamic traffic in EON which works iteratively to arrange the pre-computed fixed alternate routes offline to incorporate link loading. During the offline process, the pre-computed routes are arranged with an objective to reduce link congestion and diverts lightpaths to the under-utilized links. The proposed scheme merges the properties of fixed alternate routing and adaptive routing and is utilized for dynamic traffic in EON. It has been shown through simulation results that the proposed scheme efficiently improves the performance of RSA in EON and reduces the amount of BBPs compared to the fixed alternate routing and an existing constrained-lower-indexed-block (CLIB) based adaptive routing algorithm. The proposed LCA greatly reduces congestion over all links during dynamic network operation and lowers congestion spikes over some links which occues in the existing alternate routing scheme in different network scenarios.

show abstract

Spectrum efficient distance-adaptive paths for fixed and fixed-alternate routing in elastic optical networks

Cited by 34 publications

References 27 publications

Elastic Optical Network: A Promising Solution for Future Communication Networks Considering Differentiated CoS

Elastic Optical Network: A Promising Solution for Future Communication Networks Considering Differentiated CoS

Cost function‐based class of service provisioning strategy in elastic optical networks

Link Congestion Aware Proactive Routing for Dynamic Traffic in Elastic Optical Networks

Contact Info

Product

Resources

About