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.12969
A. Gersht, A. Shulman, P. Nemirovsky
A network optimization model (NOM) that provides a tool for performance analysis and optimal design of a broad class of routing strategies is presented. It can evaluate and optimize both static and dynamic, local and global routing strategies. The tool is applicable to both packet-switched and circuit-switched networks. NOM software is based on original modeling methods and optimization algorithms. It is user-friendly and menu-driven, and has extensive 'what if' capabilities. NOM can be used for performance evaluation of existing routing strategy and for optimal routing design for a given performance criterion. As a performance evaluation tool, for a given network topology, link and node capacities, point-to-point demand matrix, and routing strategy, NOM models the routing and computes important characteristics of network performance. As a routing optimization tool, for a given network topology, link and node capacities, point-to-point demand matrix, and performance criterion, NOM generates the optimal routing, and computes important characteristics of network performance. The current Telenet local dynamic routing strategy is compared with a set of optimal routing strategies designed for various performance criteria.<>
{"title":"NOM-a tool for optimal design and performance evaluation of routing strategies and its application to the Telenet network","authors":"A. Gersht, A. Shulman, P. Nemirovsky","doi":"10.1109/INFCOM.1988.12969","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12969","url":null,"abstract":"A network optimization model (NOM) that provides a tool for performance analysis and optimal design of a broad class of routing strategies is presented. It can evaluate and optimize both static and dynamic, local and global routing strategies. The tool is applicable to both packet-switched and circuit-switched networks. NOM software is based on original modeling methods and optimization algorithms. It is user-friendly and menu-driven, and has extensive 'what if' capabilities. NOM can be used for performance evaluation of existing routing strategy and for optimal routing design for a given performance criterion. As a performance evaluation tool, for a given network topology, link and node capacities, point-to-point demand matrix, and routing strategy, NOM models the routing and computes important characteristics of network performance. As a routing optimization tool, for a given network topology, link and node capacities, point-to-point demand matrix, and performance criterion, NOM generates the optimal routing, and computes important characteristics of network performance. The current Telenet local dynamic routing strategy is compared with a set of optimal routing strategies designed for various performance criteria.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"44 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":"128271603","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.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.12960
D. Tipper, M. Sundareshan
A simple analytical approximation to the optimal buffer-management policy valid in the moderate to heavy load ranges is presented. The throughput performance of the present adaptive policies under both steady-state and transient conditions is studied. The superiority of this scheme over the performance resulting from existing buffer-management schemes is demonstrated.<>
{"title":"Adaptive policies for optimal buffer management in dynamic load environments","authors":"D. Tipper, M. Sundareshan","doi":"10.1109/INFCOM.1988.12960","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12960","url":null,"abstract":"A simple analytical approximation to the optimal buffer-management policy valid in the moderate to heavy load ranges is presented. The throughput performance of the present adaptive policies under both steady-state and transient conditions is studied. The superiority of this scheme over the performance resulting from existing buffer-management schemes is demonstrated.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"40 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":"124966448","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.12977
D. McDysan, R. Pickholtz
The data queuing performance is analyzed for a fixed-frame-size, integrated voice-data multiplexer (IVDM), where voice has preemptive priority over data, a maximum capacity is available for voice (above which voice freeze-outs occur), and data is queued when there is insufficient capacity. A discrete-state-continuous-time Markov model is used to model a discrete-state-discrete-time IVDM when the average source burst duration is significantly larger than the multiplexer frame time. The correlation of the voice and data source activity is shown to have a significant effect on IVDM data queuing performance. An approximate, simple analytical model for the mean data queue length is derived. The approximate analytical model for mean data queue length is shown to provide a lower bound for exact calculations and simulation results. The concept of maximizing queuing power (throughput/delay) is applied to the data performance.<>
{"title":"Performance analysis of a moving boundary/fixed frame integrated voice/data multiplexing technique with correlated sources","authors":"D. McDysan, R. Pickholtz","doi":"10.1109/INFCOM.1988.12977","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.12977","url":null,"abstract":"The data queuing performance is analyzed for a fixed-frame-size, integrated voice-data multiplexer (IVDM), where voice has preemptive priority over data, a maximum capacity is available for voice (above which voice freeze-outs occur), and data is queued when there is insufficient capacity. A discrete-state-continuous-time Markov model is used to model a discrete-state-discrete-time IVDM when the average source burst duration is significantly larger than the multiplexer frame time. The correlation of the voice and data source activity is shown to have a significant effect on IVDM data queuing performance. An approximate, simple analytical model for the mean data queue length is derived. The approximate analytical model for mean data queue length is shown to provide a lower bound for exact calculations and simulation results. The concept of maximizing queuing power (throughput/delay) is applied to the data performance.<<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":"128574844","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.13018
M. Sharifi, M. Arozullah
The authors defines multiple-access method suitable for a centralized multiple satellite network, with onboard processing in the central node. This multiple-access method (CDMA/Aloha/BFN) is a combination of code-division multiple-access (CDMA), random multiple access (RMA) or Aloha, and a set of electronic beam forming networks (BFN). CDMA/Aloha/BFN multiple access maintains the advantages of CDMA and RMA techniques and avoids their disadvantages by using some processing on board the central satellite stations. The major characteristics of this method are: no need for network synchronization resistance to jamming, efficient use of the available system power and bandwidth, low equipment complexity, low mutual interference, ability to operate in systems supporting highly dynamic users, and good delay-throughput performance. The theory of operation of the CDMA/Aloha/BFN multiple-access technique is described and its performance is analyzed.<>
{"title":"A multiple access technique for centralized multiple satellite networking with on-board processing in the central node","authors":"M. Sharifi, M. Arozullah","doi":"10.1109/INFCOM.1988.13018","DOIUrl":"https://doi.org/10.1109/INFCOM.1988.13018","url":null,"abstract":"The authors defines multiple-access method suitable for a centralized multiple satellite network, with onboard processing in the central node. This multiple-access method (CDMA/Aloha/BFN) is a combination of code-division multiple-access (CDMA), random multiple access (RMA) or Aloha, and a set of electronic beam forming networks (BFN). CDMA/Aloha/BFN multiple access maintains the advantages of CDMA and RMA techniques and avoids their disadvantages by using some processing on board the central satellite stations. The major characteristics of this method are: no need for network synchronization resistance to jamming, efficient use of the available system power and bandwidth, low equipment complexity, low mutual interference, ability to operate in systems supporting highly dynamic users, and good delay-throughput performance. The theory of operation of the CDMA/Aloha/BFN multiple-access technique is described and its performance is analyzed.<<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":"129501350","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
扫码关注我们
求助内容：
应助结果提醒方式：