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.
As virtualization becomes more and more popular, how to guarantee survivability of a virtual infrastructure (VI) over a wide-area optical network is increasingly important. In this paper, we approach the problem of survivable VI mapping (SVIM) from a few unique perspectives. One of the most distinguishing perspectives is that a large-scale regional failure could destroy one or more facility nodes...
The evolution of network technologies brought increasing management complexity of networking infrastructure and protocols. Cognitive networking was introduced to deal with such complexity. This work presents a cognitive algorithm for cross-layer performance management which is the core of a decentralized framework for self-configuration of communication protocols. We illustrate the proposed solution...
How to assess the topology vulnerability of a network has attracted more and more attentions recently. Due to the rapid growing number of real- time internet applications developed since the last decade, the discovery of topology weakness related to its quality of service (QoS) is of more interest. In this paper, we provide a novel QoS-aware measurement for assessing the vulnerability of general network...
We will propose an adaptive distributed power management (DISPOW) algorithm that adaptively preserves network connectivity and cooperatively reduces interference for the dynamic environment and the changing network topology thereby improving the network performance. The proposed algorithm distributively builds a unique stable network topology tailored to its surrounding node density and propagation...
In this paper, two new heuristic algorithms are developed for maximizing the network throughput in adaptive power and adaptive rate spatial-TDMA wireless networks. The underlying problem entails the optimal joint link scheduling combined with the simultaneous assignment of transmit power levels and data rates across active links. We note this problem to be NP-complete and proceed to develop and investigate...
In this paper we focus on building low latency resource location service over unstructured Peer-to-Peer (P2P) networks. In state-of-the-art search approaches in unstructured P2P systems ,they often evaluate efficiency by overlay hops, while two nodes logically adjacent maybe physically far away and from user's QoS, clients always want to acquire as many as objects in a short time, so we propose an...
In this paper, we investigate the convergence behavior of the primal-dual scaled gradient algorithm (PDSGA) for solving distributed network utility maximization problems under time-varying fading channels. Our analysis shows that the proposed PDSGA converges to a limit region rather than a point under FSMC channels. We also show that the asymptotic tracking errors are given by O(T̅/N̅), where T̅ and...
The global routing table size has been increasing rapidly, outpacing the upgrade cycle of router hardware. Recently aggregating the Forwarding Information Base (FIB) emerges as a promising solution since it reduces FIB size significantly in the short term and it is compatible with any long-term architectural solutions.Because FIB entries change dynamically with routing updates, an important component...
A novel dynamic bandwidth allocation algorithm named GTH-DBA is proposed for metro networks. A testbed is constructed to test its performance. Numeric results show that this algorithm is effective to improve the bandwidth efficiency of the metro networks.
All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The cost-optimal multicast light-tree is NP-hard to compute, especially when taking sparse splitting into account. Thus many heuristic algorithms have been proposed. In this paper, the approximation ratios of two classical heuristic AOMR algorithms for sparse splitting WDM network are studied. Let K be...
The NP-hard QoS Multicast Routing (QoSMR) is one of the most challenging problems in recent networks. In this paper, we investigate the QoSMR problem as well as its different existing formulations. We analyze the limitations of these formulations and propose a novel one. The main advantage of our formulation is that it considers not only the quality of the multicast subgraph formed by the computed...
Network virtualization has been proposed as a powerful vehicle for running multiple customized networks on a shared infrastructure. Virtual network embedding is a critical step for network virtualization that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. Previous work in virtual network embedding primarily focused on designing heuristic algorithms...
The distributed optimal path planning (D-OPP) problem has been a bottleneck restricting the performance of Peer-to-Peer (P2P) workflow systems which have met the development trend of workflow systems and been one of the most important domains of Distributed computing. The essence of this problem is to solve the dynamical global optimization in local views without centralized mechanism. Aiming at this...
Improving latency is the key to a successful online game-playing experience. With the use of multiple servers along with a well-provisioned network it is possible to reduce the latency. Given a network of servers, game clients, and a desired delay bound, we have designed algorithms to determine the subnetwork of servers whose cardinality is minimal. We have considered the cases wherein the subnetwork...
Search in peer-to-peer networks is a challenging problem due to the absence of any centralized control & the limited information available at each node. When information is available about the overall structure of the network, use of this information can significantly improve the efficiency of decentralized search algorithms. Many peer-to-peer networks have been shown to exhibit power-law degree...
The traditional client-server architecture widely adopted on the Internet is not adequate to meet the increasing user loads and bandwidth demands in live streaming systems especially for multimedia content delivery. Peer-to-peer P2P) overlay networks provide excellent system scalability and high resource utilization, which make it an attractive solution to this problem. This paper considers a hybrid...
P2P e-commerce systems are commonly perceived as an environment offering both opportunities and threats. The existence of malicious peers could damage the correctness and availability of them. One way to minimize such threats is to use trust model to evaluate the trustworthiness of peers. This paper presents a dynamic self-adaptive trust model for p2p e-commerce system - AdaptTrust model, which involves...
Load balancing is a key component of P2P network. In this paper, we present a new load balancing scheme for Chord system, called dynamic group-based duplications scheme (DGDS). Firstly, we divide Chord ring into several continuous groups, in which light-loaded peers share the load of overloaded peers. Secondly, DGDS computes out how many duplications are required to lighten the load of overloaded...
In this paper we face the challenging issue of defining and implementing an effective law for load balancing in Content Delivery Networks. We base our proposal on a formal study of a CDN system, carried out through the exploitation of a fluid flow model characterization of the network of servers. Starting from such characterization, we derive and prove a lemma about the network queues equilibrium...
Peer-to-peer systems are highly dynamic systems, with permanent changes in their configurations, as peers may join and leave the system with no restriction or control. This makes monitoring an important element for several applications, especially for fault management: fault detection and fault recovery. As the system may have a large number of nodes, we need a scalable algorithm, able to guarantee...
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.