Enhancement Of Packet And Circuit Switching Networks Based On Kautz Digraph
| dc.contributor.author | Ali Hassaan, Ibrahim AbdulMalik | |
| dc.date.accessioned | 2016-10-26T02:32:13Z | |
| dc.date.available | 2016-10-26T02:32:13Z | |
| dc.date.issued | 2003-06 | |
| dc.description.abstract | Telecommunication and data communication are an important part of our daily life, which we cannot function without. Making a phone call, transferring data, surfing the Internet, checking e-mail, broadcasting and multicasting, etc., are only a few telecommunication/data communication application examples. The success and efficiency of telecommunication and data communication on the other hand rely heavily on switching networks. Among those usages, switching networks can be divided into two groups: Fully connected nonblocking networks (circuit switching networks) and fully connected but blocking networks (packet switching networks). Each one of these groups is classified into categories and subcategories, and each one of them has its own advantages and disadvantages. This thesis employs one of the mathematical graphs theories, which is Kautz digraph topology, to design a new switching network. The purpose of using this topology is to enhance the performance of packet and circuit switching networks. For packet switching networks, this thesis uses replication technique, which is multiple Kautz networks with parallel loading. The purpose of the new switching network based on Kautz digraph is to increase the throughput (successful packets) and to minimize internal blocking (packets collision), which happens when two packets contend on the same link of a switch element. For circuit switching networks, this thesis introduces a new cost-effective rearrangeable sW'itching network. The proposed network is not intended to replace existing network such as Benes network, but more on complementing existing network by introducing new network sizes. The new rearrangeable network based on Kautz digraph uses iooping algorithm for routing, which is similar to the algorithm used in the well known Benes network. The routing algorithm used in this network helps us to reduce switching cost by eliminating unused switches. Lastly, we also introduce a variant to the proposed network with the middle stage of the network been modified to be applicable in applications that used permutation such as Mix-net. | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/2880 | |
| dc.subject | The success and efficiency of telecommunication | en_US |
| dc.subject | heavily on switching networks | en_US |
| dc.title | Enhancement Of Packet And Circuit Switching Networks Based On Kautz Digraph | en_US |
| dc.type | Thesis | en_US |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: