Rajiv Ramaswami

Learn More
This paper studies the problem of designing a logical topology over a wavelength-routed all-optical network physical topology. The physical topology consists of the nodes and ber links in the network. On an all-optical network physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without(More)
Abstracf— This paper considers the problem of routing connections in a reeontigurable optical network using wavelength division multiplexing. Each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths share a common link in the network are assigned d]fferent(More)
We provide network designs for optical wavelength division multiptezed (OWDM) rings that minimize overall network cost, rather than just the number of wavelengths needed. The network cost includes the cost of the transceivers required at the nodes as well as the number of wavelengths. The transceiver cost includes the cost of terminating ecluipment EM well(More)
This paper proposes optical wavelength division multiplexed (WDM) networks with limited wavelength conversion that can eeciently support lightpaths (connections) between nodes. Each lightpath follows a route in the network and must be assigned a channel along each link in its route. The load max of a set of lightpath requests is the maximum over all links(More)
A dynamic time-wavelength division multiaccess protocol (DT-WDMA) is proposed for metropolitan-sized multichannel optical networks employing fixed wavelength transmitters and tunable optical receivers. Control information is sent over a dedicated signaling channel and data a re sent over channels owned by the transmitters. Time is divided into slots on each(More)
This paper studies the problems of dedicating routes and scheduling transmissions in optical networks. In optical networks, the vast bandwidth available in an optical fiber is utilized by partitioning it into several channels, each at a different optical wavelength. A connection between two nodes is assigned a specific wavelength, with the constraint that(More)
AbsfmcfWe propose de Bruijn graphs as logical topologies for multihop lightwave networks. After deriving bounds on the throughput and delay performance of any logical topology, we compute the throughput and delay performance of de Bruijn graphs for two different routing schemes and compare it with our bounds and the performance of shufflenets. For a given(More)