Results 1 
8 of
8
Admission control for hard realtime connections in ATM LAN's
, 1996
"... A CAC algorithm must efficiently determine if a new connection can be admitted by verifying that its QoS requirements can be met without violating those of previously admitted connections. In hard realtime systems, the QoS requirements are specified in terms of endtoend cell deadlines and no cell ..."
Abstract

Cited by 25 (15 self)
 Add to MetaCart
(Show Context)
A CAC algorithm must efficiently determine if a new connection can be admitted by verifying that its QoS requirements can be met without violating those of previously admitted connections. In hard realtime systems, the QoS requirements are specified in terms of endtoend cell deadlines and no cell loss due to buffer overflow. A CAC algorithm must account for interdependencies among connections caused by statzstical multiplexing of cells in ATM networks. Arbitrarity of network topology may lead to cyclic dependencies among various connections. We present an eficient CAC algorithm that addresses the above issues. The algorithm uses a traffic descriptor called the maximum traffic rate function to effectively compute bounds on endtoend delays of connections and buffer requirements within the network. Our work differs from most previous work in that it does not require traffic restoration inside the network. 1
ConnectionOriented Communication for Realtime Applications in FDDIATMFDDI Heterogeneous Networks
 Proc. of the 17th ICDCS, Baltimore MD
, 1997
"... In this paper, we study connectionoriented service an an FDDIATMFDDI heterogeneous network for realtime applications. We design and analyze an algorithm for connection admission control (CAC) for such a network. Upon a request of connection establishment, the CAC determines if the worst case d ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
In this paper, we study connectionoriented service an an FDDIATMFDDI heterogeneous network for realtime applications. We design and analyze an algorithm for connection admission control (CAC) for such a network. Upon a request of connection establishment, the CAC determines if the worst case delays of the requesting and existing connections can be satisfied given the available network resources. If so, the CAC allocates appropriate network resources to the requesting connection. The process of allocating resources for homogeneous networks (e.g. FDDIonly or ATMonly) may not be applied directly to a heterogeneous network environment(e.g. FDDIATMFDDI network) because heterogeneity adds more complexity to the process. Hence resource allocation in a heterogeneous network needs more careful analysis than its homogeneous counterpart. In this paper, we propose a CAC algorithm that will, by proper parameter tuning, allocate suficient but not excessive network resources to the requesting connection in an FDDIATMFDDI network. We show that the system can achieve satisfactory performance with this CAC algorithm. Our approach is compatible with current network standards and hence can be readily used in practical systems.
Modeling and Regulation of Host Traffic in ATM Networks
, 1996
"... For any connection admission control (CAC) algorithm to work correctly and efficiently, accurate information of the trafic flow out of host systems is required. In this paper, we develop several approximation approaches for modeling the traffic flows of hard realtame connections. We show that witho ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
For any connection admission control (CAC) algorithm to work correctly and efficiently, accurate information of the trafic flow out of host systems is required. In this paper, we develop several approximation approaches for modeling the traffic flows of hard realtame connections. We show that without accurate traffic characterization, the CAC algorithm may do either of the following: (I) admit connections that may cause network congestions which results in violating connection deadline requirments; (2) pessimistically reject many connections whose QoS can be guaranteed. We propose a traffic approximation model that can characterize the traffic correctly and efficiently, achieving a higher admission probability. From our experimental data we observe that the source traffic from a typical host is bursty. This burstiness may cause congestion within the network. To overcome this problem, we propose und analyze a simple traffic regulation mechanism at the application layer. The performance evaluation data shows that in the regulated system the traffic burstiness is lower and the probability of a connection being admitted is higher than the unregulated system.
doi:10.1155/2012/154038 Review Article Asymptotic Identity in MinPlus Algebra: A Report on CPNS
, 2011
"... which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Network calculus is a theory initiated primarily in computer communication networks, especially in the aspect of realtime communications, whereminplus algebra plays a role. C ..."
Abstract
 Add to MetaCart
