Complex-Network-Inspired Design of Traffic Generation Patterns in Communication Networks

Wu, Jiajing; Xia, Yongxiang

doi:10.1109/tcsii.2016.2598086

Cited by 34 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Simulated Annealing (SA) is an optimization method, which has been used in many research areas [26]. Our SA-based kshell attack is constituted of attacking iteration and annealing iteration, where the latter is nested within the former.…”

Section: Sa-based K-shell Attackmentioning

confidence: 99%

The Robustness of Graph k-shell Structure under Adversarial Attacks

Zhou

Mao

et al. 2021

Preprint

View full text Add to dashboard Cite

The k-shell decomposition plays an important role in unveiling the structural properties of a network, i.e., it is widely adopted to find the densest part of a network across a broad range of scientific fields, including Internet, biological networks, social networks etc. However, there arises concern about the robustness of the k-shell structure when networks suffer from adversarial attacks. Here, we introduce and formalize the problem of kshell attack and develop an efficient strategy to attack the k-shell structure by rewiring a small number of links. To the best of our knowledge, it is the first time to study the robustness of graph k-shell structure under adversarial attacks. In particular, we propose a Simulated Annealing (SA) based k-shell attack method and testify it on four real-world social networks. The extensive experiments validate that the k-shell structure of a network is robust under random perturbation, but it is quite vulnerable under adversarial attack, e.g., in Dolphin and Throne networks, more than 40% nodes change their k-shell values when only 10% links are changed based on our SA-based k-shell attack. Such results suggest that a single structural feature could also be significantly disturbed when only a small fraction of links are changed purposefully in a network. Therefore, it could be an interesting topic to improve the robustness of various network properties against adversarial attack in the future.

show abstract

Section: Sa-based K-shell Attackmentioning

confidence: 99%

The Robustness of Graph k-shell Structure under Adversarial Attacks

Zhou

Mao

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…The interest for the conduct of this study has been triggered by a variety of applications, such as environment [1], power [2], and networkon-chip design [3]. There is also an emerging application in the area of mobility systems, such as the optimization of traffic flows [4], [5], [6] and the design of efficient and effective mobility-on-demand systems [7], [8]. One of the standard models used for the study of buffer networks is the positive linear system model [9].…”

Section: Introductionmentioning

confidence: 99%

Optimization of Buffer Networks via DC Programming

Zhao

Sakurama

Ogura

2023

IEEE Trans. Circuits Syst. II

View full text Add to dashboard Cite

This brief is concerned with the H 2 and H ∞ normconstrained optimization problems of dynamic buffer networks. The extended network model is introduced first, wherein the weights of all edges can be tuned independently. Because of the emerging nonconvexity of the extended model, previous results of positive linear systems failed to address this situation. By resorting to the log-log convexity of a class of nonlinear functions called posynomials, the optimization problems can be reduced to differential convex programming problems. The proposed framework is illustrated for large-scale networks.

show abstract

“…R ECENTLY, the complex networks (CNs) have gained growing attentions because of their widely applications such as smart grids, social networks, communication networks and so on [1]- [5]. One of the emphases for CNs research is the synchronization problem, which refers to a coherent phenomenon between two or more systems.…”

Section: Introductionmentioning

confidence: 99%