This paper focuses on flow control in high-speed networks. Each node in a network handles its local traffic flow on the basis of only the information it is aware of, but it is preferable that the decision-making of each node leads to high performance of the whole network. To this end, we investigate the relationship between the flow control mechanism of each node and network performance. We consider the situation in which the capacity of a link in the network is changed but individual nodes are not aware of this. Then we investigate the stability and adaptability of the network performance, and discuss an appropriate flow control model on the basis of simulation results.

Connection Admission Control (CAC) is a key part of traffic control and still leaves several challenging problems peculiar to ATM networks. One of these problems is how to assign sufficient bandwidth for any cell arrival process that satisfies the source traffic descriptor values specified by negotiation between the network and a user at the connection setup. Because the source traffic descriptor cannot describe the actual source traffic characteristics completely, it has already been studied extensively that how to estimate sufficient bandwidth under the assumption that the actual traffic parameter values in the source traffic descriptor are equal to the negotiated values. This paper extends the studies in the literature to how to estimate sufficient bandwidth only assuming that the actual values satisfy the negotiated values, that is the actual values is less than or equal to the negotiated values. We show the sufficient condition for negotiated source traffic descriptors ensuring that the cell-loss ratio calculated from the negotiated values is always the upper-bound of the actual cell-loss ratio. Using this condition, we propose a CAC that can guarantee cell-loss ratio objective so far as a user satisfies the source traffic descriptor values.

This paper describes a realtime cell-loss ratio evaluation algorithm for ATM connection admission control. This algorithm gives an efficient evaluation of cell-loss ratio from traffic descriptors such as peak cell rate, sustainable cell rate, and maximum burst size for each VC. The most remarkable characteristics of this algorithm are that it terminates within a millisecond and that its time is independent of both the number of VCs and the capacity of a cell buffer.

The phenomenon known as social polarization, in which a social group splits into two or more groups, can cause division of the society by causing the radicalization of opinions and the spread of misinformation, is particularly significant in online communities. To develop technologies to mitigate the effects of polarization in online social networks, it is necessary to understand the mechanism driving its occurrence. There are some models of social polarization in which network structure and users' opinions change, based on the quantified opinions held by the users of online social networks. However, they are based on the interaction between users connected by online social networks. Current recommendation systems offer information from unknown users who are deemed to have similar interests. We can interpret this situation as being yielded non-local effects brought on by the network system, it is not based on local interactions between users. In this paper, based on the spectral graph theory, which can describe non-local effects in online social networks mathematically, we propose a model of polarization that user behavior and network structure change while influencing each other including non-local effects. We investigate the characteristics of the proposed model. Simultaneously, we propose an index to evaluate the degree of network polarization quantitatively, which is needed for our investigations.

A Wireless Sensor Network has sensor nodes which have limited computational power and memory size. Due to the nature of the network, the data is vulnerable to attacks. Thus, maintaining confidentiality is an important issue. To compensate for this problem, there are many countermeasures which utilize common or public key cryptosystems that have been proposed. However, these methods have problems with establishing keys between the source and the destination nodes. When these two nodes try to establish new keys, they must exchange information several times. Also, the routes of the Wireless Sensor Networks can change frequently due to an unstable wireless connection and batteries running out on sensor nodes. These problems of security and failure become more serious as the number of nodes in the network increases. In this paper, we propose a new data distribution method to compensate for vulnerability and failure based on the Secret Sharing Scheme. In addition, we will confirm the effect of our method through experiments. Concerning security, we compare our method with the existing TinySec, which is the major security architecture of Wireless Sensor Networks.

We have proposed a diffusion-type flow control mechanism to achieve the extremely time-sensitive flow control required for high-speed networks. In this mechanism, each node in a network manages its local traffic flow only on the basis of the local information directly available to it, by using predetermined rules. In this way, the implementation of decision-making at each node can lead to optimal performance for the whole network. Our previous studies concentrated on the flow control for a single flow. In this paper, we propose a diffusion-type flow control mechanism for multiple flows. The proposed scheme enables a network to quickly recover from a state of congestion and to achieve fairness among flows.

