Traffic Engineering (TE) leverages information of network traffic to generate
a routing scheme optimizing the traffic distribution so as to advance network
performance. However, optimize the link weights for OSPF to the offered traffic
is an known NP-hard problem. In this paper, motivated by the fairness concept
of congestion control, we firstly propose a new generic objective function,
where various interests of providers can be extracted with different parameter
settings.
As a social media, online social networks play a vital role in the social
information diffusion. However, due to its unique complexity, the mechanism of
the diffusion can be different from the ones in other types of networks and
remains unclear to us. Meanwhile, few works have been done to reveal the
coupled dynamics of both the structure and the diffusion of online social
networks. To this end, in this paper, we propose a model to investigate how the
structure is coupled with the diffusion in online social networks from the view
of weak ties.
Complex networks have recently aroused a lot of interest. However, network
edges are considered to be the same in almost all these studies. In this paper,
we present a simple classification method, which divides the edges of
undirected, unweighted networks into two types: p2c and p2p. The p2c edge
represents a hierarchical relationship between two nodes, while the p2p edge
represents an equal relationship between two nodes.