C. M. Aras, J. F. Kurose, D. S. Reeves, and H. Shulzrinne. Real-time communication in packet switched networks. Proceedings of the IEEE, 82(1):122--139, Jan. 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... [3] virtual clock (VCL) 4] packet generalized processor sharing (PGPS) 5,6] rate controlled static priority (RCSP) 7] self clock fair queueing (SCFQ) 8,9] and worst case fair weighted fair queueing (WF2Q) 10] A comprehensive description of the above algorithms can be referred to [11] and [12]. Generally speaking, all of them can support deterministic end to end delay and jitter binrods under the assumption of the associated traffic models. discipline called interleaved round robin (IRR) for scheduling connections in multiplexing. The main objective of this paper is to evaluate ....

C.M. Aras, J. Kurose, D. S. Reeves, and H. Schulzrinne, "Real-time communication in packet-switched networks," Proceedings of the IEEE, vol. 82, no. 1, pp. 122-139, Jan. 1994.

....of first in first out (FIFO) queues in a scheduler while providing high bandwidth utilization. INTRODUCTION To support real time services, which are expected to be one of the most demanding services in future high speed networks, steps must be taken to guarantee the Quality of Service (QoS) [1,2], especially, the end to end delay and delay variation requirements. Generally, the end to end packet delay includes processing delay (packetizing, unpacketizing delay, etc. propagation delay, as well as queueing delay. Since the processing delay and propagation delay, which result from physical ....

....a bounded delay service focuses on the study of queueing delay. Finding appropriate queue scheduling techniques has been considered as an important design aspect [4,5] Several scheduling techniques, such as the first come firstservice (FCFS) earliest deadline first (EDF) and staticpriority (SP) [1,2], have been studied. Each method presents a particular tradeoff in satisfying the requirements of efficiency, flexibility, complexity, analyzability, as well as impartiality [3] The FCFS method, which is the simplest one, is very limited because it guarantees only one delay bound for all services ....

C.M. Aras, I.F. Karose, and D.S. Reeves, H. Schulzrinne, "Real-time Communication in Packet-Switched Networks," Proc. IEEE, Vol. 82, No.l, pp. 122-139, January. 1994.

....For each FTP connection, the observing window covered all data packets. The window was evenly divided into n bins, numbered from 0 to n 1. For example, if a connection transmitted 4000 packets and n=5, then the observing window ranged from 1 to 4000 and the bin width = 800 packets, with bino = [1, 800], bin = 801, 1600] and bin4 = 3201, 4000] In each connection, the position of reordered packets was measured. Let Count represent the number of out of order packets whose sequence number fell into the i th bin. We summed up the Count for all the FTP connections and calculated the ....

C. Aras et al., Real-Time Communication in PacketSwitched Networks, Proceedings of the 1EEE, Vol. 82, No. 1, January 1994, pp. 122 139.

.... 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. Directed diffusion [11] is a data driven communication paradigm for sensor networks. Users can broadcast interests to sensor ....

C. M. Aras, J. F. Kurose, D. S. Reeves, H. Schulzrinne. "Real-Time Communication in Packet-Switched Networks ", Proc. of the IEEE, Vol. 82 No. 1, Jan. 1994, pp. 122--139.

....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 communication can be classified further into two categories according to QoS requirements [10]: deterministic and statistical . In deterministic real time communication, QoS requirements are specified in absolute terms and no cell losses or deadline misses are allowed. In order to satisfy its absolute QoS requirements, each deterministic real time connection must reserve resources based on ....

C. M. Aras, J. Kurose, D. S. Reeves, and H. Schulzrinne, "Real-time communication in packet-switched networks," Proceedings of the IEEE, vol. 82, no. 1, pp. 122--139, January 1994.

....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 communication can be classified further into two categories according to QoS requirements [10]: determi nistic and statistical. In deterministic real time communica tion, QoS requirements are specified in absolute terms and no cell losses or deadline misses are allowed. In order to satisfy its absolute QoS requirements, each deterministic real time connection must reserve resources based ....

C.M. Aras, J. Kurose, D.S. Reeves, and H. Schulzrinne, "Real-Time Communication in Packet-Switched Networks," Proc. IEEE, vol. 82, no. 1, pp. 122-139, Jan. 1994.

....communities and into homes. This has resulted in the introduction of a large number of applications with a wide range of quality of service (QoS) requirements [9] Representative of these new applications are those with real time traffic, such as video and audio. This real time communication [2, 30] requires guarantees such as bounded end to end delay, bounded cell loss rates, and guaranteed bandwidth from the network. Today s packet switched networks can employ a variety of methods The work reported in this paper was supported in part by the National Science Foundation under Grant ....

