We investigate the fault-tolerance issue of networking and propose a layered solution to it. By evaluating the performance of fault-handling schemes at each layer of a protocol stack, we can find a set of fault-handling schemes whose combined performance will guarantee the required end-to-end delay bound for real-time communication services while maintaining a certain level of fault-tolerance. The Survivable Adaptable Fiber Embedded Network (SAFENET) is used as the main vehicle of this study.<>
{"title":"A layered approach to fault-tolerance and timeliness issues in SAFENET","authors":"K. Shin, Lup-Houh Ng, T. Monaghan","doi":"10.1109/LCN.1994.386605","DOIUrl":"https://doi.org/10.1109/LCN.1994.386605","url":null,"abstract":"We investigate the fault-tolerance issue of networking and propose a layered solution to it. By evaluating the performance of fault-handling schemes at each layer of a protocol stack, we can find a set of fault-handling schemes whose combined performance will guarantee the required end-to-end delay bound for real-time communication services while maintaining a certain level of fault-tolerance. The Survivable Adaptable Fiber Embedded Network (SAFENET) is used as the main vehicle of this study.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"27 1 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":"115771007","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}
W. J. Cronin, J. Hutchison, K. Ramakrishnan, Henry S. Yang
Ethernet at 10 Mb/s and other legacy LANs such as 4 and 16 Mb/s Token Ring have matured and proliferated widely over the last decade. Now, applications have started to exceed the capabilities of these low speed LANs. A new generation of high speed networks are being deployed to meet with increasing expectations of users. This paper compares four such high speed LANs which operate at or above 100 Mb/s: 100BASE-T, 100VG-AnyLAN, FDDI and ATM. The attributes and performance of these four LANs are described and contrasted. The implications of migration to these new technologies are discussed.<>
{"title":"A comparison of high speed LANs","authors":"W. J. Cronin, J. Hutchison, K. Ramakrishnan, Henry S. Yang","doi":"10.1109/LCN.1994.386617","DOIUrl":"https://doi.org/10.1109/LCN.1994.386617","url":null,"abstract":"Ethernet at 10 Mb/s and other legacy LANs such as 4 and 16 Mb/s Token Ring have matured and proliferated widely over the last decade. Now, applications have started to exceed the capabilities of these low speed LANs. A new generation of high speed networks are being deployed to meet with increasing expectations of users. This paper compares four such high speed LANs which operate at or above 100 Mb/s: 100BASE-T, 100VG-AnyLAN, FDDI and ATM. The attributes and performance of these four LANs are described and contrasted. The implications of migration to these new technologies are discussed.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"23 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":"129879992","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}
Enterprise serving with client-server as the underlying computing paradigm has become the computing model for organizations. In enterprise serving, an interconnected set of specialized and heterogeneous servers provide the computational and storage needs of client workstations, all in a transparent fashion. Asynchronous transfer mode (ATM) has the promise of capturing the total network upon which enterprise serving operates. That is, ATM can be deployed from the workstation all the way to the server. Current servers are not designed for handling high bandwidth multimedia traffic and effectively delivering the high bandwidth of the ATM network to the processor boards where applications reside. It is feasible that extending ATM into the server as the interconnect fabric and communication architecture will be a solution. This solution is further analyzed and simulation results are reported.<>
{"title":"Moving ATM closer to multimedia applications","authors":"R. Rooholamini, V. Cherkassky","doi":"10.1109/LCN.1994.386592","DOIUrl":"https://doi.org/10.1109/LCN.1994.386592","url":null,"abstract":"Enterprise serving with client-server as the underlying computing paradigm has become the computing model for organizations. In enterprise serving, an interconnected set of specialized and heterogeneous servers provide the computational and storage needs of client workstations, all in a transparent fashion. Asynchronous transfer mode (ATM) has the promise of capturing the total network upon which enterprise serving operates. That is, ATM can be deployed from the workstation all the way to the server. Current servers are not designed for handling high bandwidth multimedia traffic and effectively delivering the high bandwidth of the ATM network to the processor boards where applications reside. It is feasible that extending ATM into the server as the interconnect fabric and communication architecture will be a solution. This solution is further analyzed and simulation results are reported.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"35 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":"122823987","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 describes a rapid protocol development approach that enables protocol verification through the design and development stages. Feedback from verification analysis can be very useful to protocol designers, but it is often difficult to stay current with the protocol's development. Our approach facilitates quick turnaround in the development and verification process-even before the protocol is stable. American National Standards Committee X3T9.3 has chartered the development of Fibre Channel (FC), a proposed standard for serial I/O channel capable of supporting a wide range of zipper layer protocols. Despite the complexity of FC, we have used our approach to both verify it and to produce a software and hardware implementation of the protocol. We describe features that enable rapid turnaround in response to revisions of the standard and maintenance of a stable suite of test cases for the standard. The approach has also been applied to other protocols.<>
{"title":"An approach for rapid protocol development: experiences with the proposed Fibre Channel Standard","authors":"A. Leff, K. B. Ocheltree, Tuchih Tsai","doi":"10.1109/LCN.1994.386618","DOIUrl":"https://doi.org/10.1109/LCN.1994.386618","url":null,"abstract":"This paper describes a rapid protocol development approach that enables protocol verification through the design and development stages. Feedback from verification analysis can be very useful to protocol designers, but it is often difficult to stay current with the protocol's development. Our approach facilitates quick turnaround in the development and verification process-even before the protocol is stable. American National Standards Committee X3T9.3 has chartered the development of Fibre Channel (FC), a proposed standard for serial I/O channel capable of supporting a wide range of zipper layer protocols. Despite the complexity of FC, we have used our approach to both verify it and to produce a software and hardware implementation of the protocol. We describe features that enable rapid turnaround in response to revisions of the standard and maintenance of a stable suite of test cases for the standard. The approach has also been applied to other protocols.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"96 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":"126295279","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 queueing model with two finite-size buffers, a single constant rate server using a serving strategy based on buffer thresholds is studied. Exact relationships for buffer size, overflow probabilities, and queueing delay are obtained. The queueing model is very general, and an application in ATM switching is described. The results are presented in-graphs that are useful in selecting a threshold pair that satisfies certain constraints on delay and cell loss.<>
{"title":"Analysis of a threshold priority queueing system with applications to ATM","authors":"A. Battou, G. Nguyen","doi":"10.1109/LCN.1994.386590","DOIUrl":"https://doi.org/10.1109/LCN.1994.386590","url":null,"abstract":"A queueing model with two finite-size buffers, a single constant rate server using a serving strategy based on buffer thresholds is studied. Exact relationships for buffer size, overflow probabilities, and queueing delay are obtained. The queueing model is very general, and an application in ATM switching is described. The results are presented in-graphs that are useful in selecting a threshold pair that satisfies certain constraints on delay and cell loss.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"279 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":"123307934","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 describes, simulates and compares a four segment CSMA/CD network and a four segment CSMA/CD network interconnected by FDDI. We evaluate the performance of an FDDI network under varying load and changing topographical conditions and compare the results to the original CSMA/CD network. The objective of the paper is to study the performance benefits of the migration using simulation, to determine if stated FDDI performance objectives can be met with the existing equipment, and to discuss implementation issues.<>
{"title":"A simulation study of the migration from a CSMA/CD network to FDDI","authors":"Steven G. Popovich, Mansoor Alam","doi":"10.1109/LCN.1994.386613","DOIUrl":"https://doi.org/10.1109/LCN.1994.386613","url":null,"abstract":"This paper describes, simulates and compares a four segment CSMA/CD network and a four segment CSMA/CD network interconnected by FDDI. We evaluate the performance of an FDDI network under varying load and changing topographical conditions and compare the results to the original CSMA/CD network. The objective of the paper is to study the performance benefits of the migration using simulation, to determine if stated FDDI performance objectives can be met with the existing equipment, and to discuss implementation issues.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"83 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":"116734521","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 new MAC layer protocol, DQRAP (distributed queueing random access protocol), provides performance with respect to throughput and delay that approaches that of an ideal protocol. The paper introduces PDQRAP, a prioritized version of DQRAP. Two formats, the extra-bit and the extra-slot, each a variation of the basic DQRAP are described. Simulation results are presented that show that under a total traffic load of 90%, a high priority segment of 20%-30% in either format has delay characteristics ranging from one-third to one-half of the delay characteristics of the normal priority traffic. The relative advantages and disadvantages of each format ore discussed. It is suggested that PDQRAP could be the mechanism that allowed a shared medium to economically transport traffic associated with multi-media services utilizing LANs, MANs, and WANs.<>
{"title":"PDQRAP-prioritized distributed queueing random access protocol","authors":"H. Lin, G. Campbell","doi":"10.1109/LCN.1994.386612","DOIUrl":"https://doi.org/10.1109/LCN.1994.386612","url":null,"abstract":"A new MAC layer protocol, DQRAP (distributed queueing random access protocol), provides performance with respect to throughput and delay that approaches that of an ideal protocol. The paper introduces PDQRAP, a prioritized version of DQRAP. Two formats, the extra-bit and the extra-slot, each a variation of the basic DQRAP are described. Simulation results are presented that show that under a total traffic load of 90%, a high priority segment of 20%-30% in either format has delay characteristics ranging from one-third to one-half of the delay characteristics of the normal priority traffic. The relative advantages and disadvantages of each format ore discussed. It is suggested that PDQRAP could be the mechanism that allowed a shared medium to economically transport traffic associated with multi-media services utilizing LANs, MANs, and WANs.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"18 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":"115209104","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 the bandwidth assignment criteria, well suited in ATM LANs environments, have been extensively examined. In particular. After a discussion of the various schemes, we analyzed the bandwidth advertising criterion both by analytical methods and simulation. The cell loss and packet loss probability have been evaluated as a function of the usual network parameters (number of users, packet length, burstiness, etc.), pointing out that the gain factor of the network (i.e., the number of multiplexed sources given the quality of service) is directly proportional to the source burstiness. This intuitive result can be efficiently exploited in ATM LAN environments, where, it is supposed that a significative portion of traffic comes from bursty users.<>
{"title":"Bandwidth management for ATM-based LANs","authors":"P. Camarda, V. Signore","doi":"10.1109/LCN.1994.386586","DOIUrl":"https://doi.org/10.1109/LCN.1994.386586","url":null,"abstract":"In this paper the bandwidth assignment criteria, well suited in ATM LANs environments, have been extensively examined. In particular. After a discussion of the various schemes, we analyzed the bandwidth advertising criterion both by analytical methods and simulation. The cell loss and packet loss probability have been evaluated as a function of the usual network parameters (number of users, packet length, burstiness, etc.), pointing out that the gain factor of the network (i.e., the number of multiplexed sources given the quality of service) is directly proportional to the source burstiness. This intuitive result can be efficiently exploited in ATM LAN environments, where, it is supposed that a significative portion of traffic comes from bursty users.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"1 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":"129515781","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}
Traffic shaping is important in ATM networks, especially those that are interconnected or provide service guarantees. We examine what shaping may be considered ideal, and what is attainable under the constraints of transmission systems and cost. We justify the use of FCFS multiplexing of multiple single-stream shaper outputs as a performance reference for multi-stream shapers, but also point out some of its deficiencies. Shaper implementations in which transmissions are scheduled on cell arrivals, emissions, and transmissions are examined and compared both qualitatively and through simulation. We identify the problem of shaping cells that must conform to multiple traffic constraints (e.g. when the rate of a multicast connection must be adapted to suit multiple links) and examine implementations to achieve this. Shaping in which inevitable cell delay variation is intentionally distributed inequitably amongst connections (to assist CDV-intolerant connections) is also examined.<>
{"title":"Implementing traffic shaping","authors":"T. Moors, N. Clarke, G. Mercankosk","doi":"10.1109/LCN.1994.386589","DOIUrl":"https://doi.org/10.1109/LCN.1994.386589","url":null,"abstract":"Traffic shaping is important in ATM networks, especially those that are interconnected or provide service guarantees. We examine what shaping may be considered ideal, and what is attainable under the constraints of transmission systems and cost. We justify the use of FCFS multiplexing of multiple single-stream shaper outputs as a performance reference for multi-stream shapers, but also point out some of its deficiencies. Shaper implementations in which transmissions are scheduled on cell arrivals, emissions, and transmissions are examined and compared both qualitatively and through simulation. We identify the problem of shaping cells that must conform to multiple traffic constraints (e.g. when the rate of a multicast connection must be adapted to suit multiple links) and examine implementations to achieve this. Shaping in which inevitable cell delay variation is intentionally distributed inequitably amongst connections (to assist CDV-intolerant connections) is also examined.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"52 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":"126724630","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}
CATV networks are targeted to provide multimedia services to the home. This paper presents a simulation model aimed at evaluating the capacity of CATV networks. The model is based on the user profile, the service discipline and the CATV bandwidth. The issues addressed include the number of users supported by a single broadcast CATV-tree, the probability of accepting a request for multimedia service, and the number of users served over a period of time.<>
{"title":"Multimedia delivery on demand: capacity analysis and implications","authors":"J. Nussbaumer, B. Patel, F. Schaffa","doi":"10.1109/LCN.1994.386582","DOIUrl":"https://doi.org/10.1109/LCN.1994.386582","url":null,"abstract":"CATV networks are targeted to provide multimedia services to the home. This paper presents a simulation model aimed at evaluating the capacity of CATV networks. The model is based on the user profile, the service discipline and the CATV bandwidth. The issues addressed include the number of users supported by a single broadcast CATV-tree, the probability of accepting a request for multimedia service, and the number of users served over a period of time.<<ETX>>","PeriodicalId":270137,"journal":{"name":"Proceedings of 19th Conference on Local Computer Networks","volume":"122 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":"121731293","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
扫码关注我们
求助内容：
应助结果提醒方式：