Here, we give a full proof of Theorem 1. Recall that an equivalent construction of the PAGA graphs is obtained by collapsing the graph G 1 to G t m leading to t super nodes. Accordingly, based on G t m, we can directly generate G m by (temporarily) adding m more nodes, each linking with a single edge, and then collapsing these m nodes to the (t+ 1)th super node. Let dt,i(v) denote the degree of...

This paper presents the new strategy for smooth content distribution in the mobile social network. We proposed a new method, hybrid mobile social network architecture scheme considered as one node of a social community called social super node with higher capacity provides the services of content distribution. We proposed methods and techniques that are introduced to set the criteria to select ...

Many characteristics of complex networks, such as small-world, scale-free, aggregation properties, and so on have been thoroughly studied. Super-node structure is an important way to resolve the problem of service node selection in complex network. Two key issues of this method are how to define the scope of super-nodes in their respective communities and how to choose an appropriate super-node...

Peer-to-Peer technologies have been widely applied for multimedia applications. The super-peer based approach provides an efficient way to run applications by exploring nodes’ heterogeneity. In P2P live video streaming, even though the number of stable nodes is small, they have significant impact on the performance of the network. Thus, we present a super-peer-based overlay design, where stable...

Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...

Many interconnection networks can be constructed with line digraph iterations. A digraph has super link-connectivity d if it has link-connectivity d and every link-cut of cardinality d consists of either all out-links coming from a node, or all in-links ending at a node, excluding loop. In this paper, we show that the link-digraph iteration preserves super link-connectivity. c © 2003 Elsevier B...

In reputation systems, how to obtain node’s reputation is a crucial issue. To solve this problem, a two-layer reputation search mechanism based on ant colony and grouping is proposed. The first layer is the monitoring platform. According to physical topology, it divides nodes into groups. Each group uses network segment as its identification, and it has a super node and a candidate node. The se...

The theory of super network is an effective method to various traffic networks with means of multiple decision-making. It provides us with a favorable pricing decision tool for it combines a practical transport network with the space pricing decision. Spatial price equilibrium problem has always been the important research direction of the Transport Economics and regional transportation plannin...