publication . Article . 2019

PENENTUAN PRIORITAS PADA JARINGAN BACK-BONE PALAPA RING MENGGUNAKAN DERAJAT NODE DAN CUT VERTEX

Pella, Stephanie Imelda; Lami, Hendro FJ;
Open Access English
  • Published: 30 Apr 2019 Journal: Media Elektro (issn: 2715-4963, eissn: 2252-6692, Copyright policy)
  • Publisher: Universitas Nusa Cendana
Abstract
Palapa Ring is a project aiming to connect provinces and cities in Indonesia via a high data speed telecommunication path. The purpose of this  research is to identify the priority scale of each node in Palapa Ring Backbone network by considering the degree of each node and the cut vertices of the network. The result shows that the existing infrastructure in Palapa Ring comprised 48 nodes and 117 links. The nodes with the highest degree in the network were PBR, PTK, BJM, JK, SB and UP, with each of the nodes was connected to four links. Cut vertices in the network consisted of 22 nodes. The nodes in the network are classified into 4 categories. Five nodes (...

B. Y. Iskandar, "Indonesia's Initiative to Deploy NGN," in 7th Global Symposium Regulator 2007, The Road to NextGeneration Networks (NGN): Can Regulators Promote Investment and Open Access, 2007.

d. Informasi, Ed., ed, 2015.

I. K. Rohman, "Review of Indonesian broadband development," Technical report, LIRNEasia2014.

M. Brazil, C. J. Ras, and D. A. Thomas, "The bottleneck 2-connected k-Steiner network problem for k≤ 2," Discrete Applied Mathematics, vol. 160, pp. 1028-1038, 2012.

M. Kim and K. S. Candan, "SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices," Data & Knowledge Engineering, vol. 72, pp. 285- 303, 2012.

C.-P. Schnorr, "Bottlenecks and edge connectivity in unsymmetrical networks," SIAM Journal on Computing, vol. 8, pp.

D. W. Matula and F. Shahrokhi, "Sparsest cuts and bottlenecks in graphs," Discrete Applied Mathematics, vol. 27, pp. 113-123, 1990. [OpenAIRE]

A. Vespignani, "Modelling dynamical processes in complex socio-technical systems," Nature physics, vol. 8, p. 32, 2012. [OpenAIRE]

Abstract
Palapa Ring is a project aiming to connect provinces and cities in Indonesia via a high data speed telecommunication path. The purpose of this  research is to identify the priority scale of each node in Palapa Ring Backbone network by considering the degree of each node and the cut vertices of the network. The result shows that the existing infrastructure in Palapa Ring comprised 48 nodes and 117 links. The nodes with the highest degree in the network were PBR, PTK, BJM, JK, SB and UP, with each of the nodes was connected to four links. Cut vertices in the network consisted of 22 nodes. The nodes in the network are classified into 4 categories. Five nodes (...

B. Y. Iskandar, "Indonesia's Initiative to Deploy NGN," in 7th Global Symposium Regulator 2007, The Road to NextGeneration Networks (NGN): Can Regulators Promote Investment and Open Access, 2007.

d. Informasi, Ed., ed, 2015.

I. K. Rohman, "Review of Indonesian broadband development," Technical report, LIRNEasia2014.

M. Brazil, C. J. Ras, and D. A. Thomas, "The bottleneck 2-connected k-Steiner network problem for k≤ 2," Discrete Applied Mathematics, vol. 160, pp. 1028-1038, 2012.

M. Kim and K. S. Candan, "SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices," Data & Knowledge Engineering, vol. 72, pp. 285- 303, 2012.

C.-P. Schnorr, "Bottlenecks and edge connectivity in unsymmetrical networks," SIAM Journal on Computing, vol. 8, pp.

D. W. Matula and F. Shahrokhi, "Sparsest cuts and bottlenecks in graphs," Discrete Applied Mathematics, vol. 27, pp. 113-123, 1990. [OpenAIRE]

A. Vespignani, "Modelling dynamical processes in complex socio-technical systems," Nature physics, vol. 8, p. 32, 2012. [OpenAIRE]

Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue