Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- China Simulation Federation (3363)
- TÜBİTAK (3020)
- Wright State University (1729)
- Washington University in St. Louis (697)
- Embry-Riddle Aeronautical University (427)
-
- Singapore Management University (410)
- Old Dominion University (355)
- Selected Works (342)
- University of Nebraska - Lincoln (234)
- University of Dayton (163)
- Chulalongkorn University (150)
- Air Force Institute of Technology (120)
- Portland State University (117)
- Purdue University (83)
- University of Nevada, Las Vegas (77)
- Chapman University (74)
- University for Business and Technology in Kosovo (70)
- Technological University Dublin (68)
- University of New Haven (68)
- University of Arkansas, Fayetteville (62)
- University of South Florida (59)
- SelectedWorks (53)
- California Polytechnic State University, San Luis Obispo (50)
- University of South Carolina (48)
- Western University (48)
- University of New Mexico (36)
- Edith Cowan University (35)
- San Jose State University (33)
- Loyola University Chicago (30)
- University of Kentucky (28)
- Keyword
-
- Computer Science (290)
- Department of Computer Science and Engineering (237)
- Engineering (191)
- Simulation (175)
- Machine learning (169)
-
- Deep learning (162)
- College of Engineering and Computer Science (157)
- Newsletters (157)
- Science news (157)
- Technical writing (157)
- Optimization (102)
- Classification (101)
- Genetic algorithm (98)
- Particle swarm optimization (83)
- Security (78)
- Machine Learning (74)
- Artificial intelligence (59)
- Robotics (58)
- Clustering (57)
- Virtual reality (57)
- Modeling (56)
- Wireless sensor networks (56)
- Digital forensics (55)
- Support vector machine (54)
- Computer Engineering (53)
- Neural network (51)
- Feature extraction (49)
- Cybersecurity (48)
- Image processing (48)
- Visualization (47)
- Publication Year
- Publication
-
- Journal of System Simulation (3363)
- Turkish Journal of Electrical Engineering and Computer Sciences (3020)
- Computer Science & Engineering Syllabi (1312)
- All Computer Science and Engineering Research (683)
- Research Collection School Of Computing and Information Systems (394)
-
- Journal of Digital Forensics, Security and Law (298)
- Browse all Theses and Dissertations (260)
- Electrical and Computer Engineering Faculty Publications (164)
- BITs and PCs Newsletter (157)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (150)
- Department of Computer Science and Engineering: Dissertations, Theses, and Student Research (138)
- Theses and Dissertations (133)
- Electrical & Computer Engineering Theses & Dissertations (127)
- Annual ADFSL Conference on Digital Forensics, Security and Law (104)
- Faculty Publications (91)
- Computer Science Faculty Publications and Presentations (81)
- Dissertations (77)
- Electrical & Computer Engineering and Computer Science Faculty Publications (67)
- Engineering Faculty Articles and Research (66)
- Electronic Theses and Dissertations (58)
- Computer Science Faculty Publications (54)
- USF Tampa Graduate Theses and Dissertations (54)
- UBT International Conference (51)
- Monish R. Chatterjee (47)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (47)
- CSE Conference and Workshop Papers (45)
- Christopher N. Roman (45)
- Computer Science Theses & Dissertations (38)
- Partha Banerjee (35)
- Graduate Theses and Dissertations (32)
- Publication Type
Articles 12391 - 12420 of 12790
Full-Text Articles in Physical Sciences and Mathematics
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 4, April 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 4, April 1996, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A six page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Scheduling Processors For Distributed, Critical, Real-Time Systems, Hari K. Narasimhamurthy
Scheduling Processors For Distributed, Critical, Real-Time Systems, Hari K. Narasimhamurthy
Electrical & Computer Engineering Theses & Dissertations
The development of a procedure to obtain cyclo-static schedules for distributed, critical real-time applications is presented in this thesis. The applications considered in this thesis are characterized by hard deadlines and periodic inputs. The applica tions are described by a data flow graph model which guarantees performance. Given the data flow graph representation, processors are scheduled to complete tasks as specified in the representation. The scheduling technique separates the scheduling of tasks in time and the assignment of processors to tasks. While different criteria exist for task scheduling, a schedule which minimizes latency and maximizes throughput is used in this …
Speech Feature Computation For Visual Speech Articulation Training, Stefan Auberg
Speech Feature Computation For Visual Speech Articulation Training, Stefan Auberg
Electrical & Computer Engineering Theses & Dissertations
A new version of the Visual Speech Articulation Training Aid was implemented which provides real-time visual feedback for speech articulation training. This version was migrated to a Windows Multimedia PC from a previous version which used a Personal Computer (PC) system and additional specialized and expensive custom hardware. This new version will make the system more available to schools and private users. A new method was developed for computing spectral/temporal features which characterize the speech sounds. In addition to the typical frame-based spectral analysis parameters, the new method represents temporal changes of the spectrum with a small number of features. …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 3, March 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 3, March 1996, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 2, February 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 2, February 1996, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 1, January 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 1, January 1996, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Compile-Time Performance Prediction Of Hpf/Fortran 90d, Manish Parashar, Salim Hariri
Compile-Time Performance Prediction Of Hpf/Fortran 90d, Manish Parashar, Salim Hariri
Electrical Engineering and Computer Science - All Scholarship
In this paper we present an interpretive approach for accurate and cost-effective performance prediction in a high performance computing environment, and describe the design of a compile-time HPF/Fortran 90D performance prediction framework based on this approach. The performance prediction framework has been implemented as a part of the HPF/Fortran 90D application development environment that integrates it with a HPF/Fortran 90D compiler and a functional interpreter. The current implementation of the environment framework is targeted to the iPSC/860 hypercube multicomputer system. A set of benchmarking kernels and application codes have been used to validate the accuracy, utility, and usability of the …
Reconsidering Fragmentation And Reassembly, Girish P. Chandranmenon, George Varghese
Reconsidering Fragmentation And Reassembly, Girish P. Chandranmenon, George Varghese
All Computer Science and Engineering Research
We reconsider several issues related to fragmentation and reassembly in IP. We first reconsider reassembly. We describe a simple expected case optimization that improves reassembly performance to 38 instructions per fragment if the fragments arrive in FIFO order (the same assumption made in header prediction) which has been implemented in the NetBSD kernel. Next, we introduce the new idea of Graceful Intermediate Reassembly (GIR), which is a generalization of the existing IP mechanisms of destination and hop-by-hop reassembly. In GIR, we coalesce the fragments at an intermediate router in order to use the largest sized packets on its outgoing interface. …
Optimal Solution Of Off-Line And On-Line Generalized Caching, Saied Hosseini-Khayat, Jerome R. Cox
Optimal Solution Of Off-Line And On-Line Generalized Caching, Saied Hosseini-Khayat, Jerome R. Cox
All Computer Science and Engineering Research
Network traffic can be reduced significantly if caching is utilized effectively. As an effort in this direction we study the replacement problem that arises in caching of multimedia objects. The size of objects and the cost of cache misses are assumed non-uniform. The non-uniformity of size is inherent in multimedia objects, and the non-uniformity of cost is due to the non-uniformity of size and the fact that the objects are scattered throughout the network. Although a special case of this problem, i.e. the case of uniform size and cost, has been extensively studied, the general case needs a great deal …
End-User Construction And Configuration Of Distributed Multimedia Applications, Terrance Paul Mccartney
End-User Construction And Configuration Of Distributed Multimedia Applications, Terrance Paul Mccartney
All Computer Science and Engineering Research
Distributed multimedia applications supported by a global electronic infrastructure have tremendous potential for providing users with customized communication and computation environments. Since communication and computation requirements vary by context and change dynamically, it is unlikely that off-the-shelf applications will anticipate the needs of all users. Therefore, empowering end-users to create their own customized applications for both communication and computation is an important challenge. This dissertation presents several mechanisms that enable end-users to create and configure distributed multimedia applications, including end-users construction direct manipulation graphical users interface (GUIs) and application management of distributed multimedia applications over the Internet.
Design Of A Gigabit Atm Switch, Tom Chaney, Andrew Fingerhut, Margaret Flucke, Jonathan S. Turner
Design Of A Gigabit Atm Switch, Tom Chaney, Andrew Fingerhut, Margaret Flucke, Jonathan S. Turner
All Computer Science and Engineering Research
This report describes the design and implementation of a gigabit ATM switching system supporting link rates from 150 Mb/s to 2.4 Gb/s, with a uniquely efficient multicast switch architecture that enables the construction of systems with essentially constant per port costs for configurations ranging from 8 to 4096 ports and system capacities approaching 1- Tb.s. The system design supports many-to-one and many-to-many forms of multicast, in addition to the usual one-to-many. It also provides multicast virtual paths, constant time configuration of multicast connections and an efficient packet-level discard method, that can achieve 100% link efficiencies, without large buffers.
The Apic Approach To High Performance Network Interface Design: Protected Dma And Other Techniques, Zubin D. Dittia, Guru M. Parulkar, Jerome R. Cox Jr.
The Apic Approach To High Performance Network Interface Design: Protected Dma And Other Techniques, Zubin D. Dittia, Guru M. Parulkar, Jerome R. Cox Jr.
All Computer Science and Engineering Research
We are building a very high performance 1.2 Gb/s ATM network interface chip called the APIC (ATM Port Interconnect Controller). In addition to borrowing userful ideas from a number of research and commercial prototypes, the APIC design embraces several innovative features, and integrates all of these pieces into a coherent whole. This paper describes some of the novel ideas that have been incorporated in the APIC design with a view to improving the bandwidth and latency seen by end-applications. Among the techniques described, Protected DMA and Protected I/O were designed to allow applications to queue data for transmission or reception …
Design Of Nonblocking Atm Networks, J. Andrew Fingerhut, Rob Jackson, Subhash Suri, Jonathan S. Turner
Design Of Nonblocking Atm Networks, J. Andrew Fingerhut, Rob Jackson, Subhash Suri, Jonathan S. Turner
All Computer Science and Engineering Research
This paper considers the problem of designing ATM networks that are nonblocking with respect to virtual circuit requests, subject to specified constraints on the traffic. In this paper, we focus on global traffic constraints that simply limit the total entering and exiting traffic at each switching system. After reviewing prior results for linear link costs, we introduce a more realistic link cost model, and develop a number of results using it. We also describe a technique for converting tree-structured networks to nonblocking hierarchical networks satisfying limits on the capacity of any single switch.
Efficient User Space Protocol Implementations With Qos Guarantees Using Real-Time Upcalls, R. Gopalakrishnan, Guru M. Parulkar
Efficient User Space Protocol Implementations With Qos Guarantees Using Real-Time Upcalls, R. Gopalakrishnan, Guru M. Parulkar
All Computer Science and Engineering Research
Real-time upcalls (RTUs) are an operating systems mechanism to provide quality-of-service (QoS) guarantees to network applications, and to efficiently implement protocols in user space with (QoS) guarantees. Traditionally, threads (and real-time extensions to threads) have been used to structure concurrent activities in user space protocol implementations. However, preemptive scheduling required for real-time threads leads to excessive context switching, and introduces the need for expensive concurrency control mechanisms such as locking. The RTU mechanism exploits the iterative nature of protocol processing to eliminate the need for locking, and reduce asynchronous preemption, while ensuring real-time operation. In addition to efficiency, eliminating the …
Designing Minimum Cost Nonblocking Communication Networks, J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner
Designing Minimum Cost Nonblocking Communication Networks, J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner
All Computer Science and Engineering Research
This paper addresses the problem of topological design of ATM (and similar) communication networks. We formulate the problem from a worst-case point of view, seeking network desings that, subject to specified traffic constraints, are nonblocking for point-to-point and multicast virtual circuits. Within this model we give various conditions under which star networks are optimal or near-optimal. These conditions are approximately satisfied in many common situations making the results of practical significance. An important consequence of these results is that, where they apply, there is no added cost for nonblocking multicast communication, relative to networks that are nonblocking for point-to-point traffic …
On The Performance Of Early Packet Discard, Maurizio Casoni, Jonathan S. Turner
On The Performance Of Early Packet Discard, Maurizio Casoni, Jonathan S. Turner
All Computer Science and Engineering Research
In a previous paper [3], one of the authors, gave a worst-case analysis for the Early Packet Discard (EPD) technique for maintaining packet integrity during overload in ATM switches. This analysis showed that to ensure 100% goodput during overload under worst-case conditions, requires a buffer with enough storage for one maximum length packet from every active virtual circuit. This paper refines that analysis, using assumptions that are closer to what we expect to see in practice and examines how EPD performs when the buffer is not large enough to achieve 100% goodput. We show that 100% goodput can be achieved …
New Results On Generalized Caching, Saied Hosseini-Khayat
New Results On Generalized Caching, Saied Hosseini-Khayat
All Computer Science and Engineering Research
We report a number of new results in generalized caching. This problem arises in modern computer networks in which data objects of various sizes are transmitted frequently. First it is shown that its optimal solution is NP-complete. Then we explore two methods of obtaining nearly optimal answers based on the dynamic programming algorithm that we provided in [5]. These methods enable a trade-off between optimality and speed. It is also shown that LFD (the longest forward distance algorithm which is the optimal policy in the classical case), is no longer optimal but is competitive. We also prove that LRU remains …
Continuous Compilation For Software Development And Mobile Computing, Michael P. Plezbert
Continuous Compilation For Software Development And Mobile Computing, Michael P. Plezbert
All Computer Science and Engineering Research
Software developers typically must choose between interpreted and compiled environments for their programming activities. However, the current trends toward mobile computing and platform independence suggest moving to a new continuous compilation paradigm that integrates the advantages of each environment. Movement in this direction can already be seen in the development of Sun Microsystems' Java environment. The resulting continuous compiler operates not as a prelude to, but rather in tandem with, program execution. In this thesis we present the results of experiments that compare the performance of the continuous compilation model with a more traditional model and show that a performance …
Leap Forward Virtual Clock: An O(Loglogn) Fair Queuing Scheme With Guaranteed Delays And Throughput Fairness, Subhash Suri, George Varghese, Girish P. Chandranmenon
Leap Forward Virtual Clock: An O(Loglogn) Fair Queuing Scheme With Guaranteed Delays And Throughput Fairness, Subhash Suri, George Varghese, Girish P. Chandranmenon
All Computer Science and Engineering Research
We describe an efficient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds almost identical to that of PGPS fair queuing, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglogN) per packet guaranteed delay and throughput fairness. As its name suggests, our scheme is based on Zhang's virtual clock. While the original virtual clock scheme does not achieve throughput fairness, we can modify it with a simple leap forward mechanism that keeps the server clock from lagging too far behind the packet tags. We prove that our scheme guarantees a fair share …
Vaudeville: A High Performance, Voice-Activated Teleconferencing Application, Jyoti K. Parwatikar, T. Paul Mccartney, John D. Dehart, Maynard Engebretson, Kenneth J. Goldman
Vaudeville: A High Performance, Voice-Activated Teleconferencing Application, Jyoti K. Parwatikar, T. Paul Mccartney, John D. Dehart, Maynard Engebretson, Kenneth J. Goldman
All Computer Science and Engineering Research
We present a voice-activated, hands-off, ATM-based video conferencing application. The application, called Vaudeville, features high quality NTSC video, voice-activated audio transmission, audio bridging of two audio streams, and voice-activated video switching. It supports multiple simultaneous multi-party conferences using a scalable multicast mechanism. We describe how Vaudeville was built using a component-based distributed programming environment. We also describe the algorithms used to contorl the audio and video of the applciation. Audio and video are encoded in hardware using an ATM hardware multimedia interface.
Design And Implementation Of A Practical Security-Conscious Electronic Polling System, Lorrie Faith Cranor, Ron K. Cytron
Design And Implementation Of A Practical Security-Conscious Electronic Polling System, Lorrie Faith Cranor, Ron K. Cytron
All Computer Science and Engineering Research
We present the design and implementation of Sensus, a practical, secure and private system for conducting surveys and elections over computer networks. Expanding on the work of Fujioka, Okamoto, and Ohta, Sensus uses blind signatures to ensure that only registered voters can vote and that each registered voter only votes once, while at the same time maintaining voters' privacy. Sensus allows voters to verify independently that their votes were counted correctly, and anonymously challenge the results should their votes be miscounted. We outline seven desirable properties of voting systems and show that Sensus satisfied these properties well, in some cases …
Bringing Real-Time Scheduling Theory And Practice Closer For Multimedia Computing, R. Gopalakrishnan, Guru M. Parulkar
Bringing Real-Time Scheduling Theory And Practice Closer For Multimedia Computing, R. Gopalakrishnan, Guru M. Parulkar
All Computer Science and Engineering Research
This paper seeks to bridge the gap between theory and practice of real-time scheduling in the domain of multimedia computer systems. We show that scheduling algorithms that are good in theory, often have practical limitations. However when these algorithms are modified based on practical considerations, existing theoretical results cannot be used as they are. In this paper we motivate the need for new scheduling schemes for multimedia protocol processing, and demonstrate their real-time performance in our prototype implementation. We then explain the observed results by analysis and measurement. More specifically, we show that using strict preemption can introduce overheads in …
Distributed Stream Filtering For Database Applications, William M. Shapiro, Kenneth J. Goldman
Distributed Stream Filtering For Database Applications, William M. Shapiro, Kenneth J. Goldman
All Computer Science and Engineering Research
Distributed stream filtering is a mechanism for implementing a new class of real-time applications with distributed processing requirements. These applications require scalable architectures to support the efficient processing and multiplexing of large volumes of continuously generated data. This paper provides an overview of a stream-oriented model for database query processing and presents a supporting implementation. To facilitate distributed stream filtering, we introduce several new query processing operations, including pipelined filtering that efficiently joins and eliminates duplicates from database streams and a new join method, the progressive join, that joins streams of tuples. Finally, recognizing that the stream-oriented model results in …
An Algorithm For Message Delivery To Mobile Units, Amy L. Murphy, Gruia-Catalin Roman, George Varghese
An Algorithm For Message Delivery To Mobile Units, Amy L. Murphy, Gruia-Catalin Roman, George Varghese
All Computer Science and Engineering Research
With recent advances in wireless communication and the ubiquity of laptops, mobile computing has become an important research area. An essential problem in mobile computing is the delivery of a message from a source to either a single mobile node, unicast, or to a group of mobile nodes, multicast. Standard solutions used in Mobile IP and cellular phones for the unicast problem rely on tracking the mobile unit. Tracking solutions scale badly when mobile nodes move frequently, and do not generalize well to multicast delivery. Our paper proposes a new message delivery algorithm for micromobility based on a modification of …
Mobile Unity Coordination Constructs Applied To Packet Forwarding For Mobile Hosts, Peter J. Mccann, Gruia-Catalin Roman
Mobile Unity Coordination Constructs Applied To Packet Forwarding For Mobile Hosts, Peter J. Mccann, Gruia-Catalin Roman
All Computer Science and Engineering Research
With recent advances in wireless communication technology, mobile computing is an increasingly important area of research. A mobile system is one where independently executing components may migrate through some space during the course of the computation, and where the pattern of connectivity among the components changes as they move in and out of proximity. Mobile UNITY is a language and logic for specifying and reasoning about mobile systems, the components of which must operate in a highly decoupled way. In this paper it is argued that Mobile UNITY contributes to the modular development of system specifications because of the declarative …
A Usability Study Of End-User Construction Of Direct Manipulation User Interfaces, T Paul Mccartney
A Usability Study Of End-User Construction Of Direct Manipulation User Interfaces, T Paul Mccartney
All Computer Science and Engineering Research
This paper describes an empirical study of end-users that tested the usability of The Programmers' Playground graphical environment. The Programmers' Playground is a software library and run-time system for constructing distributed multimedia applications. Playground's graphical environment enables end-users to create direct manipulation graphical user interfaces (GUIs) and to dynamically configure communication among distributed application components. In this study, 28 end-users with no prior experience in distributed computing or user interface construction were timed and evaluated on several tasks using our graphical environment. Tasks included the use of direct and indirect constraint relationships, visual configuration of distributed applications, and graphical user …
Building Distributed Applications With Design Patterns, Gruia-Catalin Roman, James C. Hu
Building Distributed Applications With Design Patterns, Gruia-Catalin Roman, James C. Hu
All Computer Science and Engineering Research
Design patterns are a topic of great current interest within the object-oriented programming community. The motivation is both economical and intellectual. On one hand, there is the hope of establishing a common culture and language that fosters communicatino and growth in the software engineering field. While a community dominated by empiricism is seeking to achieve higher levels of formality by capturing its experiences in the form of catalogs of design patterns, another community, deeply rooted in formal thinking, is seeking to make its mark on the every day workings of the software engineering process. Distributed algorithms and the heuristics used …
Analysis Of Mpeg Compressed Video Traffic, Jerome R. Cox Jr., O. Matthew Beal
Analysis Of Mpeg Compressed Video Traffic, Jerome R. Cox Jr., O. Matthew Beal
All Computer Science and Engineering Research
This paper outlines a study of MPEG compressed video sequences and simulation of multiplexed video traffic in the ATM environment. A number of statistical characteristics including autocorrelation and variance of MPEG-1 compressed video sequences are used to characterize the 16 sample traces used in this study. From these measurements, a preliminary model is developed which utilizes basic measurements of the individual component video sequences to predict bandwidth requirements and cell loss of the multiplexed video traffic.
Simulation Of Asynchronous Instruction Pipelines, Chia-Hsing Chien, Mark A. Franklin
Simulation Of Asynchronous Instruction Pipelines, Chia-Hsing Chien, Mark A. Franklin
All Computer Science and Engineering Research
This paper presents the ARAS simulator with which asynchronous instruction pipelines can be modelled, simulated and displayed. ARAS allows one to construct instruction pipelines by preparing various configuration files. Using these files and a number of benchmark programs, performance of the instruction pipelines can be obtained. The performance of asynchronous instruction pipelines can also be compared to synchronous case. Thus, one can decide the optimal design for instruction pipelines in asynchornous or synchronous cases and explore the deisng space of asynchronous instruction pipeline architectures.
Extending Atm Networks For Efficient Reliable Multicast, Jonathan S. Turner
Extending Atm Networks For Efficient Reliable Multicast, Jonathan S. Turner
All Computer Science and Engineering Research
One of the important features of ATM networks is their ability to support multicast communications. This facilitates the efficient distribution of multimedia information streams (such as audio and video) to large groups of receivers (potentially millions). Because ATM networks do not provide reliable delivery mechanisms, it is up to end systems to provide end-to-end reliability where it is needed. While this is straightforward for point-to-point virtual circuits, it is more difficult for one-to many and many-to-mamy virtual circuits. In this report, we propose some minimal extensions to the hardware of ATM switches that enables end systems to implement reliable multicast …