Results 1  10
of
6,875
On the Maximum Stable Throughput of Tree Algorithms with Free Access
"... A simple numerical procedure is presented to determine the maximum stable throughput (MST) of various tree algorithms with free access by defining an associated multitype branching process such that the criticality of the branching process corresponds to the stability of the tree algorithm. More pr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A simple numerical procedure is presented to determine the maximum stable throughput (MST) of various tree algorithms with free access by defining an associated multitype branching process such that the criticality of the branching process corresponds to the stability of the tree algorithm. More
On the Maximum Stable Throughput Problem in Random Networks with Directional Antennas
 IN PROC. ACM MOBIHOC
, 2003
"... We consider the problem of determining rates of growth for the maximum stable throughput achievable in dense wireless networks. We formulate this problem as one of finding maximum flows on random unitdisk graphs. Equipped with the maxflow/mincut theorem as our basic analysis tool, we obtain rates ..."
Abstract

Cited by 67 (6 self)
 Add to MetaCart
We consider the problem of determining rates of growth for the maximum stable throughput achievable in dense wireless networks. We formulate this problem as one of finding maximum flows on random unitdisk graphs. Equipped with the maxflow/mincut theorem as our basic analysis tool, we obtain
Maximum Stable Throughput of FSALOHA under Delay Constraints
"... This paper studies the maximum stable throughput of FSALOHA, a random access algorithm for dynamic bandwidth reservation in access networks, subject to delay constraints. Requests that are not transmitted successfully before the maximum delay tmax expires are dropped. We state that the algorithm is ..."
Abstract
 Add to MetaCart
This paper studies the maximum stable throughput of FSALOHA, a random access algorithm for dynamic bandwidth reservation in access networks, subject to delay constraints. Requests that are not transmitted successfully before the maximum delay tmax expires are dropped. We state that the algorithm
Improved High Maximum Stable Throughput FCFS Tree Algorithms with Interference Cancellation
"... Tree algorithms form a well researched class of collision resolution algorithms for solving multiple access control problems. Signal interference cancellation, which allows one to recover additional information from otherwise lost collision signals, has recently been combined with tree algorithms, p ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
, providing substantially higher maximum stable throughputs (MSTs), up to 0.693 (Yu and Giannakis, IEEE Transactions on Information Theory, Vol. 53(12), 2007). We propose two novel FirstComeFirstServed tree algorithms, the operation of which is similar to the wellknown tree splitting algorithms
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
 IEEE Transactions on Automatic Control
, 1992
"... AbstructThe stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRNâ€™s) provide a motivation for the consideration of this system. We ..."
Abstract

Cited by 949 (19 self)
 Add to MetaCart
. We study the problem of scheduling the server activation under the constraints imposed by the dependency among them. The performance criterion of a scheduling policy m is its throughput that is characterized by its stability region C,, that is, the set of vectors of arrival rates for which the system
Achieving 100% Throughput in an InputQueued Switch
 IEEE TRANSACTIONS ON COMMUNICATIONS
, 1996
"... It is well known that headofline (HOL) blocking limits the throughput of an inputqueued switch with FIFO queues. Under certain conditions, the throughput can be shown to be limited to approximately 58%. It is also known that if nonFIFO queueing policies are used, the throughput can be increas ..."
Abstract

Cited by 527 (27 self)
 Add to MetaCart
It is well known that headofline (HOL) blocking limits the throughput of an inputqueued switch with FIFO queues. Under certain conditions, the throughput can be shown to be limited to approximately 58%. It is also known that if nonFIFO queueing policies are used, the throughput can
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
 maximum power used. We present two centralized algorithms for use in static networks, and prove their optimality. For mobile networks, we present two distributed heuristics that adaptively adjust node transmit powers in response to topological changes and attempt to maintain a connected topology using
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 547 (12 self)
 Add to MetaCart
and maximum stable set problems in perfect graphs, the maximum k partite subgraph problem in graphs, and va...
Random Early Detection Gateways for Congestion Avoidance.
 IEEELACM Transactions on Networking,
, 1993
"... AbstractThis paper presents Random Early Detection (RED) gateways for congestion avoidance in packetswitched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract

Cited by 2716 (31 self)
 Add to MetaCart
speed ne!works with connections with large delay bandwidth products. gateways are likely to be designed with correspondingly large maximum queues to acccomodate transient congestion. In the current Internet, the TCP transport protocol detects congestion only after a packet has been dropped al the gateway
The iSLIP Scheduling Algorithm for InputQueued Switches
, 1999
"... An increasing number of high performance internetworking protocol routers, LAN and asynchronous transfer mode (ATM) switches use a switched backplane based on a crossbar switch. Most often, these systems use input queues to hold packets waiting to traverse the switching fabric. It is well known th ..."
Abstract

Cited by 425 (8 self)
 Add to MetaCart
that if simple first in first out (FIFO) input queues are used to hold packets then, even under benign conditions, headofline (HOL) blocking limits the achievable bandwidth to approximately 58.6 % of the maximum. HOL blocking can be overcome by the use of virtual output queueing, which is described
Results 1  10
of
6,875