Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Cost-effective designs of fault-tolerant access networks in communication systems

Tools
- Tools
+ Tools

Chen, Xujin and Chen, Bo, Dr.. (2009) Cost-effective designs of fault-tolerant access networks in communication systems. Networks, Vol.53 (No.4). pp. 382-391. ISSN 0028-3045

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1002/net.20306

Abstract

This article is concerned with the design of fault-tolerant access networks for cost-effective communications-deploying network links and service providers (SPs) at a minimum cost, while ensuring error tolerance ability via the ring architecture. Given a set of service subscribers (SSs) in an access network, we are required to determine the locations and capacities of service providers, and to establish network links in terms of rings connecting SSs to SPs. We pay link costs for ring constructions and pay management costs for selecting SPs with capacities sufficient to manage the SSs in their rings. The network design aims to minimize the sum of the link costs and the management costs. Two APX-hard problems in the general network design are studied in this article to address the scalable and modular features of SP capacities. Despite the logarithmic inapproximability that we show for one problem, constant-factor approximation algorithms are proposed to solve the other problem and its variant in quartic time. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 53(4),382-391 2009

Item Type: Journal Article
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Divisions: Faculty of Social Sciences > Warwick Business School
Journal or Publication Title: Networks
Publisher: John Wiley & Sons Inc.
ISSN: 0028-3045
Date: July 2009
Volume: Vol.53
Number: No.4
Number of Pages: 10
Page Range: pp. 382-391
Identification Number: 10.1002/net.20306
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Funder: NSF
Grant number: 10771209
URI: http://wrap.warwick.ac.uk/id/eprint/27681

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us