Font Size: a A A

Multi-plane Switching In The Exchange Of Variable Length And Multi-dimensional Network Flow Model

Posted on:2007-11-10Degree:MasterType:Thesis
Country:ChinaCandidate:H S ZhongFull Text:PDF
GTID:2208360185956772Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
Line speeds keep increasing nowadays, but the speed of the memory can not meet the requirement. And to improve the efficient of the packet switching, researchers suggest people use the Parallel Packet switches (PPS), and PPS has been studied as a way to overcome the memory bandwidth limitation and to scale-up switch speeds. The PPS also has some drawbacks, such as it can not provide QOS guarantee, data can not remain the right order after switched by different switching panel. At the same time, people show interested in the variable-length packet switching. We want to use novel switching algorithm that help us make the variable-length switching efficient. We do not need to cut the variable-length packet into fix cell as the traditional switching algorithm.In this paper, we suggest to use PPS for the variable-length packet switching. The traditional PPS has some drawbacks in variable-length packet switching. First, because cells belonging to the same packet are sent to different switching planes evenly to ensure the load-balance among parallel planes, here arise some problems such as how to keep the order of cells. Second, at the multiplexers there must be additional schemes to reconstruct the original packet from the cells. And the delay time of the last cell of the packet will greatly influence that of the original packet. We propose the de-multiplexer and the multiplexer algorithms in the architecture of Parallel Packet Switches (PPS) which support the variable-length packet switching. The proposed algorithms are easier to implement because the re-sequence and re-construction schemes are not needed. And the load-balance of switching planes is also guaranteed. Combined with some recently proposed variable-length packet scheduling algorithms, the proposed algorithms can efficiently accommodate IP traffic. The performance of the algorithms is evaluated through simulation, and the comparison with the previous work shows that the proposed algorithms are competent for variable-length packet switching.In the other way, traffic models play an important role in network traffic prediction and design. A good traffic model can help us to keep the status of the network and to control sudden evens in the net work. Usually different kinds of the models have...
Keywords/Search Tags:Parallel Packet Switching, Variable-length Switching, Traffic Model, Cross-correlation, Switching Algorithm
PDF Full Text Request
Related items