{"title":"Proceedings of the seventh symposium on Data communications","authors":"W. Chou, Juan Milton Garduño, K. Thurber","doi":"10.1145/800081","DOIUrl":"https://doi.org/10.1145/800081","url":null,"abstract":"","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125726739","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}
Xerox internets and Ethernet local computer networks use 48-bit absolute host numbers. This is a radical departure from practices currently in use in internetwork systems and local networks. This paper describes how the host numbering scheme was designed in the context of an overall internetwork and distributed systems architecture.
{"title":"48-bit absolute internet and Ethernet host numbers","authors":"Y. K. Dalal, R. Printis","doi":"10.1145/800081.802680","DOIUrl":"https://doi.org/10.1145/800081.802680","url":null,"abstract":"Xerox internets and Ethernet local computer networks use 48-bit absolute host numbers. This is a radical departure from practices currently in use in internetwork systems and local networks. This paper describes how the host numbering scheme was designed in the context of an overall internetwork and distributed systems architecture.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133913425","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}
Demand Assigned Multiple Access (DAMA) schemes in which requests for communication channels are transmitted over collision type channels to a master controller and in which messages of different priorities are present is analyzed. Priority use of the request channels is achieved by having users select among those channels according to a priority dependent probability distribution. Two important schemes of this class are considered. Additionally, three schemes for priority assignment of message channels are treated; two are non-preemptive and one is preemptive. Trade offs among bandwidth utilization and delay are considered as well as optimization of system parameters.
{"title":"Demand assigned multiple access systems using collision type request channels: Priority messages","authors":"G. Choudhury, S. Rappaport","doi":"10.1145/800081.802667","DOIUrl":"https://doi.org/10.1145/800081.802667","url":null,"abstract":"Demand Assigned Multiple Access (DAMA) schemes in which requests for communication channels are transmitted over collision type channels to a master controller and in which messages of different priorities are present is analyzed. Priority use of the request channels is achieved by having users select among those channels according to a priority dependent probability distribution. Two important schemes of this class are considered. Additionally, three schemes for priority assignment of message channels are treated; two are non-preemptive and one is preemptive. Trade offs among bandwidth utilization and delay are considered as well as optimization of system parameters.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115078430","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}
At the present manufacturers' network architectures do not provide co-operation between systems exceeding the boundaries of their own homogeneous networks, i.e. open systems as defined the ISO Reference Model of Open Systems Inter-connection do not yet exist. Project SNATCH shows to open the closed network architectures of two important computer manufacturers by means of gateway system. Mapping the manufacturers protocols onto neutral protocols and vice versa, gateway system acts as a channel between the closed manufacturers' networks. Since this solution is in principle not restricted to systems of only two manufacturers, SNATCH points out a practicable way to a generally open system.
{"title":"SNATCH opens manufacturers' networks through gateways","authors":"D. Einert, G. Glas","doi":"10.1145/800081.802658","DOIUrl":"https://doi.org/10.1145/800081.802658","url":null,"abstract":"At the present manufacturers' network architectures do not provide co-operation between systems exceeding the boundaries of their own homogeneous networks, i.e. open systems as defined the ISO Reference Model of Open Systems Inter-connection do not yet exist. Project SNATCH shows to open the closed network architectures of two important computer manufacturers by means of gateway system. Mapping the manufacturers protocols onto neutral protocols and vice versa, gateway system acts as a channel between the closed manufacturers' networks. Since this solution is in principle not restricted to systems of only two manufacturers, SNATCH points out a practicable way to a generally open system.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129248228","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}
Packet switching networks with flow controlled virtual channels are modeled by closed multi-chain queueing networks. The tree convolution algorithm for an exact analysis of such models is discussed. The algorithm is very efficient when routing chains have sparseness and locality properties that are typical of communication network models. The accuracy of an approximate model of equivalent open chains was investigated. An optimal routing criterion for adding a virtual channel (with a window size of one) to an existing network is explored.
{"title":"Modeling and analysis of flow controlled packet switching networks","authors":"S. Lam, Luke Y.-C. Lien","doi":"10.1145/800081.802663","DOIUrl":"https://doi.org/10.1145/800081.802663","url":null,"abstract":"Packet switching networks with flow controlled virtual channels are modeled by closed multi-chain queueing networks. The tree convolution algorithm for an exact analysis of such models is discussed. The algorithm is very efficient when routing chains have sparseness and locality properties that are typical of communication network models. The accuracy of an approximate model of equivalent open chains was investigated. An optimal routing criterion for adding a virtual channel (with a window size of one) to an existing network is explored.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123168599","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 1980, agreement was reached by CCITT defining a standard for the interconnection of public data networks. As a result, networks have been able to proceed with the establishment of international services using CCITT Recommendation X.75. This paper discusses the methodology used and the operating experience gained by the introduction of an X.75 interface between the GTE Telenet and Datapac public packet switching networks.
{"title":"X.75 internetworking of Datapac and Telenet","authors":"Mehmet S. Unsoy, Theresa A. Shanahan","doi":"10.1145/800081.802679","DOIUrl":"https://doi.org/10.1145/800081.802679","url":null,"abstract":"In 1980, agreement was reached by CCITT defining a standard for the interconnection of public data networks. As a result, networks have been able to proceed with the establishment of international services using CCITT Recommendation X.75. This paper discusses the methodology used and the operating experience gained by the introduction of an X.75 interface between the GTE Telenet and Datapac public packet switching networks.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116204078","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 analyzes the maximum throughput across a full duplex link, under three link level protocols. The three protocols all assume cumulative acknowledgements, but the sender's retransmission policy and the destination's policy on retaining correctly received packets which arrive before an expected retransmission do differ. The results quantify the throughput advantages in retaining all correctly received packets, for the two different retransmission policies. A retention policy on the part of the destination is most advantageous when the link is quite error-prone.
{"title":"An analysis of link level protocols for error prone links","authors":"L. J. Miller","doi":"10.1145/800081.802666","DOIUrl":"https://doi.org/10.1145/800081.802666","url":null,"abstract":"This paper analyzes the maximum throughput across a full duplex link, under three link level protocols. The three protocols all assume cumulative acknowledgements, but the sender's retransmission policy and the destination's policy on retaining correctly received packets which arrive before an expected retransmission do differ. The results quantify the throughput advantages in retaining all correctly received packets, for the two different retransmission policies. A retention policy on the part of the destination is most advantageous when the link is quite error-prone.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"460 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132936485","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 a world increasingly populated with Ethernets and Ethernet-like nets a few sites continue to experiment with rings of active repeaters for local data communication. This paper explores some of the engineering problems involved in designing a ring that has no central control, and then compared the M.I.T.-designed ring with Ethernet on a variety of operational and subtle technical grounds, on each of which the ring may possess important or interesting advantages.
{"title":"Why a ring?","authors":"J. Saltzer, K. Pogran, D. Clark","doi":"10.1145/800081.802676","DOIUrl":"https://doi.org/10.1145/800081.802676","url":null,"abstract":"In a world increasingly populated with Ethernets and Ethernet-like nets a few sites continue to experiment with rings of active repeaters for local data communication. This paper explores some of the engineering problems involved in designing a ring that has no central control, and then compared the M.I.T.-designed ring with Ethernet on a variety of operational and subtle technical grounds, on each of which the ring may possess important or interesting advantages.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133730463","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 deals with the problem of finding the minimum cost flow pattern for a large intercity data transmission network which provides private lines between pairs of cities and which is subject to capacity constraints. This problem can be formulated as a minimum cost multicommodity flow problem. The most efficient linear and integer programming approaches yield programs with memory requirements proportional to the square of the problem size, making impractical their use for large scale problems. In this paper a heuristic method is described which produces suboptimal solutions with smaller execution time requirements, and memory requirements linear with the problem size. Experimental results are presented comparing the proposed method with a Linear Programming approach.
{"title":"A heuristic method for optimizing an intercity data transmission network","authors":"R. Pazos","doi":"10.1145/800081.802662","DOIUrl":"https://doi.org/10.1145/800081.802662","url":null,"abstract":"This paper deals with the problem of finding the minimum cost flow pattern for a large intercity data transmission network which provides private lines between pairs of cities and which is subject to capacity constraints. This problem can be formulated as a minimum cost multicommodity flow problem. The most efficient linear and integer programming approaches yield programs with memory requirements proportional to the square of the problem size, making impractical their use for large scale problems. In this paper a heuristic method is described which produces suboptimal solutions with smaller execution time requirements, and memory requirements linear with the problem size. Experimental results are presented comparing the proposed method with a Linear Programming approach.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133143869","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 arrived late and can be found, published in full, on pages 260-267 of the Proceedings.
这篇论文姗姗来迟，全文发表在《论文集》的260-267页。
{"title":"HDLC reliability and the FRBS method to improve it","authors":"J. Selga, J. Rivera","doi":"10.1145/1013879.802683","DOIUrl":"https://doi.org/10.1145/1013879.802683","url":null,"abstract":"This paper arrived late and can be found, published in full, on pages 260-267 of the Proceedings.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130324970","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
扫码关注我们
求助内容：
应助结果提醒方式：