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.
Due to the heterogeneous, opaqueness and dynamic nature of Cloud Computing, existing MapReduce approach is not suitable for perform Parallel Computing on the cloud. In this paper, we propose a modified MapReduce framework which extracts the physical network topology information from the Virtual Machine Monitor (VMM) feature of VMs, in order to exploit dynamic resource allocations, and hence enable...
Run time variability of parallel applications continues to be a significant challenge in high performance computing (HPC) systems. We are currently studying run time variability in the context of both systemic performance and energy management. Our perspective is from that of the application, focusing on the interactions of the inter-process communication system on the set of concurrently executing...
Performance of wireless sensor networks (WSNs) can be affected when the network is deployed under different topologies. In this paper we present a performance study of congestion control algorithms in WSNs when nodes are deployed under different topologies. To perform our research we have employed algorithms SenTCP, directed diffusion, and HTAP. The choice of these algorithms is based on the fact...
For high frequency design of SoC systems, cascaded crossbar switches become more and more popular. In this paper, we present a method based on FFT-butterfly architecture. This method can provide optimal topology of cascaded crossbar switches, which consists of multiple small crossbar switches. We apply it to AMBA3 AXI-based bus system design. Experimental results show that the proposed methods allow...
In an unstructured peer-to-peer (P2P) network (e.g., Gnutella), participating peers choose their neighbors randomly such that the resultant P2P network mismatches its underlying physical network, resulting in the lengthy communication between the peers and redundant network traffics generated in the underlying network. Previous solutions to the topology-mismatch problem in the literature are far from...
Multicast join delay is an important metric to evaluate the performance of multicast services. However, there is little analytic study of this metric. In this paper, we convert the multicast join delay into the average node-tree distance problem in the graph, and propose an area-overlay method to analyze the multicast join delay against the different topology sizes and multicast densities. We set...
Intensive and extensive development of computer networks generates the problem of providing a suitably high level of network survivability. A lot of research has been done in this area in recent years, including studies associated with the use of a modern tool called p-cycles. p-Cycles not only provide a high level of protection, but also achieve it at a quite low cost. Until now, p-cycles have been...
Ethernet ring protection (ERP) introduced by ITU-T G.8032 Recommendation is a new class of packet switched network protection technology that can provides ring automatic protection switch for nested multiple Ethernet rings. An ERP system is required to provide network protection against link and node failures within 50 ms. Whenever the protection scheme switches the ring to have a new topology, the...
We analyzed how reliability, defined as the probability of continuing transmissions on link failures, will be affected by inter-domain multi-path and multi-homing routing when the structure in the future Internet changes. The goal of this project is to find properties for the ideal network structure that maximizes the advantage of multi-path and multi-home routing. We focused on how each end-to-end...
In this paper, we introduce a new denial-of-service attack on wireless networks: low-power, distributed jamming network (DJN). DJN is composed of large number of low-power jamming devices, which are deployed in proximity to the target devices. DJN can cause significant damage to target network performance with high energy efficiency. In the paper, we provide a characterization of DJN, demonstrate...
Despite ??airborne network (AN) topology design?? and careful planning of AN trajectories, unexpected disruptions (from hardware failures to changes in mission requirements and hostile attacks) may cause nodes not to connect to one another directly or indirectly either because they are out of one another's range or because nodes do not meet one another according to their preplanned trajectories. Since...
The IEEE 802.15.4 standard leaves the problem of beacon collisions in cluster-tree topologies unsolved. Some recent work tries to solve this problem, either drastically reducing scalability or introducing some non-determinism that make them unsuitable for industrial communications. In this paper we propose a novel multi-channel approach to the beacon collision avoidance problem. Thanks to the use...
In delay tolerant networks (DTNs), message ferries exploit controlled mobility to forward messages following specific routes. One of the key challenges is how to design ferry routes to achieve desired connectivity properties and store-and-forward performance. There are some attempts at designing appropriate ferry routes, but the region topology, which denotes the adjacency relationships of ferry regions...
This paper considers the problem of routing packets across a multi-hop wireless network while ensuring throughput optimality. One of the main challenges in the design of throughput optimal routing policies is identifying appropriate and universal Lyapunov functions with negative expected drift. The few well-known throughput optimal routing policies in the literature are constructed using simple quadratic...
Network-on-chip mapping and the configuration of the communication parameters are critical process of the NoC design. They significantly influence the performance, area and power of the NoCs. We take the NoC mapping problem and the design of the communication parameters both into account. First, we formalize the problem of NoC mapping. Then we propose an analytical delay model based on wormhole switching...
The purpose of this paper is a study under the Piconet of Bluetooth, We analyze for the packet transmission path, the packet delay or loss. Find solutions related to the corresponding methods to increase the efficiency of data transmission. Hence improve the overall stability of the Bluetooth Column-Ring path's transmission.
Duo to its topological advantages, the enhanced hypercube network is a very important kind of networks which has huge potential to be widely used in computer networks to improve the performance. To fully realize its potential in those networks where reliability and speed are critical, the topological properties of the enhanced hypercube network need to be further discovered. In this paper, the topological...
The paper aims to present a new scheme of synchronization-based topology identification for a class of weighted general complex dynamical networks with time-varying coupling delays. By combining the adaptive control method and the Razumikhin-type theorem, a new feedback technique to identify the exact topology of the dynamical networks with time-varying coupling delay has been proposed. In comparison...
Overlay multicast has become an increasingly popular alternative to IP-supported multicast, because of its flexibility and adaptivity. It requires a routing spanning tree on overlay network, using which messages transfer from the source to the destinations. In many multimedia applications, the spanning tree should provide low-delay paths for each member, and consume less network resources at the same...
The active queue management in Internet routers exploits the idea that an incoming packet can be dropped by the router even if there is some available buffering space in the router. Therefore, the router can send congestion signals to TCP before the actual congestion occurs, preventing queues and delays from growing too high. Many active queue management algorithms has been proposed till now. Unfortunately,...
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.