Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12903
R. Linn, J. Favreau
As part of a planned transition by the US Department of Defense (DoD) from military standard to open systems interconnection (OSI) protocols, the National Bureau of Standards (NBS) is implementing and testing two application-layer gateways. NBS is applying description techniques developed within the International Organization for Standardization (ISO) and the Consultative Committee for International Telephone and Telegraph (CCITT) to the specification of distributed test systems for the gateways between OSI and DoD networks. Translators developed at NBS for Estelle and ASN.1 aid in automating the implementation of the test systems. An overview of the test system for an electronic mail gateway and the methods used to realize it are presented. Measures of productivity of the methods used are also presented.<>
{"title":"Application of formal description techniques to the specification of distributed test systems","authors":"R. Linn, J. Favreau","doi":"10.1109/INFCOM.1988.12903","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12903","url":null,"abstract":"As part of a planned transition by the US Department of Defense (DoD) from military standard to open systems interconnection (OSI) protocols, the National Bureau of Standards (NBS) is implementing and testing two application-layer gateways. NBS is applying description techniques developed within the International Organization for Standardization (ISO) and the Consultative Committee for International Telephone and Telegraph (CCITT) to the specification of distributed test systems for the gateways between OSI and DoD networks. Translators developed at NBS for Estelle and ASN.1 aid in automating the implementation of the test systems. An overview of the test system for an electronic mail gateway and the methods used to realize it are presented. Measures of productivity of the methods used are also presented.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115290634","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}
Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.13033
K. G. Knightston
Network management is an extremely complex subject. While it is becoming easier to provide intelligence within network elements to satisfy the demand for greater sophistication, automation, and decentralization of operations, administration, maintenance, and provisioning (OAM&P) functions, a key challenge is 'managing' the system design process. Without an effective design process, it is unlikely that the real potential of a network management system can be realized. The author outlines the key challenge and issues facing network management system designers, and proposes a solution.<>
{"title":"Telecommunications management network-object-oriented architectures","authors":"K. G. Knightston","doi":"10.1109/INFCOM.1988.13033","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13033","url":null,"abstract":"Network management is an extremely complex subject. While it is becoming easier to provide intelligence within network elements to satisfy the demand for greater sophistication, automation, and decentralization of operations, administration, maintenance, and provisioning (OAM&P) functions, a key challenge is 'managing' the system design process. Without an effective design process, it is unlikely that the real potential of a network management system can be realized. The author outlines the key challenge and issues facing network management system designers, and proposes a solution.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114666241","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}
Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12928
A. Orda, R. Rom
The authors consider the shortest-path problem in networks in which the length (or weight) of the edges change with time according to arbitrary functions. They present algorithms for finding the shortest-path and minimum-delay under various waiting constraints and investigate the quality of the derived path. They also show that if departure time from the source node is unrestricted and delay functions are continuous then a shortest path can be found that is simple and achieves a delay as short as the most unrestricted strategy. The optimal waiting time for such cases is also computed. In more restricted transit, it is shown that there exist cases where the minimum delay is finite yet the path that achieves it is infinite.<>
{"title":"Shortest-path algorithms for time-dependent networks","authors":"A. Orda, R. Rom","doi":"10.1109/INFCOM.1988.12928","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12928","url":null,"abstract":"The authors consider the shortest-path problem in networks in which the length (or weight) of the edges change with time according to arbitrary functions. They present algorithms for finding the shortest-path and minimum-delay under various waiting constraints and investigate the quality of the derived path. They also show that if departure time from the source node is unrestricted and delay functions are continuous then a shortest path can be found that is simple and achieves a delay as short as the most unrestricted strategy. The optimal waiting time for such cases is also computed. In more restricted transit, it is shown that there exist cases where the minimum delay is finite yet the path that achieves it is infinite.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117091597","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}
Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12951
G. Hébuterne
The author examines some of the dimensioning problems encountered when using an asynchronous time-division network, to carry synchronous traffic. The basic switch is built around a memory, buffering the frames to be processed. The incoming flows are to be emitted on the output trunks in some order depending on external constraints, so the buffers play in fact the role of a reordering stage; the authors calculates their size, so that the rejection probability meets the grade-of-service criteria. He compares briefly two memory organizations for synchronous time-division switches, namely, common memory and full partitioning.<>
{"title":"STD switching in an ATD environment","authors":"G. Hébuterne","doi":"10.1109/INFCOM.1988.12951","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12951","url":null,"abstract":"The author examines some of the dimensioning problems encountered when using an asynchronous time-division network, to carry synchronous traffic. The basic switch is built around a memory, buffering the frames to be processed. The incoming flows are to be emitted on the output trunks in some order depending on external constraints, so the buffers play in fact the role of a reordering stage; the authors calculates their size, so that the rejection probability meets the grade-of-service criteria. He compares briefly two memory organizations for synchronous time-division switches, namely, common memory and full partitioning.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127313195","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}
Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.13010
A. Orda, R. Rom
Multihoming in networks, i.e. attaching a subscriber to more than a single access point in the network, is a mechanism used to improve performance. The authors take the topological design view and address the problem of finding optimal multihoming configurations for several topological design criteria. They analyze the problem and demonstrate that except for dual homing, multihoming is algorithmically complex. Optimal algorithms based on maximum matching in graphs and 0-1 integer programming are given for all cases.<>
{"title":"Multihoming in computer networks: a topology-design approach","authors":"A. Orda, R. Rom","doi":"10.1109/INFCOM.1988.13010","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13010","url":null,"abstract":"Multihoming in networks, i.e. attaching a subscriber to more than a single access point in the network, is a mechanism used to improve performance. The authors take the topological design view and address the problem of finding optimal multihoming configurations for several topological design criteria. They analyze the problem and demonstrate that except for dual homing, multihoming is algorithmically complex. Optimal algorithms based on maximum matching in graphs and 0-1 integer programming are given for all cases.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114102340","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}
Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12940
M. Hluchyj, M. Karol
The authors propose a multihop wavelength-division-multiplexing (WDM) approach, referred to as ShuffleNet, for achieving concurrency in distributed lightwave networks. ShuffleNet can be configured with each user having as few as one fixed-wavelength transmitter and one fixed-wavelength receiver, avoiding both wavelength agility and pretransmission coordination problems. Still, the network can achieve at least 40% of the maximum efficiency possible with wavelength-agile transmitters and receivers. To transmit a packet from one user to another, however, may require routing the packet through intermediate users, each repeating the packet on a new wavelength, until the packet is finally transmitted on a wavelength that the destination user receives. For such a multihop lightwave network, the transmit and receive wavelengths must be assigned to users to provide both a path between all users and the efficient utilization of all wavelength channels. A class of assignment schemes is proposed which is based on a generalization of the perfect shuffle and achieves high efficiency for uniform traffic loads. Physically, the network may take on a variety of topologies, including a bus, tree, or star.<>
{"title":"ShuffleNet: an application of generalized perfect shuffles to multihop lightwave networks","authors":"M. Hluchyj, M. Karol","doi":"10.1109/INFCOM.1988.12940","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12940","url":null,"abstract":"The authors propose a multihop wavelength-division-multiplexing (WDM) approach, referred to as ShuffleNet, for achieving concurrency in distributed lightwave networks. ShuffleNet can be configured with each user having as few as one fixed-wavelength transmitter and one fixed-wavelength receiver, avoiding both wavelength agility and pretransmission coordination problems. Still, the network can achieve at least 40% of the maximum efficiency possible with wavelength-agile transmitters and receivers. To transmit a packet from one user to another, however, may require routing the packet through intermediate users, each repeating the packet on a new wavelength, until the packet is finally transmitted on a wavelength that the destination user receives. For such a multihop lightwave network, the transmit and receive wavelengths must be assigned to users to provide both a path between all users and the efficient utilization of all wavelength channels. A class of assignment schemes is proposed which is based on a generalization of the perfect shuffle and achieves high efficiency for uniform traffic loads. Physically, the network may take on a variety of topologies, including a bus, tree, or star.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114382460","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}
Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12908
M. Xu, J. Herzog
Concurrent token ring (CTR), a multiple-access protocol for ring-type area networks, is proposed. In CTR, message frames are partially removed by the destination node. A truncated portion of the frame, which contains the source and destination addresses, is configured by the destination into a conditional token which is allowed to circulate back to the source for removal. The conditional token informs 'downstream' nodes of busy data paths and allows them to establish concurrent message transmission if resources are free. Simulation results indicate that the CTR protocol has a higher throughput and shorter transmission delay than the IEEE 802.5 token ring.<>
{"title":"Concurrent token ring protocol","authors":"M. Xu, J. Herzog","doi":"10.1109/INFCOM.1988.12908","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12908","url":null,"abstract":"Concurrent token ring (CTR), a multiple-access protocol for ring-type area networks, is proposed. In CTR, message frames are partially removed by the destination node. A truncated portion of the frame, which contains the source and destination addresses, is configured by the destination into a conditional token which is allowed to circulate back to the source for removal. The conditional token informs 'downstream' nodes of busy data paths and allows them to establish concurrent message transmission if resources are free. Simulation results indicate that the CTR protocol has a higher throughput and shorter transmission delay than the IEEE 802.5 token ring.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128396848","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}
Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12927
Hwa-Chun Lin, J. Yee, C. Raghavendra
The load balancing and routing problems are combined as a single problem to capture the interaction between them. An optimization problem for joint load balancing and routing is formulated using a linear combination of the average job response time and average message delay as the performance criterion. Given an initial feasible solution, the Frank-Wolfe method is applied to solve the problem. An algorithm which gives an optimal solution is obtained. The algorithm is then extended to solve the same problem with multiple types of jobs.<>
{"title":"Optimal joint load balancing and routing in message switched computer networks","authors":"Hwa-Chun Lin, J. Yee, C. Raghavendra","doi":"10.1109/INFCOM.1988.12927","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12927","url":null,"abstract":"The load balancing and routing problems are combined as a single problem to capture the interaction between them. An optimization problem for joint load balancing and routing is formulated using a linear combination of the average job response time and average message delay as the performance criterion. Given an initial feasible solution, the Frank-Wolfe method is applied to solve the problem. An algorithm which gives an optimal solution is obtained. The algorithm is then extended to solve the same problem with multiple types of jobs.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128509018","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}
Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.13024
J. Brown, W. Krzymień
A discussion is presented of the selection of a subset of the ISDN (integrated-services digital network) signalling system's network-layer protocol for point-to-point links suitable for processing in VLSI. A symmetric subset of the CCITT Q.931 recommendation as it stood in August 1987 is proposed. The need for bearer-channel negotiations is eliminated by using a 'two-way independent channel selection' technique in which each end of the link is master in the transmit direction and slave in the receive direction. A logical model for the signalling system's network layer processor is developed to aid in understanding the Q.931 protocol. The model also serves as the initial functional partitioning for the VLSI implementation. The key element of the model is the separation of the network-layer processor into a protocol-specific module (PSM) and an application-specific module (ASM).<>
{"title":"A subset of the ISDN network layer protocol suitable for implementation in hardware","authors":"J. Brown, W. Krzymień","doi":"10.1109/INFCOM.1988.13024","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13024","url":null,"abstract":"A discussion is presented of the selection of a subset of the ISDN (integrated-services digital network) signalling system's network-layer protocol for point-to-point links suitable for processing in VLSI. A symmetric subset of the CCITT Q.931 recommendation as it stood in August 1987 is proposed. The need for bearer-channel negotiations is eliminated by using a 'two-way independent channel selection' technique in which each end of the link is master in the transmit direction and slave in the receive direction. A logical model for the signalling system's network layer processor is developed to aid in understanding the Q.931 protocol. The model also serves as the initial functional partitioning for the VLSI implementation. The key element of the model is the separation of the network-layer processor into a protocol-specific module (PSM) and an application-specific module (ASM).<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115791083","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}
Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12961
M. Wernik, R. Corn, S. Minzer, G. Luderer, G. A. Nelson, B. Goldstein, R. Vickers
This panel presentation covers the following topics: benefits of new network architectures; requirements for these network architectures; feature of broadband ISDN (integrated-services digital network); and integrated services versus integrated transport.<>
{"title":"Panel: network architectures for future services","authors":"M. Wernik, R. Corn, S. Minzer, G. Luderer, G. A. Nelson, B. Goldstein, R. Vickers","doi":"10.1109/INFCOM.1988.12961","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12961","url":null,"abstract":"This panel presentation covers the following topics: benefits of new network architectures; requirements for these network architectures; feature of broadband ISDN (integrated-services digital network); and integrated services versus integrated transport.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134132938","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
扫码关注我们
求助内容：
应助结果提醒方式：