Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,781
Calculating the Maximum Throughput
"... Abstract. This paper analyzes the communication between two points in wireless ad hoc networks operating at the IEEE 802.11 standard mode. The path from the source to the destination consists of a chain of nodes. We aim at deriving an analytical expression for the maximum throughput. We show that th ..."
Abstract
- Add to MetaCart
Abstract. This paper analyzes the communication between two points in wireless ad hoc networks operating at the IEEE 802.11 standard mode. The path from the source to the destination consists of a chain of nodes. We aim at deriving an analytical expression for the maximum throughput. We show
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- IEEE Transactions on Automatic Control
, 1992
"... Abstruct-The 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
Maximum-Throughput Software Pipelining
, 1995
"... This paper presents UNRET (unrolling and retiming), a resource-constrained software pipelining approach aimed at finding a loop schedule with maximum throughput and minimum register requirements. UNRET works in two phases. First, a pipelined loop schedule with maximum throughput is found for a given ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
This paper presents UNRET (unrolling and retiming), a resource-constrained software pipelining approach aimed at finding a loop schedule with maximum throughput and minimum register requirements. UNRET works in two phases. First, a pipelined loop schedule with maximum throughput is found for a
Maximum Throughput of Clandestine Relay
, 2009
"... Abstract — The maximum throughput of relaying information flows while concealing their presence is studied. The concealment is achieved by embedding transmissions of information flows into truly independent transmission schedules that resemble the normal transmission behaviors without any flow. Such ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract — The maximum throughput of relaying information flows while concealing their presence is studied. The concealment is achieved by embedding transmissions of information flows into truly independent transmission schedules that resemble the normal transmission behaviors without any flow
MAXIMUM-THROUGHPUT DYNAMIC NETWORK FLOWS
, 1983
"... This paper presents and solves the maximum throughput dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time. The model is a finite network in which the flow on each arc not only has an associated upper and lower bound but also a ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
This paper presents and solves the maximum throughput dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time. The model is a finite network in which the flow on each arc not only has an associated upper and lower bound but also
ON THE MAXIMUM THROUGHPUT OF CLANDESTINE SENSOR NETWORKING
"... We consider the problem of clandestine communications, i.e., communications that are meant to be invisible to thirdparty eavesdroppers, in the context of wireless sensor networks. Although encryption and anonymous routing protocols can hide the content and the routing information, the transmission a ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
constraint at the relay nodes in terms of limited buffer size. The proposed method is proved to achieve the maximum throughput, which is characterized analytically for transmission schedules following alternating renewal processes with a closed-form solution for Poisson processes. The analytical results
Register Optimization for Maximum Throughput Loop Pipelining
, 1995
"... UNRET (unrolling and retiming) is an approach for resource-constrained loop pipelining that aims at finding a loop schedule with maximum throughput and minimum register pressure. This paper proposes an algorithm in two phases. In the first phase, a schedule with maximum throughput is found for a giv ..."
Abstract
- Add to MetaCart
UNRET (unrolling and retiming) is an approach for resource-constrained loop pipelining that aims at finding a loop schedule with maximum throughput and minimum register pressure. This paper proposes an algorithm in two phases. In the first phase, a schedule with maximum throughput is found for a
Maximum Throughput Loop Pipelining With Register Optimization
, 1994
"... This paper presents UNRET (unrolling and retiming), a new approach for resourceconstrained loop pipelining. UNRET aims at finding a loop schedule with maximum throughput and minimum register pressure. UNRET is composed of two main phases. In the first phase, a schedule with maximum throughput is fo ..."
Abstract
- Add to MetaCart
This paper presents UNRET (unrolling and retiming), a new approach for resourceconstrained loop pipelining. UNRET aims at finding a loop schedule with maximum throughput and minimum register pressure. UNRET is composed of two main phases. In the first phase, a schedule with maximum throughput
Stable Maximum Throughput Broadcast in Wireless Fading Channels
"... Abstract—This research considers network coded broadcast system with multi-rate transmission and dual queue stability constraints. Existing network coded broadcast systems consider single rate transmission without receiver queue constraints. First, we shall illustrate that broadcast without network ..."
Abstract
- Add to MetaCart
coding cannot support maximum throughput in wireless fading channels. However, the network coded broadcast poses new constraints for the receivers to manage stable queues while the fading channel characteristics suggest the broadcast to operate at multi-rate to achieve higher throughput. In this research
Theoretical Maximum Throughput of IEEE 802.11 and its Applications
- In Proceedings of the IEEE International Symposium on Network Computing and Applications
, 2003
"... The goal of this paper is to present exact formulae for the throughput of IEEE 802.11 networks in the absence of transmission errors and for various physical layers, data rates and packet sizes. Calculation of the throughput is more than a simple exercise. It is a mandatory part of provisioning any ..."
Abstract
-
Cited by 70 (4 self)
- Add to MetaCart
system based on 802.11 technology (whether in ad-hoc or infrastructure mode). We will discuss the practical importance of theoretical maximum throughput and present several applications.
Results 1 - 10
of
2,781
