S. Kweon and K. Shin. Providing Deterministic Delay Guarantees in ATM Networks. IEEE/ACM Trans. Networking, 6(6):838--850, December 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....region when the service rate of the multiplexer is a constant. The schedulability conditions are closely related to traffic characteristics. Hence we discuss traffic characteristics first. Since the deterministic model has been widely used in the literature related to real time services [1,3,4,7], we also use deterministic model to characterize the worst case traffic of a connection. Let It, t , be the total traffic arrivals from service j to the scheduler in the time interval [t, t , where the traffic from service j consists of packets with maximum transmission time s and minimum ....

S.K. Kweoo, and K.G. Shin, "Providing Deterministic Delay Guarantees in ATM Networks," IEEEdACM Trans. on Networking, Vol. 6, No. 6, pp. 838-850, December 199g. 867

....By providing fairer service to remote sensors, SVM can scale significantly better than FCFS and DS in large sensor networks. 5. Related Work There are significant research results on real time communications on single hop wired LANs (e.g. 24] 25] multi hop wired LANs (e.g. 14] ATM (e.g. [17][18] and the Internet (e.g. 13] 22] 21] A good survey about real time network architecture for packet switched network is [3] However, there have been few published works on real time multi hop sensor networks, which has significant different constraints from previous real time networks. ....

S. Kweon and K. G. Shin, "Providing Deterministic Delay Guarantees in ATM Networks," IEEE/ACM Transactions on Networking, 6(6), December 1998.

....Congestion can increase the end to end delay of a packet and can even force the switch to drop packets. One of the means to reduce congestion is to use a good scheduling policies at the switches. For this reason, there is a lot of active work in offering nice scheduling algorithms and policies [4, 11, 14, 5, 17]. A. Scheduling Policies One the most popular scheduling policies is the First In First Out (FIFO) policy. It is simple and easy to implement. Unfortunately, it has been observed that FIFO is not stable (i.e. the congestion can grow unbounded) even in connection oriented models of networks [1, ....

S.-K. Kweon and K. G. Shin, "Providing deterministic delay guarantees in ATM networks," IEEE/ACM Trans. on Networking, vol. 6, no. 6, pp. 838--850, Dec. 1998.

....miss ratio by as much as 57.6 , compared to FCFS, and by as much 28.1 compared to deadline based scheduling policy. 5. Related Work There are significant research results on real time communications on single hop wired LANs (e.g. 24] 25] multi hop wired LANs (e.g. 14] ATM (e.g. [17][18] 19] and the Internet (e.g. 6] 13] 22] 21] A good survey about real time network architecture for packet switched network is [3] However, there have been few published works on real time multi hop sensor networks, which has significant different constraints from previous real time ....

S. Kweon and K. G. Shin, "Providing Deterministic Delay Guarantees in ATM Networks," IEEE/ACM Transactions on Networking, 6(6), December 1998.

....the development of multimedia techniques have allowed the emergence of applications that require deterministic quality of service (QoS) guarantees from the network. In a deterministic service, all packets of a connection are assured to be delivered within the specified QoS bounds [1] 2] 3] [4], 5] 6] 7] 8] In order to provide such services, the communication subsystem must be based on an accurate deterministic traffic model that characterizes the source with a minimum set of param eters so as to make an efficient service feasible [3] 9] 10] 11] 12] The XGOP B model ....

S.-K. Kweon and K. G. Shin, "Providing deterministic delay guarantees in ATM networks," IEEE/ACM Transactions on Networking, vol. 6, no. 6, pp. 838 850, Dec. 1998.

.... that must be controlled by the communication infrastructure to provide such applications with the required QoS degree [1, 2, 3, 4, 5, 6] In order to provide QoS guarantees, the network service must be founded on the traffic model, on the packet scheduler, and on the connec tion admission control [3, 7, 8, 9, 10, 11, 12, 13, 14]. However, neither the packet scheduler nor the connection admission control can provide by themselves an effcient service if an accurate traffc model is not supplied. Many traffc models for statistic services have been proposed in the literature [15, 16, 17, 18, 19] These models are mostly ....

....be used in services that require deterministic guarantees from the network (e.g. strict video applications) since there exists a nonzero probability that the QoS parameters are violated. In a deterministic service, all the packets are guaranteed to be delivered within the specified QoS bounds [3, 8, 9, 10, 11, 12, 13, 14]. In such services, the trac characteristics are parameterized by a deterministic trac model. In the ( p) model [20, 21] for an interval of length , the source is constrained to transmitting no more than p bits. The ( p model [3] which is an extension of the ( p) model, defines a ....

S.-K. Kweon and K. G. Shin, "Providing deterministic delay guarantees in ATM networks," IEEE/ACM Transactions on Networking, vol. 6, no. 6, pp. 838 850, Dec. 1998. 27

.... The IETF proposed the Integrated Services architecture (Intserv) for providing deterministic service guarantees required by real time multimedia applications such as IP telephony, video on demand, and video conferencing [3] 6] 21] 22] 28] In Intserv and other QoS architectures ( 11] [15] to name a few) the network reserves the required link bandwidth for each application, and then uses a fair scheduling algorithm, such as WFQ [4] at the links to ensure each application receives its allotted bandwidth. This approach has several problems related to its scalability. Firstly, ....

S. Kweon and K. Shin. Providing Deterministic Delay Guarantees in ATM Networks. IEEE/ACM Trans. Networking, 6(6):838--850, December 1998.

