WDM-based local lightwave networks. I. Single-hop systems

Mukherjee, Biswanath

doi:10.1109/65.139139

Cited by 587 publications

(153 citation statements)

References 47 publications

Supporting

Mentioning

151

Contrasting

Unclassified

Order By: Relevance

“…The entire path between source and destination in such a network is entirely optical; no electro-optic conversion of the signal is necessary [9]. Helios uses a smaller number of wavelengths than the potentially large number of nodes.…”

Section: The Helios Architecturementioning

confidence: 99%

Helios: A Broadcast Optical Architecture

Baldin

Jackson

Rouskas

2002

NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

Abstract. In this article we present a new all-optical broadcast LAN architecture and an accompanying signaling protocol. The distinguishing characteristics of this architecture are its fault-tolerant design and its collision-free nature, which allows it to achieve high throughput in a broadcast environment. The flexibility of the design allows different schedulers to be used, which can introduce new features into the network (e.g. multicast and QoS) as well as optimize its behavior for the specific setting in which it is used.

show abstract

Section: The Helios Architecturementioning

confidence: 99%

Helios: A Broadcast Optical Architecture

Baldin

Jackson

Rouskas

2002

NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

show abstract

“…BMSN is one of the multihop lightwave networks based on Wavelength Division Multiplexing (WDM) that is a promising technology for high-speed communication, in which the vast bandwidth of a optical fiber is divided into multiple channels. Details of WDM and network topologies can be found in [4], [5], [6]. Recently, similar optimization problems have been investigated for other networks, e.g.…”

Section: Introductionmentioning

confidence: 99%

“…, n−1) represents i-th node in the node placement that corresponds to the node number assigned at ( i/m , i mod m) slot coordinates in the graph of the network. Figure 1 shows an example of node placements for graph G 4,4 , and the corresponding node placement is σ = {11, 2, 6, 14, 8, 0, 3, 7, 5, 9, 12, 4, 15, 1, 10, 13}. If the traffic matrix gives that for example, nodes 8 and 10 (that are assigned at slots (1,0) and (3,2), respectively) are heavily communicated (i.e., t 8,10 = 1), the number of hops in the shortest path is 4 in this node placement.…”

Section: Introductionmentioning

confidence: 99%

Variable depth search and iterated local search for the node placement problem in multihop WDM lightwave networks

Katayama

Yamashita

Narihisa

2007

2007 IEEE Congress on Evolutionary Computation

View full text Add to dashboard Cite

Abstract-We address a problem of finding an optimal node placement that minimizes the amount of traffics by reducing the weighted hop distances in multihop lightwave networks. The problem is called Node Placement Problem (NPP). NPP is known to be NP-hard and one of the most important problems in wavelength division multiplexing (WDM) based networks.In this paper we propose a new local search algorithm for the NPP based on variable depth search, and show its extension to an iterated local search algorithm. To evaluate the performance of the proposed methods, we provided the benchmark instances with known optimal solutions, and performed extensive experiments on the instances. The computational results showed that our iterated local search outperformed multistart local search methods and the best available metaheuristic for the problem.

show abstract

“…WDM networks can be classified as either single-hop or multi-hop networks [4,5]. In single-hop (or all-optical ) networks each message is transmitted from the source to the destination without any optical-to-electronic conversion within the network.…”

Section: Introductionmentioning

confidence: 99%

Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks

Libeskind-Hadas

Melhem

2001

Networking — ICN 2001

View full text Add to dashboard Cite

Abstract. This paper addresses multicast routing in multi-hop optical networks employing wavelength-division multiplexing (WDM). We consider a model in which multicast communication requests are made and released dynamically over time. A multicast connection is realized by constructing a multicast tree which distributes the message from the source node to all destination nodes such that the wavelengths used on each link and the receivers and transmitters used at each node are not used by existing circuits. We show that although the routing and wavelength assignment in this model is NP-complete, the wavelength assignment problem can be solved in linear time.

show abstract

WDM-based local lightwave networks. I. Single-hop systems

Cited by 587 publications

References 47 publications

Helios: A Broadcast Optical Architecture

Helios: A Broadcast Optical Architecture

Variable depth search and iterated local search for the node placement problem in multihop WDM lightwave networks

Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks

Contact Info

Product

Resources

About