2,715,787 research outputs found

    The effect of aging on network structure

    Full text link
    In network evolution, the effect of aging is universal: in scientific collaboration network, scientists have a finite time span of being active; in movie actors network, once popular stars are retiring from stage; devices on the Internet may become outmoded with techniques developing so rapidly. Here we find in citation networks that this effect can be represented by an exponential decay factor, eβτe^{-\beta \tau}, where τ\tau is the node age, while other evolving networks (the Internet for instance) may have different types of aging, for example, a power-law decay factor, which is also studied and compared. It has been found that as soon as such a factor is introduced to the Barabasi-Albert Scale-Free model, the network will be significantly transformed. The network will be clustered even with infinitely large size, and the clustering coefficient varies greatly with the intensity of the aging effect, i.e. it increases linearly with β\beta for small values of β\beta and decays exponentially for large values of β\beta . At the same time, the aging effect may also result in a hierarchical structure and a disassortative degree-degree correlation. Generally the aging effect will increase the average distance between nodes, but the result depends on the type of the decay factor. The network appears like a one-dimensional chain when exponential decay is chosen, but with power-law decay, a transformation process is observed, i.e., from a small-world network to a hypercubic lattice, and to a one-dimensional chain finally. The disparities observed for different choices of the decay factor, in clustering, average node distance and probably other aspects not yet identified, are believed to bear significant meaning on empirical data acquisition.Comment: 8 pages, 9 figures,V2, accepted for publication in Phys. Rev.

    Managing and Improving Upon Bandwidth Challenges in Computer Network

    Get PDF
    Managing the bandwidth of a computer network is always faced with great challenges. This research was necessitated by the urgent need to manage the University network currently experiencing congestion in both the local LA� and on the internet backhaul with a view to improving network performance and reduce the huge recurrent on the WA� link. However, there exists various ways that have been deployed towards solving these problems. In this paper we examined existing bandwidth management, effect of limited bandwidth on the network performance and profound solutions of techniques that enhanced or improved the bandwidth efficiency. Also, included in this research work are the studies of the effect of limited bandwidth on work load, type of protocol used and the effect of network congestion on the quality of service of a Wide Area �etwork (WA�). By comparison, from the modeling of the effect of work load and limited bandwidth on the throughput of a wide area network based on experimental simulation and real time simulation scenarios, some observations were made and recommendation of solutions were given from the analyzed results

    The effect of bandwidth in scale-free network traffic

    Get PDF
    We model information traffic on scale-free networks by introducing the bandwidth as the delivering ability of links. We focus on the effects of bandwidth on the packet delivering ability of the traffic system to better understand traffic dynamic in real network systems. Such ability can be measured by a phase transition from free flow to congestion. Two cases of node capacity C are considered, i.e., C=constant and C is proportional to the node's degree. We figured out the decrease of the handling ability of the system together with the movement of the optimal local routing coefficient αc\alpha_c, induced by the restriction of bandwidth. Interestingly, for low bandwidth, the same optimal value of αc\alpha_c emerges for both cases of node capacity. We investigate the number of packets of each node in the free flow state and provide analytical explanations for the optimal value of αc\alpha_c. Average packets traveling time is also studied. Our study may be useful for evaluating the overall efficiency of networked traffic systems, and for allevating traffic jam in such systems.Comment: 6 pages, 4 figure

    Conformation-networks of two-dimensional lattice homopolymers

    Full text link
    The effect of different Monte Carlo move sets on the the folding kinetics of lattice polymer chains is studied from the geometry of the conformation-network. The networks have the characteristics of small- world. The Monte Carlo move, rigid rotation, has drastic effect on the geometric properties of the network. The move not only change the connections but also reduce greatly the shortest path length between conformations. The networks are as robust as random network

    The Contributory Effect of Latency on the Quality of Voice Transmitted over the Internet

    Get PDF
    Deployment of Voice over Internet Protocol (VoIP) is rapidly growing worldwide due to the new services it provides and cost savings derived from using a converged IP network. However, voice quality is affected by bandwidth, delay, latency, jitter, packet loss e.t.c. Latency is the dominant factor that degrades quality of voice transfer. There is therefore strong need for a study on the effect of Latency with the view to improving Quality of Voice (QoV) in VoIP network. In this work, Poisson probability theorem, Markov Chain, Probability distribution theorems and Network performance metric were used to study the effect of latency on QoS in VoIP network. This is achieved by considering the effect of latency resulting from several components between two points in multiple networks. The NetQoS Latency Calculator, Net-Cracker Professional® for Modeling and Matlab/Simulink® for simulating network were tools used and the results obtained compare favourably well with theoretical facts
    corecore