....IP networks and the complexity is similar to the best effort IP architecture. 1 Introduction Several different architectures have been proposed to support applications that require strict service guarantees. In the IETF Integrated Services architecture (Intserv) 3, 21] and other architectures [10, 12, 15], the network reserves the required bandwidth on per flow basis, and ensures that the flows receive their allotted bandwidth by using fair schedulers, such as Weighted Fair Queuing (WFQ) or equivalent [4, 13, 14] at each link. However, these per flow approaches have many scaling problems as ....

...., where C i k is the link capacity. The routing table entry is then modified such that B i j;g;k B i j;g;k ae. Similarly, the allocated bandwidth is decremented when flows are terminated. Note that the link admission test takes O(1) time which is much simpler than the admission tests in [8, 12, 20] which depend on the individual reservations already made to other flows and are generally complex. Also, the link schedulers have to service flows on per destination Token bucket Input Buffer r s per class flow N 2 1 i Token buckets Distributor Per destination (a) b) Fig. 2. a) ....

[Article contains additional citation context not shown here]

S. Kweon and K. Shin. Providing Deterministic Delay Guarantees in ATM Networks. IEEE/ACM Trans. Networking, 6(6):838--850, December 1998.

....in the Internet. The Intserv architecture provides deterministic guarantees using per ow reservations, limiting its scalability. In this dissertation, we address the support of guaranteed services, so we focus mainly on Intserv and other guaranteed services architectures proposed in literature [28, 41, 61]. The scalability problem in Intserv arises mainly because, networks manage reservations of each session individually, and use per ow fair scheduling at the links. A key design principle in Intserv is to avoid using any virtual circuits and proceed with a connection less approach of current IP. ....

....distributed routing protocols. 96 Chapter 4 Multipaths in Guaranteed Services Architecture Several di erent architectures have been proposed that support applications requiring strict service guarantees. In the IETF s Integrated Services architecture (Intserv) 10, 76] and other architectures [28, 41, 61], the required bandwidth for each ow is reserved in the network on a per ow basis, and routers ensures that the ows receive their allotted bandwidth by using fair schedulers, such as Weighted Fair Queuing (WFQ) or equivalent [14, 48, 60] at each link. However, these per ow approaches have ....

[Article contains additional citation context not shown here]

S. Kweon and K. Shin. Providing Deterministic Delay Guarantees in ATM Networks. IEEE/ACM Trans. Networking, 6(6):838-850, December 1998.

....packet switched networks, because their packet multiplexers do not differentiate between real time and non real time traffic, nor among real time connections themselves. Several packet multiplexing techniques have been proposed to provide different QoS for different real time applications [1 9]. In particular, we proposed TrafficControlled Rate Monotonic Priority Scheduling (TCRM) 9] as a cell multiplexing scheme to achieve deterministic real time communication in ATM networks. The prime attraction of the TCRM lies in its simplicity, and hence makes it suitable for high speed networks ....

....real time and non real time traffic, nor among real time connections themselves. Several packet multiplexing techniques have been proposed to provide different QoS for different real time applications [1 9] In particular, we proposed TrafficControlled Rate Monotonic Priority Scheduling (TCRM) [9] as a cell multiplexing scheme to achieve deterministic real time communication in ATM networks. The prime attraction of the TCRM lies in its simplicity, and hence makes it suitable for high speed networks such as ATM and, at the same time, provides high channel admissibility. Real time ....

[Article contains additional citation context not shown here]

S.-K. Kweon and K. G. Shin, "Providing Deterministic Delay Guarantees in ATM Networks," IEEE/ACM Transactions on Networking, vol. 6, no. 6, pp. 838--850, December 1998.

....their packet multiplex ers do not differentiate between real time and nonreal time traffic, nor among real time connections themselves. Several packet multiplexing techniques have been proposed to provide different QoS for different real time applications [1] 2] 3] 4] 5] 6] 7] 8] [9]. In particular, we proposed Traffic Controlled Rate Monotonic Priority Scheduling (TCRM) 9] as a cell multiplexing scheme to achieve deterministic real time communication in ATM networks. The prime attraction of the TCRM lies in its simplicity and, hence, makes it suitable for highspeed networks ....

....nor among real time connections themselves. Several packet multiplexing techniques have been proposed to provide different QoS for different real time applications [1] 2] 3] 4] 5] 6] 7] 8] 9] In particular, we proposed Traffic Controlled Rate Monotonic Priority Scheduling (TCRM) [9] as a cell multiplexing scheme to achieve deterministic real time communication in ATM networks. The prime attraction of the TCRM lies in its simplicity and, hence, makes it suitable for highspeed networks such as ATM and, at the same time, provides high channel admissibility. Real time ....

[Article contains additional citation context not shown here]

S.-K. Kweon and K.G. Shin, "Providing Deterministic Delay Guarantees in ATM Networks," IEEE/ACM Trans. Networking, vol. 6, no. 6, pp. 838-850, Dec. 1998.

No context found.

S.-K. Kweon and K. G. Shin, "Providing Deterministic Delay Guarantees in ATM Networks," IEEE/ACM Transactions on Networking, vol. 6, pp. 838--850, Dec. 1998.

No context found.

S. Kweon and K. Shin. Providing Deterministic Delay Guarantees in ATM Networks. IEEE/ACM Trans. Networking, 6(6):838--850, December 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC