The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any but trivial network topologies. In this work, we present an effective and efficient hierarchical traffic grooming framework for WDM networks of general topology, with the objective of minimizing the total number of electronic ports. At the first level of hierarchy, we decompose the network into clusters and designate one node in each cluster as the hub for grooming traffic. At the second level, the hubs form another cluster for grooming intercluster traffic. We view each (first- or second-level) cluster as a virtual star, and we present an efficient near-optimal algorithm for determining the logical topology of lightpaths to carry the traffic within each cluster. Routing and wavelength assignment is then performed directly on the underlying physical topology. We demonstrate the effectiveness of our approach by applying it to two networks of realistic size, a 32-node, 53-link topology and a 47-node, 96-link network. Comparisons to lower bounds indicate that hierarchical grooming is efficient in its use of the network resources of interest, namely, electronic ports and wavelengths. In addition to scaling to large network sizes, our hierarchical approach also facilitates the control and management of multigranular networks.

/pdf/on-hierarchical-traffic-grooming-in-wdm-networks-fvqq0jig3v.pdf

On hierarchical traffic grooming in WDM networks

We present a framework for hierarchical traffic grooming in mesh networks with the objective of minimizing the total number of electronic ports. At the first level of hierarchy, we decompose the network into clusters and designate one node in each cluster as the hub for grooming traffic. At the second level, the hubs form another cluster for grooming inter-cluster traffic. We view each (first- or second-level) cluster as a virtual star, and we present an efficient near-optimal algorithm for determining the logical topology of lightpaths to carry the traffic within each cluster. Routing and wavelength assignment is then performed directly on the underlying physical topology. Our approach scales to large network sizes, and facilitates the control and management of multigranular networks. Comparisons to lower bounds indicate that it is also efficient in its use of the network resources of interest, namely, electronic ports and wavelengths.

/pdf/a-framework-for-hierarchical-traffic-grooming-in-wdm-18xupcdszq.pdf

A framework for hierarchical traffic grooming in WDM networks of general topology

https://rouskas.csc.ncsu.edu/Publications/Journals/COMNET-HVTTR-2014.pdf

Survey Hierarchical traffic grooming: A tutorial

https://scholarworks.wmich.edu/cgi/viewcontent.cgi?article=2429&context=masters_theses

Traffic grooming, routing, and wavelength assignment in WDM transport networks with sparse grooming resources

We study the traffic grooming problem on WDM networks with the physical topology of a star. In star networks, several nodes are connected to a single hub directly through a bi-directional optical fiber, but are not connected to each other. Previous studies concentrated on the objective of minimizing the total amount of electronic switching. However, in order to lower the network cost, we consider the objective of minimizing the number of line terminating equipment (LTE), which is the dominant cost among optical devices. We first present new complexity results for this problem. The goal of minimizing LTE cost can be embodied in two alternative objective functions, the total number of LTE or the number of LTE at the node with the greatest such number (Min-Max). We provide heuristic algorithms for both objectives, and we present numerical results to demonstrate the effectiveness of our algorithms. One of our main contributions is to show that for star networks, it is usually possible to obtain near-optimal values for both objectives simultaneously, and our heuristics can obtain such solutions. The most consistently useful solutions for both objectives can be obtained by addressing the Min-Max objective as primary.

/pdf/traffic-grooming-in-star-networks-3heagdjwnv.pdf

Traffic Grooming in Star Networks

Rapid advances in the world of high-speed optical network and high-speed electronic routing has led to consideration of advanced models such as genetic algorithms (GAs). GAs have proved to be a practical and robust optimization and search tool for network design. However, a GA is not generally employed in traffic grooming over mesh networks. In this paper, we propose a new GA model to handle the traffic grooming problem in an all-optical WDM mesh network. The new model extends classical GAs with heuristic approach to support network cost optimization for combining multiple traffic streams into a single lightpath. In addition, to support our new GA model, we have developed a set of new investigation including position-based bit matrix encoding, genetic heuristic operators, and fitness evaluation function using the clustering method. The experimental results show that our GA model is superior to traditional heuristic approaches for the 5, 6 and 14-node benchmark networks.

A genetic algorithm for traffic grooming in all-optical mesh networks

The robustness of TCP has contributed to its success in the Internet environment. The role of communications is already well-established in the office environment. With the advent of cheap, affordable broadband communications and the increasing complexity of consumer goods, it seems natural to extend the network into homes. In-home networking means a high-speed communication among the digital appliances within a home. Introduction of applications over high-speed home networks using the TCP/IP protocol is increasing. The integrated environment of Internet and home network is demanding as well. We have validated a TCP model over a high-speed home network environment, investigated the throughput behavior of TCP over IEEE 1394 home networks, and evaluated a potential solution for high performance of TCP over IEEE 1394 home networks. The simulation model has produced several interesting results in the performance of TCP over IEEE 1394 home networks.

An analysis of the performance of TCP over IEEE 1394 home networks

Currently public networks have an enormous number of computers capable of providing many services. Autonomous mobile agents are being used to access their information sources. These agents are modeled in the context of network simulation as mobile network processes. The paper demonstrates that distributed mobile agents can be simulated effectively using C++ over CSIM. C++ over CSIM achieves the clarity and logic of agent based simulation for network services. Inheritance and specialization under object orientation allow the design and reuse of simulation objects. This combination facilitates rather straightforward simulation designs that are scalable, accurate, flexible and generalizable. The design for such large scale simulation is sketched and the run time behavior of the simulator is analyzed.

Simulating agent based processing in an ADS using C++ SIM

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Chiewon Lee

Author Tools

Chat about Author

Papers

A genetic algorithm for traffic grooming in all-optical mesh networks

An analysis of the performance of TCP over IEEE 1394 home networks

Simulating agent based processing in an ADS using C++ SIM