Simulation Research of Communication Networks Based on Prim Algorithm

Yang, Chen; Ren, ChuanJun

doi:10.1109/ifita.2010.35

Cited by 3 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Adel Ben Mnaouer received his BS degree in computer science from the "Ecole Supérieure des communications (SUP'COM)" of Tunisia in 1985 and the Meng and PhD degrees in electrical and computer engineering from the University of Fukui and from Yokohama National University, Japan, in 1993respectively. From 1997to 2010 he served as an academic staff in several Universities such as Yokohama National University (1997University ( -1999, CS dept of Sultan Qaboos University, Oman (1999-2002, School of Computer Engineering at Nanyang Technological University, Singapore, (2002-2005, the "Ecole Supérieure de Technologie et d'Informatique", 7th November university, Tunisia (2005-2008. Dr. Ben Mnaouer served in the Centre of Information and Communication technologies of the University of Trinidad and Tobago (UTT) as an associate professor (2008)(2009)(2010).…”

Section: Discussionmentioning

confidence: 99%

New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing

Aissa

Mnaouer

Murray

et al. 2011

International Journal of Business Data Communications and Networking

View full text Add to dashboard Cite

Multimedia applications are expected to guarantee end-to-end quality of service (QoS) and are characterized by stringent constraints on delay, delay-jitter, bandwidth, cost, and so forth. The authors observe that Kruskal’s algorithm is limited to minimal (maximal) spanning unconstrained tree. As such, the authors extend Kruskal’s algorithm to incorporate the delay bound constraint. Consequently, a novel algorithm is proposed, called EKRUS (Extended Kruskal), for constructing multicast trees. The EKRUS’ distinguishing features consists of a better management of Kruskal’s priority queues, and in the provision of edge priority aggregation. Preliminary results show that the proposed EKRUS algorithm performs as well as the best-known algorithms (such as the DDMC, DMCTc algorithms) while exhibiting reduced complexity. The authors conducted an intensive analysis and evaluations of different strategies of assigning edges into the classes of the queue as well as edge selection. As a result, the EKRUS algorithm was further extended with different edge assignment and selection strategies. Through extensive simulations, the authors have evaluated various versions of the EKRUS and analyzed their performance under different load conditions.

show abstract

Section: Discussionmentioning

confidence: 99%

New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing

Aissa

Mnaouer

Murray

et al. 2011

International Journal of Business Data Communications and Networking

View full text Add to dashboard Cite

show abstract

“…Dilansir dari penelitian yang berjudul "Learning Kruskal's Algorithm, Prim's Algorithm and Dijkstra's Algorithm by Board Game", menjelaskan bahwa terdapat keuntungan dalam menggabungkan pembelajaran algorimta Kruskal dan Prim melalui permainan papan [12]. Dilansir dari penelitian yang berjudul "Simulation Research of Communication Networks Based on Prim Algorithm", menjelaskan bahwa algoritma Kruskal dan Prim bermanfaat dalam membantu efisiensi jaringan komunikasi, terkhususnya algoritma Prim [13]. Dilansir dari penelitian yang berjudul "Simulasi Minimum Spanning Tree Graf Berbobot Menggunakan Algoritma Prim Dan Algoritma Kruskal", menjelaskan bahwa terdapat beberapa jenis graf yang lebih efisien jika memakai algoritma Kruskal [14].…”

Section: Latar Belakangunclassified

Visualisasi Algoritma Kruskal dan Prim dalam Mencari Rute Terpendek Berbasis Unity 3D

Ekasaputra,

Pakereng

2023

jtik

View full text Add to dashboard Cite

Algoritma Kruskal dan Prim adalah dua algoritma pencarian Minimum Spanning Tree pada suatu graf yang mempunyai kemiripan. Seiring dengan perkembangan teknologi, muncul sebuah media pembelajaran baru yaitu game. Riset ini dilakukan untuk merancang dan menguji suatu game yang dapat menjelaskan dan memvisualisasikan cara kerja algoritma Kruskal dan Prim. Hasil riset ini diharapkan dapat membuktikan bahwa media game mempunyai efisiensi lebih dalam menjelaskan algoritma Kruskal dan Prim. Data yang ada pada riset ini diambil dari angket yang disebarkan pada pengguna game yang masih berstatus pelajar atau mahasiswa. Hasil penelitian memperlihatkan adanya peningkatan jumlah pengguna game yang memahami algoritma Kruskal dan Prim.

show abstract