In high-speed data networks, it is important to execute high-speed address resolution for packets at a router. To accomplish high-speed address resolution, address cache is effective. For HTTP accesses, it has been discussed that the Dual Zipfian Model can describe the distribution of the destination IP addresses, and it enabled us to derive the cache miss ratio in the steady state, i. e. , the cache miss ratio when the cache has full entries. However, at the time that systems are initialized or network topology is changed, the address cache has no address information or invalid address information. This paper shows the compulsory miss ratio which is the cache miss ratio when the cache has no address entry. In addition, we discuss the replacement policies of cache entries, for fast recovery of packet reachability, when the cache has information of unreachable address.

Recent development of compact and powerful portable computers and mobile phones and proliferation of the Internet will enable mobile multimedia communications. From the viewpoint of implementing multimedia services into mobile communications, it allows us to predict that traffic characteristics of mobile networks change. For planning, designing, and operating mobile multimedia networks, it is important to investigate traffic models which take the effect of multimedia services into consideration. This paper investigates population of active users in a micro-cell and proposes a traffic model for mobile multimedia networks. This model describes a population process of active users in a micro-cell in diffusion model, and its characteristics include self-similarity and activity of mobility. We also made an evaluation of network performance by using simulation, in order to show that characteristics of the proposed traffic model have impact on planning and designing networks.

We have previously proposed a diffusion-type flow control mechanism as a solution for severely time-sensitive flow control required for high-speed networks. In this mechanism, each node in a network manages its local traffic flow using the basis of only the local information directly available to it, by using predetermined rules. In addition, the implementation of decision-making at each node can lead to optimal performance for the whole network. Our previous studies show that our flow control mechanism with certain parameter settings works well in high-speed networks. However, to apply this mechanism to actual networks, it is necessary to clarify how to design a parameter in our control mechanism. In this paper, we investigate the range of the parameter and derive its optimal value enabling the diffusion-type flow control to work effectively.

This paper discusses research into the capacity dimensioning of Virtual Private Network (VPN) access links for elastic traffic, such as the Web or ftp. Assuming that the core-VPN network is provisioned with a sufficiently large capacity, managing the capacity of the VPN access link comes to sharing the bandwidth for the elastic traffic of the two bottlenecks, the ingress and egress access links. In the case of a single bottleneck with a limited capacity for access links, the processor-sharing model provides a simple formula for mean transfer time, but here, the value may be less than the actual transfer time because multiple flow may compete the bandwidth of both ingress and egress links. In contrast, max-min fair sharing provides an accurate sharing model which is similar to the TCP, but it is difficult to obtain a closed form for performance statistics. We propose a closed form approximation for a max-min fair sharing model, within a specific but realistic topology, through an investigation into the difference between the max-min and the processor sharing model. Using approximation, we calculate the capacity dimensioning of VPN access links.

Spectral graph theory provides an algebraic approach to investigate the characteristics of weighted networks using the eigenvalues and eigenvectors of a matrix (e.g., normalized Laplacian matrix) that represents the structure of the network. However, it is difficult to accurately represent the structures of large-scale and complex networks (e.g., social network) as a matrix. This difficulty can be avoided if there is a universality, such that the eigenvalues are independent of the detailed structure in large-scale and complex network. In this paper, we clarify Wigner's Semicircle Law for weighted networks as such a universality. The law indicates that the eigenvalues of the normalized Laplacian matrix of weighted networks can be calculated from a few network statistics (the average degree, average link weight, and square average link weight) when the weighted networks satisfy a sufficient condition of the node degrees and the link weights.

Computer networks require sophisticated control mechanisms to realize fair resource allocation among users in conjunction with efficient resource usage. To successfully realize fair resource allocation in a network, someone should control the behavior of each user by considering fairness. To provide efficient resource utilization, someone should control the behavior of all users by considering efficiency. To realize both control goals with different granularities at the same time, a hierarchical network control mechanism that combines microscopic control (i.e., fairness control) and macroscopic control (i.e., efficiency control) is required. In previous works, Aida proposed the concept of chaos-based hierarchical network control. Next, as an application of the chaos-based concept, Aida designed a fundamental framework of hierarchical transmission rate control based on the chaos of coupled relaxation oscillators. To clarify the realization of the chaos-based concept, one should specify the chaos-based hierarchical transmission rate control in enough detail to work in an actual network, and confirm that it works as intended. In this study, we implement the chaos-based hierarchical transmission rate control in a popular network simulator, ns-2, and confirm its operation through our experimentation. Results verify that the chaos-based concept can be successfully realized in TCP/IP networks.

