Multiwavelength Multicast Packet Switch: Performance Analysis and Evaluation

Huang, Qirui; Zhong, Wen‐De

doi:10.1364/jocn.2.000678

Cited by 8 publications

(9 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that required the number of FDLs in the proposed multicast switch is 23 and 25 for N=8 and 16, respectively; while the required number of FDLs in the broadcast-and-select switch is 22 and 23 for N=8 and 16, respectively. Since the packet loss probability of the broadcast-and-select switch is independent of multicast traffic ratio [11], the required number of SOA gates is also independent of the multicast traffic ratio; however, it increases rapidly with the switch size. For the proposed multicast switch, to achieve a fixed packet loss probability, the required number of SOA gates is much fewer than that of the broadcast-and-select switch, and it increases slowly depending on the multicast traffic ratio and switch size.…”

Section: B Evaluation and Discussionmentioning

confidence: 99%

An optical multicast packet switch using multi-wavelength converters and shared fiber delay lines

Huang

Zhong

2010

2010 Photonics Global Conference

Self Cite

View full text Add to dashboard Cite

This paper studies the traffic performance of our recently proposed multicast packet switch using multi-wavelength converters and shared fiber delay lines (FDLs) under a correlated traffic model. Simulation results show that with a few multi-wavelength converters, the proposed multicast switch can achieve almost the same traffic performance as the broadcast-and-select switch. The complexity evaluation shows that the proposed multicast switch requires much fewer SOA gates to achieve the same packet loss probability as the broadcast-and-select switch.

show abstract

Section: B Evaluation and Discussionmentioning

confidence: 99%

An optical multicast packet switch using multi-wavelength converters and shared fiber delay lines

Huang

Zhong

2010

2010 Photonics Global Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…2. So, link (3,4) should be firstly added to network coding multicast sub-graph and for constructing the multicast routing. The edge-disjoint paths for the destination t 1 and t 2 are S-2-3-4-t 1 and S-1-3-4-t 2 , which are added to the sub-graph, respectively.…”

Section: Problem Description and Analysismentioning

confidence: 99%

“…However, the optical multicast routing and wavelength assignment are two fundamental problems in WDM networks. The multicast routing usually needs to construct a multicast tree to transmit the information flow from the source node through tree's each wavelength channel exactly once to a group of destinations [3]. How to optimize the multicast tree and wavelength assignment has great effect on the network's performance, network throughput, the wavelength utilization and the blocking probability.…”

Section: Introductionmentioning

confidence: 99%

A Multicast Routing to Improve Multicast Capacity with Minimal Network Coding Cellsin WDM Networks

Liu

Zhou

Chen

2014

Journal of Optical Communications

View full text Add to dashboard Cite

Multicast routing based on network coding can save large wavelength channels with high network coding operation costs for the all-optical WDM network. An optical multicast routing algorithm based on minimum network coding cells to reach the multicast max-flow is proposed in the paper. The algorithm selects path in the K shortest paths from source to each destination which meets the two criteria. One is to select paths making the least probability of dropping multicast max-flow. The other is to make the path lowest potential path coding cells in the K shortest paths. We investigate that the previously proposed multicast algorithms based on network coding choose the shortest paths or link-disjoint highest shared links to construct network coding sub-graph which may result in the large coding operation cost and decrease the possibility of getting the maximal multicast flow. The simulation results show that the proposed algorithm can effectively reduce the network coding cells and improve the possibility of achieving the multicast max-flow by using our designed two path selection criteria. In addition, the proposed multicast algorithm deteriorates a very limited multicast link costs which is very close to the lowest link costs. So, the proposed algorithm can get the cost-effective multicast routing for the optical networks.

show abstract

“…In general, they can be divided into two categories based on the type of switches adopted: Multicast scheduling for electronic switches, see, for example, [6], [7], [8], [9], [10], [11], [12], [13], [14], and multicast scheduling for optical switches, such as [15], [16], [17], [18]. Most multicast scheduling algorithms for electronic switches adopt the input queued (IQ) switching architecture, due to the fact that the internal bandwidth of IQ switch only needs to be as fast as the link rate, which is very promising for large routers and switches with very high port speed.…”

mentioning

confidence: 99%

“…On the other hand, many multicast scheduling schemes in optical packet switches (OPS) rely on Fiber Delay Lines (FDLs), an optical device capable of delaying packets for a specific amount of time, to resolve output contention [15], [16], [17], [18], as a practical "optical RAM" able to mimic the buffers used in electronic switches is still not available currently. In wavelength-assisted routing [15], [16], multicast packets are sent to multicast modules, where a FDL loop device is used to generate copies of the packet and provide necessary latency.…”

mentioning

confidence: 99%

High-Speed Multicast Scheduling in Hybrid Optical Packet Switches with Guaranteed Latency

Zeng

Yang

2013

IEEE Trans. Comput.

View full text Add to dashboard Cite

In this paper, we study multicast scheduling in the OpCut switch, a recently proposed hybrid optical/electronic switching architecture for transmitting high-volume traffic in core networks and parallel computers. First, we present a multicast scheduling algorithm called Guaranteed Latency Multicast Scheduling (GLMS) that considers the schedule of each packet for multiple time slots. We show that GLMS has several desirable features, such as guaranteed latency for all transmitted packets and adaptivity to transmission requirements. To relax the time constraint on computing a schedule, we further propose a parallel and pipeline processing architecture for GLMS that distributes the scheduling task to multiple pipelined processing stages, with N processors in each stage, where N is the switch size. Finally, by implementing it with simple combination logic circuits, we show that each processor can finish the scheduling for one time slot in Oð1Þ time complexity. We evaluate the performance of GLMS extensively against statistical traffic models and real Internet traffic, and the results show that the proposed GLMS algorithm can achieve very low average packet latency with minimum packet drop ratio.

show abstract

Multiwavelength Multicast Packet Switch: Performance Analysis and Evaluation

Cited by 8 publications

References 22 publications

An optical multicast packet switch using multi-wavelength converters and shared fiber delay lines

An optical multicast packet switch using multi-wavelength converters and shared fiber delay lines

A Multicast Routing to Improve Multicast Capacity with Minimal Network Coding Cellsin WDM Networks

High-Speed Multicast Scheduling in Hybrid Optical Packet Switches with Guaranteed Latency

Contact Info

Product

Resources

About