Delay tolerance aware queueing and scheduling for differentiated services in dynamic survivable WDM networks

Mirhosseini, Amin; Soorki, Mehdi Naderi; Tabataba, Foroogh S.

doi:10.1016/j.osn.2015.01.003

Cited by 7 publications

(2 citation statements)

References 31 publications

(61 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Considering the service differentiation based on the delay tolerance and holding time, the service classes with high delay tolerance could have been serviced with some delay. The paper [18] proposed a strategy which intentionally inserts these service classes into a queue to save optical resources for future requests, schedules the queue after each departure event and chooses the best group of the waiting connections to provision. The approach results in significant decrease in overall blocking probability (BP), while reducing the BP of the service classes with stringent delay tolerance as well.…”

Section: Related Workmentioning

confidence: 99%

Delay Aware RSA Algorithm Based on Scheduling of Differentiated Services With Dynamic Virtual Topology Construction

et al. 2020

View full text Add to dashboard Cite

The fast and diversified development of Internet services leads to numerous services with differentiated delay tolerance of optical connections set-up are converging in the optical network. Consequently, the average set-up delay of optical connection is increased, which will inevitably bring pressures to optical networks. To solve this problem, a delay aware routing spectrum assignment (RSA) algorithm based on services scheduling in priority queues with dynamic virtual topology construction (QVT-RSA) is proposed. First, the QVT-RSA algorithm reasonably identifies various different services and arranges them in order according to their priority, waiting time and delay tolerance requirements. Then, software defined networks (SDN) controller with multi-threads technology is adopted to innovatively parallel serve the ordered service requests to reduce the average set-up delay of optical connections, which also offset the induced delay caused by services scheduling. The network resource is accurately shared among multi-threads using the proposed mutual exclusive resource utilization model realized by dynamic virtual topology construction. The continuously coloring and usable virtual topology linkage reconfiguration can provide topology resources for service requests and adapt the dynamic transformation among serving, waiting and new arriving service requests. The shortest-path routing and first fit spectrum assignment (SPFF-RSA) algorithm is used as the baseline algorithm. Furthermore, by combining the SPFF-RSA algorithm and partial strategy of our strategy, the QSPFF-RSA and V-RSA algorithms are proposed as baseline algorithms as described in V-B. The simulation experiment results demonstrate that the average optical connections set-up delay of QVT-RSA algorithm is reduced compared with SPFF-RSA and QSPFF-RSA algorithms, and the blocking probability of QVT-RSA algorithm is reduced compared with SPFF-RSA, QSPFF-RSA and VRSA algorithms. The optical connections set-up success probability within delay tolerance about high, medium and low priority services of QVT-RSA algorithm is higher than that of the SPFF-RSA, QSPFF-RSA and VRSA algorithms.INDEX TERMS Low delay, QoS, reconfiguration of virtual topology, RSA, services scheduling.

show abstract

Section: Related Workmentioning

confidence: 99%

Delay Aware RSA Algorithm Based on Scheduling of Differentiated Services With Dynamic Virtual Topology Construction

et al. 2020

View full text Add to dashboard Cite

show abstract

“…SLA policy is an agreement between the client and the network service provider in which the type of service, time constraints, service price, and negotiation policies are defined 16 . In this work, the traffic is classified into three different CoSs, that is, CoS1: real‐time traffic (i.e., online audio–video traffic), CoS2: nonreal‐time traffic (i.e., compressed video and transactional data traffic), and CoS3: delay‐tolerant traffic (like store‐and‐forward bulk data files transfer between various datacenters) 18–21 . The priority order of these CoS is as CoS1 > CoS2 > CoS3.…”

Section: Introductionmentioning

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

A traffic scheduling strategy based on cost function for differentiated class of service in multi-domain optical networks

Batham

Pathak

Yadav

et al. 2020

Optical Fiber Technology

View full text Add to dashboard Cite

Delay tolerance aware queueing and scheduling for differentiated services in dynamic survivable WDM networks

Cited by 7 publications

References 31 publications

Delay Aware RSA Algorithm Based on Scheduling of Differentiated Services With Dynamic Virtual Topology Construction

Delay Aware RSA Algorithm Based on Scheduling of Differentiated Services With Dynamic Virtual Topology Construction

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

A traffic scheduling strategy based on cost function for differentiated class of service in multi-domain optical networks

Contact Info

Product

Resources

About