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.
When dealing with multimedia delivery, scalability, efficiency and Quality of Service (QoS) are challenging features for today's networks. Overlay networks can compensate for the lack of control over the network routers, but for real-world applications overlay network performance is an issue. This paper presents an efficient solution for software implementation of overlay network nodes. A new, advanced...
As a failure occurs, the affected traffic is quickly switched to backup paths for a network performing a fast IP rerouting. However, the rerouted traffic may cause congestion along the backup paths that would result in more packet losses than purely discarded the affected flows. In this paper, we take the concept of interface specific forwarding (ISF) to provide more flexibility in determining load...
We propose a random-walk-based file search for unstructured P2P networks. In the proposal, each node keeps two pieces of information, one is on the hop-limited shortest path tree rooted at itself and the other is on the indexes of files owned by neighbor nodes, referred to as the file list. A random-walk search is conducted along the concatenation of hop limited shortest path trees. To find a file,...
Overlay networks are becoming prevalent in today's networking environment. We consider scenarios where substrate resources are primarily consumed by many overlay networks placed on top of the substrate. We focus on the fair and efficient allocation of substrate link bandwidth among competing overlays. We adapt various existing fairness definitions to this scenario and define a metric to evaluate the...
The distributed wireless communications system is a new architecture for wireless access with multiple distributed relay stations (RSs). Instead of the traditional cellular system, the multihop cellular network for executing their data transmission can potentially augment coverage, data rates, and quality of service (QoS) performance. However, in the multiuser environment the multihop cellular system...
In this paper, we study the fundamental property of the ad hoc network using connectivity index. We investigate the construction of minimum cost multicast trees by selecting a link having minimum connectivity Index and comparing application required bandwidth with (available bandwidth - allocated bandwidth) of the link. We have shown that Increase in total connectivity Index of the entire network...
Traffic grooming in wavelength division multiplexing networks merges low-speed flows into large capacity pipes so that the bandwidth discrepancy between them will not lead to underutilization of resources. Dynamic grooming deals with requests for wavelength allocation based on a dynamic pattern of arrivals in contrast to the situation of static grooming in which the pattern of arrivals must be previously...
This paper proposes a novel network architecture called cloud control plane (Cloud C-plane) to reduce the power consumption of networks. In Cloud C-plane, the forwarding functions and control functions are decoupled, and the control functions are placed in the cloud. In addition, physical network topology is modified to improve the energy efficiency when the load of traffic changes. The routing engine...
Point-to-point metrics, such as latency and bandwidth, are often used to characterize network performance with the consequent assumption that optimizing for these metrics is sufficient to improve parallel application performance. However, these metrics can only provide limited insight into application behavior because they do not fully account for effects, such as network congestion, that significantly...
Traffic grooming in wavelength division multiplexing networks merges low-speed flows into large capacity pipes so that the bandwidth discrepancy between them will not lead to underutilization of resources. On-line solutions for dynamic grooming typically involve the construction of an auxiliary graph for deciding on the routing and wavelength assignment. An auxiliary graph can represent the network...
The design flow of network-on-chip (NoCs) include several key issues. Among other parameters, the decision of where cores have to be topologically mapped and also the routing algorithm represent two highly correlated design problems that must be carefully solved for any given application in order to optimize several different performance metrics. The strong correlation between the different parameters...
Light trails, a fairly recent optical networking architecture for LAN and MAN, and possibly WAN applications, can support both optical unicast and multicast. In this paper we consider routing both types of traffic in a survivable light trail network with multiple wavelengths. The algorithm supports multi-hop routing where traffic may use up to two light trails to reach its destination. An ILP is developed...
How to improve the whole processing capability, the availability and survivability of network by use of load balancing is studied in this paper. To solve the problem with dynamic traffic, a novel dynamic weight based traffic sharing (DW-TS) algorithm is proposed. In DW-TS, we introduce the idea of traffic engineering algorithm-minimum interference routing algorithm (MIRA) in generalized multi-protocol...
Cognitive radio (CR) has the potential to substantially improve the system capacity and adaptability of wireless mesh network (WMN). In this paper we investigate the achievable performance gain of cognitive wireless mesh network (CWMN), in which all nodes are equipped with CRs, by jointly optimizing spectrum allocation, routing and time scheduling. The formulated optimization problem aims to minimize...
One of the goals of P2P file-sharing system is to provide reliable and convenient sharing mechanism for users, so the resources can be gotten more quickly. However, in traditional DHT network, the problem of mismatching between the P2P overlay network and the physical underlying network has not been taken into consideration, which greatly limits the performance in various search or routing techniques...
In this paper, we propose novel techniques to reduce bandwidth cost in a continuous keyword query processing system that is based on a distributed hash table. We argue that query indexing and document announcement are of significant importance towards this goal. Our detailed simulations show that our proposed techniques, combined together, effectively and greatly reduce bandwidth cost.
Peer-to-Peer (P2P) web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized Internet-scale applications. However, many P2P web caching systems suffer expensive overheads such as lookup and publish messages, and lack of locality awareness. In this paper we present the development of a locality aware P2P cache system to overcome these limitations...
In this paper a BISR architecture for embedded memories is presented. The proposed scheme utilises a multiple bank cache-like memory for repairs. Statistical analysis is used for minimisation of the total resources required to achieve a very high fault coverage. Simulation results show that the proposed BISR scheme is characterised by high efficiency and low area overhead, even for high defect densities...
The downsizing of transistor dimensions enabled in the future nanotechnologies will inevitably increase the number of faults in the complex ULSI chips. To maintain the production yield at acceptable level, several levels of protection mechanisms will have to be implemented to tolerate the permanent and transient faults occurring in the physical layers. In this paper, we study fault tolerance at the...
We derive the Neyman-Pearson error exponent for the detection of Gauss-Markov signals using randomly spaced sensors. We assume that the sensor spacings, d1,d2,..., are drawn independently from a common density fd(.), and we treat both stationary and nonstationary Markov models. Error exponents are evaluated using specialized forms of the strong law of large numbers, and are seen to take on algebraically...
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.