The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
RFC4893 defines the transition mechanisms to use 4 byte Autonomous System numbers. This RFC has some inconsistencies and has not been implemented correctly by all vendors. As a result, several major Internet incidents related with the handling of bogus 4 byte Autonomous System Numbers (ASNs) have ocurred. The last one was registered between the 17th and the 18th August, 2009. This paper analyses BGP-4...
In this paper, dynamic protocols for multi-agent systems are designed and presented to reach consensus on different scenarios. The architecture of such group of agents are with interconnected scattered topology. In static synchrony communication circumstance, a consensus protocol which is depicted in linear dynamic-system form, is developed to make group of agents finally obtain consensus. The consensus...
Underwater wireless sensor networks (UWSNs) are prone to message loss due to their poor link condition with high bit error rate (BER). Retransmission-based mechanisms such as ARQ can be used for the reliability, however, they are not suitable for UWSNs due to the inherent long propagation delay of UWSNs. Therefore, a forward error correction (FEC) mechanism might be an alternative in order to guarantee...
This work presents an H2 performance analysis of the agreement protocol in the presence of noise. The agreement protocol is first transformed into an equivalent system induced by the dynamics of the relative, or edge, system states. The edge based representation is used to perform an H2 analysis of the system highlighting the roles of cycles in this context. For spanning trees and and certain k-regular...
This paper develops finite-time consensus theory for multi-agent systems and presents the design and analysis results of distributed consensus protocols, which are continuous state feedbacks. Those distributed algorithms are in general form and have their wide range of applications, including fast consensus, saturation control, and network connectivity preserving. By employing the tools of finite-time...
In this paper, we study the discrete-time nonlinear consensus protocols over both directed and undirected networks with fixed topology. First, the notions of (global/exponential) semistability are introduced for systems with a continuum of equilibria. In terms of (global/exponential) consensus defined based on the notion of semistability, we have derived convergence conditions for the general discrete-time...
This paper is concerned with the asynchronous consensus problem of agents with double-integrator dynamics under time-invariant interaction topology. It is assumed that each agent measures its states relative to its neighbors only at discrete times and the discrete times of each agent are independent of the others'. It is shown that the asynchronous consensus is equivalent to the globally asymptotically...
This paper studies the velocity-consensus problem of multi-agent systems with second-order agent dynamics and proposes an asynchronous distributed consensus protocol allowing for switching interaction topology, time-varying delays and intermittent information transmission. Unlike the existing works, the agreement of position-like states is not required in this paper. Velocity consensus is a prerequisite...
This paper proposed a redirection scheme used in the broadband access network to optimize the transmission of p2p service. The excellent performance of the proposed scheme in decreasing the burden of the core network data is verified through the simulations with NS2.
The hierarchical routing and wavelength assignment problem in Automatic Switched Optical Network (ASON) is researched. Based on our analysis, three adaptive algorithms called MLLR (Multi-Layer Least Loaded Routing Algorithm), WMLCR (Wavelength-graph-based Multi-Layer Least Congestion Routing Algorithm) and BMR (Backtracking-based Multi-Layer Routing Algorithm) are proposed. A platform named AHORSP...
In this paper, we study algebraic aggregate computations in Sensor Networks. The main contribution is the presentation of an early-stopping protocol that computes the average function under a harsh model of the conditions under which sensor nodes operate. This protocol is shown to be time-optimal in presence of unfrequent failures. The approach followed saves time and energy by relying the computation...
In order to avoid the single-point-failure problem in centralized Web service publication and search mechanisms, an alliance-based Web service discovery method for unstructured P2P network was proposed in this paper. A service alliance is composed of web services with same functional properties. By using of the alliance-information-list, service requests could be spread rapidly through out the alliance...
As a reaction to the threat of network security, the appliance of virtual private network (VPN) has become more and more prevalent. In order to support IPSec VPN on ForTER, the paper proposes an implementation model by IPSec security policy LFB, which is the critical step to achieve IPSec VPN on ForTER. Experiment results show the feasibility and effectiveness of the model.
We propose an efficient way of constructing the wireless mesh structure associated with molecular MAC, a multichannel access method designed for efficient packet forwarding. We base our role assignment on a restricted weakly connected dominating set structure. After presenting a formal definition of the role assignment problem, we prove its NP-completeness. Then, we propose a centralized 2-approximation...
DHT-based P2P networks have a problem of topology mismatch which causes high latency for message routing. This paper focuses on improving the latency of routing process for chord, which is a typical DHT-based P2P network protocol. We propose a simple method to build a chord network based on the proximity of nodes in the underlying physical network. The idea of our method is the combination of two...
Resource discovery is an important aspect of many modern large-scale distributed systems. In the past, this problem has been solved using many different approaches, such as a central registry server, flooding-based protocols, and distributed hash tables. In this paper, these three widely used architectures are compared, using measurement results obtained from real implementations run on an Emulab...
Multicast conferencing is a rapidly-growing area of Internet use. Audio, video and other media such as shared whiteboard data can be distributed efficiently between groups of conference participants using multicast algorithms that minimize the amount of traffic sent over the network. This is far more effective than systems that maintain a separate link between each participant. On the other hand Peer-to-Peer...
To resolve the scalability problem in the existing Internet, there are many researches proposing the idea of separating the Internet into two independent evolving spaces, the access network and the core network, respectively. Such separation provides us opportunities to reconsider the methods of implementation of inter-domain traffic engineering under the new network environment. Based on the existing...
Structured peer-to-peer (P2P) networks is becoming popular for their advantages of high scalability and good performance. These networks are based on the distributed hash tale or DHT mechanism to establish and maintain a certain topology. However, while adopting structured P2P network for wireless environment, one have to deal with the phenomenon of frequent join and leave of mobile nodes, namely...
In a consensus problem, autonomous agents constituting a dynamical system communicate with one another to reach agreement on certain quantities of interest. By merging control theory and spectral graph theory, we generalize the previous consensus problems under nonlinear protocols for networks with undirected graphs to directed graphs. We prove that, when the nonlinear protocol is strictly increasing,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.