Abstract: In this paper, the performance ofRZDPSK and NRZ-DPSK modulation techniques with/without dispersion compensating fiberin optical communication system has been analyzed. Dispersion compensating fibers are developingvery fast to gain the dispersion compensation of real value and perfect coupling to fibers to sustainwavelength stability. A effort is shown to improve the performance of the system in terms of bit error rate (BER) and Q-value by proposing a combination of fibre length by using SMF-DCF for RZ-DPSK and NRZ-DPSK modulation techniques. The combination of SMF-DCF improves the optical distance. The BER and Qvalue are observed for RZ-DPSK and NRZ-DPSK at the transmission rate of 10 Gb/s.

• Publication Date: 15-Mar-2020
• DOI: 10.15224/978-1-63248-184-9-01
• Views: 0
• Downloads: 0

Abstract: Existing graph partitioning algorithms rarely focus on the choice of the replicas. Most of them make use of random hashing to allocate vertices to partitions due to its convenience and simplicity. However, such random property may result in undesirable partitioning results with huge communication cost if many high degree vertices are being replicated. We address this problem and propose a greedy algorithm to minimize the number of replications of high degree vertices and at the same time minimize the replication factor by sorting the vertices before allocating them to different partitions. We compare our algorithm with one of the well performed existing graph partitioning algorithms, Powers hybrid-cut, and prove that our algorithm gives better results in most practical situations. Experimental results show that our algorithm gives much lower replication factor compared to Powers hybrid-cut algorithm generally in random graphs, power-law graphs and real-life graphs.

• Publication Date: 15-Mar-2020
• DOI: 10.15224/978-1-63248-184-9-02
• Views: 0
• Downloads: 0