Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253298
D. Box, D. Hong, T. Suda
The backward compatibility dilemma introduced by the deployment of a high-speed, wide-area asynchronous transfer mode (ATM) network is examined. The problem is that emerging ATM network must be capable of transporting traffic sources such as digital voice and video, but many of the design choices that optimize ATM for these sources make the transport of traditional connectionless data traffic difficult. The overlay of a virtual datagram network of connectionless servers onto a public ATM network to provide connectionless service is proposed to solve the problem. This method provides low transfer delay and efficiently utilizes network resources. Architectural issues are described, and an implementation of a connectionless server is presented.<>
{"title":"Architecture and design of connectionless data service for a public ATM network","authors":"D. Box, D. Hong, T. Suda","doi":"10.1109/INFCOM.1993.253298","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253298","url":null,"abstract":"The backward compatibility dilemma introduced by the deployment of a high-speed, wide-area asynchronous transfer mode (ATM) network is examined. The problem is that emerging ATM network must be capable of transporting traffic sources such as digital voice and video, but many of the design choices that optimize ATM for these sources make the transport of traditional connectionless data traffic difficult. The overlay of a virtual datagram network of connectionless servers onto a public ATM network to provide connectionless service is proposed to solve the problem. This method provides low transfer delay and efficiently utilizes network resources. Architectural issues are described, and an implementation of a connectionless server is presented.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116367956","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 : 1993-03-28DOI: 10.1109/INFCOM.1993.253326
Willibald A. Doeringer, D. Dykeman, Antonius P. J. Engbersen, R. Guérin, A. Herkersdorf, L. Heusler
A hierarchical decomposition of network nodes which permits the networkwide topology database and algorithms to be independent of node internals, yet allows (implicit) access to special intranodal features when required is described. A complementary procedure for the establishment of bandwidth-reserved connections is outlined that makes efficient use of this node structure to support network-level optimization through use of node-level features. Based on a significantly increased concurrency of path computation and bandwidth reservation, the execution time of the setup procedure is independent of the network's complexity (such as number of nodes and links) and is essentially bounded from above by the round-trip delay only.<>
{"title":"Fast connection establishment in large-scale networks","authors":"Willibald A. Doeringer, D. Dykeman, Antonius P. J. Engbersen, R. Guérin, A. Herkersdorf, L. Heusler","doi":"10.1109/INFCOM.1993.253326","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253326","url":null,"abstract":"A hierarchical decomposition of network nodes which permits the networkwide topology database and algorithms to be independent of node internals, yet allows (implicit) access to special intranodal features when required is described. A complementary procedure for the establishment of bandwidth-reserved connections is outlined that makes efficient use of this node structure to support network-level optimization through use of node-level features. Based on a significantly increased concurrency of path computation and bandwidth reservation, the execution time of the setup procedure is independent of the network's complexity (such as number of nodes and links) and is essentially bounded from above by the round-trip delay only.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132252476","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 : 1993-03-28DOI: 10.1109/INFCOM.1993.253370
Joseph B. Evans, Edgardo Duron, Yizhen Wang
A priority knockout switch (PKS) architecture using priority based congestion control mechanisms is presented for broadband ISDN (BISDN) networks. This architecture provides the capability of assigning qualities of service to connections through per cell or virtual circuit priority mechanisms. Performance studies that use an analytical model for uniform traffic and simulation models for uniform and bursty traffic are presented. These studies indicate that the PKS architecture provides excellent cell loss rates for high priority traffic at minor expense to the low priority traffic. CMOS implementations of the switch modules that demonstrate the feasibility of the architecture are described.<>
{"title":"Analysis and implementation of a priority knockout switch","authors":"Joseph B. Evans, Edgardo Duron, Yizhen Wang","doi":"10.1109/INFCOM.1993.253370","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253370","url":null,"abstract":"A priority knockout switch (PKS) architecture using priority based congestion control mechanisms is presented for broadband ISDN (BISDN) networks. This architecture provides the capability of assigning qualities of service to connections through per cell or virtual circuit priority mechanisms. Performance studies that use an analytical model for uniform traffic and simulation models for uniform and bursty traffic are presented. These studies indicate that the PKS architecture provides excellent cell loss rates for high priority traffic at minor expense to the low priority traffic. CMOS implementations of the switch modules that demonstrate the feasibility of the architecture are described.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116991300","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 : 1993-03-28DOI: 10.1109/INFCOM.1993.253368
I. Stavrakakis, S. Tsakiridou
The queue occupancy distribution of the distributed queue-dual-bus (DQDB) station is derived through the formulation and exact analysis of a queuing model with the following characteristic: the packet service time requirements depends on the state of an underlying Markov-structured process at the time when the packet is forwarded to the server (head of the queue). Numerical results are presented and compared with simulation results to evaluate the accuracy of the involved approximations.<>
{"title":"Occupancy distribution of a DQDB station based on a queueing system with Markov-structured service requirements","authors":"I. Stavrakakis, S. Tsakiridou","doi":"10.1109/INFCOM.1993.253368","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253368","url":null,"abstract":"The queue occupancy distribution of the distributed queue-dual-bus (DQDB) station is derived through the formulation and exact analysis of a queuing model with the following characteristic: the packet service time requirements depends on the state of an underlying Markov-structured process at the time when the packet is forwarded to the server (head of the queue). Numerical results are presented and compared with simulation results to evaluate the accuracy of the involved approximations.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116440285","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 : 1993-03-28DOI: 10.1109/INFCOM.1993.253386
S. Liew, T. Lee
It is desirable that the traffic control policy at a network node depend on the external traffic loads on the input and output links, but not on the detailed addressing or distribution of packets from inputs to outputs. It should be possible to guarantee the grade of service of an input-output connection by controlling the aggregate loads on the input and output. Switch nodes in which such a traffic control policy is possible are said to have the property of the sufficiency of the knowledge of external loads (SKEL). The authors clarify issues related to SKEL and establish its feasibility for a generic switch node on a rigorous basis.<>
{"title":"A fundamental property for traffic management in ATM networks","authors":"S. Liew, T. Lee","doi":"10.1109/INFCOM.1993.253386","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253386","url":null,"abstract":"It is desirable that the traffic control policy at a network node depend on the external traffic loads on the input and output links, but not on the detailed addressing or distribution of packets from inputs to outputs. It should be possible to guarantee the grade of service of an input-output connection by controlling the aggregate loads on the input and output. Switch nodes in which such a traffic control policy is possible are said to have the property of the sufficiency of the knowledge of external loads (SKEL). The authors clarify issues related to SKEL and establish its feasibility for a generic switch node on a rigorous basis.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123206129","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 : 1993-03-28DOI: 10.1109/INFCOM.1993.253279
K. Claffy, George C. Polyzos, Hans-Werner Braun
The results of a measurement study of the T1 NSFNET backbone are presented. The measurement environment and the approach to data collection are discussed. Measurements results are then presented for: long-term growth in traffic volume, including attribution to domains and protocols; trends in average packet size on the network, over both long- and medium-term intervals; most popular sources, destinations, and site pairs; traffic locality; international distribution of traffic; mean utilization statistics of the overall backbone as well as of specific links of interest: and delay statistics.<>
{"title":"Traffic characteristics of the T1 NSFNET backbone","authors":"K. Claffy, George C. Polyzos, Hans-Werner Braun","doi":"10.1109/INFCOM.1993.253279","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253279","url":null,"abstract":"The results of a measurement study of the T1 NSFNET backbone are presented. The measurement environment and the approach to data collection are discussed. Measurements results are then presented for: long-term growth in traffic volume, including attribution to domains and protocols; trends in average packet size on the network, over both long- and medium-term intervals; most popular sources, destinations, and site pairs; traffic locality; international distribution of traffic; mean utilization statistics of the overall backbone as well as of specific links of interest: and delay statistics.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123579045","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 : 1993-03-28DOI: 10.1109/INFCOM.1993.253320
Opher Yaron, M. Sidi
A way to calculate the performance of packet switching communication networks under a fixed (session-based) routing strategy, based on properly bounding the probability distribution functions of the system input processes, is proposed. The bounds suggested, which are decaying exponentials, posses three convenient properties. When the inputs to an isolated network element are all bounded, they result in bounded outputs and ensure that the delays and queues in this element have exponentially decaying distribution. In some network settings, the bounded inputs result in bounded outputs. Finally, natural traffic processes can be shown to satisfy such bounds. These properties enable the calculation of upper bounds for all the interesting parameters of network performance, in a variety of settings.<>
{"title":"Calculating performance bounds in communication networks","authors":"Opher Yaron, M. Sidi","doi":"10.1109/INFCOM.1993.253320","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253320","url":null,"abstract":"A way to calculate the performance of packet switching communication networks under a fixed (session-based) routing strategy, based on properly bounding the probability distribution functions of the system input processes, is proposed. The bounds suggested, which are decaying exponentials, posses three convenient properties. When the inputs to an isolated network element are all bounded, they result in bounded outputs and ensure that the delays and queues in this element have exponentially decaying distribution. In some network settings, the bounded inputs result in bounded outputs. Finally, natural traffic processes can be shown to satisfy such bounds. These properties enable the calculation of upper bounds for all the interesting parameters of network performance, in a variety of settings.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121863373","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 : 1993-03-28DOI: 10.1109/INFCOM.1993.253311
S. Low, P. Varaiya
An exact analysis of the dynamic behavior of IGRP, an adaptive shortest-path routing algorithm, is performed. The distance metric is a weighted sum of traffic-sensitive and traffic-insensitive delay components. The optimality and stability of the protocol is related to the ratio of the weights. In particular, it is shown that if the traffic-sensitive component is not given enough weight, then starting from any initial routing, the subsequent routings after finitely many update periods will oscillate between two worst cases. Otherwise, the successive routings will converge to the unique equilibrium routing. It is also shown that load sharing among routes whose distances are within a threshold of the minimum distance helps stabilize the dynamic behavior.<>
{"title":"Stability of a class of dynamic routing protocols (IGRP)","authors":"S. Low, P. Varaiya","doi":"10.1109/INFCOM.1993.253311","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253311","url":null,"abstract":"An exact analysis of the dynamic behavior of IGRP, an adaptive shortest-path routing algorithm, is performed. The distance metric is a weighted sum of traffic-sensitive and traffic-insensitive delay components. The optimality and stability of the protocol is related to the ratio of the weights. In particular, it is shown that if the traffic-sensitive component is not given enough weight, then starting from any initial routing, the subsequent routings after finitely many update periods will oscillate between two worst cases. Otherwise, the successive routings will converge to the unique equilibrium routing. It is also shown that load sharing among routes whose distances are within a threshold of the minimum distance helps stabilize the dynamic behavior.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129329664","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 : 1993-03-28DOI: 10.1109/INFCOM.1993.253407
Paola Fulchignoni, Giovanni Marrota, A. J. Wiley
The need for secure data exchange within the public Switched Multimegabit Data Service (SMDS) environment is addressed by applying the IEEE 802.10 Secure Data Exchange (SDE) protocol. A result of this study has been the implementation of an efficient protection mechanism for information transfer over the public SMDS network, providing security against unauthorized disclosure, data modification, masquerading attacks, and unauthorized access to resources. A security and key management system, consisting of applications and protocols, has also been provided. This has been used for configuring security system attributes such as cryptographic keys, session keys, and security flags, and for the supervision of the SDE protocol and the maintenance of local secure management information bases.<>
{"title":"Applying security to SMDS: a practical example","authors":"Paola Fulchignoni, Giovanni Marrota, A. J. Wiley","doi":"10.1109/INFCOM.1993.253407","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253407","url":null,"abstract":"The need for secure data exchange within the public Switched Multimegabit Data Service (SMDS) environment is addressed by applying the IEEE 802.10 Secure Data Exchange (SDE) protocol. A result of this study has been the implementation of an efficient protection mechanism for information transfer over the public SMDS network, providing security against unauthorized disclosure, data modification, masquerading attacks, and unauthorized access to resources. A security and key management system, consisting of applications and protocols, has also been provided. This has been used for configuring security system attributes such as cryptographic keys, session keys, and security flags, and for the supervision of the SDE protocol and the maintenance of local secure management information bases.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125676629","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 : 1993-03-28DOI: 10.1109/INFCOM.1993.253236
L. Reiss, L. Merakos
Two mechanisms for shaping private network traffic in asynchronous transfer mode (ATM) broadband ISDN (B-ISDN) are proposed and analyzed. The shapers utilize the information about the network policer and implement a form of priority service to assure satisfactory levels of cell loss and delay for traffic streams with differing service requirements multiplexed into a policed ATM virtual path. The performance of the shapers is analyzed using stochastic-fluid methods and Markov-modulated models of bursty traffic sources. The numerical results illustrate the performance benefits and flexibility obtainable through the use of the proposed shapers in comparison to a simple policed path without traffic shaping.<>
{"title":"Shaping of virtual path traffic for ATM B-ISDN","authors":"L. Reiss, L. Merakos","doi":"10.1109/INFCOM.1993.253236","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253236","url":null,"abstract":"Two mechanisms for shaping private network traffic in asynchronous transfer mode (ATM) broadband ISDN (B-ISDN) are proposed and analyzed. The shapers utilize the information about the network policer and implement a form of priority service to assure satisfactory levels of cell loss and delay for traffic streams with differing service requirements multiplexed into a policed ATM virtual path. The performance of the shapers is analyzed using stochastic-fluid methods and Markov-modulated models of bursty traffic sources. The numerical results illustrate the performance benefits and flexibility obtainable through the use of the proposed shapers in comparison to a simple policed path without traffic shaping.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"11 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132891807","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
扫码关注我们
求助内容：
应助结果提醒方式：