Results 1 - 10
of
31,415
Local and Congestion-Driven Fairness Algorithm in Arbitrary Topology Networks
"... Abstract—Typically, bandwidth reservation is not made for data applications. Therefore, the only way to provide minimum bandwidth guarantees to such an application is by using a fairness mechanism to regulate the access to the network and by controlling the packet loss (i.e., congestion) inside the ..."
Abstract
- Add to MetaCart
the network. There are numerous works treating fairness in ring networks, however, there are almost no such works on fairness in arbitrary topology networks. The context of this work is fairness in an arbitrary topology network, the MetaNet, which employs convergence routing, aloss-free routing technique
Distributively-Competitive Online Paging for Arbitrary-Topology Networks (Extended Abstract)
, 1994
"... ) Baruch Awerbuch Yair Bartal y Amos Fiat y May 3, 1994 Abstract This paper gives first competitive distributed paging algorithm for the general network topology. The competitive ratios in storage and communication are poly-logarithmic in the total number of network nodes and the diameter of ..."
Abstract
- Add to MetaCart
) Baruch Awerbuch Yair Bartal y Amos Fiat y May 3, 1994 Abstract This paper gives first competitive distributed paging algorithm for the general network topology. The competitive ratios in storage and communication are poly-logarithmic in the total number of network nodes and the diameter
A generalized processor sharing approach to flow control in integrated services networks: The single-node case
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... The problem of allocating network resources to the users of an integrated services network is investigated in the context of rate-based flow control. The network is assumed to be a virtual circuit, connection-based packet network. We show that the use of Generalized processor Sharing (GPS), when co ..."
Abstract
-
Cited by 2010 (5 self)
- Add to MetaCart
, the performance of a single-server GPS system is analyzed exactly from the standpoint of worst-case packet delay and burstiness when the sources are constrained by leaky buckets. The worst-case session backlogs are also determined. In the sequel to this paper, these results are extended to arbitrary topology
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 fixed-topology method on a challenging benchmark reinforcement learning task ..."
Abstract
-
Cited by 536 (112 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 fixed-topology method on a challenging benchmark reinforcement learning
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 graph-based ..."
Abstract
-
Cited by 493 (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
Topology Control of Multihop Wireless Networks using Transmit Power Adjustment
, 2000
"... We consider the problem of adjusting the transmit powers of nodes in a multihop wireless network (also called an ad hoc network) to create a desired topology. We formulate it as a constrained optimization problem with two constraints- connectivity and biconnectivity, and one optimization objective- ..."
Abstract
-
Cited by 688 (3 self)
- Add to MetaCart
We consider the problem of adjusting the transmit powers of nodes in a multihop wireless network (also called an ad hoc network) to create a desired topology. We formulate it as a constrained optimization problem with two constraints- connectivity and biconnectivity, and one optimization objective
Consensus Problems in Networks of Agents with Switching Topology and Time-Delays
, 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or leader ..."
Abstract
-
Cited by 1112 (21 self)
- Add to MetaCart
In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or
Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks
- ACM Wireless Networks Journal
, 2001
"... ..."
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 2148 (11 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
An algebraic approach to network coding
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 2003
"... We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary n ..."
Abstract
-
Cited by 858 (88 self)
- Add to MetaCart
We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary
Results 1 - 10
of
31,415