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

Abstract

Abstract-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 (we refer to them as members), where each member transmits its traffic to all other members in the same group. In this paper, we address the problem of grooming sub-wavelength many-to-many traffic (e.g., OC-3) into high-bandwidth wavelength channels (e.g., in WDM mesh networks. I. INTRODUCTIONIn wavelength routing networks, using wavelength division multiplexing (WDM), it is feasible to have hundreds of wavelengths per fiber each operating at 10 to 40 Gbps. Bandwidth requirements of user sessions, however, are usually of subwavelength granularities. For example, an MPEG compressed HDTV channel requires less than 20 Mbps of bandwidth. In order to reduce this huge bandwidth gap, traffic grooming was introduced to allow a number of sessions with sub-wavelength granularities to share the bandwidth of a wavelength channel.Early network applications such as TELNET and FTP are characterized as unicast or "one-to-one". A large portion of network applications today, however, are of the multipoint type. For example, video distribution and file distribution are examples of multicast or "one-to-many" applications, while resource discovery and data collection are examples of manyto-one or "inverse multicasting" applications. Recently, another set of multipoint network applications has emerged such as multimedia conferencing, e-science applications, distance learning, distributed simulations, and collaborative processing [23]. In these applications, each of the participating entities

Dynamic Provisioning of Optical Networks with Many-to-Many Traffic Grooming

“…Many-to-many traffic grooming in optical WDM mesh networks is a new field of research that has been only considered in [14]- [16]. In [14]- [16], MILP formulations, heuristic solutions, and approximation algorithms were introduced for the static many-to-many traffic grooming problem in WDM mesh networks.…”

“…In [14]- [16], MILP formulations, heuristic solutions, and approximation algorithms were introduced for the static many-to-many traffic grooming problem in WDM mesh networks. This paper is the first to address the dynamic manyto-many traffic grooming problem in WDM mesh networks.…”