Unicast and Multicast Communications on a Sliding-Window Parallel Packet Switch

碩士 === 國立中興大學 === 資訊科學研究所 === 92 === A Parallel Packet Switch (PPS) is composed of several demultiplexers、multiplexers and traditional packet switches, with a architecture similar to Clos Network. Parallel switches in PPS can concurrently process a large quantity of packets. PPS has a go...

Full description

Bibliographic Details
Main Author: 許弼程
Other Authors: weoi lin
Format: Others
Language:zh-TW
Published: 2004
Online Access:http://ndltd.ncl.edu.tw/handle/89961992621922753425
Description
Summary:碩士 === 國立中興大學 === 資訊科學研究所 === 92 === A Parallel Packet Switch (PPS) is composed of several demultiplexers、multiplexers and traditional packet switches, with a architecture similar to Clos Network. Parallel switches in PPS can concurrently process a large quantity of packets. PPS has a good performance. The Sliding-Window Packet Switch is a kind of shared-memory parallel packet switches. In the switch, packets are placed in separate multiple memory modules. The Sliding-Window Packet Switch is based on a concept of virtual sliding window; as the virtual window is sliding to a location, the packets in this location leave from memory module. There is a basic reguirement for the Sliding-Window Packet Switch: the memory must run as fast as the external line rate. The idea behind our research is to adept and incorporate the sliding-window switching mechanism to the parallel packet switch architecture. This new architecture is called Sliding-Window Parallel Packet Switch (SW-PPS). SW-PPS outperforms PPS under various network trafficis. We design a traffic model based on the bursty traffic model. Finally , the simulation result under unicast multicast traffics shows that, SW-PPS achieves higher average throughput、lower average packet delay and lower packer loss rate than the traditional round-robin PPS.