A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations
2004
Physical Review E
Preserved Fulltext
Other Versions
We study the microscopic time fluctuations of traffic-load and the global statistical properties of a dense traffic of particles on scale-free cyclic graphs. ...
Already before jamming we observe qualitative changes in the global network-load distributions and the particle queuing-times. ...
scale free directed network with closed loops and a next-nearestneighbor search strategy results in efficient traffic with a large output rate which utilizes the hubs effectively. ...
doi:10.1103/physreve.69.036102
pmid:15089356
fatcat:g5vy6vqphzfm7g4ilrzwpvb3jy
Integrating network structure and dynamic information for better routing strategy on scale-free networks
2009
Physica A: Statistical Mechanics and its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
We study information packet routing processes on scale-free networks by mimicking the Internet traffic delivery strategies. ...
We incorporate both the global network structure information and the local queuing information in the dynamic processes. We propose several new routing strategies to guide the packet routing. ...
We thus focus our attention on information packet traffic in scale-free networks. ...
doi:10.1016/j.physa.2009.02.018
fatcat:dlbjaaz2zfcctntoatdfvcofry
Optical switching speed requirements for terabit/second packet over WDM networks
2000
IEEE Photonics Technology Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Optical dynamics requirement for packetover-WDM networks is analyzed. ...
Optimization among optical switching speed, global resource availability, and local queuing considerations is performed, yielding multiterabit/second throughput capability by employing submicrosecond switching ...
Summarizing the three-lag strategy: a) realistic optical switching technology limits switching speeds to submicroseconds or longer; b) decision time for global considerations does not scale and is therefore ...
doi:10.1109/68.839045
fatcat:pn6roncdlze5ldbeygngcp73bu
Information super-diffusion on structured networks
2004
Physica A: Statistical Mechanics and its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2003 pre-print arXiv:cond-mat/0307670v1 fatcat:6xqt2vtbyzct7aup7gtrskomle
We study diffusion of information packets on several classes of structured networks. Packets diffuse from a randomly chosen node to a specified destination in the network. ...
We are able to quantify the role of network topology on overall transport efficiency. ...
. • Queuing strategy: When more than one packet is sitting on a node a queue is formed and a queuing discipline needs to be specified. ...
doi:10.1016/j.physa.2003.10.007
fatcat:52tie3t5mbhx5dw55ry5wefgke
Performance Modeling of BitTorrent Peer-to-Peer File Sharing Networks
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The widespread popularity of BitTorrent has attracted a great deal of attention from networking researchers who conducted various performance studies on it. ...
The performance models examined in this study include deterministic models, Markov chain models, fluid flow models, and queuing network models. ...
But in reality, the dynamics of a single piece depends on the other pieces as well based on BitTorrent piece selection strategy. ...
arXiv:1311.1195v1
fatcat:chx4nnn3avephcvxrojnmonlke
Efficient path routing strategy for flows with multiple priorities on scale-free networks
2017
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, a novel routing algorithm, which is based on the efficient path routing strategy (EP), is proposed to overcome network congestion problem caused by large amount of traffic flows with different ...
In real networks, traffic flows are different in amount as well as their priorities. However, the latter priority has rarely been examined in routing strategy studies. ...
BA scale-free network is generated from a fully connected graph with m 0 nodes. ...
doi:10.1371/journal.pone.0172035
pmid:28199382
pmcid:PMC5310893
fatcat:ualbme7x4vckdmrgcgf7mjr3gu
A Congestion Control Strategy for Power Scale-Free Communication Network
2017
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In [14, 15] , a global dynamic routing strategy was proposed, which took the queue length of each node in the path as the route cost. ...
In [14, 15] , a global dynamic routing strategy was proposed, which took the queue length of each node in the path as the route cost. ...
Under the global dynamic routing, Rc reaches a very high value of 44, which is larger than the three routing strategies. ...
doi:10.3390/app7101054
fatcat:2stjidsvcbdifirmp35sinoa2y
Effective local dynamic routing strategy for air route networks
2015
Chinese Journal of Aeronautics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Aiming to improve the throughput of the air route network (ARN), we propose an effective local dynamic routing strategy in this paper. ...
When the ARN is in the normal free-flow state, the proposed strategy can recover the shortest path routing (SPR) strategy. ...
based on topological distance, link capacity and betweenness. 17 For spatial scale-free networks, choosing a neighbor with a higher degree in the local routing strategy can also give a higher probability ...
doi:10.1016/j.cja.2015.09.003
fatcat:75dr336rwvhorhd4faekszreti
Complex Networks: Traffic Dynamics, Network Performance, and Network Structure
2013
American Journal of Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Much research has focused on scale-free (SF) networks because of the discovery of power-law degree distribution of many real-world networks [13] [14] . ...
We investigate how internal traffic, through put, delay, and packet loss change as a function of packet generation rate, network structure, queue type, and queuing discipline through simulation. ...
Based on observed traffic dynamics in the networks studied, we classify three network states: traffic free flow state, moderate congestion state, and heavy congestion state. ...
doi:10.4236/ajor.2013.31a018
fatcat:khiyoz5pivaglmvnqg2kx2yzgu
TRANSPORT ON COMPLEX NETWORKS: FLOW, JAMMING AND OPTIMIZATION
2007
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present the results of extensive simulations on two classes of networks; a correlated cyclic scale-free network and an uncorrelated homogeneous weakly clustered network. ...
We also determine statistical indicators of the pre-jamming regime on different network geometries and discuss the role of queuing and dynamical betweenness for the traffic congestion. ...
In particular, whenα = 1 the graph is rigid (rewiring can not occure) and scale-free, i.e., for M = 1 a scale-free tree and when M > 1 a weakly clustered uncorrelated scale-free graph emerges as known ...
doi:10.1142/s0218127407018452
fatcat:aksbiqe67jdphnvl5yq4btmfzm
Using Machine Learning to Provide Reliable Differentiated Services for IoT in SDN-Like Publish/Subscribe Middleware
2019
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Finally, we propose a reliable differentiated services guarantee mechanism according to the queuing delay and the programmability of SDN to improve QoS, namely, a two-layer queue management mechanism. ...
Then we present a machine learning method using the eXtreme Gradient Boosting (XGBoost) model to solve the difficult issue of getting the queuing delay of switches accurately. ...
This strategy makes full use of the administrator's characteristics which can control the global network and dynamically allocate constraints based on user requirements. ...
doi:10.3390/s19061449
fatcat:j4h33ge4inc3lpbh4pgalb2rri
ParRouting: An Efficient Area Partition-Based Congestion-Aware Routing Algorithm for NoCs
2020
Micromachines
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Routing algorithms is a key factor that determines the performance of NoC (Networks-on-Chip) systems. ...
First, ParRouting partitions the network into two areas (i.e., edge area and central area.) based on node priorities. ...
(b) One has a free VC and another does not have a free VC. ...
doi:10.3390/mi11121034
pmid:33255727
fatcat:y3n7emrcmzfdjlph2zmiot3ipm
Macroscopic model of agent-based load balancing on grids
2003
Proceedings of the second international joint conference on Autonomous agents and multiagent systems - AAMAS '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a dynamic model of agent-based load balancing on grids. Our goal is to explore the effects of agents' strategies on the quality of load balancing. ...
., whether or not the load can be perfectly balanced, depends on agents' strategies. ...
Therefore, agents' behaviors can be decomposed into two elements: leaving and queuing. The primitive strategies for the two elements will determine the global dynamic behaviors of the system. ...
doi:10.1145/860575.860704
dblp:conf/atal/WangL03
fatcat:ksuipwgnrnaydpomvmobvchxrq
Macroscopic model of agent-based load balancing on grids
2003
Proceedings of the second international joint conference on Autonomous agents and multiagent systems - AAMAS '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a dynamic model of agent-based load balancing on grids. Our goal is to explore the effects of agents' strategies on the quality of load balancing. ...
., whether or not the load can be perfectly balanced, depends on agents' strategies. ...
Therefore, agents' behaviors can be decomposed into two elements: leaving and queuing. The primitive strategies for the two elements will determine the global dynamic behaviors of the system. ...
doi:10.1145/860700.860704
fatcat:hkwdh2hzs5cqnjvmvzzz7q5ka4
Agent-based load balancing on homogeneous minigrids: macroscopic modeling and characterization
2005
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The agent-based load balancing is regarded as agent distribution from a macroscopic point of view. We study two quantities on minigrids: the number and size of teams where agents (tasks) queue. ...
In order to maximize the utility gain and the efficiency, we theoretically discuss the optimization of agents' strategies. ...
Therefore, we use a model in [39] to generate scale-free networks. ...
doi:10.1109/tpds.2005.76
fatcat:eqdo7xl6a5fzlkpbs5kpnp5ysu
« Previous
Showing results 1 — 15 out of 7,942 results