The Adaptive Network Architecture for a Time-constrained Environment (original) (raw)
Related papers
Realization of a Network Configuration Management for increasing Operation Efficiency
IEICE technical report. Internet Architecture, 2015
While the growing diversity and complexity of the computer network, the operational efficiency of network management has been required. However, network equipments which should be managed are increasing, and it results in a management cost increase. To improve this issue, in this paper, we think the configuration management and automatic provisioning of the network service. Specifically we describe the effectiveness and problem of the proposed method through the application to a Hiroshima University's campus network system which is consisted by approximately 450 network switches.
Transactions of the Japanese Society for Artificial Intelligence, 2011
Distributed sensor network is an important research area of multi-agent systems. We focus on a type of distributed sensor network systems that cooperatively observe multiple objects using multiple autonomous gaze control sensors. The sensor resource allocation problems of the distributed sensor network can be formalized as distributed constraint optimization problems. However, in the previous works, computation cost to solve the resource allocation problems highly increases with scale/density of the problems. In this work, we divide the problem into two layers of problems. Then two layered cooperative solvers are applied to those problems. Moreover, constraints to keep stability of the allocation in dynamic environment are introduced. The result of the experiment shows that proposed method reduces the number of message cycles. Effects of constraints for the stability of the allocation are also shown.
Development of Middle Agents Mediating Ubiquitous Environment and Web Services
Transactions of the Japanese Society for Artificial Intelligence
According to the widespread use of Web Services, composition of multiple services is becoming a main issue. BPEL was proposed as a Web Services workflow language in this context. Then, in many cases we need much interactions between a service requester and a BPEL process execution engine. However for the end user under the ubiquitous environment where the service is executed with a cellular phone or PDA, the interaction means simply a burden. The reason is: (1)it is hard to carry out the operation manually, (2)a network connection is unstable, (3)a connection charge is relatively high. In this paper, we propose middle agents between ubiquitous users and Web Services. The agents analyze BPEL, extract the interaction which the ubiquitous users would need, then produce action operators. It makes a plan in order to achieve a service request from the user. Here the planning agent can reduce operations of the user by collecting the necessary information at the beginning which will be inputted during the IP execution. We show the architecture of the agents and an example regarding ATM service, then evaluate the number of inputs, the performance, and the quantity of data transmitted on network. Finally, we consider adaptability of this approach to generic BPEL flow.
Performance improvement in ad hoc wireless networks with consideration to packet duplication
2001
A Flexible Radio Network, one of the ad hoc wireless network systems, has a packet retransmission mechanism against packet transmission failures. While this mechanism intends to contribute to packet reachability, it sometimes causes unnecessary packet duplications and degrades the network performance. In this paper, we investigate a packet duplication process and suggest performance improving techniques with consideration to packet duplication. We also show that these techniques can decrease the number of duplicated packets and improve the network performance through simulation experiment.
Transactions of the Japanese Society for Artificial Intelligence, 2009
Cooperative problem solving with shared resources is important in practical multi-agent systems. Resource constraints are necessary to handle practical problems such as distributed task scheduling with limited resource availability. As a fundamental formalism for multi-agent cooperation, the Distributed Constraint Optimization Problem (DCOP) has been investigated. With DCOPs, the agent states and the relationships between agents are formalized into a constraint optimization problem. However, in the original DCOP framework, constraints for resources that are consumed by teams of agents are not well supported. A framework called Resource Constrained Distributed Constraint Optimization Problem (RCDCOP) has recently been proposed. In RCDCOPs, a limit on resource usage is represented as an n-ary constraint. Previous research addressing RCDCOPs employ a pseudo-tree based solver. The pseudo-tree is an important graph structure for constraint networks. A pseudo-tree implies a partial ordering of variables. However, n-ary constrained variables, which are placed on a single path of the pseudo-tree, decrease efficiency of the solver. We propose another method using (i) a pseudo-tree that is generated ignoring resource constraints and (ii) virtual variables representing the usage of resources. However the virtual variables increase search space. To improve pruning efficiency of search, (iii) we apply a set of upper/lower bounds that are inferred from resource constraints. The efficiency of the proposed method is evaluated by experiment.