We present an efficient method for the performance evaluation of HIPPI interconnection system implementing a camp-on strategy. The camp-on feature has been defined in the HIPPI standards and implemented in switching designs but no performance analysis results have been published to the best of our knowledge. We model the system with only a fixed number of states. This reduction in the size of the state space has a direct impact on the computational time required. Our new models allow us to analyze the system not only with uniform traffic, but with many other different traffic patterns including uniform traffic, hot-spot traffic, general traffic pattern, locality of reference, etc. Moreover, we compare the performance of the camp-on and drop strategies and demonstrate that the camp-on outperforms the drop strategy.<>
{"title":"Performance evaluation of HIPPI interconnection system using a camp-on strategy","authors":"A. Mazyad, C. Y. Chen","doi":"10.1109/LCN.1994.386619","DOIUrl":"https://doi.org/10.1109/LCN.1994.386619","url":null,"abstract":"We present an efficient method for the performance evaluation of HIPPI interconnection system implementing a camp-on strategy. The camp-on feature has been defined in the HIPPI standards and implemented in switching designs but no performance analysis results have been published to the best of our knowledge. We model the system with only a fixed number of states. This reduction in the size of the state space has a direct impact on the computational time required. Our new models allow us to analyze the system not only with uniform traffic, but with many other different traffic patterns including uniform traffic, hot-spot traffic, general traffic pattern, locality of reference, etc. Moreover, we compare the performance of the camp-on and drop strategies and demonstrate that the camp-on outperforms the drop strategy.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132779163","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}
We implemented an ATM network interface featuring two novel techniques: exposed buffering and subdatagram flow control. Exposed buffering allows applications to send or receive data from buffers shared with the network interface, thereby avoiding the latency of data copying or VM manipulations. Separate buffer areas maintain user privacy. Sub-datagram flow control uses feedback from the receiver to pace datagram transmission in small bursts according to the buffering available and eventual loss detected. This enables higher-level protocols or applications to use large transmission units and better amortize per-packet protocol overheads even if the network has limited buffering and no flow control. Our experiments show that these techniques can considerably improve latency, throughput, and congestion handling in ATM LANs.<>
{"title":"Exposed buffering and sub-datagram flow control for ATM LANs","authors":"J. Brustoloni","doi":"10.1109/LCN.1994.386587","DOIUrl":"https://doi.org/10.1109/LCN.1994.386587","url":null,"abstract":"We implemented an ATM network interface featuring two novel techniques: exposed buffering and subdatagram flow control. Exposed buffering allows applications to send or receive data from buffers shared with the network interface, thereby avoiding the latency of data copying or VM manipulations. Separate buffer areas maintain user privacy. Sub-datagram flow control uses feedback from the receiver to pace datagram transmission in small bursts according to the buffering available and eventual loss detected. This enables higher-level protocols or applications to use large transmission units and better amortize per-packet protocol overheads even if the network has limited buffering and no flow control. Our experiments show that these techniques can considerably improve latency, throughput, and congestion handling in ATM LANs.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121822372","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}
This paper examines the issues involved in the design of conference servers that support multiparty, multimedia conferences. These servers, called multipoint control units (MCUs) in the telephony world, coordinate the distribution of audio, video, and data streams amongst the multiple participants in a videoconference. The MCU is responsible for the processing of video and audio so that a conference participant can hear and see one or more of the other participants in the conference. It is also responsible for handling and forwarding the data streams from the participants. This paper presents different approaches to the design of an MCU to implement these functions. It also describes the design of a related device-a transcoding gateway that enables conferencing between participants using different video/audio equipment.<>
{"title":"On multipoint control units for videoconferencing","authors":"M. Willebeek-LeMair, D. Kandlur, Zon-Yin Shae","doi":"10.1109/LCN.1994.386585","DOIUrl":"https://doi.org/10.1109/LCN.1994.386585","url":null,"abstract":"This paper examines the issues involved in the design of conference servers that support multiparty, multimedia conferences. These servers, called multipoint control units (MCUs) in the telephony world, coordinate the distribution of audio, video, and data streams amongst the multiple participants in a videoconference. The MCU is responsible for the processing of video and audio so that a conference participant can hear and see one or more of the other participants in the conference. It is also responsible for handling and forwarding the data streams from the participants. This paper presents different approaches to the design of an MCU to implement these functions. It also describes the design of a related device-a transcoding gateway that enables conferencing between participants using different video/audio equipment.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121025407","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}
The volume of data transmission required by current software applications utilizing graphical user interfaces, visualization and imaging techniques, and large databases, is taxing, and in some cases, overloading the capabilities of classic local area networks such as Ethernets and token rings. Multimedia applications that will be appearing and maturing in the near future will further exceed the capabilities of these networks. These effects have engendered the development of a number of new local area network protocols that attempt to bring higher throughput capacities to the network user. The behavior and operation of one of these new networks, 100VG-AnyLAN, the 100 megabit per second demand priority protocol proposed by IEEE 802.12, is the subject of this paper. We begin with a short discussion of common existing networks to place 400VG-AnyLAN in context with established networking technologies. The operation of single hub and cascaded hub 100VG-AnyLAN systems is discussed, along with the features of physical layer signalling on voice grade twisted pair cabling. Finally, a summary of the types of real-time and multimedia guarantees that can be provided by the 100VG-AnyLAN system is presented.<>
{"title":"100VG-AnyLAN: network operation and real-time capabilities","authors":"S. Barilovits, J. Kadambi","doi":"10.1109/LCN.1994.386608","DOIUrl":"https://doi.org/10.1109/LCN.1994.386608","url":null,"abstract":"The volume of data transmission required by current software applications utilizing graphical user interfaces, visualization and imaging techniques, and large databases, is taxing, and in some cases, overloading the capabilities of classic local area networks such as Ethernets and token rings. Multimedia applications that will be appearing and maturing in the near future will further exceed the capabilities of these networks. These effects have engendered the development of a number of new local area network protocols that attempt to bring higher throughput capacities to the network user. The behavior and operation of one of these new networks, 100VG-AnyLAN, the 100 megabit per second demand priority protocol proposed by IEEE 802.12, is the subject of this paper. We begin with a short discussion of common existing networks to place 400VG-AnyLAN in context with established networking technologies. The operation of single hub and cascaded hub 100VG-AnyLAN systems is discussed, along with the features of physical layer signalling on voice grade twisted pair cabling. Finally, a summary of the types of real-time and multimedia guarantees that can be provided by the 100VG-AnyLAN system is presented.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115083598","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}
A growing challenge in the transition of telecommunications provisioning systems from a closed architecture to a distributed open architecture is the need for effective system management tools that encompass not only network management, but also application management functionality. Networking the various provisioning system components resulted in a heterogeneous multivendor environment. At the time, the lack of industry standards in the communications as well as the systems management area gave rise to the development of proprietary communications protocols and network management solutions. This paper concentrates on the analysis of a proprietary total management system (TMS) designed to combine applications and network monitoring in a heterogeneous provisioning system environment. Bellcore's long-term strategic direction is towards implementing the open system interconnection (OSI) management standards model to provide a consistent management environment within provisioning systems. We discuss the transition strategy and an approach to integrating OSI defined CMIP/CMISE management protocols, the TCP/IP defined SNMP protocol and proprietary legacy network management systems to produce an open architecture total management system to complement our open architecture provisioning system strategy. We highlight our main point that neither network management nor application management alone is sufficient. However, the judicious combination of the two yields an unbeatable total management system solution.<>
{"title":"Total systems management in open architecture provisioning systems","authors":"L. E. Heindel, K. J. Schlieber","doi":"10.1109/LCN.1994.386579","DOIUrl":"https://doi.org/10.1109/LCN.1994.386579","url":null,"abstract":"A growing challenge in the transition of telecommunications provisioning systems from a closed architecture to a distributed open architecture is the need for effective system management tools that encompass not only network management, but also application management functionality. Networking the various provisioning system components resulted in a heterogeneous multivendor environment. At the time, the lack of industry standards in the communications as well as the systems management area gave rise to the development of proprietary communications protocols and network management solutions. This paper concentrates on the analysis of a proprietary total management system (TMS) designed to combine applications and network monitoring in a heterogeneous provisioning system environment. Bellcore's long-term strategic direction is towards implementing the open system interconnection (OSI) management standards model to provide a consistent management environment within provisioning systems. We discuss the transition strategy and an approach to integrating OSI defined CMIP/CMISE management protocols, the TCP/IP defined SNMP protocol and proprietary legacy network management systems to produce an open architecture total management system to complement our open architecture provisioning system strategy. We highlight our main point that neither network management nor application management alone is sufficient. However, the judicious combination of the two yields an unbeatable total management system solution.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115886370","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}
Most research on network management concentrates on technical issues. We discuss the possibility of using a network management system as an integrated environment for capacity planning of local area networks. The paper gives an overview of network management systems and relevance to capacity planning, and this also looks into the capabilities of the current network management frameworks of Internet and OSI and their suitability for the capacity planning task.<>
{"title":"Capacity planning of LAN using network management","authors":"S. Jha, B. Howarth","doi":"10.1109/LCN.1994.386577","DOIUrl":"https://doi.org/10.1109/LCN.1994.386577","url":null,"abstract":"Most research on network management concentrates on technical issues. We discuss the possibility of using a network management system as an integrated environment for capacity planning of local area networks. The paper gives an overview of network management systems and relevance to capacity planning, and this also looks into the capabilities of the current network management frameworks of Internet and OSI and their suitability for the capacity planning task.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"610 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117336217","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}
In this paper we explore the packet starvation effect (PSE) that occurs in Ethernet controllers due to the unfairness of the CSMA/CD algorithm. The PSE causes some packets to experience latencies up to 100 times the average or to completely starve out due to 16 collisions. The PSE causes some packets to experience high delays at realistic offered loads as low as 40% and causes complete starvation of some packets at offered loads as low as 60%. The PSE makes CSMA/CD LANs unsuitable for real-time traffic except at offered loads much less than 100%. It is the limiting factor in the usable bandwidth of the bus. As an alternative to CSMA/CD, we present the fair dual distributed queue (FDDQ) algorithm. Under high load, FDDQ uses a single reservation mini-dot per packet and a tree-based collision resolution algorithm (CRA) to maintain two distributed queues of waiting senders. This provides two priority FCFS access to the network. FDDQ provides utilizations and average latencies very similar to those of CSMA/CD but is fair even at extremely high offered loads. The protocol is stable for a constant number of senders, is simple enough to be practical, should be implementable in firmware, and completely eliminates the PSE.<>
{"title":"The packet starvation effect in CSMA/CD LANs and a solution","authors":"B. Whetten, S. Steinberg, D. Ferrari","doi":"10.1109/LCN.1994.386599","DOIUrl":"https://doi.org/10.1109/LCN.1994.386599","url":null,"abstract":"In this paper we explore the packet starvation effect (PSE) that occurs in Ethernet controllers due to the unfairness of the CSMA/CD algorithm. The PSE causes some packets to experience latencies up to 100 times the average or to completely starve out due to 16 collisions. The PSE causes some packets to experience high delays at realistic offered loads as low as 40% and causes complete starvation of some packets at offered loads as low as 60%. The PSE makes CSMA/CD LANs unsuitable for real-time traffic except at offered loads much less than 100%. It is the limiting factor in the usable bandwidth of the bus. As an alternative to CSMA/CD, we present the fair dual distributed queue (FDDQ) algorithm. Under high load, FDDQ uses a single reservation mini-dot per packet and a tree-based collision resolution algorithm (CRA) to maintain two distributed queues of waiting senders. This provides two priority FCFS access to the network. FDDQ provides utilizations and average latencies very similar to those of CSMA/CD but is fair even at extremely high offered loads. The protocol is stable for a constant number of senders, is simple enough to be practical, should be implementable in firmware, and completely eliminates the PSE.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117289876","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}
In B-ISDN, a policing function such as usage parameter control (UPC) is mandatory to constraint the cell flow of a new connection to respect its contract. The case of a user accessing B-ISDN via a DQDB metropolitan area network (MAN) is considered. One assumes that this user generates a variable bit rate (VBR) traffic towards the user network interface (UNI). We investigate the influence of the internal DQDB traffic on the time structure of this VBR cell flow when it enters the DQDB/B-ISDN gateway. We then consider two UPC functions which are the leaky bucket and the spacer-controller to police the VBR connection. The efficiency of each of these two UPC mechanisms is evaluated in terms of the cell delay variation and dynamics. The influence of several source parameters such as the mean bit rate, the peak bit rate and the burstiness on UPC efficiency is investigated.<>
{"title":"Comparison of UPC mechanisms in a DQDB/B-ISDN gateway","authors":"M. Gagnaire, A. Thelen","doi":"10.1109/LCN.1994.386609","DOIUrl":"https://doi.org/10.1109/LCN.1994.386609","url":null,"abstract":"In B-ISDN, a policing function such as usage parameter control (UPC) is mandatory to constraint the cell flow of a new connection to respect its contract. The case of a user accessing B-ISDN via a DQDB metropolitan area network (MAN) is considered. One assumes that this user generates a variable bit rate (VBR) traffic towards the user network interface (UNI). We investigate the influence of the internal DQDB traffic on the time structure of this VBR cell flow when it enters the DQDB/B-ISDN gateway. We then consider two UPC functions which are the leaky bucket and the spacer-controller to police the VBR connection. The efficiency of each of these two UPC mechanisms is evaluated in terms of the cell delay variation and dynamics. The influence of several source parameters such as the mean bit rate, the peak bit rate and the burstiness on UPC efficiency is investigated.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123214091","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}
The authors deal with the problem of the information exchange between processes in extended fieldbus systems. As is known, although most of the traffic in these systems is within a single bus, there is always a certain amount transiting from one fieldbus to another, often covering a certain distance. There is therefore the problem of finding ways to interconnect the various fieldbuses in such a way as to meet the time constraints imposed by the applications. The paper proposes and then assesses a way of interconnecting even a large number of fieldbuses, introducing delays which are compatible with process control requirements.<>
{"title":"Exploiting FDDI communication features to connect FieldBuses in process control environment","authors":"S. Cavalieri, A. Stefano, O. Mirabella","doi":"10.1109/LCN.1994.386615","DOIUrl":"https://doi.org/10.1109/LCN.1994.386615","url":null,"abstract":"The authors deal with the problem of the information exchange between processes in extended fieldbus systems. As is known, although most of the traffic in these systems is within a single bus, there is always a certain amount transiting from one fieldbus to another, often covering a certain distance. There is therefore the problem of finding ways to interconnect the various fieldbuses in such a way as to meet the time constraints imposed by the applications. The paper proposes and then assesses a way of interconnecting even a large number of fieldbuses, introducing delays which are compatible with process control requirements.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116752958","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}
We study the throughput characteristics of a FDDI workstation cluster installed at the University of Paderborn. We compare theoretical results to the performance really available to the user at the service access point to TCP and UDP. Furthermore, we compare the performance for two difficult operating systems: we consider the SUN-OS based on BSD and the new Solaris 2.3 developed for multiprocessor environments. The measurement results showed a maximum throughput of less than 60 Mbps which is still considerably less than the bandwidth promised by FDDI vendors. Moreover, it becomes clear that high throughput absolutely requires the transmission of large frames. We also briefly address the current discussion on higher speed LANs within IEEE 802.<>
{"title":"Measurements in a FDDI workstation cluster","authors":"R. Wittenberg, P. Martini","doi":"10.1109/LCN.1994.386616","DOIUrl":"https://doi.org/10.1109/LCN.1994.386616","url":null,"abstract":"We study the throughput characteristics of a FDDI workstation cluster installed at the University of Paderborn. We compare theoretical results to the performance really available to the user at the service access point to TCP and UDP. Furthermore, we compare the performance for two difficult operating systems: we consider the SUN-OS based on BSD and the new Solaris 2.3 developed for multiprocessor environments. The measurement results showed a maximum throughput of less than 60 Mbps which is still considerably less than the bandwidth promised by FDDI vendors. Moreover, it becomes clear that high throughput absolutely requires the transmission of large frames. We also briefly address the current discussion on higher speed LANs within IEEE 802.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123866681","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：