Controlling Traffic Hops - A New Approach for Traffic Grooming in WDM Optical Networks

Bhattacharya, Asima; Kumbhakar, Himadri; Chatterjee, Monish Ranjan; Saha, Diganta

doi:10.1109/conecct50063.2020.9198500

Cited by 2 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Introduction of Compared Algorithms: We will give a brief description about compared algorithms: K-shortest path first fit (KSPFF) and C-Hop [30].…”

Section: Performance Evaluationmentioning

confidence: 99%

“…The VNFs of network slice are distributed on the nodes along the selected path and the traffic is routed using the first available wavelength. • The authors in [30] also proposed a new traffic grooming strategy named C-Hop. The basic idea of C-Hop strategy is to groom traffic with a fixed number of hops h on the logical topology.…”

Section: Performance Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

Deterministic Latency Bounded Network Slice Deployment in IP-Over-WDM Based Metro-Aggregation Networks

Taleb

Zhang

et al. 2022

IEEE Trans. Netw. Sci. Eng.

View full text Add to dashboard Cite

As a critical enabler of the next generation networks, network slicing can dynamically and flexibly create virtual networks leveraging necessary network resources for services with different quality of service (QoS) requirements. To satisfy the strict QoS requirements of some vertical industries, e.g., industry automation, the Deterministic Networking (DetNet) concept has been recently proposed to investigate deterministic service provisioning with bounds on service latency, loss, and jitter. A critical issue for providing deterministic services is how to allocate the right amount of resources that ensures the QoS requirements within a network slice. In this paper, we first obtain the amount of network resources needed for a network slice, using the stochastic network calculus (SNC) method, to ensure the end-to-end latency requirement under specific traffic demands. We then study the network slice deployment problem in an IP-over-WDM (wavelength division multiplexing) metro aggregation network and propose a heuristic with three different objectives: minimizing traffic hops, minimizing lightpaths and minimizing wavelengths, which can help network service provider to optimize network deployment under different considerations. The simulation results show the comparison of the resource utilization under different strategies.

show abstract

“…Introduction of Compared Algorithms: We will give a brief description about compared algorithms: K-shortest path first fit (KSPFF) and C-Hop [30].…”

Section: Performance Evaluationmentioning

confidence: 99%

Section: Performance Evaluationmentioning

confidence: 99%