Pub Date : 1988-03-27DOI: 10.1109/INFCOM.1988.12932
C. Andres, Uwe Hillmer, P. Holleczek, R. Kummer, R. Müller
Methods have been developed in a DFN (Deutsches Forschungs-Netz) project for checking access rights of calls into the DATEX-P public network and recording costs which can be assigned to users. This is done using a gateway computer. The methods which can be used for interactive services using X.3, X.28 and X.29, and for level-7 services, are discussed. Experience with a prototype gateway computer is described.<>
{"title":"Control and accounting of user access to a PDN from private X.25 data networks","authors":"C. Andres, Uwe Hillmer, P. Holleczek, R. Kummer, R. Müller","doi":"10.1109/INFCOM.1988.12932","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12932","url":null,"abstract":"Methods have been developed in a DFN (Deutsches Forschungs-Netz) project for checking access rights of calls into the DATEX-P public network and recording costs which can be assigned to users. This is done using a gateway computer. The methods which can be used for interactive services using X.3, X.28 and X.29, and for level-7 services, are discussed. Experience with a prototype gateway computer is described.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"4 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":"124085795","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.12965
T. Chung, S. Rai, D. Agrawal
The authors present a group of multidimensional regular topologies with two incoming and two outgoing link per node. The use of a mixed-radix numbering system in defining the network topology leads to many choices for the jump distance, which provides better performance when the total number of nodes is large. They introduce a performance parameter named spanning radius (SPR) which determines the addition traversal required to use all different choices when the number of choices exceeds two. The impact of the number of choices and its SPR on the network performance is also studied. The results show that a multidimensional network performs better in terms of diameter and reliability when the penalty of the extra link traversal is offset by the saving due to the additional jump distance choices used.<>
{"title":"Doubly connected multi-dimensional regular topologies for MANs and LANs","authors":"T. Chung, S. Rai, D. Agrawal","doi":"10.1109/INFCOM.1988.12965","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12965","url":null,"abstract":"The authors present a group of multidimensional regular topologies with two incoming and two outgoing link per node. The use of a mixed-radix numbering system in defining the network topology leads to many choices for the jump distance, which provides better performance when the total number of nodes is large. They introduce a performance parameter named spanning radius (SPR) which determines the addition traversal required to use all different choices when the number of choices exceeds two. The impact of the number of choices and its SPR on the network performance is also studied. The results show that a multidimensional network performs better in terms of diameter and reliability when the penalty of the extra link traversal is offset by the saving due to the additional jump distance choices used.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"2 2 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":"131314186","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.12910
C. B. Silio, H. Ghafir
The authors present analytical models to approximate average message queueing time, service time, and token round trip time on ring topology local area networks that use a Playthrough protocol. Playthrough's data-link-layer protocol uses a continually circulating control token, source removed update control messages, and destination-removed data messages to achieve concurrent transfer of multiple messages of arbitrary length. The models of data-message service time and token round trip time are used in a queueing system model for average message waiting time in this class of multiserver circuit-switched ring. The collection of analytical models is shown to adequately approximate simulated queueing times for messages transmitted using a shortest-outbound-distance-first queueing discipline. This analysis differs from earlier approximations in that it includes the effects of both bridge traffic and downstream blocking traffic on the waiting times experienced by messages arriving at an arbitrary node.<>
{"title":"A performance model for concurrent message transfer on Playthrough rings","authors":"C. B. Silio, H. Ghafir","doi":"10.1109/INFCOM.1988.12910","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12910","url":null,"abstract":"The authors present analytical models to approximate average message queueing time, service time, and token round trip time on ring topology local area networks that use a Playthrough protocol. Playthrough's data-link-layer protocol uses a continually circulating control token, source removed update control messages, and destination-removed data messages to achieve concurrent transfer of multiple messages of arbitrary length. The models of data-message service time and token round trip time are used in a queueing system model for average message waiting time in this class of multiserver circuit-switched ring. The collection of analytical models is shown to adequately approximate simulated queueing times for messages transmitted using a shortest-outbound-distance-first queueing discipline. This analysis differs from earlier approximations in that it includes the effects of both bridge traffic and downstream blocking traffic on the waiting times experienced by messages arriving at an arbitrary node.<<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":"130673318","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.12945
J. Brinsfield
Summary form only given. The unified network management architecture is a three-tiered approach with a standard machine-to-machine protocol and user-to-machine interface. The five components of the architecture are described. The network management protocol (NMP) is based on CCITT/ISO standards, providing an open architecture. The basis of NMP is the CCITT/ISO OSI seven-layer stack. The protocol stack is generally well defined within the standards bodies. Layers 4 (transport), 5 (session), and 6 (presentation) are final specifications. Within Layer 7 (application), there are numerous sublayers used. ACSE (association control service elements), and FTAM (file transfer access and management) are also final specifications. ROS (remote operations services) and CCR (commitment, concurrency and recovery) are official drafts. CMISE (common management information service elements) is a draft proposal.<>
{"title":"Unified network management architecture (UNMA)","authors":"J. Brinsfield","doi":"10.1109/INFCOM.1988.12945","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12945","url":null,"abstract":"Summary form only given. The unified network management architecture is a three-tiered approach with a standard machine-to-machine protocol and user-to-machine interface. The five components of the architecture are described. The network management protocol (NMP) is based on CCITT/ISO standards, providing an open architecture. The basis of NMP is the CCITT/ISO OSI seven-layer stack. The protocol stack is generally well defined within the standards bodies. Layers 4 (transport), 5 (session), and 6 (presentation) are final specifications. Within Layer 7 (application), there are numerous sublayers used. ACSE (association control service elements), and FTAM (file transfer access and management) are also final specifications. ROS (remote operations services) and CCR (commitment, concurrency and recovery) are official drafts. CMISE (common management information service elements) is a draft proposal.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"72 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":"134409044","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.13028
W. Lu, M. Sundareshan
A model which precisely describes the mechanism that enforces the security policy and requirements for a multilevel secure network is described. This mechanism attempts to ensure secure flow of information between entities assigned to different security classes in different computer systems connected to the network. The mechanism also controls the access to the network devices by the subjects (users and processes executed on behalf of the users) with different security clearances. The model integrates the notions of access control and information flow control to provide a trusted network base that imposes appropriate restrictions on the flow of information among the various devices. Utilizing simple set-theoretic concepts, a procedure is given to verify the security of a network that implements the present model.<>
{"title":"A model for multilevel security in computer networks","authors":"W. Lu, M. Sundareshan","doi":"10.1109/INFCOM.1988.13028","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13028","url":null,"abstract":"A model which precisely describes the mechanism that enforces the security policy and requirements for a multilevel secure network is described. This mechanism attempts to ensure secure flow of information between entities assigned to different security classes in different computer systems connected to the network. The mechanism also controls the access to the network devices by the subjects (users and processes executed on behalf of the users) with different security clearances. The model integrates the notions of access control and information flow control to provide a trusted network base that imposes appropriate restrictions on the flow of information among the various devices. Utilizing simple set-theoretic concepts, a procedure is given to verify the security of a network that implements the present model.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"10 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":"129792152","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.12895
K. Eng, M. Hluchyj, Y. Yeh
The knockout switch is a packet-switch architecture recently proposed for high-performance packet networks. In addition to providing point-to-point connections among user pairs, a packet network must often support multicast and broadcast capabilities. Multicast connections differ from point-to-point connections in that each packet is addressed to a number of destinations. Two specific approaches using the knockout switch to provide a practical and efficient means for multicast services under both light and heavy traffic conditions are proposed. The first involves packet duplication and is more suitable for light traffic loads. The second uses a fast address comparison technique and is capable of handling larger loads. In both cases, the knockout principle is utilized to yield the best delay-throughput performance, guarantee the first-in first-out packet sequence, and provide for a simple, modular implementation.<>
{"title":"Multicast and broadcast services in a knockout packet switch","authors":"K. Eng, M. Hluchyj, Y. Yeh","doi":"10.1109/INFCOM.1988.12895","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12895","url":null,"abstract":"The knockout switch is a packet-switch architecture recently proposed for high-performance packet networks. In addition to providing point-to-point connections among user pairs, a packet network must often support multicast and broadcast capabilities. Multicast connections differ from point-to-point connections in that each packet is addressed to a number of destinations. Two specific approaches using the knockout switch to provide a practical and efficient means for multicast services under both light and heavy traffic conditions are proposed. The first involves packet duplication and is more suitable for light traffic loads. The second uses a fast address comparison technique and is capable of handling larger loads. In both cases, the knockout principle is utilized to yield the best delay-throughput performance, guarantee the first-in first-out packet sequence, and provide for a simple, modular implementation.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"5 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":"133204556","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.12906
R. Singh, S. Singhal
A discussion is presented of the effects of this additional delay on speech transmission over a mixed packet and circuit connection. The authors find that the additional delay introduced by a packet network remains within acceptable bounds for normal conversation, and thus does not degrade the service quality. However, the additional delay can cause severe problems because of the presence of echoes if proper suppression measures are not incorporated. They argue that echoes can be reduced to acceptable limits by using echo cancellation devices at the gateways between the packet network and the circuit-switched network, with no changes required in the circuit-switched part of the network.<>
{"title":"Voice transmission over mixed packet- and circuit-switched networks","authors":"R. Singh, S. Singhal","doi":"10.1109/INFCOM.1988.12906","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12906","url":null,"abstract":"A discussion is presented of the effects of this additional delay on speech transmission over a mixed packet and circuit connection. The authors find that the additional delay introduced by a packet network remains within acceptable bounds for normal conversation, and thus does not degrade the service quality. However, the additional delay can cause severe problems because of the presence of echoes if proper suppression measures are not incorporated. They argue that echoes can be reduced to acceptable limits by using echo cancellation devices at the gateways between the packet network and the circuit-switched network, with no changes required in the circuit-switched part of the network.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"177 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":"133769277","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.12943
D. Luan, D. Lucantoni
The authors analyze the performance of an end-to-end window-based flow control subject to bandwidth management. In particular, they model a high-level data-link-control-type layer-two protocol, e.g. LAPD, based on positive acknowledgements for correctly received frames. They explicitly model the effect of frame losses on the performance, which takes on a greater significance when some type of bandwidth management is used by the network. When a frame is lost, there are two major recovery mechanisms: REJECT and time-out. Both of them are explicitly incorporated into the analysis. The main performance measure considered is the goodput, i.e. the throughput of frames excluding retransmissions, that the customer can achieve. When the network is at a given level of congestion, it is shown that a customer can choose an appropriate window size to optimize the goodput subject to bandwidth management.<>
{"title":"Throughput analysis of a window-based flow control subject to bandwidth management","authors":"D. Luan, D. Lucantoni","doi":"10.1109/INFCOM.1988.12943","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12943","url":null,"abstract":"The authors analyze the performance of an end-to-end window-based flow control subject to bandwidth management. In particular, they model a high-level data-link-control-type layer-two protocol, e.g. LAPD, based on positive acknowledgements for correctly received frames. They explicitly model the effect of frame losses on the performance, which takes on a greater significance when some type of bandwidth management is used by the network. When a frame is lost, there are two major recovery mechanisms: REJECT and time-out. Both of them are explicitly incorporated into the analysis. The main performance measure considered is the goodput, i.e. the throughput of frames excluding retransmissions, that the customer can achieve. When the network is at a given level of congestion, it is shown that a customer can choose an appropriate window size to optimize the goodput subject to bandwidth management.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"91 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":"127141728","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.13023
I. Gopal, A. Segall
In computer networks with decentralized control, it is necessary to provide a directory service which enables users to discover dynamically the location of other users. The authors examine the protocols for maintaining consistent directory information for casually connected users that can connect and disconnect from the network at will. They propose protocols for both hierarchical and nonhierarchical directory systems. The protocols do not rely on sequence numbers and consequently do not require 'safe store' at the user.<>
{"title":"Directories for networks with casually connected users","authors":"I. Gopal, A. Segall","doi":"10.1109/INFCOM.1988.13023","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13023","url":null,"abstract":"In computer networks with decentralized control, it is necessary to provide a directory service which enables users to discover dynamically the location of other users. The authors examine the protocols for maintaining consistent directory information for casually connected users that can connect and disconnect from the network at will. They propose protocols for both hierarchical and nonhierarchical directory systems. The protocols do not rely on sequence numbers and consequently do not require 'safe store' at the user.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"148 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":"114600409","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.12925
J. Waramahaputi, S. Thanawastien
A protocol called linear conflict resolution (LCR) for unidirectional broadcast bus networks is introduced. This protocol is shown to be suitable for both LAN (local area network) and MAN (metropolitan area network) environments. LCR combines the benefits of the quick access of the Aloha protocol and the deterministic access of TDMA (time-division multiple access). Not only could the maximum throughput of LCR be increased to near 100% but also the network is stable in that the delay is finite for all the operating conditions. The channel capacity of the LCR protocol is less sensitive to the bus characteristics than most of the existing protocols. Numerical results indicate that LCR exhibits good performance over a wide range of network sizes.<>
{"title":"The linear conflict resolution algorithm for unidirectional broadcast bus networks","authors":"J. Waramahaputi, S. Thanawastien","doi":"10.1109/INFCOM.1988.12925","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12925","url":null,"abstract":"A protocol called linear conflict resolution (LCR) for unidirectional broadcast bus networks is introduced. This protocol is shown to be suitable for both LAN (local area network) and MAN (metropolitan area network) environments. LCR combines the benefits of the quick access of the Aloha protocol and the deterministic access of TDMA (time-division multiple access). Not only could the maximum throughput of LCR be increased to near 100% but also the network is stable in that the delay is finite for all the operating conditions. The channel capacity of the LCR protocol is less sensitive to the bus characteristics than most of the existing protocols. Numerical results indicate that LCR exhibits good performance over a wide range of network sizes.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"30 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":"129484399","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
扫码关注我们
求助内容：
应助结果提醒方式：