Pub Date : 1993-10-19DOI: 10.1109/ICNP.1993.340920
P. Havala, H. Kaur, M. Sosa, M. Ulema
The proposed congestion notification strategy for SMDS networks presented in this paper is based on explicit notification, which uses control messages to inform other network elements of congestion. Network elements respond to explicit notifications by matching the traffic entering the network to the network loading. For an effective congestion management strategy, the notifications should carry sufficient information about the congested resource so that the notified switching systems (SSs) may reduce traffic towards the congested SS. Since the internal architecture of an SS is not visible to other SSs in the network, the congestion notification mechanism maps the SS resource congestion to path congestion, identified by open interfaces such as the inter-SS, intercarrier, and customer-to-network interfaces, which are visible to all SSs in the network.<>
{"title":"A congestion notification technique for SMDS networks","authors":"P. Havala, H. Kaur, M. Sosa, M. Ulema","doi":"10.1109/ICNP.1993.340920","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340920","url":null,"abstract":"The proposed congestion notification strategy for SMDS networks presented in this paper is based on explicit notification, which uses control messages to inform other network elements of congestion. Network elements respond to explicit notifications by matching the traffic entering the network to the network loading. For an effective congestion management strategy, the notifications should carry sufficient information about the congested resource so that the notified switching systems (SSs) may reduce traffic towards the congested SS. Since the internal architecture of an SS is not visible to other SSs in the network, the congestion notification mechanism maps the SS resource congestion to path congestion, identified by open interfaces such as the inter-SS, intercarrier, and customer-to-network interfaces, which are visible to all SSs in the network.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"12 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123538283","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-10-19DOI: 10.1109/ICNP.1993.340892
A. Tarraf, I. Habib, T. Saadawi
Accurate characterization of the multimedia traffic is essential, in asynchronous transfer mode (ATM) broadband networks, in order to develop a robust set of traffic descriptors. Such a set is required, by the usage parameter control (UPC) algorithm, for traffic enforcement (policing). The authors present a novel approach to characterize and model the multimedia traffic using neural networks (NNs). A backpropagation NN is used to characterize and predict the statistical variations of the packet arrival process resulting from the superposition of N packetized video sources and M packetized voice sources. The accuracy of the results is verified by matching the index of dispersion for counts (IDC), the variance, and the autocorrelation of the arrival process to those of the NN output. The results show that the NNs can be successfully utilized to characterize the complex nonrenewal process with extreme accuracy.<>
{"title":"A novel neural network traffic descriptor for ATM networks","authors":"A. Tarraf, I. Habib, T. Saadawi","doi":"10.1109/ICNP.1993.340892","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340892","url":null,"abstract":"Accurate characterization of the multimedia traffic is essential, in asynchronous transfer mode (ATM) broadband networks, in order to develop a robust set of traffic descriptors. Such a set is required, by the usage parameter control (UPC) algorithm, for traffic enforcement (policing). The authors present a novel approach to characterize and model the multimedia traffic using neural networks (NNs). A backpropagation NN is used to characterize and predict the statistical variations of the packet arrival process resulting from the superposition of N packetized video sources and M packetized voice sources. The accuracy of the results is verified by matching the index of dispersion for counts (IDC), the variance, and the autocorrelation of the arrival process to those of the NN output. The results show that the NNs can be successfully utilized to characterize the complex nonrenewal process with extreme accuracy.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122698961","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-10-19DOI: 10.1109/ICNP.1993.340910
G. M. Lundy, Berna Bülbül
Systems of communicating machines (SCM) is a formal model for the specification, verification and testing of communication protocols, which has been used to specify and verify several well-known protocols. The authors discuss a program, called mushroom, which automates the analysis using the SCM model. The program generates either the system state analysis or the full reachability analysis. The automation of this model is expected to greatly facilitate the use of the model for protocol design and analysis. The program has been used to verify some theoretical results, serving to confirm these earlier results.<>
{"title":"Mushroom: a program for the automated verification of an SCM protocol specification","authors":"G. M. Lundy, Berna Bülbül","doi":"10.1109/ICNP.1993.340910","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340910","url":null,"abstract":"Systems of communicating machines (SCM) is a formal model for the specification, verification and testing of communication protocols, which has been used to specify and verify several well-known protocols. The authors discuss a program, called mushroom, which automates the analysis using the SCM model. The program generates either the system state analysis or the full reachability analysis. The automation of this model is expected to greatly facilitate the use of the model for protocol design and analysis. The program has been used to verify some theoretical results, serving to confirm these earlier results.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128465138","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-10-19DOI: 10.1109/ICNP.1993.340919
R. Chang, L. Huynh, J. Gray
Recent simulation studies of TCP congestion control Slow-Start clearly show problems of oscillatory behavior in packet delay, congestion windows and throughput. Furthermore, it also suffers from rapid fluctuations in queue length, periodic packet losses, and underutilization of the transmission line in a large pipeline size and/or two-way traffic environments. These studies also exhibit three fairness problems in TCP-SS: systematic discrimination of a particular connection in periodic traffic, a bias against a connection with a long round trip time and a bias against bursty traffic. Based on the principles of rate control and preventive congestion mechanism, the authors have developed a new adaptive rate-based (ARB) congestion avoidance scheme that avoids these problems present in TCP-SS. It is demonstrated through simulations that ARB outperforms TCP-SS in network efficiency and fairness.<>
{"title":"Adaptive rate-based congestion control versus TCP-SS: a performance comparison","authors":"R. Chang, L. Huynh, J. Gray","doi":"10.1109/ICNP.1993.340919","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340919","url":null,"abstract":"Recent simulation studies of TCP congestion control Slow-Start clearly show problems of oscillatory behavior in packet delay, congestion windows and throughput. Furthermore, it also suffers from rapid fluctuations in queue length, periodic packet losses, and underutilization of the transmission line in a large pipeline size and/or two-way traffic environments. These studies also exhibit three fairness problems in TCP-SS: systematic discrimination of a particular connection in periodic traffic, a bias against a connection with a long round trip time and a bias against bursty traffic. Based on the principles of rate control and preventive congestion mechanism, the authors have developed a new adaptive rate-based (ARB) congestion avoidance scheme that avoids these problems present in TCP-SS. It is demonstrated through simulations that ARB outperforms TCP-SS in network efficiency and fairness.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"57 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120869050","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-10-19DOI: 10.1109/ICNP.1993.340916
Raymond E. Miller, S. Paul
This paper focuses on a technique to reduce the length of maximal fault coverage test sequences for communication protocols by removing redundant test segments. This approach conceptually begins with all the test segments needed for the generation of maximal fault coverage test sequences, analyzes the structure of the specified finite state machine for the protocol, and shows that certain segments in these tests are unnecessary to guarantee maximal fault coverage. From this analysis an algorithm is proposed for generating the reduced length sequences that still guarantee maximal fault coverage. The authors describe how these tests are in some sense minimal, or near minimal, length test sequences without losing fault coverage.<>
{"title":"Generating maximal fault coverage conformance test sequences of reduced length for communication protocols","authors":"Raymond E. Miller, S. Paul","doi":"10.1109/ICNP.1993.340916","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340916","url":null,"abstract":"This paper focuses on a technique to reduce the length of maximal fault coverage test sequences for communication protocols by removing redundant test segments. This approach conceptually begins with all the test segments needed for the generation of maximal fault coverage test sequences, analyzes the structure of the specified finite state machine for the protocol, and shows that certain segments in these tests are unnecessary to guarantee maximal fault coverage. From this analysis an algorithm is proposed for generating the reduced length sequences that still guarantee maximal fault coverage. The authors describe how these tests are in some sense minimal, or near minimal, length test sequences without losing fault coverage.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124426225","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-10-19DOI: 10.1109/ICNP.1993.340922
Leo Cacciari, O. Rafiq
Reachability analysis, which is the most used technique in protocol validation, is based on the construction of a graph called the reachability graph. However this technique has two serious drawbacks: the undecidability of the finiteness of the reachability graph and the state explosion when it is finite. To cope with the latter problem, reduction techniques are required. After a brief presentation of their reduced reachability graph the authors deal with related decidability issues and show how decidability results can be applied to the global reachability graph.<>
{"title":"Decidability issues in reduced reachability analysis","authors":"Leo Cacciari, O. Rafiq","doi":"10.1109/ICNP.1993.340922","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340922","url":null,"abstract":"Reachability analysis, which is the most used technique in protocol validation, is based on the construction of a graph called the reachability graph. However this technique has two serious drawbacks: the undecidability of the finiteness of the reachability graph and the state explosion when it is finite. To cope with the latter problem, reduction techniques are required. After a brief presentation of their reduced reachability graph the authors deal with related decidability issues and show how decidability results can be applied to the global reachability graph.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125814851","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-10-19DOI: 10.1109/ICNP.1993.340912
Richard G. Guy, G. Popek, T. Page
This paper presents a practical set of algorithms for maintaining the consistency of a replicated file system with an optimistic update policy. These algorithms permit a system which allows updates to an object so long as any copy is available; the algorithms then return the various copies to consistency at their first opportunity. These algorithms have been used to build the Ficus replicated file system.<>
{"title":"Consistency algorithms for optimistic replication","authors":"Richard G. Guy, G. Popek, T. Page","doi":"10.1109/ICNP.1993.340912","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340912","url":null,"abstract":"This paper presents a practical set of algorithms for maintaining the consistency of a replicated file system with an optimistic update policy. These algorithms permit a system which allows updates to an object so long as any copy is available; the algorithms then return the various copies to consistency at their first opportunity. These algorithms have been used to build the Ficus replicated file system.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127100709","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-10-19DOI: 10.1109/ICNP.1993.340890
S. Low
A probabilistic approach to conformance testing of protocols containing unobservable transitions is proposed. It is said that an implementation conforms to its specification if their observable behavior is probabilistically the same, when both are subject to the same random environment simulated by the tester. Under the randomized inputs, faults in unobservable transitions may manifest themselves in certain statistics measurable from the implementation, and hence can be detected by comparing these measurements against the desirable statistics computed from the specification. The sensitivity of the nonconformance criterion to the uncertainty in our knowledge of desirable statistics is also studied. The conventional testing of protocols without unobservable transitions uses mismatch in outputs to detect faults. Here, one relies, in addition, on mismatch in the dynamics of the protocol under input randomization.<>
{"title":"Probabilistic conformance testing of protocols with unobservable transitions","authors":"S. Low","doi":"10.1109/ICNP.1993.340890","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340890","url":null,"abstract":"A probabilistic approach to conformance testing of protocols containing unobservable transitions is proposed. It is said that an implementation conforms to its specification if their observable behavior is probabilistically the same, when both are subject to the same random environment simulated by the tester. Under the randomized inputs, faults in unobservable transitions may manifest themselves in certain statistics measurable from the implementation, and hence can be detected by comparing these measurements against the desirable statistics computed from the specification. The sensitivity of the nonconformance criterion to the uncertainty in our knowledge of desirable statistics is also studied. The conventional testing of protocols without unobservable transitions uses mismatch in outputs to detect faults. Here, one relies, in addition, on mismatch in the dynamics of the protocol under input randomization.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131956157","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-10-19DOI: 10.1109/ICNP.1993.340894
A. Jirachiefpattana, R. Lai
The techniques for verifying protocols specified in Estelle have so far focused on translating the specifications into another form, such as finite state machines or Petri nets, for which tools of verification have already been implemented. All the Estelle verification tools impose some restrictions on the specifications to be verified: the techniques use a subset of Estelle or restrict the complexity of the specifications that can be verified; or the specifications need to be specified in a variant of Estelle, rather than standardized Estelle. In particular, the dynamic behaviors of Estelle are not handled. This paper describes the verification of Estelle specifications by translating them into those of numerical Petri nets, which can then be verified by a proven automated verification tool, PROTEAN.<>
{"title":"Verifying Estelle specifications: numerical Petri nets approach","authors":"A. Jirachiefpattana, R. Lai","doi":"10.1109/ICNP.1993.340894","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340894","url":null,"abstract":"The techniques for verifying protocols specified in Estelle have so far focused on translating the specifications into another form, such as finite state machines or Petri nets, for which tools of verification have already been implemented. All the Estelle verification tools impose some restrictions on the specifications to be verified: the techniques use a subset of Estelle or restrict the complexity of the specifications that can be verified; or the specifications need to be specified in a variant of Estelle, rather than standardized Estelle. In particular, the dynamic behaviors of Estelle are not handled. This paper describes the verification of Estelle specifications by translating them into those of numerical Petri nets, which can then be verified by a proven automated verification tool, PROTEAN.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123116945","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-10-19DOI: 10.1109/ICNP.1993.340921
W. Peng, K. Makki
With Petri nets as the concurrent model, the issue of self-stabilizing communication protocols is discussed. It is argued that self-stabilizing extensions of communication protocols should not interfere with their normal operations by giving a new definition of self-stabilizing extension and a ring net that meets the new definition. It is also argued that communication protocols are usually delay sensitive and timed Petri nets provide a more suitable formal model than ordinary Petri nets to express the self-stabilizing property. The possibility and suitability of using Petri nets with a new type of transitions, the max transitions, to express self-stabilizing communication protocols is explored. To facilitate practical implementations, two types of interferences, external and internal interferences, are formally identified and discussed.<>
{"title":"On Petri nets and self-stabilization of communication protocols","authors":"W. Peng, K. Makki","doi":"10.1109/ICNP.1993.340921","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340921","url":null,"abstract":"With Petri nets as the concurrent model, the issue of self-stabilizing communication protocols is discussed. It is argued that self-stabilizing extensions of communication protocols should not interfere with their normal operations by giving a new definition of self-stabilizing extension and a ring net that meets the new definition. It is also argued that communication protocols are usually delay sensitive and timed Petri nets provide a more suitable formal model than ordinary Petri nets to express the self-stabilizing property. The possibility and suitability of using Petri nets with a new type of transitions, the max transitions, to express self-stabilizing communication protocols is explored. To facilitate practical implementations, two types of interferences, external and internal interferences, are formally identified and discussed.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131220281","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
扫码关注我们
求助内容：
应助结果提醒方式：