Routing and path multicoloring

Loading...
Thumbnail Image

Date

Authors

Nomikos, C.
Pagourtzis, A.
Zachos, S.

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Type of the conference item

Journal type

peer reviewed

Educational material type

Conference Name

Journal name

Information Processing Letters

Book name

Book series

Book edition

Alternative title / Subtitle

Description

In optical networks it is important to make an optimal use of the available bandwidth. Given a set of requests the goal is to satisfy them by using a minimum number of wavelengths. We introduce a variation to this well known problem, by allowing multiple parallel links, in order to be able to satisfy any set of requests even if the available bandwidth is insufficient. In this new approach the goal is to use a minimum number of active links and thus reduce network pricing. In graph-theoretic terms, given a graph, a list of pairs of vertices, and a number of available colors, the goal is to route paths with the given pairs of vertices as endpoints and to find a color assignment to paths that minimizes color collisions over all possible routings and colorings. We present efficient algorithms for simple network topologies. For chains our solutions are optimal; for stars and rings - where it is NP-hard to solve the problem optimally - our solutions are approximate within a factor two of the optimal solution. The key technique involves transformation to edge coloring of bipartite graphs. For rings we also present a 2-approximation algorithm, for a variation of the problem, in which the routing is already prescribed. (C) 2001 Elsevier Science B.V. All rights reserved.

Description

Keywords

algorithms, all-optical networks, routing, path coloring, parallel fiber links, directed fiber trees, graphs

Subject classification

Citation

Link

Language

en

Publishing department/division

Advisor name

Examining committee

General Description / Additional Comments

Institution and School/Department of submitter

Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής

Table of contents

Sponsor

Bibliographic citation

Name(s) of contributor(s)

Number of Pages

Course details

Endorsement

Review

Supplemented By

Referenced By