Performance of the multichannel multihop lightwave network under nonuniform traffic

Eisenberg, Martin; Mehravari, Nader

doi:10.1109/49.7827

Cited by 52 publications

(17 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is seen, for example, that with N ‫ס‬ 1000, B ‫ס‬ 1 Gbps, and p ‫ס‬ 2, an aggregate network throughput of about 200 Gbps with each node supporting 200 Mbps of newly arriving traffic can be achieved. For nonuniform traffic, this capacity is reduced by a factor of between 0.3 and 0.5 depending on the routing algorithm used [96,103]. Notice that by using wavelength tunable transceivers, it is possible to rearrange the connectivity pattern without altering the physical topology of the network.…”

Section: Fig 22mentioning

confidence: 97%

Multiple Access Techniques for Fiber-Optic Networks

Mestdagh¹

1996

Optical Fiber Technology

View full text Add to dashboard Cite

Section: Fig 22mentioning

confidence: 97%

Multiple Access Techniques for Fiber-Optic Networks

Mestdagh¹

1996

Optical Fiber Technology

View full text Add to dashboard Cite

“…From Table II, the worst case minimum number of hops between two arbitrary stations, is the smallest integer that satisfies the following inequality, whose left side is obtained by summing the numbers of new stations reached at each hop (from the rightmost column of Table II): (8) This reduces to which gives immediately Now, recalling that the number of wavebands is given by and that we report the expression for into and obtain (9) 8 The "01" term in the first row and last column of Table II would appear on a different row for a different originating station and a different value of W (i.e., T R ): But the "01" term always appears on the first row if the first or last station is the originator because of the self-loops on these stations in de Bruijn graphs.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…In the other extreme case (i.e., each waveband reduces to a single wavelength, yielding a fixed connection diagram. The performance of networks with regular connection diagrams has been studied for both uniform traffic [4]- [6] and nonuniform traffic [7], [8].…”

Section: Introductionmentioning

confidence: 99%

Performance impact of partial reconfiguration on multihop lightwave networks

Labourdette

1997

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Rearrangeable multihop lightwave networks can be dynamically reconfigured to adapt the connectivity among network stations to prevailing traffic conditions. With no limitations on the tunability range of the transmitters and/or receivers allocated to each network station, all connection diagrams can be realized among network stations, within the constraints of the number of transmitters and receivers at each station. Since the number of wavelengths in use may be very large, the tunability range of transmitters/receivers will be restricted, in practice, to some limited set of contiguous wavelengths, or waveband. As a result, all connection diagrams might not be achievable and the network may loose some of its ability to adapt to traffic changes through reconfiguration. In this paper, we derive bounds on the performance degradation experienced by the network as a function of the tunability restrictions. We then propose and analyze a waveband decomposition, illustrating how networks with good performance can be designed with tunability constraints on the transceivers. We also describe other architectures (subcarrier division multiplexing, multi-fiber physical topology) to which our model and analysis readily apply.

show abstract

“…N=kj.i< and b=C.pk+r (4) There are many possible fixed routing algorithms for ShuffleNet. In this section, we present two that are particularly simple to implement.…”

Section: Fixed Routing Algorithm For Multi-dual Ring Connected Shufflmentioning

confidence: 99%

<title>Simple adaptive self-routing algorithm for congestion control in an optical WAN architecture</title>

Liu

1996

Optical Interconnects in Broadband Switching Architectures

View full text Add to dashboard Cite

A Multi-Dual Ring Connected Shuffle Network is an optical multichannel multihop architecture proposed for wide area networks (WAN). With a simple fixed routing algorithm, this network architecture can achieve better performance than the Perfect ShuffleNet. In this paper, we propose a simple adaptive routing scheme which can achieve an even better performance. The adaptive routing scheme can quickly disperse packets away from congested portions of the network. Unlike centralized routing algorithms, the distributed routing algorithm uses only local state information and does not require a priori knowledge of the traffic patterns. Also, in contrast with some adaptive routing algorithms proposed for the Perfect ShuffleNet, the routing algorithm can distribute some of the traffic over less busy channels without increasing the length of the path. Moreover, in the case of network link failure, the adaptive routing scheme can direct the traffic around the 'trouble' area, which makes the network survivable. Since the whole idea of the scheme is to distribute traffic evenly among all the channels as much as possible, it can reduce the maximum traffic intensity on each channel, thus decreasing the size of pre-allocated buffer. All these characters make it very suitable for optical network architectures. The deloading factor is used in assessing the performance. Static simulations are performed under the worst condition and the most likely scenarios. The results support the preceding statements. The ideas presented here may be used for other optical WAN architectures, as long as each Metropolitan Area Network is multiconnected in a ring topology.

show abstract

Performance of the multichannel multihop lightwave network under nonuniform traffic

Cited by 52 publications

References 2 publications

Multiple Access Techniques for Fiber-Optic Networks

Multiple Access Techniques for Fiber-Optic Networks

Performance impact of partial reconfiguration on multihop lightwave networks

<title>Simple adaptive self-routing algorithm for congestion control in an optical WAN architecture</title>

Contact Info

Product

Resources

About