Identification of Key Nodes Based on PageRank Algorithm

Fan, Bing; Li, Zewei; Shu, Nan C.; Li, Yaqun

doi:10.1109/iaeac50856.2021.9390946

Cited by 6 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the regular switches are responsive and dependent on the efficiency of the critical switch. Tools in graph theory such as degree [74], betweenness [75], information [76], closeness centralities, and PageRank [77] can be used to measure switch importance in a network.…”

Section: Critical Node(switch)mentioning

confidence: 99%

“…Then passes them through a route optimization function before invoking an H-Permissible to prune and select a path based on the cardinality constraints. However, the inclusion of the optimization function adds up to the complexity by order of (LP(N 2 +L, L)) ⁄ 2 [77]. Maaloul et al [134] proposed a technique for SDN-based CGN to optimize energy.…”

Section: Psa With Critical Switch Awarementioning

confidence: 99%

See 1 more Smart Citation

Review of Path Selection Algorithms with Link Quality and Critical Switch Aware for Heterogeneous Traffic in SDN

Yusuf

Bakar

Isyaku

et al. 2023

Int. j. electr. comput. eng. syst. (Online)

View full text Add to dashboard Cite

Software Defined Networking (SDN) introduced network management flexibility that eludes traditional network architecture. Nevertheless, the pervasive demand for various cloud computing services with different levels of Quality of Service requirements in our contemporary world made network service provisioning challenging. One of these challenges is path selection (PS) for routing heterogeneous traffic with end-to-end quality of service support specific to each traffic class. The challenge had gotten the research community's attention to the extent that many PSAs were proposed. However, a gap still exists that calls for further study. This paper reviews the existing PSA and the Baseline Shortest Path Algorithms (BSPA) upon which many relevant PSA(s) are built to help identify these gaps. The paper categorizes the PSAs into four, based on their path selection criteria, (1) PSAs that use static or dynamic link quality to guide PSD, (2) PSAs that consider the criticality of switch in terms of an update operation, FlowTable limitation or port capacity to guide PSD, (3) PSAs that consider flow variabilities to guide PSD and (4) The PSAs that use ML optimization in their PSD. We then reviewed and compared the techniques' design in each category against the identified SDN PSA design objectives, solution approach, BSPA, and validation approaches. Finally, the paper recommends directions for further research.

show abstract

Section: Critical Node(switch)mentioning

confidence: 99%

Section: Psa With Critical Switch Awarementioning

confidence: 99%

Review of Path Selection Algorithms with Link Quality and Critical Switch Aware for Heterogeneous Traffic in SDN

Yusuf

Bakar

Isyaku

et al. 2023

Int. j. electr. comput. eng. syst. (Online)

View full text Add to dashboard Cite

show abstract

“…To identify important nodes in power systems and improve system security, the study [14] provides a vital node identification method based on the PageRank algorithm. A model of node failure on system line power is proposed to facilitate the identification of important nodes.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Numerous ranking algorithms based on other factors, including link structure, content, or a combination of both, then emerged. Every web page provides a "vote" known as Page Rank to indicate the significance of another web page [1] [14]. A single vote of support is regarded as a single link to a web page.…”

Section: Theoretical Frameworkmentioning

confidence: 99%

Optimizing the Eﬃciency of Web Mining through Comparative Web Ranking Algorithms

Khalil,

Rehan,

Syed

et al. 2023

VFAST trans. softw. eng.

View full text Add to dashboard Cite

Millions of web pages carrying massive amounts of data make up the World Wide Web. Real-time data has been generated on a wide scale on the websites. However, not every piece of data is relevant to the user. While scouring the web for information, a user may come upon a web page that contains irrelevant or incomplete information. As a response, search engines can alleviate this issue by displaying the most relevant pages. Two web page ranking algorithms are proposed in this study along with the Dijkstra algorithm; the PageRank algorithm and the Weighted PageRank algorithm. The algorithms are used to evaluate a web page's importance or relevancy within a network, such as the Internet. PageRank evaluates a page's value based on the quantity and quality of links leading to it. It is commonly utilized by nearly all search engines around the world to rank web pages in order of relevance. This algorithm is used by Google, the most widespread Internet search engine. In the process of Web mining, page rank is quite weighty. The most important component of marketing is online use mining, which investigates how people browse and operate a business on a company's website. The study presents two proposed models that try to optimize web links and improve search engine results relevancy for users.

show abstract

Evaluation of Cross-Layer Network Vulnerability of Power Communication Network Based on Multi-Dimensional and Multi-Layer Node Importance Analysis

et al. 2022

View full text Add to dashboard Cite

Power communication network (PCN) is the cornerstone of the stable operation of smart grid. The evaluation of the essential vulnerability of the PCN based on the node importance is advantageous to the protection of critical nodes and the improvement of the reliability and controllability of the system. So, firstly, this paper establishes a multi-index evaluation system for the analysis of important nodes. Based on the site operation level, site load capacity, network topology, service flow, service quality requirements and security operation requirements, the network characteristics of nodes are divided into four layers to describe. Meanwhile, the characteristics of node topology are subdivided into three dimensions to analyze. Then, fully considering the coupling between power network and communication network, a multi-dimensional and multi-layer node importance (MMNI) model based on entropy weight method is proposed. Combined the long-term and short-term vulnerability loss, the node cross-layer vulnerability loss (CVL) function and network cross-layer loss entropy (CVE) model are proposed. Finally, based on the actual power communication network, under different attacks and fault strategies, the changes of maximum network connectivity and network cross layer loss entropy are compared. It shows the effectiveness and accuracy of the MMNI model for the analysis and evaluation of important nodes and it provides a theoretical basis for key weak point identification and the network optimization.

show abstract

Identification of Key Nodes Based on PageRank Algorithm

Cited by 6 publications

References 11 publications

Review of Path Selection Algorithms with Link Quality and Critical Switch Aware for Heterogeneous Traffic in SDN

Review of Path Selection Algorithms with Link Quality and Critical Switch Aware for Heterogeneous Traffic in SDN

Optimizing the Eﬃciency of Web Mining through Comparative Web Ranking Algorithms

Evaluation of Cross-Layer Network Vulnerability of Power Communication Network Based on Multi-Dimensional and Multi-Layer Node Importance Analysis

Contact Info

Product

Resources

About