Pair-dependent rejection rate and its impact on traffic flow in a scale-free network

No abstract is available for this paper.

• Publication year

  2014

• Venue

  International Journal of Modern Physics C

• Publication date

  2014-05-21

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1142/S0129183114500193
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Self Avoiding Paths Routing Algorithm in Scale-Free Networks

  2013cited by this paper
• Traffic gridlock on complex networks

  2012cited by this paper
• Onion-like network topology enhances robustness against malicious attacks

  2011cited by this paper
• Inter-arrival times of message propagation on directed networks

  2010cited by this paper
• Local Empathy provides Global Minimization of Congestion in Communication Networks

  2010cited by this paper
• Survey of multipath routing protocols for mobile ad hoc networks

  2009cited by this paper
• Traffic optimization in transport networks based on local routing

  2009cited by this paper
• Congestion phenomena on complex networks

  2008cited by this paper
• Entropy rate of diffusion processes on complex networks.

  2007cited by this paper
• Structural bottlenecks for communication in networks.

  2007cited by this paper
• Traffic dynamics based on local routing protocol on a scale-free network.

  2006cited by this paper
• Optimal routing on complex networks

  2006cited by this paper
• Efficient routing on complex networks.

  2005cited by this paper
• Two-peak and three-peak optimal complex networks.

  2004cited by this paper
• Optimization of network robustness to waves of targeted and random attacks.

  2004cited by this paper
• Congestion and Centrality in Traffic Flow on Complex Networks

  2003cited by this paper
• Statistical mechanics of complex networks

  2001cited by this paper
• Universal behavior of load distribution in scale-free networks.

  2001cited by this paper
• Navigation in a small world

  2000cited by this paper
• PHASE TRANSITION IN A COMPUTER NETWORK TRAFFIC MODEL

  1998cited by this paper

• Mining Important Functions in Software Network by Node Vulnerability

  2020cites this paper
• The effect of data exchange policy on traffic flow between interconnected networks

  2020cites this paper
• Mining important nodes in complex software network based on ripple effects of probability

  2019cites this paper
• Mining the Key Nodes from Software Network Based on Fault Accumulation and Propagation

  2019cites this paper
• Mining the Key Nodes from Software Network Based on Fault Accumulation and Propagation

  2019cites this paper
• Approach to Mine the Modularity of Software Network Based on the Most Vital Nodes

  2018cites this paper
• Dynamic model SIR of the spread of virus inside computers in scale free network

  2017cites this paper
• Optimal topology to minimizing congestion in connected communication complex network

  2017cites this paper
• The impact of neighboring infection on the computer virus spread in packets on scale-free networks

  2017cites this paper
• Modeling the spread of virus in packets on scale free network

  2016cites this paper
• Implantation of the global dynamic routing scheme in scale-free networks under the shortest path strategy

  2016cites this paper
• The optimal community detection of software based on complex networks

  2016cites this paper
• Traffic dynamics of information packets in complex networks with non-uniform source and destination selection

  2015cites this paper
• An algorithm to find critical execution paths of software based on complex network

  2015cites this paper