Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 2

Reduksi Parameter Quality-Of-Service Menggunakan Rough-Set-Theory Dalam Simulasi Routing Algoritma Dijkstra

IJCCS (Indonesian Journal of Computing and Cybernetics Systems) · Vol. 6 No. 1 (2013)

DOI
10.22146/ijccs.2143
ISSN
2460-7258, 1978-1520
Published
2013-01-31
Publisher
IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

AbstrakProses pemilihan jalur/rute terbaik dalam proses routing melibatkan bobot-bobot yang terbentuk dalam topologi jaringan. Terdapat banyak parameter yang menunjang munculnya bobot tersebut. Kesalahan dalam pemilihan parameter dapat mengganggu proses kumunikasi data yang terlihat pada communication-overhead (CO) yang muncul dalam jaringan. Proses reduksi parameter dalam teori Rough Set dapat memilih parameter mana yang dianggap penting sesuai dengan nilai quality of service. Sehingga dari sekian banyak parameter, akan terpilih parameter yang akan dijadikan bobot dalam topologi. Hal ini akan mengurangi beban CO yang akan mengoptimalkan proses routing dalam jaringan. Kata kunci—Quality of Service, reduksi parameter, teori rough set, routing, algoritma Dijkstra AbstractPath selection process/best route in the routing process involves weights that are formed in the network topology. There are many parameters that support the emergence of these weights. Errors in the selection process parameters can interfere with communication data seen in communication-overhead (CO) which appears in the network. Reduction process on Rough Set theory can select the parameters which are considered important parameters in accordance with the quality of service (QoS). So of the many parameters, will be selected parameters to be used as weights in the topology. This will reduce the burden of CO that will optimize the process of routing in the network. Keywords—Quality of Service, parameter’s reduction, rough set theory, routing, Dijkstra algorithm

Collaboration network of the authors

17 authors · 24 co-authorship links · 4 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universitas Gadjah Mada
  • Udayana University
  • Universitas Halu Oleo
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Anindita SuryarasmiUniversitas Gadjah Mada1
Ika Oktavia SuzantiUniversitas Gadjah Mada1
La SurimiUniversitas Halu Oleo1
Agus HalidUniversitas Gadjah Mada1
Yoga Dwitya PramuditaUniversitas Gadjah Mada1
I Nym Saputra Wahyu WijayaAffiliation unknown1
Rachmat Wahid Saleh InsaniUniversitas Gadjah Mada1
Afiahayati AfiahayatiUniversitas Gadjah Mada1
Muhammad IhsanAffiliation unknown1
Muhammad Asghar NazalUniversitas Gadjah Mada1
Mardhani RiasetiawanUniversitas Gadjah Mada1
Ni Made Ary Esta Dewi WirastutiUdayana University1
I Dewa Made Bayu Atmaja DarmawanUdayana University1
LinawatiAffiliation unknown1
Gede SukadarmikaUdayana University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journal.ugm.ac.id/ijccs/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Reduksi Parameter Quality-Of-Service Menggunakan Rough-Set-Theory Dalam Simulasi Routing  Algoritma Dijkstra</dc:title>
	<dc:creator>Santyadi, Gede Saindra</dc:creator>
	<dc:creator>Pulungan, Reza</dc:creator>
	<dc:description xml:lang="en-US">AbstrakProses pemilihan jalur/rute terbaik dalam proses routing melibatkan bobot-bobot yang terbentuk dalam topologi jaringan. Terdapat banyak parameter yang menunjang munculnya bobot tersebut. Kesalahan dalam pemilihan parameter dapat mengganggu proses kumunikasi data yang terlihat pada communication-overhead (CO) yang muncul dalam jaringan. Proses reduksi parameter dalam teori Rough Set dapat memilih parameter mana yang dianggap penting sesuai dengan nilai quality of service. Sehingga dari sekian banyak parameter, akan terpilih parameter yang akan dijadikan bobot dalam topologi. Hal ini akan mengurangi beban CO yang akan mengoptimalkan proses routing dalam jaringan.  Kata kunci—Quality of Service, reduksi parameter, teori rough set, routing, algoritma Dijkstra AbstractPath selection process/best route in the routing process involves weights that are formed in the network topology. There are many parameters that support the emergence of these weights. Errors in the selection process parameters can interfere with communication data seen in communication-overhead (CO) which appears in the network. Reduction process on Rough Set theory can select the parameters which are considered important parameters in accordance with the quality of service (QoS). So of the many parameters, will be selected parameters to be used as weights in the topology. This will reduce the burden of CO that will optimize the process of routing in the network. Keywords—Quality of Service, parameter’s reduction, rough set theory, routing, Dijkstra algorithm</dc:description>
	<dc:publisher xml:lang="en-US">IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.</dc:publisher>
	<dc:contributor xml:lang="en-US">indoceiss</dc:contributor>
	<dc:date>2013-01-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.ugm.ac.id/ijccs/article/view/2143</dc:identifier>
	<dc:identifier>10.22146/ijccs.2143</dc:identifier>
	<dc:source xml:lang="en-US">IJCCS (Indonesian Journal of Computing and Cybernetics Systems); Vol 6, No 1 (2012): January</dc:source>
	<dc:source>2460-7258</dc:source>
	<dc:source>1978-1520</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.ugm.ac.id/ijccs/article/view/2143/1924</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2013 IJCCS - Indonesian Journal of Computing and Cybernetics Systems</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>