An implementation of a security protocol in an extended LAN environment is described. The protocol has a hierarchical architecture. At the first level, the session key is disposed of, in the second level there are the master keys, and at the highest level there are the public and private key of the manager and the CryptoNet's keys. The relations between them, the right time to do the keys' renewal, and the appropriate form in which to do it are also characteristics that make it possible to obtain security based on two very well known algorithms such as the DES and RSA.<>
{"title":"A cryptographic protocol to obtain secure communications in extended Ethernet environment","authors":"X. Simón, J. L. Melús-Moreno, F. Recacha","doi":"10.1109/LCN.1992.228124","DOIUrl":"https://doi.org/10.1109/LCN.1992.228124","url":null,"abstract":"An implementation of a security protocol in an extended LAN environment is described. The protocol has a hierarchical architecture. At the first level, the session key is disposed of, in the second level there are the master keys, and at the highest level there are the public and private key of the manager and the CryptoNet's keys. The relations between them, the right time to do the keys' renewal, and the appropriate form in which to do it are also characteristics that make it possible to obtain security based on two very well known algorithms such as the DES and RSA.<<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":"116444159","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}
As a media access control (MAC) protocol for integrated services on a high-speed LAN, the distributed priority change (DPC) protocol is proposed. DPC supports synchronous voice/video service and asynchronous data service. To support synchronous service, it is necessary to guarantee periodic access to the network with a small delay variation. This requirement is met by alternating between the synchronous mode and the asynchronous mode. In DPC, there is not central controller and there is no special bit in the token for reservation to realize fair asynchronous data transmission. Performance comparisons with other token ring protocols are presented. It is shown that DPC can achieve higher maximum throughput than other priority protocols using a central controller. DPC can transmit long size data more effectively than the timed token protocol used in FDDI.<>
{"title":"An integrated video/voice/data protocol using distributed priority change","authors":"T. Yoneda, Y. Matsushita","doi":"10.1109/LCN.1992.228146","DOIUrl":"https://doi.org/10.1109/LCN.1992.228146","url":null,"abstract":"As a media access control (MAC) protocol for integrated services on a high-speed LAN, the distributed priority change (DPC) protocol is proposed. DPC supports synchronous voice/video service and asynchronous data service. To support synchronous service, it is necessary to guarantee periodic access to the network with a small delay variation. This requirement is met by alternating between the synchronous mode and the asynchronous mode. In DPC, there is not central controller and there is no special bit in the token for reservation to realize fair asynchronous data transmission. Performance comparisons with other token ring protocols are presented. It is shown that DPC can achieve higher maximum throughput than other priority protocols using a central controller. DPC can transmit long size data more effectively than the timed token protocol used in FDDI.<<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":"125929626","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}
B. Patel, Antonio Ruiz, F. Schaffa, M. Willebeek-LeMair
A mechanism is required which prevents the initiation of the claim process and maintains a constant ring latency during the insertion and removal of stations into the ring. Such a mechanism, graceful insertion and removal, is described. The mechanism is designed to support the graceful insertion and removal of stations into the M-ports of concentrators and requires no hardware modification of the endstations.<>
{"title":"Graceful insertion and removal approaches for FDDI-II","authors":"B. Patel, Antonio Ruiz, F. Schaffa, M. Willebeek-LeMair","doi":"10.1109/LCN.1992.228166","DOIUrl":"https://doi.org/10.1109/LCN.1992.228166","url":null,"abstract":"A mechanism is required which prevents the initiation of the claim process and maintains a constant ring latency during the insertion and removal of stations into the ring. Such a mechanism, graceful insertion and removal, is described. The mechanism is designed to support the graceful insertion and removal of stations into the M-ports of concentrators and requires no hardware modification of the endstations.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"28 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":"128129072","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}
It is demonstrated that an effective 800-Mb LAN can be built from HIPPI-SC switches, at a cost that is reasonable for large systems. The limitations of HIPPI cables can be overcome by the use of fiber optic extenders. With a standard for address resolution and the addition of an ARP server to the LAN and gateways to conventional networks, one can have a LAN that is fully equivalent to networks known today, but with geometrically increased throughput and exponentially increased bandwidth.<>
{"title":"Building a practical HIPPI LAN","authors":"J. Renwick","doi":"10.1109/LCN.1992.228113","DOIUrl":"https://doi.org/10.1109/LCN.1992.228113","url":null,"abstract":"It is demonstrated that an effective 800-Mb LAN can be built from HIPPI-SC switches, at a cost that is reasonable for large systems. The limitations of HIPPI cables can be overcome by the use of fiber optic extenders. With a standard for address resolution and the addition of an ARP server to the LAN and gateways to conventional networks, one can have a LAN that is fully equivalent to networks known today, but with geometrically increased throughput and exponentially increased bandwidth.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"9 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":"132111076","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 ring networks using multiple tokens is defined. The tokens are released either at their sources or at their destination nodes, depending on bandwidth availability and frame lengths. This results in greater bandwidth availability and reduced access delays, as confirmed by simulation results. The protocol is shown to outperform several other popular protocols, like the token ring with early token release, e.g. FDDI, the slotted ring, and DQDB. This performance superiority is shown to hold over almost the entire range of traffic loads, with different network spans and different values of average packet lengths.<>
{"title":"A partial-destination-release strategy for the multi-token ring protocol","authors":"May-Yew Wee, A. Kamal","doi":"10.1109/LCN.1992.228134","DOIUrl":"https://doi.org/10.1109/LCN.1992.228134","url":null,"abstract":"A strategy for ring networks using multiple tokens is defined. The tokens are released either at their sources or at their destination nodes, depending on bandwidth availability and frame lengths. This results in greater bandwidth availability and reduced access delays, as confirmed by simulation results. The protocol is shown to outperform several other popular protocols, like the token ring with early token release, e.g. FDDI, the slotted ring, and DQDB. This performance superiority is shown to hold over almost the entire range of traffic loads, with different network spans and different values of average packet lengths.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"59 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":"134401482","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}
Recent developments in real-time communications in local-area networks are reviewed. Issues relating to the transmission of both synchronous and asynchronous messages are examined. Priority-driven protocols, global reservation protocols, and protocols with bounded access times are discussed.<>
{"title":"Advances in hard real-time communication with local area networks","authors":"Nicholas Malcolm, Wei Zhao","doi":"10.1109/LCN.1992.228144","DOIUrl":"https://doi.org/10.1109/LCN.1992.228144","url":null,"abstract":"Recent developments in real-time communications in local-area networks are reviewed. Issues relating to the transmission of both synchronous and asynchronous messages are examined. Priority-driven protocols, global reservation protocols, and protocols with bounded access times are discussed.<<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":"133250917","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 queued-arbitrated (QA) protocol of the distributed queue dual bus (DQDB) has several drawbacks, such as unfairness of access opportunities and inefficiency of priority scheme in the multipriority environment. A modified version of the basic distributed queuing algorithm is presented to solve these problems. Simulation results indicate that the proposed strategy provides fairer access opportunities as well as more efficient priority transmissions compared to the current algorithm.<>
{"title":"A modified QA (queued arbitrated) protocol for improving performances in DQDB MAN","authors":"Su-yeon Kim, Jung-Bong Suk, Ki-Jun Han","doi":"10.1109/LCN.1992.228172","DOIUrl":"https://doi.org/10.1109/LCN.1992.228172","url":null,"abstract":"The queued-arbitrated (QA) protocol of the distributed queue dual bus (DQDB) has several drawbacks, such as unfairness of access opportunities and inefficiency of priority scheme in the multipriority environment. A modified version of the basic distributed queuing algorithm is presented to solve these problems. Simulation results indicate that the proposed strategy provides fairer access opportunities as well as more efficient priority transmissions compared to the current algorithm.<<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":"131161550","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 probabilistic model for quality of service available to users for communication via packet-switched public data networks is presented. The concepts of network reliability, availability and congestion are discussed. It is shown that network congestion appears as a loss of availability with regard to data communication services provided to network users, and therefore the quality of service depends not only on equipment reliability and maintenance activity, but also on the congestion probability. After defining the network equivalent availability, a probabilistic model for its evaluation is presented. New concepts are introduced for network equivalent availability evaluation; they consider network component reliability, their maintainability, and the network congestion together.<>
{"title":"Probabilistic model for quality of service modelling in packet-switched data networks","authors":"I. Popescu, E. Staicut","doi":"10.1109/LCN.1992.228128","DOIUrl":"https://doi.org/10.1109/LCN.1992.228128","url":null,"abstract":"A probabilistic model for quality of service available to users for communication via packet-switched public data networks is presented. The concepts of network reliability, availability and congestion are discussed. It is shown that network congestion appears as a loss of availability with regard to data communication services provided to network users, and therefore the quality of service depends not only on equipment reliability and maintenance activity, but also on the congestion probability. After defining the network equivalent availability, a probabilistic model for its evaluation is presented. New concepts are introduced for network equivalent availability evaluation; they consider network component reliability, their maintainability, and the network congestion together.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"120 12 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":"122690868","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 network-level abstraction called phi -channel that supports the requirements of real-time applications is proposed. A phi -channel represents a simplex, end-to-end communication channel between a source and a destination. The channel is characterized by a set of specific performance parameters associated with its traffic, namely packet maximum end-to-end delay and the maximum number of packets that can be sent over that delay. The primary attribute supported by the phi -channel is on-time reliability. The basic scheme used to verify the feasibility of accepting a phi -channel, and the run-time support to guarantee its performance are described. The results of a simulation experiment implementing the basic functionalities of the proposed scheme are presented.<>
{"title":"A network level fractional channel to support guaranteed real-time communication","authors":"T. Znati, Brian Field","doi":"10.1109/LCN.1992.228104","DOIUrl":"https://doi.org/10.1109/LCN.1992.228104","url":null,"abstract":"A network-level abstraction called phi -channel that supports the requirements of real-time applications is proposed. A phi -channel represents a simplex, end-to-end communication channel between a source and a destination. The channel is characterized by a set of specific performance parameters associated with its traffic, namely packet maximum end-to-end delay and the maximum number of packets that can be sent over that delay. The primary attribute supported by the phi -channel is on-time reliability. The basic scheme used to verify the feasibility of accepting a phi -channel, and the run-time support to guarantee its performance are described. The results of a simulation experiment implementing the basic functionalities of the proposed scheme are presented.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"39 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":"125897575","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 performance of interconnected distributed-queue dual-bus (DQDB) networks is studied while the Manhattan street network (MSN) is being used as the backbone architecture with neural brouters as its nodes. It is interesting to note that, since the MSN topology is logically equivalent to a multichannel ring network, it may be easily adapted to operate as a token ring-of course, with multiple tokens-or token mesh network at heavy load conditions. Relevant performance measures using both an analytical method and simulation are also included.<>
{"title":"Neural brouter for network interconnections: MS-net interconnects DQDB-nets","authors":"B. Khasnabish","doi":"10.1109/LCN.1992.228107","DOIUrl":"https://doi.org/10.1109/LCN.1992.228107","url":null,"abstract":"The performance of interconnected distributed-queue dual-bus (DQDB) networks is studied while the Manhattan street network (MSN) is being used as the backbone architecture with neural brouters as its nodes. It is interesting to note that, since the MSN topology is logically equivalent to a multichannel ring network, it may be easily adapted to operate as a token ring-of course, with multiple tokens-or token mesh network at heavy load conditions. Relevant performance measures using both an analytical method and simulation are also included.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"56 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":"116670261","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
扫码关注我们
求助内容：
应助结果提醒方式：