Results 11 - 20 of 31,982

IDENTIFYING NETWORK LOAD BALANCING REQUIREMENTS ON HISTORICAL TRAFFIC FLOW USING MACHINE LEARNING APPROACH FOR FLEXIBLE MULTIPATH NETWORKS

by K Balamurugan
"... Multipath routing uses several paths to distribute traffic from a source to destination. This not only improves network performance but also achieves load balancing and fault tolerance. Though multipath routing is not deployed widely in the internet, current systems chooses the paths with the same l ..."
Abstract - Add to MetaCart
Multipath routing uses several paths to distribute traffic from a source to destination. This not only improves network performance but also achieves load balancing and fault tolerance. Though multipath routing is not deployed widely in the internet, current systems chooses the paths with the same

Consensus and cooperation in networked multi-agent systems

by Reza Olfati-Saber , J Alex Fax , Richard M Murray , Reza Olfati-Saber , J Alex Fax , Richard M Murray - Proceedings of the IEEE , 2007
"... Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees. An ove ..."
Abstract - Cited by 807 (4 self) - Add to MetaCart
in networked dynamic systems and diverse applications including synchronization of coupled oscillators, flocking, formation control, fast consensus in small-world networks, Markov processes and gossip-based algorithms, load balancing in networks, rendezvous in space, distributed sensor fusion in sensor

HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks

by Ossama Younis, Sonia Fahmy - IEEE TRANS. MOBILE COMPUTING , 2004
"... Topology control in a sensor network balances load on sensor nodes and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. In this paper, we propose a novel distributed clustering approach for long-lived ad hoc sensor networks. Our proposed ..."
Abstract - Cited by 590 (1 self) - Add to MetaCart
Topology control in a sensor network balances load on sensor nodes and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. In this paper, we propose a novel distributed clustering approach for long-lived ad hoc sensor networks. Our

Towards an Active Network Architecture

by David L. Tennenhouse, David J. Wetherall - Computer Communication Review , 1996
"... Active networks allow their users to inject customized programs into the nodes of the network. An extreme case, in which we are most interested, replaces packets with "capsules" -- program fragments that are executed at each network router/switch they traverse. Active architectures permit ..."
Abstract - Cited by 497 (7 self) - Add to MetaCart
, they will accelerate the pace of innovation by decoupling network services from the underlying hardware and allowing new services to be loaded into the infrastructure on demand. In this paper, we describe our vision of an active network architecture, outline our approach to its design, and survey the technologies

Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility

by Antony Rowstron, Peter Druschel , 2001
"... This paper presents and evaluates the storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility. PAST is based on a self-organizing, Internetbased overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache a ..."
Abstract - Cited by 803 (23 self) - Add to MetaCart
balances the number of files stored on each node. However, non-uniform storage node capacities and file sizes require more explicit storage load balancing to permit graceful behavior under high global storage utilization; likewise, non-uniform popularity of files requires caching to minimize fetch distance

A Linear-Time Heuristic for Improving Network Partitions

by C. M. Fiduccia, et al. , 1982
"... An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning. To d ..."
Abstract - Cited by 524 (0 self) - Add to MetaCart
An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning

Contiki - a Lightweight and Flexible Operating System for Tiny Networked Sensors

by Adam Dunkels, Björn Grönvall, Thiemo Voigt , 2004
"... of tiny networked devices that communicate untethered. For large scale networks it is important to be able to dynamically download code into the network. In this paper we present Contiki, a lightweight operating system with support for dynamic loading and replacement of individual programs and servi ..."
Abstract - Cited by 516 (45 self) - Add to MetaCart
of tiny networked devices that communicate untethered. For large scale networks it is important to be able to dynamically download code into the network. In this paper we present Contiki, a lightweight operating system with support for dynamic loading and replacement of individual programs

Energy-efficient communication protocol for wireless microsensor networks

by Wendi Rabiner Heinzelman, Anantha Chandrakasan, Hari Balakrishnan , 2000
"... Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our f ..."
Abstract - Cited by 2103 (10 self) - Add to MetaCart
cluster base stations (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must

Energy Conserving Routing in Wireless Ad-hoc Networks

by Jae-hwan Chang, Leandros Tassiulas , 2000
"... An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set ..."
Abstract - Cited by 622 (2 self) - Add to MetaCart
An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines

Search and replication in unstructured peer-to-peer networks

by Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker , 2002
"... Abstract Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over network topologies and data placement. However, the flooding-based query algorithm used in Gnutella does n ..."
Abstract - Cited by 692 (6 self) - Add to MetaCart
not scale; each individual query gener-ates a large amount of traffic and, as it grows, the system quickly becomes overwhelmed with the query-induced load. This paper explores, through simulation, various alternatives to gnutella's query algorithm, data replicationmethod, and network topology. We
Results 11 - 20 of 31,982