View in EDS

Satisfying a maximum number of pre-routed requests in all-optical rings

Saved in:
Bibliographic Details
Title: Satisfying a maximum number of pre-routed requests in all-optical rings
Authors: Nomikos, Christos1 cnomikos@cs.uoi.gr, Pagourtzis, Aris2,3 pagour@inf.ethz.ch, Zachos, Stathis3,4 zachos@cs.ntua.gr
Source: Computer Networks. May2003, Vol. 42 Issue 1, p55. 9p.
Subjects: Telecommunication, Algorithms
Abstract: We address the problem of maximizing the number of satisfied requests in all-optical networks that use wavelength division multiplexing. We consider the case where requests are pre-routed and formulate it as the maximum path coloring problem. We study the problem for rings and present a (2/3)-approximation algorithm. Along the way we develop a fast matching technique for a special class of bipartite graphs. By using this technique we achieve an O(n+mlogL) time complexity for our approximation algorithm, where n is the number of nodes, m is the number of requests and L is the maximum load of requests on a single link. [Copyright &y& Elsevier]
Copyright of Computer Networks is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 9404746
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Satisfying a maximum number of pre-routed requests in all-optical rings
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Nomikos%2C+Christos%22">Nomikos, Christos</searchLink><relatesTo>1</relatesTo><i> cnomikos@cs.uoi.gr</i><br /><searchLink fieldCode="AR" term="%22Pagourtzis%2C+Aris%22">Pagourtzis, Aris</searchLink><relatesTo>2,3</relatesTo><i> pagour@inf.ethz.ch</i><br /><searchLink fieldCode="AR" term="%22Zachos%2C+Stathis%22">Zachos, Stathis</searchLink><relatesTo>3,4</relatesTo><i> zachos@cs.ntua.gr</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computer+Networks%22">Computer Networks</searchLink>. May2003, Vol. 42 Issue 1, p55. 9p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Telecommunication%22">Telecommunication</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We address the problem of maximizing the number of satisfied requests in all-optical networks that use wavelength division multiplexing. We consider the case where requests are pre-routed and formulate it as the maximum path coloring problem. We study the problem for rings and present a (2/3)-approximation algorithm. Along the way we develop a fast matching technique for a special class of bipartite graphs. By using this technique we achieve an <f>O(n+mlogL)</f> time complexity for our approximation algorithm, where <f>n</f> is the number of nodes, <f>m</f> is the number of requests and <f>L</f> is the maximum load of requests on a single link. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Computer Networks is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=9404746
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/S1389-1286(02)00448-6
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 9
        StartPage: 55
    Subjects:
      – SubjectFull: Telecommunication
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: Satisfying a maximum number of pre-routed requests in all-optical rings
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Nomikos, Christos
      – PersonEntity:
          Name:
            NameFull: Pagourtzis, Aris
      – PersonEntity:
          Name:
            NameFull: Zachos, Stathis
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 05
              Text: May2003
              Type: published
              Y: 2003
          Identifiers:
            – Type: issn-print
              Value: 13891286
          Numbering:
            – Type: volume
              Value: 42
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Computer Networks
              Type: main
ResultId 1