Results 1  10
of
795,995
Formal Verification of Arbitrary Network Topologies
"... We show how data independence results can be used to generalise an inductive proof from binary to arbitrary branching tree networks. The example used is modelled on the RSVP Resource Reservation Protocol. Of particular interest is the need for a separate lowerlevel induction which is itself closely ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We show how data independence results can be used to generalise an inductive proof from binary to arbitrary branching tree networks. The example used is modelled on the RSVP Resource Reservation Protocol. Of particular interest is the need for a separate lowerlevel induction which is itself
CWIT’2003 59 Achievable Rates for Arbitrary Network Topologies with ‘Cheap ’ Nodes
"... In this paper, we derive achievable rates for arbitrary network topologies consisting of ‘cheap ’ nodes. A node is labeled ‘cheap ’ if its radio can only operate in TDD mode when transmitting and receiving in the same frequency band. Two main results are shown. The first result provides an achievabl ..."
Abstract
 Add to MetaCart
In this paper, we derive achievable rates for arbitrary network topologies consisting of ‘cheap ’ nodes. A node is labeled ‘cheap ’ if its radio can only operate in TDD mode when transmitting and receiving in the same frequency band. Two main results are shown. The first result provides
Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input
 SIAM Journal on Computing
, 2005
"... We study the longterm (steady state) performance of a simple, randomized, local load balancing technique under a broad range of input conditions. We assume a system of n processors connected by an arbitrary network topology. Jobs are placed in the processors by a deterministic or randomized adversa ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We study the longterm (steady state) performance of a simple, randomized, local load balancing technique under a broad range of input conditions. We assume a system of n processors connected by an arbitrary network topology. Jobs are placed in the processors by a deterministic or randomized
A Fast TokenChasing Mutual Exclusion Algorithm in Arbitrary Network Topologies
 J. PARALLEL AND DISTRIBUTED COMPUTING
, 1996
"... We present a simple and efficient mutual exclusion algorithm whose optimal message passing complexity is O(N), where N is the number of processors in the network. The message complexity is measured by counting the number of communication hops in a network for a given topology. This algorithm reduces ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a simple and efficient mutual exclusion algorithm whose optimal message passing complexity is O(N), where N is the number of processors in the network. The message complexity is measured by counting the number of communication hops in a network for a given topology. This algorithm
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies
, 1201
"... We consider the problem of balancing load items (tokens) on networks. Starting with an arbitrary load distribution, we allow in each round nodes to exchange tokens with their neighbors. Thegoalisto achieveadistribution whereall nodeshavenearlythe samenumber of tokens. For the continuous case where t ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We consider the problem of balancing load items (tokens) on networks. Starting with an arbitrary load distribution, we allow in each round nodes to exchange tokens with their neighbors. Thegoalisto achieveadistribution whereall nodeshavenearlythe samenumber of tokens. For the continuous case where
Celerity: Towards LowDelay MultiParty Conferencing over Arbitrary Network Topologies
"... In this paper, we attempt to revisit the problem of multiparty conferencing from a practical perspective, and to rethink the design space involved in this problem. We believe that an emphasis on low endtoend delays between any two parties in the conference is a must, and the source sending rate i ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
to deliver video with low endtoend delays, at quality levels commensurate with available network resources over arbitrary network topologies where bottlenecks can be anywhere in the network. This is in contrast to commonly assumed P2P scenarios where bandwidth bottlenecks reside only at the edge
Multiresolution Analysis of Arbitrary Meshes
, 1995
"... In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly becoming commonplace. Such meshes are notoriously expensive to store, transmit, render, and are awkward to edit. Multire ..."
Abstract

Cited by 605 (16 self)
 Add to MetaCart
in practice typically do not meet this requirement. In this paper we present a method for overcoming the subdivision connectivity restriction, meaning that completely arbitrary meshes can now be converted to multiresolution form. The method is based on the approximation of an arbitrary initial mesh M by a
Modeling Internet Topology
 IEEE COMMUNICATIONS MAGAZINE
, 1997
"... The topology of a network, or a group of networks such as the Internet, has a strong bearing on many management and performance issues. Good models of the topological structure of a network are essential for developing and analyzing internetworking technology. This article discusses how graphbased ..."
Abstract

Cited by 497 (21 self)
 Add to MetaCart
The topology of a network, or a group of networks such as the Internet, has a strong bearing on many management and performance issues. Good models of the topological structure of a network are essential for developing and analyzing internetworking technology. This article discusses how graph
Evolving Neural Networks through Augmenting Topologies
 Evolutionary Computation
"... An important question in neuroevolution is how to gain an advantage from evolving neural network topologies along with weights. We present a method, NeuroEvolution of Augmenting Topologies (NEAT), which outperforms the best fixedtopology method on a challenging benchmark reinforcement learning task ..."
Abstract

Cited by 524 (113 self)
 Add to MetaCart
An important question in neuroevolution is how to gain an advantage from evolving neural network topologies along with weights. We present a method, NeuroEvolution of Augmenting Topologies (NEAT), which outperforms the best fixedtopology method on a challenging benchmark reinforcement learning
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled
Results 1  10
of
795,995