Results 1 - 10 of 6,133

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

A Delay-Tolerant Network Architecture for Challenged Internets

by Kevin Fall , 2003
"... The highly successful architecture and protocols of today’s Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme env ..."
Abstract - Cited by 953 (12 self) - Add to MetaCart
The highly successful architecture and protocols of today’s Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme

Network Partitioning, Hypergossiping.

by Keywords Manet
"... Mobility plays a major role in mobile ad hoc networks (MANETs), since it stresses networking tasks such as routing on the one hand, but aids to increase the network capacity and to overcome network partitioning on the other hand. To benefit from node mobility, a new class of MANET protocols and appl ..."
Abstract - Add to MetaCart
Mobility plays a major role in mobile ad hoc networks (MANETs), since it stresses networking tasks such as routing on the one hand, but aids to increase the network capacity and to overcome network partitioning on the other hand. To benefit from node mobility, a new class of MANET protocols

A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

by Vincent D. Park, M. Scott Corson , 1997
"... We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computat ..."
Abstract - Cited by 1100 (6 self) - Add to MetaCart
" of the distributed algorithm. This capability is unique among protocols which are stable in the face of network partitions, and results in the protocol's high degree of adaptivity. This desirable behavior is achieved through the novel use of a "physical or logical clock" to establish the "

Optimal Termination Protocols for Network Partitioning

by Author(s Chin, Francis Ramarao, Francis Chin, K. V. S. Ramaraot - In ACM SIGACT-SIGMOD symp. on prin. of Database Systems , 1983
"... Abstract. We address the problem of maintaining the distributed database consistency in presence of failures while maximizing the database availability. Network Partitioning is a failure which partitions the distributed system into a number of parts, no part being able to communicate with any other. ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract. We address the problem of maintaining the distributed database consistency in presence of failures while maximizing the database availability. Network Partitioning is a failure which partitions the distributed system into a number of parts, no part being able to communicate with any other

Network Partitioning into Tree Hierarchies

by Ming-ter Kuo, Lung-tien Liu, Chung-kuan Cheng - In: Proc. ACM/ IEEE Design Automation Conf , 1996
"... This paper addresses the problem of partitioning a circuit into a tree hierarchy with an objective of minimizing a glo-bal interconnection cost. An efficient and effective algo-rithm is necessary when the circuit is huge and the tree has many levels of hierarchy. We propose a heuristic algorithm for ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
This paper addresses the problem of partitioning a circuit into a tree hierarchy with an objective of minimizing a glo-bal interconnection cost. An efficient and effective algo-rithm is necessary when the circuit is huge and the tree has many levels of hierarchy. We propose a heuristic algorithm

Secure routing for structured peer-to-peer overlay networks

by Miguel Castro, Peter Druschel, Ayalvadi Ganesh, Antony Rowstron, Dan S. Wallach , 2002
"... Structured peer-to-peer overlay networks provide a sub-strate for the construction of large-scale, decentralized applications, including distributed storage, group com-munication, and content distribution. These overlays are highly resilient; they can route messages correctly even when a large fract ..."
Abstract - Cited by 473 (12 self) - Add to MetaCart
fraction of the nodes crash or the network partitions. But current overlays are not secure; even a small fraction of malicious nodes can prevent correct message delivery throughout the overlay. This prob-lem is particularly serious in open peer-to-peer systems, where many diverse, autonomous parties

A message ferrying approach for data delivery in sparse mobile ad hoc networks

by Wenrui Zhao, Mostafa Ammar, Ellen Zegura - In Proc. of ACM Mobihoc , 2004
"... Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and self-configuring network capacity required in many critical applications, e.g., battlefields, disaster relief and wide area sensing. In this paper we study the problem of efficient data delivery in sparse MANETs where network partitions ..."
Abstract - Cited by 498 (14 self) - Add to MetaCart
Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and self-configuring network capacity required in many critical applications, e.g., battlefields, disaster relief and wide area sensing. In this paper we study the problem of efficient data delivery in sparse MANETs where network partitions

Finding community structure in networks using the eigenvectors of matrices

by M. E. J. Newman , 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract - Cited by 502 (0 self) - Add to MetaCart
divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a

Architectural Styles and the Design of Network-based Software Architectures

by Roy Thomas Fielding , 2000
"... The World Wide Web has succeeded in large part because its software architecture has been designed to meet the needs of an Internet-scale distributed hypermedia system. The Web has been iteratively developed over the past ten years through a series of modifications to the standards that define its ..."
Abstract - Cited by 1119 (1 self) - Add to MetaCart
architecture. In order to identify those aspects of the Web that needed improvement and avoid undesirable modifications, a model for the modern Web architecture was needed to guide its design, definition, and deployment. Software architecture research investigates methods for determining how best to partition
Results 1 - 10 of 6,133