Approximation Algorithms for Many-to-Many Traffic Grooming in WDM Mesh Networks

Free registration required

Executive Summary

A large number of network applications today allow several users to interact together using the many-to-many service mode. In many-to-many communication, also referred to as group communication, a session consists of a group of users (the authors refer to them as members), where each member transmits its traffic to all other members in the same group. In this paper, they address the problem of grooming sub-wavelength many-to-many traffic (e.g., OC-3) into high-bandwidth wavelength channels (e.g., OC-192) in WDM mesh networks.

  • Format: PDF
  • Size: 229.44 KB