This paper describes a real-time connection admission control scheme for supporting multiple service categories. The scheme is based on a real-time cell-loss ratio evaluation algorithm for VBR based on peak/sustainable cell rates and maximum burst size. The algorithm is based on a notion of Allan variance of VP utilization. The most remarkable characteristics of the admission control scheme are that it terminates within constant time, a few milliseconds, and that its time is independent of both the number of VCs and the capacity of a cell buffer.

Sensor nodes are prone to failure and have limited power capacity, so the evaluation of fault tolerance and the creation of technology for improved tolerance are among the most important issues for wireless sensor networks. The placement of sensor nodes is also important, since this affects the availability of nodes within sensing range of a target in a given location and of routes to the base station. However, there has been little research on the placement of sensor nodes. Furthermore, all research to date has been based on deterministic node placement, which is not suitable when a great many sensor nodes are to be placed over a large area. In such a situation, we require stochastic node placement, where the sensor-positions are in accord with a probability density function. In this paper, we examine how fault tolerance can be improved by stochastic node placement that produces scale-free characteristics, that is, where the degree of the nodes follows a power law.

This paper discusses research trends in high-speed LANs, which are leading the way to private networks. It also mentions issues that need to be solved to achieve high-performance seamless networks.

Since the TCP is the transport protocol for most Internet applications, evaluation of TCP throughput is important. In this paper, we establish a framework of evaluating TCP throughput by simple measurement. TCP throughput is generally measured by sending TCP traffic and monitoring its arrival or using data from captured packets, neither of which suits our proposal because of heavy loads and lack of scalability. While there has been much research into the analytical modeling of TCP behavior, this has not been concerned with the relationship between modeling and measurement. We thus propose a lightweight method for the evaluation of TCP throughput by associating measurement with TCP modeling. Our proposal is free from the defects of conventional methods, since measurement is performed to obtain the input parameters required to calculate TCP throughput. Numerical examples show the proposed framework's effectiveness.

We present a new multi-path routing methodology, MLB-routing, that is based on the multinomial logit model, which is well known in the random utility field. The key concept of the study is to set multiple paths from the origin to the destination, and distribute packets in accordance with multinomial logit type probability. Since MLB-routing is pure multi-path routing, it reduces the convergence on some links and increases bandwidth utilization in the network. Unlike existing multi-path routing schemes, which pre-set alternate paths, the proposed method can dynamically distribute packets to every possible path and thus is more efficient. Furthermore, it should be mentioned that this methodology can be implemented as either a link-state protocol or a distance-vector protocol. Therefore, it well supports the existing Internet. Simulations show that this methodology raises network utilization and significantly reduces end-to-end delay and jitter.

This paper proposes an oscillation model for analyzing the dynamics of activity propagation across social media networks. In order to analyze such dynamics, we generally need to model asymmetric interactions between nodes. In matrix-based network models, asymmetric interaction is frequently modeled by a directed graph expressed as an asymmetric matrix. Unfortunately, the dynamics of an asymmetric matrix-based model is difficult to analyze. This paper, first of all, discusses a symmetric matrix-based model that can describe some types of link asymmetry, and then proposes an oscillation model on networks. Next, the proposed oscillation model is generalized to arbitrary link asymmetry. We describe the outlines of four important research topics derived from the proposed oscillation model. First, we show that the oscillation energy of each node gives a generalized notion of node centrality. Second, we introduce a framework that uses resonance to estimate the natural frequency of networks. Natural frequency is important information for recognizing network structure. Third, by generalizing the oscillation model on directed networks, we create a dynamical model that can describe flaming on social media networks. Finally, we show the fundamental equation of oscillation on networks, which provides an important breakthrough for generalizing the spectral graph theory applicable to directed graphs.