Survivable network architectures for broad-band fiber optic networks: model and performance comparison

Wu, Tianwei; Kolar, D.J.; Cardwell, R.H.

doi:10.1109/50.9987

Cited by 84 publications

(20 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Wu et al (1988) consider an intra-local access transport area network architecture. The demand nodes are the central offices and each central office is served by a hub.…”

Section: Introductionmentioning

confidence: 99%

The hierarchical hub median problem with single assignment

Yaman

2009

Transportation Research Part B: Methodological

110

View full text Add to dashboard Cite

a b s t r a c tWe study the problem of designing a three level hub network where the top level consists of a complete network connecting the so-called central hubs and the second and third levels are unions of star networks connecting the remaining hubs to central hubs and the demand centers to hubs and central hubs, respectively. The problem is to decide on the locations of a predetermined number of hubs and central hubs and the connections in order to minimize the total routing cost in the resulting network. This problem includes the classical p-hub median problem as a special case. We also consider a version of this problem where service quality considerations are incorporated through delivery time restrictions. We propose mixed integer programming models for these two problems and report the outcomes of a computational study using the CAB data and the Turkey data.

show abstract

“…Wu et al (1988) consider an intra-local access transport area network architecture. The demand nodes are the central offices and each central office is served by a hub.…”

Section: Introductionmentioning

confidence: 99%

The hierarchical hub median problem with single assignment

Yaman

2009

Transportation Research Part B: Methodological

110

View full text Add to dashboard Cite

show abstract

“…Traffic holding times are one such distinction. For example, traffic for a wideband DCS network (a wideband DCS interfaces digital signals at the DS-3, or STS-n rate, and crossconnects 9 the constituent channels at the DS-1 or SONET Virtual Tributary (VT) group rate; a broadband DCS interfaces digital signals at the DS-3 or STS-n rate and cross-connects the constituent channels at the DS-3 or STS-I rate) at the logical layer are DS-I s that represent private line demand or multiplexed trunks of a circuit switched network. Here, traffic holding time represents the time between connection and disconnection of a DS-1, which could range from days to years.…”

Section: Physical Layermentioning

confidence: 99%

Network Survivability Performance

Cassano¹,

Doverspike²,

Koerner³

et al. 1993

View full text Add to dashboard Cite

“…Reasons are to reduce operating costs of copper-based networks, to provide new broadband telecommunication services such as interactive multimedia and video conferencing, and to enhance survivability of the network. Figure 1 depicts a typical three-tier fiber-optic network topology within a local access and transport area (LATA) which consists of: (i) the interoffice network connecting central offices (CO) with one another and with points of presence (POP) of inter-exchange carriers (IXC) [12], (ii) the feeder transport network connecting COs to remote nodes (RN) [8], and (iii) the passive distribution network (a.k.a. fiber in the loop or FITL) connecting RNs to optical network units (ONUs) [1].…”

Section: Introductionmentioning

confidence: 99%

Design of reliable SONET feeder networks

2007

View full text Add to dashboard Cite

We address the physical SONET network design problem of selecting stackable, unidirectional rings connecting central office nodes (COs) and remote nodes (RNs). This problem frequently arises in designing feeder transport networks to support centralized traffic between the COs and RNs. We formulate a 0-1 programming model for this problem. A simulated annealing-based Lagrangian relaxation procedure to find optimal or near-optimal solutions is then described. Computational results are reported showing that our procedures produce solutions that are on average within 1.1% of optimality. We show that using simulated annealing to augment the pure Lagrangian approach produces superior solutions to the Lagrangian approach.

show abstract

Survivable network architectures for broad-band fiber optic networks: model and performance comparison

Cited by 84 publications

References 4 publications

The hierarchical hub median problem with single assignment

The hierarchical hub median problem with single assignment

Network Survivability Performance

Design of reliable SONET feeder networks

Contact Info

Product

Resources

About