....In a static priority algorithm each flow has a predetermined priority number associated with it. All packets belonging to the flow are marked with the same priority. The special case where there is only one priority level is the FCFS algorithm, where no packets have priority over others. Under EDD [2, 30], each packet is assigned a due date (deadline) with the scheduler transmitting smallest deadline first. With these schemes each flow i provides the minimum packet interarrival time I i and a local delay bound d for each node the packet passes in the network. Packet by packet generalized ....

C. M. Aras, J. F. Kurose, D. S. Reeves, and H. Schulzrinne. Real-time communication in packet-switched networks. Proceedings of IEEE, 82(1):122--139, January 1994.

....teleconferencing. In order to meet these ever increasing demands, real time media servers will be responsible for hundreds, if not thousands of clients, with a wide range of QoS requirements. The QoS requirements of the clients are usually specified in terms of end to end delay, jitter, and loss [1, 2]. To meet the end to end QoS requirements of the clients, both the server and the network should provide QoS guarantees. At the network level, QoS support is either guaranteed by establishing real time channel [3] between the server and the client or attempted in a best effort manner [4] ....

C.M. Aras, J.F. Kurose, D.S. Reeves, and H. Schulzrinne, "Real-time communication in packet-switched networks, " Proc. IEEE, vol.82, no.1, pp.122-139, Jan. 1994.

....The real time communication service provides a guaranteed Quality of Service (QoS) such as bounded message delay, delay jitter, and error rate. Considerable efforts have been made to provide timeliness guarantees necessary for the above mentioned applications. See the survey paper by Aras et al. [2] for a detailed account of many of the existing real time communication schemes. Most of the real time communication schemes known to date share three common properties [1] QoS contracted, connection oriented, and reservation based. Before actually transferring any message, a contract must be ....

C. M. Aras, J. F. Kurose, D. S. Reeves, and H. Schulzrinne, "Real-time communication in packet switched networks," Proceedings of IEEE, vol. 82, pp. 122--139, Jan. 1994.

....delay and error rate is the key requirement of real time communication services. In recent years, considerable efforts have been made to provide the timeliness QoS guarantee, while the importance of guaranteeing fault tolerance QoS has been far less recognized. The survey paper by Aras et al. [ARA94] discusses many of existing real time communication schemes. However, there are growing needs for communication services with a guaranteed level of faulttolerance in many real time applications. Suppose, for example, there is a very important video conference and network failures disconnect one or ....

C. M. Aras, J. F. Kurose, D. S. Reeves, and H. Schulzrinne, "Real-time communication in packetswitched networks," Proceedings of the IEEE, vol. 82, pp. 122--139, January 1994.

....teleconferencing. In order to meet these ever increasing demands, real time media servers will be responsible for hundreds, if not thousands of clients, with a wide range of QoS requirements. The QoS requirements of the clients are usually specified in terms of end to end delay, jitter, and loss [1, 2]. To meet the end to end QoS requirements of the clients, both the server and the network should provide QoS guarantees. At the network level, QoS support is either guaranteed by establishing real time channel [3] between the server and the client or attempted in a best effort manner [4] ....

C.M. Aras, J.F. Kurose, D.S. Reeves, and H. Schulzrinne, "Real-time communication in packet-switched networks, " Proc. IEEE, vol.82, no.1, pp.122-139, Jan. 1994.

....and n is the number of nodes in the graph. 5.2.2 Simulation Parameters Except in the case of figure 6, all the networks used for simulation had 60 vertices. The parameters ff and fi were tuned to produce networks with average node degree 4. Random edge costs were generated uniformly from the set [1,10]. Edge delays were made proportional to the Euclidean distance of the edges in the coordinate plane. Each link in the network was assigned a total bandwidth of 100 units. Every simulation run consisted of a batch of 5000 call requests. Each point in every plot is the average over the values ....

Aras C M, Kurose J F, Reeves D S, and Schulzrine H, "Real-time communication in packet-switched networks", Proc. IEEE, Vol. 82, No. 1, pp. 122-139, Jan. 1994.

....the sense that it provides scheduling flexibility by trading off result quality to meet task (message) deadlines. 1. 5 REAL TIME COMMUNICATION The term real time communication is used to describe any kind of communication in which messages involved have timing constraints associated with them [3]. Real time messages are broadly classified into two categories: periodic and aperiodic. Periodic messages are generated by periodic tasks. Arrival times of periodic messages are spaced by the periodicity of the message stream. If the delays encountered in sending a periodic message is more than ....

