{"title":"Admission Control For Advance Reserved Real-Time Connections","authors":"D. Ferrari, A. Gupta","doi":"10.1109/HPCS.1995.662006","DOIUrl":"https://doi.org/10.1109/HPCS.1995.662006","url":null,"abstract":"Some of the important multimedia applications of integrated services networks require that advance reservations be possible. The clients who wish to set up multimedia multi-party meetings (i.e., meetings involving more t h a n two human beings) need to schedule those meetings in advance to make sure that all or most of the participants will be able to attend; at the time the meeting is scheduled. they must also be certain that the network connections and the other resources required will be available when needed and for the entire duration of the mccting. IJnfortunately, distributed multimedia applications must be supported by real-time communication services, which are to provide the necessary qualit y-of-service (QoS) guarantees, and these services cannot admit an arbitrary number of connections. Thus, there is no guarantee that the resources for a prc-scheduled meeting will be available at, the time tht meeting is expected to start, unless they can bc rescrved in advance. We have now finished the design, simulation and implementation of our multi-party real-time communication protocols that provide advance reservations of real-time connections. In this abstract, we describe our system for admission control of advance-reserved connections; we discuss some design issues and trade-offs, along with our implementation choices. This is the first implementation that supports advance reservations of real-time connections in an integrated-services packetswitching network; our research demonstrates the feasibility of providing advance reservations for real-time connections. Our design is fiilly-distributed and scalable; the performance measurements show that our techniques are fast (conncclion set-up time about 0.1 sec) and efficient in allocating network resources.","PeriodicalId":174670,"journal":{"name":"Third IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126737770","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reliable Dissemination For Large-Scale Wide-Area Information Systems","authors":"R. Yavatkar, J. Griffioen","doi":"10.1109/HPCS.1995.662014","DOIUrl":"https://doi.org/10.1109/HPCS.1995.662014","url":null,"abstract":"Thts paper describes a reliable multicast protocol ( T M T P ) that that cart bc britlf at the transport layer mrthout modrfication io the neturorL-level routers The protocol combtncs the besf o j acnder and receiver inrtrated protocols t o distribute protocol processing and localize retransmission Ezperimcnlal rrsults obtained across Internet MBONE sites rn thc LiSA and Europe are presented.","PeriodicalId":174670,"journal":{"name":"Third IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114356559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Protocol For Relative Quality-of-Service In TCP/IP-Based Internetworks","authors":"org Liebeherr, A. Tai","doi":"10.1109/HPCS.1995.662008","DOIUrl":"https://doi.org/10.1109/HPCS.1995.662008","url":null,"abstract":"A new protocol is presented that controls the quality of service of simplex end to end packet streams in a TCP IP based internetwork The protocol called TReg for Transport Regulation limits the use of network resources by a rate control mechanism im plemented at the tra c sources The set of ows is partitioned into di erent tra c classes based on the application type e g video tra c audio tra c or bulk data The rate control mechanisms at the traf c sources adapt to the current tra c load such that ows within the same tra c class obtain the same quality of service Relative Quality of Service Mea surements of a prototype implementation in a net work of workstations demonstrate the e ectiveness of the TReg protocol","PeriodicalId":174670,"journal":{"name":"Third IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems","volume":"329 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127985694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Kaleido: An Integrated Architecture For Interactive Multimedia Systems","authors":"A. Asthana, V. Krishnaswamy, M. Srivastava","doi":"10.1109/HPCS.1995.662001","DOIUrl":"https://doi.org/10.1109/HPCS.1995.662001","url":null,"abstract":"Emerging ’multimedia technologies have the potential to revolutionize the way humans organize, communicate and consume information. However, the full benefits of this technology have yet to reach the vast majority of computer users. One reason for this is that high-bandwidth networks are not widely deployed or accessibIe. But beyond the bandwidth banier, there also exists a mulfimedia compuring barrier. The architectures of present day computers are not significantly different from their earlier generation counterparts: fundamentally oriented towards &fa processing -they are simply much faster and better at it. Consequently, these systems (hardware and system software alike) are ill-equipped to cater to the special requirements imposed by multimedia. Most commonly used approach is to attach ‘multimedia’ devices such as cameras, sound-cards, CD-ROM drives as U0 peripherals to an existing computer system, and hope that a ‘fast enough’ CPU will run a few targeted applications reasonably well. It is possible, using this approach, to build some highly optimized (possibly through the use of custom hardware peripherals) stand alone multimedia applications that perfonn tolerably. However, such systems do not provide a general-purpose infra-structure to support the integration of multimedia capability into an arbitrary user application. To enable this, it is necessary to incorporate support for multimedia into the hardware and software fabric of the system, not just as ‘add-ons’. Kaleido is an experimental approach to designing such an integrated multimedia system. It is an on-going project and in this paper we present the current snap shot of our architecture and implementation.","PeriodicalId":174670,"journal":{"name":"Third IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132216810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Experimenting Prototype Scenarios For Accessing And Exchanging Multimedia Information","authors":"L. Grandinariu, G. Beuchot, P. Prévôt","doi":"10.1109/HPCS.1995.662002","DOIUrl":"https://doi.org/10.1109/HPCS.1995.662002","url":null,"abstract":"1)istrihution of compuring resources and applications together with the integration of multimedia information in application context rudicully changed neworking iechnologies and communicution prcitocols. People hmv thou,qht.fi)r long-time that asynchronous packet-.witched netwirks like computer networks could offir only usynchronou.s communication sen~ices so that real-iime transmissinns would he inipo~ssihle. Nouuduy,s. experiences with audio and video conference applications across the Internet proved rhere are yet resources to integrate real-time senrices. I t is not in rhe scope of this paper to present the technical support of this evolution. 7he.w aspects are luqely treated in /2, 15, 231. Our interest is on tailoring such applications to our u.ser.v needs. lhm'ng the implementation of un experimental pla(fi)rm, we've,fi~u.sed on .spec!&ing the archirecrure of a communication sub.vystrm able to support two dlffirertt aspects of exchunging real-time multimedia informution in distributed environments: distant aspect. dealing nith red-tinre trunsport of multimedia infirmution ucroxs heterogeneous networks; local aspect, dealinl: with realtime retrieving and presentation on remoie multimedia terminals connected to workstations. 7he plutfiinn werw set up is in senrice .fi)r experimenral disrance lecturing to students in ~ m i o u s disciplines in order to discover more detailed aspects of this optimization which are related l o ihe course contents und media urilisation,fi>r knowledge reprexentution.","PeriodicalId":174670,"journal":{"name":"Third IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132491204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multicast Communication In Large Scale Networks","authors":"M. Hofmann, T. Braun, G. Carle","doi":"10.1109/HPCS.1995.662020","DOIUrl":"https://doi.org/10.1109/HPCS.1995.662020","url":null,"abstract":"Upcoming applications, such as computer supported cooperative work, distributed parallel processing and virtual shared memory depend on efJicient data exchange among multiple computer systems. They often require a reliable multipoint conzniunication service with low end-to-end delay and high throughput. Additional problem occur for the provision of a reliable multipoint service, where errors are more likely and where the sender has to deal with n m y receivers. i n order to meet the required reliability, and in order to allow an eficient use of network resources, powe@l error control mechanisms are essential. This paper presents a novel concept to support reliable multicast conimuitication in large scale heterogeneous networks. correction schemes suitable to provide reliable multicast service on top of unreliable network service. Common protocols use Go-Back-N or selective repeat to retransmit lost and corrupted data. Receivers request missing data directly from the multicast sender without consideration of network topology and actuaI network load. In case of multicast, it may be preferable to contact another communication participant placed closer to the requesting endsystem. This paper presents a novel error control mechanism suitable for global heterogeneous networks. It aims to reduce transfer delay, network load and the acknowledgement processing overhead at the sending side. Section 2 presents the proposed framework based on the concept of local groups. Section 3 gives results of a performance analysis with a simple example scenario. Finally, section 4 presents concluding remarks.","PeriodicalId":174670,"journal":{"name":"Third IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133128469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Erich Nahum, Sean O 'malley, Hilarie Orman, R. Schroeppel
{"title":"Towards High Performance Cryptographic Software","authors":"Erich Nahum, Sean O 'malley, Hilarie Orman, R. Schroeppel","doi":"10.1109/HPCS.1995.662009","DOIUrl":"https://doi.org/10.1109/HPCS.1995.662009","url":null,"abstract":"A great deal of effort is currently being expended to provide some level of Internet security. An important question is whether security can be provided at gigabit speeds. The standard set of algorithms required to secure a connection includes a bulk encryption algorithm such as DES [1], a cryptographic checksum such as MD5 [13], a key exchange algorithm (such as Diffie-Hellman key exchange) to securely distribute the DES key, and some form of digital signature algorithm to authenticate the parties (e.g., RSA [14]). The encryption and checksum algorithm must be applied to every packet going across a secure link, and therefore the performance of these algorithms directly affects the achievable bandwidth. Furthermore, there are some problems (such as sender authentication in multicast) that require the use of expensive algorithms such as RSA signatures on every packet. The other algorithms only need to be run at connection set-up time, so they only affect the overall bandwidth if the connections are short, the algorithms are particularly expensive, and/or the overhead of using these algorithms on busy servers reduces overall network performance. Thus there are two important performance metrics to consider: overall bandwidth and number of connections per second. A straightforward approach to improving cryptographic performance is to implement cryptographic algorithms in hardware. This approach has been shown to improve cryptographic performance of single algorithms (e.g., DEC has demonstrated a 1 Gbit/sec DES chip [5]). Unfortunately there are several problems with this approach. First, a secure network system requires the efficient implementation of a suite of algorithms, not just DES. Hosts clearly need to be able to run both DES and MD5 efficiently, and servers, at least, need to run them all efficiently. Second, hosts need to implement Internet standards, and standards change. In fact, most Internet security standards are written to allow flexibility in algorithm selection. Third, security","PeriodicalId":174670,"journal":{"name":"Third IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121507803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Performance Of A No-Copy API For Communication","authors":"B. Ahlgren, M. Bjorkman, K. Moldeklev","doi":"10.1109/HPCS.1995.662024","DOIUrl":"https://doi.org/10.1109/HPCS.1995.662024","url":null,"abstract":"We present a so-called no-copy Application Programming Interface (API) for communication. The interface avoids copying when data is transferred between the application and operating system kernel address spaces. The API is an extension to the socket interface for SunOS, and has been implemented on Sun SPARCstations equipped with Fore Systems ATM adapters. \u0000 \u0000Throughput for the no-copy API is 85 Mbit/s for 8K UDP messages, to be compared to 57 Mbit/s for the regular API on the SPARCstation 2. Processing times through the TCP and UDP stacks are reduced by up to 30% for the SPARCstation 2 and by more than 50% for the SPARCstation 10.","PeriodicalId":174670,"journal":{"name":"Third IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122465004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"QoS-Sensitive Protocol Processing In Shared-Memory Multiprocessor Multimedia Servers","authors":"A. Mehra, K. Shin","doi":"10.1109/HPCS.1995.662023","DOIUrl":"https://doi.org/10.1109/HPCS.1995.662023","url":null,"abstract":"The advent of high-speed nrtworks and demand for distributed multimedia applications now requires that the communication subsystems in end hosts (or simply hosts) be designed and implemented to facilitate and provide certain quality-of-service (QoS) guarantees. An application specifies its &OS requirements for each active connection in terms of several parameters such as end-to-end delay, delay jitter, and bandwidth; additional requirements regarding packet loss and in-order delivery can also be specified [l, 21. Additionally, the application may need to specify its traffic cliaracteristics on each connection in order for the host communication subsystem and network to provide the required guarantees. Acceptance of a guaranteed-QoS connection by the network implies a contract between the network and the application that the requirements of the latter will be met as long as the application honors its traffic specifications. Given appropriate support within the network t o establish and maintain such connections, we focus on the problem of maintaining QoS-guarantees within the communication Subsystem on the host’. In particular we consider shared-memory multiprocessor (SMMP) hosts since mediumto large-scale SMMPs are increasingly being employed as multimedia servers and desktop workstations.","PeriodicalId":174670,"journal":{"name":"Third IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122620337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Virtual Topology Embedding On A Network Of Workstations For High-Performance Computing","authors":"B. Yener, Y. Ofek, B. York, M. Yung","doi":"10.1109/HPCS.1995.662028","DOIUrl":"https://doi.org/10.1109/HPCS.1995.662028","url":null,"abstract":"Due to economic incentives and recent technology advances. networks of workstations (NOWs) are gaining prominence as an altemative computing paradigm to supercomputers. In this work, we introduce methods for embedding an arbitrary virrual topology in a NOW. Since a large number of parallel algorithms have been developed for the hypercube and mapped to it cfficicntly, we illustrate our methods with an embedding of a virtual hypercube in a given NOW with minimum dilation (length of a virtual edge) and intcrfercncc (sharing of a physical link).","PeriodicalId":174670,"journal":{"name":"Third IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128635325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}