(Show Context)
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Network calculus is a theory initiated primarily in computer communication networks, especially in the aspect of realtime communications, whereminplus algebra plays a role. Cyberphysical networking systems (CPNSs) are recently developing fast and models in data flows as well as systems in CPNS are, accordingly, greatly desired. Thoughminplus algebra may be a promising tool to linearize any node in CPNS as can be seen from its applications to the Internet computing, there are tough problems remaining unsolved in this regard. The identity in minplus algebra is one problem we shall address. We shall point out the confusions about the conventional identity in the minplus algebra and present an analytical expression of the asymptotic identity that may not cause confusions. 1.
FGN Based Telecommunication Traffic Models
"... Abstract: This paper addresses three models of traffic based on fractional Gaussian noise (fGn). The first is the standard fGn (fGn for short) that is characterized by a single Hurst parameter. The second is the generalized fGn (GfGn) indexed by two parameters. The third the local Hurst function. T ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: This paper addresses three models of traffic based on fractional Gaussian noise (fGn). The first is the standard fGn (fGn for short) that is characterized by a single Hurst parameter. The second is the generalized fGn (GfGn) indexed by two parameters. The third the local Hurst function. The limitation of fGn in traffic modeling is explained. We shall exhibit that the model of GfGn can be used to release that limitation. Finally, we discuss the local Hurst function to interpret that it is a simple model to express the multifractal property of traffic on a pointbypoint basis.
Fair and Smooth Scheduling for Virtual Output Queuing Switches Achieving 100 % Throughput
"... Abstract. Cell scheduling has received extensive attention. Most recent studies, however, focus on achieving a 100 % switch throughput under the uniform arrivals. As the demand for quality of service increases, two important goals are to provide predictive cell latency and to reduce the output burst ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Cell scheduling has received extensive attention. Most recent studies, however, focus on achieving a 100 % switch throughput under the uniform arrivals. As the demand for quality of service increases, two important goals are to provide predictive cell latency and to reduce the output burstiness. This paper presents a new scheduling algorithm, Worstcase Iterative Longest Port First (WiLPF), which improves the performance of the wellknown scheduler Iterative Longest Port First (iLPF) such that both cell latency and output burstiness are well controlled. Simulation results are provided to verify how WiLPF outperforms iLPF. 1
Hard RealTime Communications with Weighted Round Robin Service in ATM Local Area Networks *
"... In this paper, we address issues related to providing guaranteed realtime communication in ATM local area networks. We concentrate on output link scheduling because it plays a critical role in meeting message deadlines. We are particularly interested in the weighted round robin scheduling policy b ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper, we address issues related to providing guaranteed realtime communication in ATM local area networks. We concentrate on output link scheduling because it plays a critical role in meeting message deadlines. We are particularly interested in the weighted round robin scheduling policy because of its simple design and implementation. To use weighted round robin scheduling for hard realtime applications, the weights must be properly allocated to each of the connections. We propose and analyze two weight allocation schemes. The first scheme is heuristic, and is easy to understand and implement. The second scheme is optimal. That is, it can always guarantee a set of hard realtime connections whenever it is possible to do so. We evaluate and compare the system performance in terms of its admission probability the probability that deadlines of all connections in a randomly chosen connection set can be met. We find that the op timal weight allocation scheme indeed performs the best. However, the heuristic scheme performs closely to the op timal scheme over a wide range of loading conditions. 1
e Regulation To Meet EndtoEnd Deadlines In ATM
"... This paper considers the support of hard realtime connections in ATM networks. In an ATM network, a set of hard realtime connections can be admitted only if the worst case endtoend delays of cells belonging to individual connections are less than their deadlines. Although there are several app ..."
Abstract
 Add to MetaCart
(Show Context)
This paper considers the support of hard realtime connections in ATM networks. In an ATM network, a set of hard realtime connections can be admitted only if the worst case endtoend delays of cells belonging to individual connections are less than their deadlines. Although there are several approaches to manage the network resources in order to meet the delay requirements of connections, we focus on the use of traffic regulation to achieve this objective. Leaky buckets provide simple and userprogrammable means of traffic regulation. We design and analyze an efficient optimal algorithm for selecting the burst parameters of leaky buckets to meet connections' deadlines. Our algorithm is optimal in the sense that it always selects burst parameters to meet the delay requirements of hard realtime connections whenever some such assignment exists. The exponential size of the search space makes this problem a challenging one. Our algorithm is efficient and we observe a dramatic improvement in the system performance in terms of the connection admission probability when traffic is regulated using our algorithm. 1