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.
Network attacks and in particular denial of service (DoS) attacks have emerged as a major way to compromise the availability of servers and interrupt legitimate online services provided by servers. These attacks are among one of the hardest security problems to address because they are simple to implement but hard to prevent and difficult to trace. Tracing the attacker after an attack is crucial to...
In network analysis the ability to characterize nodes based on their attributes and surrounding network structure is a fundamental problem. For example, in financial transaction networks, it allows us to identify typical and anomalous behaviour -- important for uncovering fraudulent behaviour. Egocentric network motif analysis is a counting algorithm that tackles this problem -- although it is a computationally...
This paper proposes Peer-to-Peer (P2P) Communication to share the resources in fast manner with the help of large area communication between the nodes in the network. The big size and good stability properties of P2P files in network give rise to the use of highly effective capacity planning and topology matching techniques as a promising solution to manage P2P communications in shared area network...
One way to conserve energy in cloud data centers is to transition idle servers into a power saving state during periods of low utilization. Dynamic virtual machine (VM) consolidation (VMC) algorithms are proposed to create idle times by periodically repacking VMs on the least number of physical machines (PMs). Existing works mostly apply VMC on top of centralized, hierarchical, or ring-based system...
Placing replicas in a P2P network can reduced the number of hops required by a node to search an object. One existing replica placement strategy for structured P2P networks allocates replicas at nodes that are continuously close to the destination. In this paper, we investigate the effectiveness of such an approach. We propose an optimal algorithm to place replicas for an object, in terms of number...
Wireless sensor networks based on the IEEE 802.15.4 standard is able to achieve low-power transmissions in low-rate and short-distance wireless personal area networks (WPANs). It employs the slotted carrier sense multiple access with collision avoidance (CSMA/CA) in the contention access period (CAP). Unfortunately the periodic broadcast beacon frame is transmitted without CSMA/CA so that it could...
In decentralized and unstructured P2P networks like Gnutella, there is no coupling between topology and data location. Nodes can leave the network arbitrarily, which greatly affects their neighbors. We should determine in advance how many and which nodes will be affected when some nodes leave the network due to unstable Internet environment. In view of this challenge, we model the problem as detecting...
Key generation, a well known alternative to key distribution, allows two (or more) parties to concurrently generate the same secret key through their independent measurements of a mutually observable random information source. within wireless networks the reciprocity of channel characterization measurements can be used to provide this required random source of information. This work enables key generation...
Private overlays, such as Virtual Private Networks (VPN), offer methods for a cheap and yet secure communication over the Internet. However, as our society becomes more and more dependent on it, these structures turn into vital targets for Denial-of-Service (DoS) attacks. As so-called botnets offer an inexpensive way to generate almost arbitrary amounts of traffic, the only effective measure that...
We present LVRI, a hybrid link-state routing protocol based on exchange of link states in a region of interest. The region of interest (ROI) is defined as a connected component of the network that includes the source, destination nodes and the nodes that act as relays for the data. An ROI is established on-demand and exists as long as there are data to be sent. Each node in the region of interest...
The {\it software defined networking} (SDN) paradigm promises to dramatically simplify network configuration and resource management. Such features are extremely valuable to network operators and therefore, the industrial (besides the academic) research and development community is paying increasing attention to SDN. Although wireless equipment manufacturers are increasing their involvement in SDN-related...
In wireless ad hoc networks, nodes may act selfishly to preserve their limited energy resources. This behavior can cause the network performance to drop. Therefore, cooperation between peers is necessary to keep ad hoc networks operational. Beside the need to actively encourage cooperation, passive encouragement is also needed to overcome the effect of factors that may limit cooperation. These factors...
Content addressing and localization are basic issues in the structure of content-centric networks. This paper presents the implementation and performance evaluation of the Content Registry (CR), developed within the framework of the FIE (Future Internet Engineering) project to meet the requirements of the PI CAN network. The CR allows to find the desired Content Record (containing basic transmission...
Resilience analysis of the popular P2P networks (like Gnutella) has emerged as an important research issue for the network community. Most of the contemporary studies primarily focused on the estimation of percolation threshold and disruption on the largest connected component due to node removal. However, real-world networks exhibit intrinsically degree-degree correlation, which makes the behavior...
With the development of computer science and virtual reality technology, virtual world evolves along the way of computer game development, from arcade games, console system games, LAN games, Internet connectivity games, unstructured games, games with player generation of content, worlds with designer-provided objectives, games with social networks, and open virtual worlds [1]. Traditional server-client...
Understanding of the Internet evolution is important for many research topics, such as network planning, optimal routing design, etc. In this paper, we try to analyze CAIDA AS-level topology dataset from 2004 to 2010 to validate two conjectures on the Internet evolution, i.e., the Internet flattening trend and the preferential attachment rule. Our analysis shows that the evolvement of the Internet...
Based on the in-depth research of the P2P technology, we propose an implementation scheme of the P2P communication system for the wireless network environment, design a new hybrid structure model and describe the query mechanism, which can be used in the two-level domain of the distribution structure, in addition, we also design the P2P transmission protocols, which are quite fit for the wireless...
Resource discovery in large-scale distributed systems is a challenging issue, mainly due to the traditional centralized topologies in which the nodes of these systems are typically organized. This unified approach has been proven to be effectual for cluster-based grids and clouds but questionable for large scale, heterogeneous and dynamically interoperable e-infrastructure such as grids and inter-clouds...
Many researchers think that networks with small world effect are always more effective for spread of behavior, but a fewer studies indicated that the behavior spread farther and faster in clustered-lattice networks than in other networks. In this paper, we analyzed the spread of behavior in unstructured peer-to-peer networks with three different topologies. The experimental results show that to get...
According to Chord protocol of P2P network, entries in the routing table are placed at a long distances that are all powers of 2 and only cover half of the identifier space. Therefore, an improved Chord routing algorithm is proposed. The algorithm presents a new routing table structure formula, increases entries distribution density, and extends routing searching coverage areas. Performance analysis...
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.