Internet data packet transport: from global topology to local queueing dynamics

We study structural feature and evolution of the Internet at the autonomous systems level. Extracting relevant parameters for the growth dynamics of the Internet topology, we construct a toy model for the Internet evolution, which includes the ingredients of multiplicative stochastic evolution of nodes and edges and adaptive rewiring of edges. The model reproduces successfully structural features of the Internet at a fundamental level. We also introduce a quantity called the load as the capacity of node needed for handling the communication traffic and study its time-dependent behavior at the hubs across years. The load at hub increases with network size $N$ as $\sim N^{1.8}$. Finally, we study data packet traffic in the microscopic scale. The average delay time of data packets in a queueing system is calculated, in particular, when the number of arrival channels is scale-free. We show that when the number of arriving data packets follows a power law distribution, $\sim n^{-\lambda}$, the queue length distribution decays as $n^{1-\lambda}$ and the average delay time at the hub diverges as $\sim N^{(3-\lambda)/(\gamma-1)}$ in the $N \to \infty$ limit when $2 < \lambda < 3$, $\gamma$ being the network degree exponent.Comment: 5 pages, 4 figures, submitted to International Journal of Bifurcation and Chao

Classification of scale-free networks

While the emergence of a power law degree distribution in complex networks is intriguing, the degree exponent is not universal. Here we show that the betweenness centrality displays a power-law distribution with an exponent \eta which is robust and use it to classify the scale-free networks. We have observed two universality classes with \eta \approx 2.2(1) and 2.0, respectively. Real world networks for the former are the protein interaction networks, the metabolic networks for eukaryotes and bacteria, and the co-authorship network, and those for the latter one are the Internet, the world-wide web, and the metabolic networks for archaea. Distinct features of the mass-distance relation, generic topology of geodesics and resilience under attack of the two classes are identified. Various model networks also belong to either of the two classes while their degree exponents are tunable.Comment: 6 Pages, 6 Figures, 1 tabl

Collaborative Worlds and Avatar-Based Communication: A Comparison of Virtual Worlds with Traditional Computer-Mediated Communications Media

Interest in virtual worlds from both academic and practitioner perspectives continues to grow. As a relatively new area of research, exploratory efforts to capitalize on and understand this new computer-mediated communications medium have been varied and multi-disciplinary, but also dangerously fragmented. Avatar-based communication distinguishes virtual worlds from traditional communications media and conceptually enables a potentially richer communications medium. Utilizing an integrative theoretical approach drawing from theories of social presence, media richness, media synchronicity, social influence, technology acceptance, and channel expansion, we seek to understand how virtual worlds compare with other communications media. Preliminary results from two phases of a Delphi study with expert participants present interesting findings. While not surprising that face-to-face communications are preferred in a wide variety of situations, what is surprising is that virtual worlds do not appear to be favorably ranked as compared to other leaner traditional communications media. Other results, implications and directions for future research are discussed

A box-covering algorithm for fractal scaling in scale-free networks

A random sequential box-covering algorithm recently introduced to measure the fractal dimension in scale-free networks is investigated. The algorithm contains Monte Carlo sequential steps of choosing the position of the center of each box, and thereby, vertices in preassigned boxes can divide subsequent boxes into more than one pieces, but divided boxes are counted once. We find that such box-split allowance in the algorithm is a crucial ingredient necessary to obtain the fractal scaling for fractal networks; however, it is inessential for regular lattice and conventional fractal objects embedded in the Euclidean space. Next the algorithm is viewed from the cluster-growing perspective that boxes are allowed to overlap and thereby, vertices can belong to more than one box. Then, the number of distinct boxes a vertex belongs to is distributed in a heterogeneous manner for SF fractal networks, while it is of Poisson-type for the conventional fractal objects.Comment: 12 pages, 11 figures, a proceedings of the conference, "Optimization in complex networks." held in Los Alamo

Safely dissolvable and healable active packaging films based on alginate and pectin

Extensive usage of long-lasting petroleum based plastics for short-lived application such as packaging has raised concerns regarding their role in environmental pollution. In this research, we have developed active, healable, and safely dissolvable alginate-pectin based biocomposites that have potential applications in food packaging. The morphological study revealed the rough surface of these biocomposite films. Tensile properties indicated that the fabricated samples have mechanical properties in the range of commercially available packaging films while possessing excellent healing effciency. Biocomposite films exhibited higher hydrophobicity properties compared to neat alginate films. Thermal analysis indicated that crosslinked biocomposite samples possess higher thermal stability in temperatures below 120 °C, while antibacterial analysis against E. coli and S. aureus revealed the antibacterial properties of the prepared samples against different bacteria. The fabricated biodegradable multi-functional biocomposite films possess various imperative properties, making them ideal for utilization as packaging material

Load distribution in weighted complex networks

We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution function $p_c(c)$. In the strong disorder limit, where $p_c(c)\sim c^{-1}$, the load distribution follows a power law both in the Erd\H{o}s-R\'enyi (ER) random graphs and in the scale-free (SF) networks, and its characteristics are determined by the structure of the minimum spanning tree. The distribution of loads at vertices with a given vertex degree also follows the SF nature similar to the whole load distribution, implying that the global transport property is not correlated to the local structural information. Finally, we measure the effect of disorder by the correlation coefficient between vertex degree and load, finding that it is larger for ER networks than for SF networks.Comment: 4 pages, 4 figures, final version published in PR

Implementation of a herd management system with wireless sensor networks

This paper investigates an adaptation of Wireless Sensor Networks (WSNs) to cattle monitoring applications. The proposed solution facilitates the requirement for continuously assessing the condition of individual animals, aggregating and reporting this data to the farm manager. There are several existing approaches to achieving animal monitoring, ranging from using a store and forward mechanism to employing GSM-based techniques; these approaches only provide sporadic information and introduce a considerable cost in staffing and physical hardware. The core of this study is to overcome the aforementioned drawbacks by using alternative cheap, low power consumption sensor nodes capable of providing real-time communication at a reasonable hardware cost. In this paper, both the hardware and software has been designed to provide a solution which can obtain real-time data from dairy cattle whilst conforming to the limitations associated with WSNs implementations