The register insertion bus (RIB) access scheme, a protocol that uses a folded-bus topology such as in C-NET and D-Net but reduces overhead by using an approach similar to that used in the interface of the register insertion ring, is described. The protocol uses stations containing two buffers that allow packets in the network to be temporarily stored to avoid conflicts. Performance results based on analysis and simulation are presented. Results show the access scheme to utilize the network efficiently without requiring the overhead associated with a train-type protocol. The protocol is scalable in both transmission speed and packet length. An increase in transmission speed will result in a proportional increase in performance. This protocol serves as the basis for a protocol that uses information gathered from the network to provide a fair distributed access scheme for all loads. The control is based on incrementally increasing or decreasing the time between transmissions based on the measured network load.<>
{"title":"RIB: a register insertion bus fiber optical local area network","authors":"J. M. Ott, A. Jayasumana","doi":"10.1109/LCN.1992.228137","DOIUrl":"https://doi.org/10.1109/LCN.1992.228137","url":null,"abstract":"The register insertion bus (RIB) access scheme, a protocol that uses a folded-bus topology such as in C-NET and D-Net but reduces overhead by using an approach similar to that used in the interface of the register insertion ring, is described. The protocol uses stations containing two buffers that allow packets in the network to be temporarily stored to avoid conflicts. Performance results based on analysis and simulation are presented. Results show the access scheme to utilize the network efficiently without requiring the overhead associated with a train-type protocol. The protocol is scalable in both transmission speed and packet length. An increase in transmission speed will result in a proportional increase in performance. This protocol serves as the basis for a protocol that uses information gathered from the network to provide a fair distributed access scheme for all loads. The control is based on incrementally increasing or decreasing the time between transmissions based on the measured network load.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"88 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":"128973940","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 data collection and analysis study of packet traffic over a local area network is reported. The objectives of this study are to develop analysis tools to isolate the effect of each protocol, and eventually each application. The measurements of the LAN are made using a raw Ethernet packet capture program (tcpdump) running on a Sun workstation. The analysis was accomplished using a PERL script and the ACE/gr data analysis program. The contribution of each protocol and host is isolated, and the higher-level application mix is examined. The characteristics of the protocol traffic are examined, and it is shown that the lower-rate traffic protocol characteristics, while not Poisson, are similar to a proposed two-state Markov chain model, while the higher-rate protocol/application traffic exhibits correlation and periodicity that are more difficult to model analytically.<>
{"title":"High level traffic analysis of a LAN segment","authors":"Bruce G. Barnett, Emilie T. Saulnier","doi":"10.1109/LCN.1992.228159","DOIUrl":"https://doi.org/10.1109/LCN.1992.228159","url":null,"abstract":"A data collection and analysis study of packet traffic over a local area network is reported. The objectives of this study are to develop analysis tools to isolate the effect of each protocol, and eventually each application. The measurements of the LAN are made using a raw Ethernet packet capture program (tcpdump) running on a Sun workstation. The analysis was accomplished using a PERL script and the ACE/gr data analysis program. The contribution of each protocol and host is isolated, and the higher-level application mix is examined. The characteristics of the protocol traffic are examined, and it is shown that the lower-rate traffic protocol characteristics, while not Poisson, are similar to a proposed two-state Markov chain model, while the higher-rate protocol/application traffic exhibits correlation and periodicity that are more difficult to model analytically.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"72 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":"132784314","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 coexistence of Internet protocol (IP) and internetwork packet exchange (IPX) traffic on the same workstation is investigated. A case study of selected commercial and public domain software is presented along with many considerations in selecting a solution model for integration. While these solutions work well in a single subnet environment, integrating several departmental LANs through routers and bridges to create a large network poses many technical and administrative challenges. These challenges include: type of router to use; selection of software solutions for the coexistence of multiple protocol stacks on the desktop workstation; subnetting and assignment of IP addresses where workstations are shared by more than one user; integration of ROM bootable workstations; security with respect to user authentication on the Internet in a shared environment; costs of implementation; and universal electronic mail systems.<>
{"title":"Multiple protocol network integration: a case study in internetworking with IP/IPX","authors":"S. Pappa, Sanjit Sethi, Jack Tan","doi":"10.1109/LCN.1992.228143","DOIUrl":"https://doi.org/10.1109/LCN.1992.228143","url":null,"abstract":"The coexistence of Internet protocol (IP) and internetwork packet exchange (IPX) traffic on the same workstation is investigated. A case study of selected commercial and public domain software is presented along with many considerations in selecting a solution model for integration. While these solutions work well in a single subnet environment, integrating several departmental LANs through routers and bridges to create a large network poses many technical and administrative challenges. These challenges include: type of router to use; selection of software solutions for the coexistence of multiple protocol stacks on the desktop workstation; subnetting and assignment of IP addresses where workstations are shared by more than one user; integration of ROM bootable workstations; security with respect to user authentication on the Internet in a shared environment; costs of implementation; and universal electronic mail systems.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"212 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":"123497109","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 effects of excessive frame loss (presumably due to media speed mismatches and/or heavy congestion) on the frequency of spanning tree reconfiguration are examined. Assuming that the losses of successive bridge protocol data units (BPDUs) are independent, general formulas for the mean time and transient probability of a single node initiating spanning tree reconfiguration (due to loss of successive BPDUs) are derived as a function of its probability of frame loss. The case of n equivalently independent nodes in the network is considered. The mean time to first loss (conditioned and unconditioned on the initial state of the system) given a step increase in utilization to above 1, if the node is modeled as an M/M/1/K system, is determined. Throughout, methods for making the network less susceptible to unnecessary spanning tree reconfiguration are discussed.<>
{"title":"Effects of excessive frame loss on scanning tree reconfiguration","authors":"A. Rindos, S. Woolet, Lee A. Sendelbach","doi":"10.1109/LCN.1992.228117","DOIUrl":"https://doi.org/10.1109/LCN.1992.228117","url":null,"abstract":"The effects of excessive frame loss (presumably due to media speed mismatches and/or heavy congestion) on the frequency of spanning tree reconfiguration are examined. Assuming that the losses of successive bridge protocol data units (BPDUs) are independent, general formulas for the mean time and transient probability of a single node initiating spanning tree reconfiguration (due to loss of successive BPDUs) are derived as a function of its probability of frame loss. The case of n equivalently independent nodes in the network is considered. The mean time to first loss (conditioned and unconditioned on the initial state of the system) given a step increase in utilization to above 1, if the node is modeled as an M/M/1/K system, is determined. Throughout, methods for making the network less susceptible to unnecessary spanning tree reconfiguration are discussed.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"31 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":"125065551","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 based on a reduced protocol profile is well suited for industrial applications that require cheap and fast communications. A pilot project whose aim is to demonstrate the practical feasibility of such an environment is presented. The implementation approach is described, pointing out the advantages coming from the solution adopted, which is based on the availability of multiple processes carrying out different protocol functions that the user can see as a collection of procedures linked together forming a common library. Some significant manufacturing message service (MMS) services are also described, and their performance is discussed in terms of response times.<>
{"title":"CIMNET: a prototype network for time critical applications in the factory","authors":"A. Valenzano, C. Demartini, G. Cena","doi":"10.1109/LCN.1992.228155","DOIUrl":"https://doi.org/10.1109/LCN.1992.228155","url":null,"abstract":"A network based on a reduced protocol profile is well suited for industrial applications that require cheap and fast communications. A pilot project whose aim is to demonstrate the practical feasibility of such an environment is presented. The implementation approach is described, pointing out the advantages coming from the solution adopted, which is based on the availability of multiple processes carrying out different protocol functions that the user can see as a collection of procedures linked together forming a common library. Some significant manufacturing message service (MMS) services are also described, and their performance is discussed in terms of response times.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"27 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":"121557804","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 CCITT has defined the reference architecture for general network management, called telecommunication network management (TNM), as a logical definition and partition of functionalities. The TNM is assumed as a guideline, and a proposal for metropolitan area network (MAN) management in a public and private environment is examined. Such a hierarchical architecture is presented in a multiservices scenario, allowing the use of it in distributed queue dual bus (DQDB) MANs. The definition of functionalities for each management entity is given, and the way in which the entities work using the DQDB MAN parameters is discussed.<>
{"title":"A general architecture for services management in a DQDB MAN","authors":"S. Casale, M. Iudica, A. L. Corte","doi":"10.1109/LCN.1992.228173","DOIUrl":"https://doi.org/10.1109/LCN.1992.228173","url":null,"abstract":"The CCITT has defined the reference architecture for general network management, called telecommunication network management (TNM), as a logical definition and partition of functionalities. The TNM is assumed as a guideline, and a proposal for metropolitan area network (MAN) management in a public and private environment is examined. Such a hierarchical architecture is presented in a multiservices scenario, allowing the use of it in distributed queue dual bus (DQDB) MANs. The definition of functionalities for each management entity is given, and the way in which the entities work using the DQDB MAN parameters is discussed.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"97 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":"126480144","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 multichannel extension of the fiber distributed data interface (FDDI) protocol using tunable-channel access is proposed. It greatly reduces the node complexity and allows low-speed electronics to be used for a high-speed network. Compared with a single-channel FDDI implementation, the multichannel FDDI either has a much higher throughput efficiency (same access delay) or a much lower access delay (same total throughput or TTRT). The proposed scheme is applicable to many other token ring networks.<>
{"title":"A multichannel extension of the fiber distributed data interface (FDDI) using tunable-channel access","authors":"K. Cheung","doi":"10.1109/LCN.1992.228165","DOIUrl":"https://doi.org/10.1109/LCN.1992.228165","url":null,"abstract":"A multichannel extension of the fiber distributed data interface (FDDI) protocol using tunable-channel access is proposed. It greatly reduces the node complexity and allows low-speed electronics to be used for a high-speed network. Compared with a single-channel FDDI implementation, the multichannel FDDI either has a much higher throughput efficiency (same access delay) or a much lower access delay (same total throughput or TTRT). The proposed scheme is applicable to many other token ring networks.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"34 Suppl 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":"116888973","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}
Data transfer rates between local area networks connected via a cross-country switched multi-megabit data service (SMDS) experimental prototype network were measured. Private line services from an interexchange carrier were used to support the experimental network. The user-network interface was the DSI subscriber network interface (SNI) (1.17 Mb/s). The maximum measured UDP data transfer rate was up to 1.05 Mb/s for 1024-byte packets. TCP was fine tuned by increasing its maximum packet size to 1 kbyte (from 512 byte) and its maximum window size to 46 kbyte (from 16 kbyte) to accommodate the SMDS network round-trip delay. The maximum TCP user data transfer rate was 0.963 Mb/s for 1024-byte packets. The average round-trip delay between workstations was 400 ms when the 1024-byte packet TCP experiments were being performed. The average round trip delay when no experiments were being performed was 121 ms. The TCP protocol adapted well to the delay characteristics of the experimental SMDS network.<>
{"title":"LAN interconnection experiments over a cross country switched multi-megabit data service network","authors":"R. Reinoso","doi":"10.1109/LCN.1992.228121","DOIUrl":"https://doi.org/10.1109/LCN.1992.228121","url":null,"abstract":"Data transfer rates between local area networks connected via a cross-country switched multi-megabit data service (SMDS) experimental prototype network were measured. Private line services from an interexchange carrier were used to support the experimental network. The user-network interface was the DSI subscriber network interface (SNI) (1.17 Mb/s). The maximum measured UDP data transfer rate was up to 1.05 Mb/s for 1024-byte packets. TCP was fine tuned by increasing its maximum packet size to 1 kbyte (from 512 byte) and its maximum window size to 46 kbyte (from 16 kbyte) to accommodate the SMDS network round-trip delay. The maximum TCP user data transfer rate was 0.963 Mb/s for 1024-byte packets. The average round-trip delay between workstations was 400 ms when the 1024-byte packet TCP experiments were being performed. The average round trip delay when no experiments were being performed was 121 ms. The TCP protocol adapted well to the delay characteristics of the experimental SMDS network.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"42 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":"133044461","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 optimality of a dynamic adaptive bandwidth allocation mechanism on the inter-FDDI virtual circuits is analyzed. The proposed algorithm is based on the monitoring of InterWorking Unit buffer status and the request of quanta of bandwidth as the buffer content exceeds given thresholds. By using the analytical model proposed, the analysis of N-level bandwidth quantization algorithm performance can be carried out. The results, validated by simulation, allow comparison between three-level and two-level algorithms. The three-level algorithm shows a better response to statistical fluctuations of input traffic, while offering a better grade of service.<>
{"title":"Analysis of the optimality of a multi-level bandwidth-negotiation algorithm for FDDI interconnection across B-ISDN","authors":"Claudio Bompard, A. Iera, V. Trecordi","doi":"10.1109/LCN.1992.228109","DOIUrl":"https://doi.org/10.1109/LCN.1992.228109","url":null,"abstract":"The optimality of a dynamic adaptive bandwidth allocation mechanism on the inter-FDDI virtual circuits is analyzed. The proposed algorithm is based on the monitoring of InterWorking Unit buffer status and the request of quanta of bandwidth as the buffer content exceeds given thresholds. By using the analytical model proposed, the analysis of N-level bandwidth quantization algorithm performance can be carried out. The results, validated by simulation, allow comparison between three-level and two-level algorithms. The three-level algorithm shows a better response to statistical fluctuations of input traffic, while offering a better grade of service.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"51 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":"131466422","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}
An analysis and simulation results for multiple token ring networks are presented. The analysis of multiple-ring networks by Q. Yang et al. (1986) is generalized. Closed-form solutions are presented for the token interarrival time and the probability that a station will transmit when a free token arrives, for any packet length or arrival rate, while load is <1. These solutions are compared with simulation data. The results are in agreement within the usable range of the simulator, for load from 0.01 to 0.90. For the special case of a single ring, the results are in agreement with previously published results on single ring networks. Simulation data show that an optimum number of rings exists to achieve minimum wait time. The data show that a ratio of 0.2 to 0.5 rings per station may provide an optimal design of the network, for the conditions described.<>
{"title":"An analysis and simulation of multiple ring token networks","authors":"D. Vasko, R. Rajsuman","doi":"10.1109/LCN.1992.228133","DOIUrl":"https://doi.org/10.1109/LCN.1992.228133","url":null,"abstract":"An analysis and simulation results for multiple token ring networks are presented. The analysis of multiple-ring networks by Q. Yang et al. (1986) is generalized. Closed-form solutions are presented for the token interarrival time and the probability that a station will transmit when a free token arrives, for any packet length or arrival rate, while load is <1. These solutions are compared with simulation data. The results are in agreement within the usable range of the simulator, for load from 0.01 to 0.90. For the special case of a single ring, the results are in agreement with previously published results on single ring networks. Simulation data show that an optimum number of rings exists to achieve minimum wait time. The data show that a ratio of 0.2 to 0.5 rings per station may provide an optimal design of the network, for the conditions described.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"26 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":"123929767","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
扫码关注我们
求助内容：
应助结果提醒方式：