{"title":"Optimal control of arrivals at a blocking node","authors":"I. Lambadaris, P. Narayan","doi":"10.1109/CNS.1988.4998","DOIUrl":"https://doi.org/10.1109/CNS.1988.4998","url":null,"abstract":"Two communication traffic streams with Poisson statistics arrive at a network node. These are to be transmitted across a channel with a total bandwidth capacity of C frequency slots. Messages not accepted at the node are assumed to be lost. Under the assumption of exponential service time distributions, the authors study the problem of dynamic allocation of available channel bandwidth among the two traffic types to minimize a weighted sum of blocking probabilities. Modeling the system as a two-dimensional Markov chain, they show by an application of dynamic programming principles that the optimal policy is characterized by a set of two switching curves.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130025717","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}
{"title":"Architecture and design of an open systems LAN/WAN gateway","authors":"W. Johannsen, W. Lamersdorf, K. Reinhardt","doi":"10.1109/CNS.1988.4987","DOIUrl":"https://doi.org/10.1109/CNS.1988.4987","url":null,"abstract":"The authors report on architectural alternatives and an implementation design of an open systems LAN/WAN (local area network/wide-area network) gateway which connects a private (IBM token ring) LAN with a open WAN based on a public X.25 packet-layer protocol. The gateway design applies and generalizes the ideas underlying the ISO Open Systems Interconnection (OSI) reference model for heterogeneous communication networks. The gateway presented is currently implemented in a project which supports distributed data-intensive applications in a heterogeneous LAN and WAN configuration.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123811729","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}
K. Geihs, B. Schoener, U. Hollberg, H. Schmutz, H. Eberle
{"title":"An architecture for the cooperation of heterogeneous operating systems","authors":"K. Geihs, B. Schoener, U. Hollberg, H. Schmutz, H. Eberle","doi":"10.1109/CNS.1988.5008","DOIUrl":"https://doi.org/10.1109/CNS.1988.5008","url":null,"abstract":"The DAC Network Operating System (DACNOS) was designed to support resource sharing in a world of interconnected heterogeneous computing systems. The prototype implementation demonstrates that it is feasible to add powerful and flexible means for distributed cooperation to an operating system without affecting its existing individual interfaces and applications. The authors describe the important design issues of DACNOS and their experiences with the implementation and performance of a prototype. Particular emphasis is put on the portability of the NOS software and on the design of the interface to the NOS kernel that provides the facilities for distributed cooperation. It is shown by an example how this set of facilities eases the implementation of distributed applications by taking most of the burden of distribution, access protection, resource management and data representation away from the programmer.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"41 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131072115","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}
{"title":"Ethernet with segmented carrier","authors":"W. Dobosiewicz, P. Gburzynski","doi":"10.1109/CNS.1988.4979","DOIUrl":"https://doi.org/10.1109/CNS.1988.4979","url":null,"abstract":"Two variations of a local area network based on a modified concept of Ethernet are presented. Unlike many other concepts (e.g. collision-free protocols, or the so-called new-generation collision protocols) the proposed modifications are simple, realistic and inexpensive. In particular, the essence of the CSMA/CD (carrier-sense multiaccess with collision detection) protocol is retained. The simpler of the two methods, called SCS (single carrier with segmentation), operates almost exactly as the standard Ethernet. The second network, DCS (double carrier with segmentation), is particularly interesting, as (despite the collision protocol) its asymptotic effective throughput turns out to be equal to the capacity of the carrier. The performance of both networks is demonstrated to be superior to the performance of the standard Ethernet.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132751225","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}
{"title":"Multicast routing in bus-based computer networks","authors":"P. McKinley, J.W.-S. Liu","doi":"10.1109/CNS.1988.5006","DOIUrl":"https://doi.org/10.1109/CNS.1988.5006","url":null,"abstract":"The authors address multicast routing of integrated voice, video, and messages in bus-based computer networks, particularly in grids of buses. Graph theoretical formulations of the multicast routing problem are presented and an algorithm is given that produces optimal multicast routes in grids of buses. The performance of this algorithm is compared with that of heuristic algorithms. Finally, the bilevel grid, a hierarchical grid topology, is described, and an algorithm is given that produces optimal multicast routes in such networks.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131850259","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}
{"title":"Implementation of the ISO file transfer, access and management protocol in the Unix environment","authors":"S. Chanson, M. Goh","doi":"10.1109/CNS.1988.4976","DOIUrl":"https://doi.org/10.1109/CNS.1988.4976","url":null,"abstract":"A description is presented of an implementation of a useful subset of the file transfer, access, and management (FTAM) protocol on Unix 4.2 BSD. The local implementation decisions necessary and certain ambiguities in the FTAM specifications are discussed. As well, some performance data of the prototype implementation are presented.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114610697","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}
{"title":"A distributed directory scheme in computer networks","authors":"K.J. Lee, B. Kadaba","doi":"10.1109/CNS.1988.5013","DOIUrl":"https://doi.org/10.1109/CNS.1988.5013","url":null,"abstract":"In this scheme, each node in the network maintains a local DDB (directory database), and each resource i is registered in the DDBs of all nodes with r/sub i/ hops away from the owning node of resource i, where r/sub i/ denotes the radius of the resource. In general, each resource has a different radius. Whenever a user at a node makes a reference to a resource, the node first searches its local DDB to find an entry for the resource. If this attempt is successful, it is done. Otherwise, the node trigger a query protocol to find the resource. Registered entries are updated for the integrity of stored information every time there are changes in their contents. This scheme uses simple broadcast protocols among the nodes in the network in querying other nodes to find a nonlocal resource and in updating DDBs of other nodes. The authors quantify the response time performance and the overhead associated with the directory scheme as a function of the radius of each resource, and propose an integer programming formulation to determine the optimal radius for each resource which is solved in O(R) steps, where R is the maximum radius of the resource.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131404039","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}
{"title":"Design of network application protocols for distributed programming","authors":"L. Ni, Y.-H. Liu, A. Nanda, J. Ramanathan","doi":"10.1109/CNS.1988.5010","DOIUrl":"https://doi.org/10.1109/CNS.1988.5010","url":null,"abstract":"The authors present distributed programming tools that are based on the message-passing macro C language being advocated by Argonne National Laboratory. These tools are built on network systems which support Unix 4.2/4.3 BSD. A description is given of the design of network application protocols to support such a concurrent programming environment. Design and implementation strategies of such protocols are discussed. A visual co-current program debugging tool is described.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125668324","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}
{"title":"LANCET: local area network comprehensive evaluation tool","authors":"B. L. Barnett, K. Abeynayake, M. Malek","doi":"10.1109/CNS.1988.5012","DOIUrl":"https://doi.org/10.1109/CNS.1988.5012","url":null,"abstract":"The features and capabilities of the local area network comprehensive evaluation tool (LANCET) are described. LANCET is a network monitoring and management package developed for a Unix workstation which incorporates many of the capabilities of special purpose network monitoring hardware. Traffic monitoring, generation, and display features of the system are discussed. Future extensions to the system are proposed.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130697030","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}
{"title":"Transitioning to an intelligent ISDN-based plant-a datacom perspective","authors":"D. Minoli, J. Amoss","doi":"10.1109/CNS.1988.5018","DOIUrl":"https://doi.org/10.1109/CNS.1988.5018","url":null,"abstract":"Likely phases and time frames in a transition to an intelligent integrated-services-digital-network (ISDN)-based architecture are identified, as seen from a large commercial data network perspective. Issues discussed include technical and protocol matters, available services and geographic coverage, interworking and gatewaying with traditional data communication architectures (proprietary systems, LANs, etc.). Since all parties involved in ISDN/intelligent network deployment (carriers, manufacturers, and end users) must jointly address these issues, a preliminary assessment of the interworking of these three groups is offered.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134007908","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号
