Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,901
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
On the way to a wireless network calculus -- The single node case with retransmissions
, 2010
"... During the last two decades, starting with the seminal work by Cruz, network calculus has evolved as a new theory for the performance analysis of networked systems. In contrast to classical queueing theory, it deals with performance bounds instead of average values and thus has been the theoretical ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
-up simulations, to name a few. In this paper, in an attempt to improve the versatility of network calculus, we extend its reach to error-prone wireless links employing ARQ schemes. This is based on a stochastic extension of data scaling as introduced in [17]. Modelling the single node case with retransmissions
Guaranteeing Statistical QoS to Regulated Traffic: The Single Node Case
- In Proceedings of 37th IEEE Conference on Decision and Control (CDC
"... Multimedia traffic can typically tolerate some loss but has rigid delay constraints. A natural QoS requirement for a multimedia connection is a prescribed bound on the the fraction of traffic that exceeds an end--to--end delay limit. We propose and analyze a traffic management scheme which guarantee ..."
Abstract
-
Cited by 16 (4 self)
- Add to MetaCart
guarantees QoS to multimedia traffic while simultaneously allowing for a large connection--carrying capacity. We study our traffic management scheme in the context of a single node. In order for the node to guarantee QoS, each connection's traffic is regulated. In order to support many connections
Delay Bounds of a Dynamic Priority Queueing Scheme: Single Node Case
, 1995
"... The issue of providing deterministic delay guarantee using the Dynamic Priority Queueing (DPQ) scheme to support multiple connections at a single server queue is investigated. The novelty of our approach lies in that the delay bound is derived without making any assumptions about the traffic charact ..."
Abstract
- Add to MetaCart
characteristics of the connections. We first show that the DPQ server provides a delay bound comparable to that of the PGPS server in a single node and then improve the delay bound by incorporating a peak rate constraint on the connections. The results reveal the possibility of using the DPQ scheme to support
Stochastic service curve and delay bound analysis: a single node case
- Computer Science from University of Kaiserslautern
, 2013
"... ar ..."
ON THE MODELING OF OPEN FLOW- BASED SDNS: THE SINGLE NODE CASE
"... OpenFlow is one of the most commonly used protocols for communication between the controller and the forwarding element in a software defined network (SDN). A model based on M/M/1 queues is proposed in [1] to capture the communication between the forwarding element and the controller. Albeit the mod ..."
Abstract
- Add to MetaCart
the model provides useful insight, it is accurate only for the case when the probability of expecting a new flow is small. Secondly, it is not straight forward to extend the model in [1] to more than one forwarding element in the data plane. In this work we propose a model which addresses both
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case.'
, 1991
"... The problem of allocating network resources to the users of an integrated services net-work is investigated in the context of rate-based flow control. The network is assumed to be a virtual circuit, connection-based packet network. We propose a flexible and efficient multiplexing scheme called Gener ..."
Abstract
- Add to MetaCart
] in the context of controlling congestion at network gateway nodes. In this paper, 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
A GENERALIZED PROCESSOR SHARING APPROACH TO FLOW CONTROL IN INTEGRATED SERVICES NETWORKS—THE SINGLE NODE CASE
"... Abstract 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 propose a highly flexible and efficient multiplexing sche ..."
Abstract
- Add to MetaCart
to the packet-by-packet scheme in a precise manner. A single server GPS system is analyzed exactly, and tight bounds on worst-case packet delay, output burstiness and backlog are derived for each session, when the sources are constrained by leaky buckets. The analysis yields a simple resource assignment scheme
The Single-Node Dynamic . . .
, 2004
"... In this paper, we focus on a particular version of the Dynamic Service Network Design (DSND) problem, namely the case of a single-terminal that dispatches services to a number of customers and other terminals. We present a time-dependent, stochastic formulation that aims to optimize the problem over ..."
Abstract
- Add to MetaCart
over a given planning horizon, and propose a solution approach based on dynamic programming principles. We also present a static, single-period, formulation of the single-node problem that appears as a subproblem when addressing the time-dependent version and general service network design cases
Synchronous data flow
, 1987
"... Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case ..."
Abstract
-
Cited by 622 (45 self)
- Add to MetaCart
Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case
Results 1 - 10
of
1,901
