A hierarchical broadcasting technique in very large arbitrary networks which achieves near optimal cost and time measures is proposed. The network is partitioned into hierarchical clusters which are interconnected with each other through gate nodes. The approach is based on using a fully distributed minimum spanning tree algorithm within the gate-node network while achieving time optimal broadcasting within the local clusters by formulating the problem as finding maximum matching in constrained bipartite graphs. Extensive simulation results are presented which show the tradeoff between the two conflicting performance criteria.<>
{"title":"Hierarchical message dissemination in very large WANs","authors":"S. Chatterjee, M. Bassiouni","doi":"10.1109/LCN.1992.228108","DOIUrl":"https://doi.org/10.1109/LCN.1992.228108","url":null,"abstract":"A hierarchical broadcasting technique in very large arbitrary networks which achieves near optimal cost and time measures is proposed. The network is partitioned into hierarchical clusters which are interconnected with each other through gate nodes. The approach is based on using a fully distributed minimum spanning tree algorithm within the gate-node network while achieving time optimal broadcasting within the local clusters by formulating the problem as finding maximum matching in constrained bipartite graphs. Extensive simulation results are presented which show the tradeoff between the two conflicting performance criteria.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128251312","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}
Four factors in parallel token ring systems which can improve network performance are identified. An analytical model is developed to predict the performance of these systems. The predictions obtained with the analytical model are compared with simulation results. While the current model accurately predicts the performance of networks with 16 or more rings, it is not so accurate at lower numbers of rings. The short/long cycle behavior of the token interarrival times is identified as one cause of the inaccuracies. The benefits and limitations of parallel token ring networks for gigabit speeds are discussed.<>
{"title":"Modeling and analysis of high speed parallel token ring networks","authors":"R. Mukkamala, E. Foudriat, K. Maly, V. Kale","doi":"10.1109/LCN.1992.228136","DOIUrl":"https://doi.org/10.1109/LCN.1992.228136","url":null,"abstract":"Four factors in parallel token ring systems which can improve network performance are identified. An analytical model is developed to predict the performance of these systems. The predictions obtained with the analytical model are compared with simulation results. While the current model accurately predicts the performance of networks with 16 or more rings, it is not so accurate at lower numbers of rings. The short/long cycle behavior of the token interarrival times is identified as one cause of the inaccuracies. The benefits and limitations of parallel token ring networks for gigabit speeds are discussed.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115015470","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 feasibility of using buffered transmission, which has the advantages of eliminating the token passing overhead and relieving the network interface from the complex token handling operations, is considered. The concept of a real-time channel (RTC) and the RTC establishment procedures are reviewed. Its performance is then compared with the FDDI timed token protocol. Simulation results show that the buffered transmission in local area ring networks equipped with real-time channels enhances both the networks' throughput and the ability to support heterogeneous real-time traffic. The implementation of the network interface is also examined with an example design showing the feasibility of real-time channels in high-speed local area networks.<>
{"title":"Real-time communication in local area ring networks","authors":"Q. Zheng, K. Shin","doi":"10.1109/LCN.1992.228106","DOIUrl":"https://doi.org/10.1109/LCN.1992.228106","url":null,"abstract":"The feasibility of using buffered transmission, which has the advantages of eliminating the token passing overhead and relieving the network interface from the complex token handling operations, is considered. The concept of a real-time channel (RTC) and the RTC establishment procedures are reviewed. Its performance is then compared with the FDDI timed token protocol. Simulation results show that the buffered transmission in local area ring networks equipped with real-time channels enhances both the networks' throughput and the ability to support heterogeneous real-time traffic. The implementation of the network interface is also examined with an example design showing the feasibility of real-time channels in high-speed local area networks.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131058849","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}
Stanley F. Ralph, O. Ukrainsky, Robert H. Schellack, L. Weinberg
An alternate path fiber distributed data interface (APFDDI) topology is described. This topology is compared with a definition for computer survivability. Experimental results prove that the topology works. The token flow is described. Control and reconfiguration delay times for the APFDDI are discussed. Many commercial and military applications exist where APFDDI will provide important redundancy not available with other topologies.<>
{"title":"Alternate path FDDI topology","authors":"Stanley F. Ralph, O. Ukrainsky, Robert H. Schellack, L. Weinberg","doi":"10.1109/LCN.1992.228161","DOIUrl":"https://doi.org/10.1109/LCN.1992.228161","url":null,"abstract":"An alternate path fiber distributed data interface (APFDDI) topology is described. This topology is compared with a definition for computer survivability. Experimental results prove that the topology works. The token flow is described. Control and reconfiguration delay times for the APFDDI are discussed. Many commercial and military applications exist where APFDDI will provide important redundancy not available with other topologies.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129823822","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 distributed routing architecture is shown to provide higher performance at lower cost than the hub routing approach. These two techniques are discussed in terms of practical evaluation criteria, including cost, performance, interoperability, scalability, and ease of management.<>
{"title":"Hub routing versus distributed routing","authors":"H. Salwen","doi":"10.1109/LCN.1992.228118","DOIUrl":"https://doi.org/10.1109/LCN.1992.228118","url":null,"abstract":"The distributed routing architecture is shown to provide higher performance at lower cost than the hub routing approach. These two techniques are discussed in terms of practical evaluation criteria, including cost, performance, interoperability, scalability, and ease of management.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116320285","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 feasibility of distributing digitized voice over FDDI using the Xpress Transfer Protocol (XTP) is examined. The requirements of such a system, the role of a communications protocol, and the overall experimental design are studied. A basic configuration is developed to measure the system throughput, latency, and jitter, and from these data the number of voice channels that a given configuration would support is computed. The basic system is then perturbed by adding up to 75 Mb/s of background synchronous load to the FDDI network, and by artificially dropping up to 10% of the transmitted packets to force retransmissions. Whether XTP's reliable transport multicast, which provides a 1-to-m transmission capability, provides a latency reduction when compared to m serial unicasts is investigated. Conclusions regarding the utility of a transport protocol for both single segment and multiple-segment LANs are presented.<>
{"title":"Digitized voice distribution using XTP and FDDI","authors":"A. Weaver, J. F. McNabb","doi":"10.1109/LCN.1992.228156","DOIUrl":"https://doi.org/10.1109/LCN.1992.228156","url":null,"abstract":"The feasibility of distributing digitized voice over FDDI using the Xpress Transfer Protocol (XTP) is examined. The requirements of such a system, the role of a communications protocol, and the overall experimental design are studied. A basic configuration is developed to measure the system throughput, latency, and jitter, and from these data the number of voice channels that a given configuration would support is computed. The basic system is then perturbed by adding up to 75 Mb/s of background synchronous load to the FDDI network, and by artificially dropping up to 10% of the transmitted packets to force retransmissions. Whether XTP's reliable transport multicast, which provides a 1-to-m transmission capability, provides a latency reduction when compared to m serial unicasts is investigated. Conclusions regarding the utility of a transport protocol for both single segment and multiple-segment LANs are presented.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123533721","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 cost of a dedicated fiber access to the B-ISDN is too high for small business and residential customers, necessitating some form of resource sharing. Combining ATM over a passive optical network (APON) with a suitable medium access control (MAC) protocol can provide significant cost savings and a reasonable bandwidth. In this way, this customer section can also enjoy introduction of broadband services at a relatively early stage. The emphasis of the MAC protocol presented is placed on service transparency with an aim to incur minimal changes to the local exchange (LEX) when an APON is attached. Sharing is effected by a reservation-based time division multiple access method.<>
{"title":"A class of MAC protocols for sharing ATM local access PONs","authors":"J. Angelopoulos, I. Venieris, G. Stassinopoulos","doi":"10.1109/LCN.1992.228139","DOIUrl":"https://doi.org/10.1109/LCN.1992.228139","url":null,"abstract":"The cost of a dedicated fiber access to the B-ISDN is too high for small business and residential customers, necessitating some form of resource sharing. Combining ATM over a passive optical network (APON) with a suitable medium access control (MAC) protocol can provide significant cost savings and a reasonable bandwidth. In this way, this customer section can also enjoy introduction of broadband services at a relatively early stage. The emphasis of the MAC protocol presented is placed on service transparency with an aim to incur minimal changes to the local exchange (LEX) when an APON is attached. Sharing is effected by a reservation-based time division multiple access method.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123535264","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 strategy for handling real-time communications under the FieldBus protocol, which provides end-to-end delivery delay guarantees for time-critical messages, is proposed. This strategy provides a fast local mechanism for establishing intraworkcell real-time connections, while supporting global interworkcell real-time connections. The proposed strategy is fully compatible with the current draft proposal of the FieldBus protocol and also provides flexibility for the choice of scheduling algorithms and adaptability for different traffic loads. Numerical examples are given based on a typical manufacturing network.<>
{"title":"Design and evaluation of real-time communication for FieldBus based manufacturing systems","authors":"K. Shin, Chi-Che Chou","doi":"10.1109/LCN.1992.228153","DOIUrl":"https://doi.org/10.1109/LCN.1992.228153","url":null,"abstract":"A strategy for handling real-time communications under the FieldBus protocol, which provides end-to-end delivery delay guarantees for time-critical messages, is proposed. This strategy provides a fast local mechanism for establishing intraworkcell real-time connections, while supporting global interworkcell real-time connections. The proposed strategy is fully compatible with the current draft proposal of the FieldBus protocol and also provides flexibility for the choice of scheduling algorithms and adaptability for different traffic loads. Numerical examples are given based on a typical manufacturing network.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129288377","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}
Higher-speed data transmission over the embedded network of cables, specifically, Category 3 unshielded twisted-pair developed primarily for voice communications, is addressed. To provide robust transmission systems at high data rates for distances of 100 m, bandwidth-efficient encoding schemes utilizing adaptive noise cancellation techniques are required. One such scheme, carrierless AM/PM (CAP), is described.<>
{"title":"A bandwidth-efficient encoding scheme for high-speed data transmission on Category 3 cable","authors":"J. Kadambi, J. Werner","doi":"10.1109/LCN.1992.228163","DOIUrl":"https://doi.org/10.1109/LCN.1992.228163","url":null,"abstract":"Higher-speed data transmission over the embedded network of cables, specifically, Category 3 unshielded twisted-pair developed primarily for voice communications, is addressed. To provide robust transmission systems at high data rates for distances of 100 m, bandwidth-efficient encoding schemes utilizing adaptive noise cancellation techniques are required. One such scheme, carrierless AM/PM (CAP), is described.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"469 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122738309","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}
Issues in multimedia networking over the fiber distributed data interface (FDDI) and simulation results demonstrating the feasibility of multimedia over FDDI are discussed. Previous work in this field has concentrated on the asynchronous channel in FDDI. Other examinations of the FDDI synchronous channel have applied bursty traffic to the synchronous channel. Multimedia traffic is typically stream oriented. The simulations reported were focused on simulating typical configurations with a range of applications and traffic models. The advantages of FDDI as an integrated voice/video data network are demonstrated.<>
{"title":"Multimedia over FDDI","authors":"Amit Shah, Don Staddon, I. Rubin, A. Ratkovic","doi":"10.1109/LCN.1992.228168","DOIUrl":"https://doi.org/10.1109/LCN.1992.228168","url":null,"abstract":"Issues in multimedia networking over the fiber distributed data interface (FDDI) and simulation results demonstrating the feasibility of multimedia over FDDI are discussed. Previous work in this field has concentrated on the asynchronous channel in FDDI. Other examinations of the FDDI synchronous channel have applied bursty traffic to the synchronous channel. Multimedia traffic is typically stream oriented. The simulations reported were focused on simulating typical configurations with a range of applications and traffic models. The advantages of FDDI as an integrated voice/video data network are demonstrated.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122707085","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
扫码关注我们
求助内容：
应助结果提醒方式：