....establishment phase involves the selection of a route for the channel satisfying traffic characteristics and performance requirements. For example, to guarantee that the specified end to end deadline can be met, the schedulability of individual links along the path of the channel must be checked [3]. A set of real time connections is schedulable on a link if it can be guaranteed that no message in those connections will miss its deadline on that link. Any scheduling algorithm should have its associated schedulability test (also known as call admission test) which is to be performed while ....

[Article contains additional citation context not shown here]

C.M. Aras, J.F. Kurose, D.S. Reeves, and H. Schulzrinne, "Real-time communication in packet-switched networks," Proc. IEEE, vol.82, no.1, pp.122-139, Jan. 1994.

....average performance is of prime interest, guaranteeing such quality of service (QoS) as message delay and error rate is the key requirement of real time communication services. In recent years, considerable efforts have been made to guarantee the timeliness QoS. The survey paper by Aras et al. [1] discusses many of existing real time communication schemes. By contrast, the importance of guaranteeing fault tolerance QoS has been far less recognized. While fault tolerant realtime communication in multi access networks has been relatively well studied, only a few research results are ....

C. M. Aras, J. F. Kurose, D. S. Reeves, and H. Schulzrinne, "Real-time communication in packet-switched networks," Proceedings of the IEEE, vol. 82, pp. 122--139, January 1994.

....we discuss a possible realization of controlledload service based on this interpretation including the one used in the experiments reported in this paper. Two rather well researched means of realizing different classes of service in an integrated services network is to use class based queuing [1, 6] and weighted fair queuing [4, 7, 19, 21] In a class based queuing scheme, datagrams belonging to different classes are put in different queues in the routers. The queues are serviced in different priority order based on the associated traffic class. A possible realization of controlled load ....

C. M. Aras, J. F. Kurose, D. S. Reeves, and H. Schulzrinne. Real-Time Communication in Packet-Switched Networks. Proceedings of IEEE, 82(1), January 1994.

....are not usually able to accurately describe their traffic profile. Therefore, unless peak bandwidth admission control is employed, it is inevitable that moments of transient congestion will occur in the network. In this paper we focus on congestion management of soft real time services [4], such as multimedia data, MPEG video streaming and IP telephony, which can tolerate a small degree of loss or delay, rather than those requiring guaranteed delivery and delay bounds [5] 6] such as mission critical applications. Our aims in this paper are two fold: ffl To highlight ....

C. M. Aras, J. F. Kurose, D. S. Reeves, and H. Schulzrinne, "Real-time communication in packet-switched networks," Proc. IEEE, vol. 82, pp. 122-- 139, Jan. 1994.

No context found.

C. M. Aras, J. F. Kurose, D. S. Reeves, and H. Shulzrinne. Real-time communication in packet switched networks. Proceedings of the IEEE, 82(1):122--139, Jan. 1994.

No context found.

C. Aras, J. Kurose, D. Reeves, H. Schulzrinne, "Real-Time Communication in Packet-Switched Networks," Proceedings of the IEEE, vol. 82, no. 1, pp. 122-139, January 1994.

No context found.

Aras, C.M., Kurose, J.F., Reeves, D.S., and Schulzrinne, H., 1994. Real-time communication in packetswitched networks, Proc. IEEE, vol.82, no.1, pp.122-139.

No context found.

C.M. Aras, J.F. Kurose, D.S. Reeves, and H. Schulzrinne, "RealTime Communication in Packet-Switched Networks," IEEE Proc., vol. 82, pp. 122-139, Jan. 1994.

No context found.

C.M. Aras, J.F. Kurose, D.S. Reeves, and H. Schulzrinne, "Real-time communication in packet-switched networks," Proc. IEEE, vol.82, no.1, pp.122-139, Jan. 1994.

No context found.

C.M.Aras, J.Kurose, D.S.Reeves and H.Schulzrinne, "Real-Time Communication in Packet-Switched Networks," Proceedings of the IEEE, vol.82, No.1, pp122-138, 1994.

No context found.

C. M. Aras, J. Kurose, D. S. Reeves, and H. Schulzrinne, "Real-time communication in packetswitched networks," Proceedings of the IEEE, vol. 82, pp. 122--139, Jan. 1994.

No context found.

C.M. Aras, J.F. Kurose, D.S. Reeves, and H. Schulzrinne, "Real-time communication in packet-switched networks, " Proc. IEEE, vol.82, no.1, pp.122-139, Jan. 1994.

No context found.

C.M. Aras, J.F. Kurose, D.S. Reeves, and H. Schulzrinne, "Real-time communication in packetswitched networks," Proc. IEEE, vol. 82, no. 1, pp. 122-139, Jan. 1994.

First 50 documents  Next 50

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