Pub Date : 1999-02-10DOI: 10.1109/PCCC.1999.749467
G. Papadimitriou
A new protocol for WDM star networks is introduced. According to the proposed Centralized Packet Filtering (CPF) protocol, more than one stations share each wavelength and transmit their packets in a random access fashion. An array of electrooptic tunable filters, which is placed at the network hub, allows at most one packet per wavelength to pass to the star coupler; at each time slot. In this way, channel collisions are eliminated. Furthermore, the selection of the passing packets is implemented in such a way that receiver conflicts are avoided.
{"title":"Centralized packet filtering protocols: a new class of high performance protocols for single-hop lightwave WDM networks","authors":"G. Papadimitriou","doi":"10.1109/PCCC.1999.749467","DOIUrl":"https://doi.org/10.1109/PCCC.1999.749467","url":null,"abstract":"A new protocol for WDM star networks is introduced. According to the proposed Centralized Packet Filtering (CPF) protocol, more than one stations share each wavelength and transmit their packets in a random access fashion. An array of electrooptic tunable filters, which is placed at the network hub, allows at most one packet per wavelength to pass to the star coupler; at each time slot. In this way, channel collisions are eliminated. Furthermore, the selection of the passing packets is implemented in such a way that receiver conflicts are avoided.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126878796","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 : 1999-02-10DOI: 10.1109/PCCC.1999.749468
A. Kamal, H. Hassanein
This paper investigates the possibility of using wavelength division multiplexing to enhance the system capacity of local area networks with the bus topology. We first consider the choice between wavelength fixed and wavelength tunable transceivers based on practical considerations, and we conclude that the use of fixed wavelength transceivers allows one to employ WDM while still using standard interface cards. This requires that wavelength translation be implemented in the network. The paper then considers the problem of wavelength translation and introduces three approaches: the min-max approach that minimizes the maximum load on channels; the Translation at Destination approach in which wavelength translation is done only at the ingress point to the receiving channel, and the Translation at Source approach in which the wavelength translation is done at the egress point from the source. Practical algorithms for implementing these optimal allocations are considered. We then present throughput analysis of dual-bus networks employing the proposed translation approaches.
{"title":"Throughput analysis of WDM-based dual-bus local area networks","authors":"A. Kamal, H. Hassanein","doi":"10.1109/PCCC.1999.749468","DOIUrl":"https://doi.org/10.1109/PCCC.1999.749468","url":null,"abstract":"This paper investigates the possibility of using wavelength division multiplexing to enhance the system capacity of local area networks with the bus topology. We first consider the choice between wavelength fixed and wavelength tunable transceivers based on practical considerations, and we conclude that the use of fixed wavelength transceivers allows one to employ WDM while still using standard interface cards. This requires that wavelength translation be implemented in the network. The paper then considers the problem of wavelength translation and introduces three approaches: the min-max approach that minimizes the maximum load on channels; the Translation at Destination approach in which wavelength translation is done only at the ingress point to the receiving channel, and the Translation at Source approach in which the wavelength translation is done at the egress point from the source. Practical algorithms for implementing these optimal allocations are considered. We then present throughput analysis of dual-bus networks employing the proposed translation approaches.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116080192","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 : 1999-02-10DOI: 10.1109/PCCC.1999.749432
A. Gulati, S. Rai
This paper presents modifications to the Core Based Tree (CBT) multicast routing protocol for selecting a set of optimal routers in a domain as core routers for a multicast group. Currently, there is no mechanism in CBT to locate core routers in an automatic fashion, adapting to network changes. Our proposed modifications help configure an optimal router as core based on three heuristics: Center of Members (CBT-CoM), Center of Sources (CBT-CoS), and Center of Sources and Members (CBT-CoSM). We next evaluate and compare the performance of these heuristics using network dynamics. For this, an implementation based on the simulation package NSv2 and a topology generation package GT-ITM is considered.
{"title":"Core discovery in Internet multicast routing protocol","authors":"A. Gulati, S. Rai","doi":"10.1109/PCCC.1999.749432","DOIUrl":"https://doi.org/10.1109/PCCC.1999.749432","url":null,"abstract":"This paper presents modifications to the Core Based Tree (CBT) multicast routing protocol for selecting a set of optimal routers in a domain as core routers for a multicast group. Currently, there is no mechanism in CBT to locate core routers in an automatic fashion, adapting to network changes. Our proposed modifications help configure an optimal router as core based on three heuristics: Center of Members (CBT-CoM), Center of Sources (CBT-CoS), and Center of Sources and Members (CBT-CoSM). We next evaluate and compare the performance of these heuristics using network dynamics. For this, an implementation based on the simulation package NSv2 and a topology generation package GT-ITM is considered.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133290840","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 : 1999-02-10DOI: 10.1109/PCCC.1999.749419
An-I Wang, P. Reiher, R. Bagrodia
Optimistic replication of data is becoming increasingly popular in mobile environments, but its performance and scaling characteristics are not well understood. This paper presents a simulation evaluation of optimistic replicated filing in a mobile environment. We first compare full and selective optimistic replication systems to capture the properties required for scaling. We then show that the presence of portable computers in optimistically replicated filing systems achieves a 60-percent cost reduction (e.g., computing resources) with only a 10-percent degradation of service quality (e.g., consistency of data perceived by users). This finding reveals certain similarities between the network disconnection interval and frequency of data synchronization. The research suggests new guidelines for design of optimistic replication systems.
{"title":"A simulation evaluation of optimistic replicated filing in mobile environments","authors":"An-I Wang, P. Reiher, R. Bagrodia","doi":"10.1109/PCCC.1999.749419","DOIUrl":"https://doi.org/10.1109/PCCC.1999.749419","url":null,"abstract":"Optimistic replication of data is becoming increasingly popular in mobile environments, but its performance and scaling characteristics are not well understood. This paper presents a simulation evaluation of optimistic replicated filing in a mobile environment. We first compare full and selective optimistic replication systems to capture the properties required for scaling. We then show that the presence of portable computers in optimistically replicated filing systems achieves a 60-percent cost reduction (e.g., computing resources) with only a 10-percent degradation of service quality (e.g., consistency of data perceived by users). This finding reveals certain similarities between the network disconnection interval and frequency of data synchronization. The research suggests new guidelines for design of optimistic replication systems.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134341657","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 : 1999-02-10DOI: 10.1109/PCCC.1999.749425
M. Obaidat, C. B. Ahmed, N. Boudriga
The growing fields of wireless networks and asynchronous transfer mode (ATM) are merging to form wireless ATM networks. This paper addresses dynamic bandwidth allocation, connection admission procedures, routing, and location management strategies in wireless ATM. More precisely, we investigate the issue of extending the Private Network to Network Interface, PNNI, protocol to support mobility. PNNI-based hierarchical routing, hand-off location management and routing schemes are proposed to integrate wireless capabilities. These schemes provide a reduction in the connection disruption time during a connection handoff session and a predictable resource need of the mobile during its connection. This substantially reduces the overhead due to end-to-end re-transmissions invoked at higher layer. An analytical model is developed to illustrate the hand-off algorithm.
{"title":"Managing mobility in a wireless ATM network","authors":"M. Obaidat, C. B. Ahmed, N. Boudriga","doi":"10.1109/PCCC.1999.749425","DOIUrl":"https://doi.org/10.1109/PCCC.1999.749425","url":null,"abstract":"The growing fields of wireless networks and asynchronous transfer mode (ATM) are merging to form wireless ATM networks. This paper addresses dynamic bandwidth allocation, connection admission procedures, routing, and location management strategies in wireless ATM. More precisely, we investigate the issue of extending the Private Network to Network Interface, PNNI, protocol to support mobility. PNNI-based hierarchical routing, hand-off location management and routing schemes are proposed to integrate wireless capabilities. These schemes provide a reduction in the connection disruption time during a connection handoff session and a predictable resource need of the mobile during its connection. This substantially reduces the overhead due to end-to-end re-transmissions invoked at higher layer. An analytical model is developed to illustrate the hand-off algorithm.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115543678","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 : 1999-02-10DOI: 10.1109/PCCC.1999.749452
B. Grayson, L. John, C. Chase
We study the effect of memory access ordering policies on processor performance. Relaxed ordering policies increase available instruction-level parallelism, but such policies must be evaluated subject to their effect on memory consistency-since virtually all microprocessors are designed to be compatible with shared memory multiprocessor systems, even uniprocessor desktop computers are constrained by the rules of multiprocessor memory consistency models. We define the set of potential parallelism-restricting ordering rules found in strong memory models. We then construct a spectrum of possible memory models by progressively relaxing these restrictions. Some of our models are similar to those of existing commercial processors, other models illustrate potential alternatives. We simulate and analyze several uniprocessor benchmarks from the SPEC95 and SPLASH-2 suites using a super scalar processor simulator (Armadillo) developed at the University of Texas at Austin. This simulator models dataflow instruction execution, branch prediction, speculative execution, memory disambiguation and an aggressive memory system. Our experiments confirm the significant benefits of a weaker memory model on processor performance. Although the absolute performance varies considerably from benchmark to benchmark, the relative performance gains of relaxing specific memory ordering constraints is surprisingly similar across most of the benchmarks.
{"title":"The effects of memory-access ordering on multiple-issue uniprocessor performance","authors":"B. Grayson, L. John, C. Chase","doi":"10.1109/PCCC.1999.749452","DOIUrl":"https://doi.org/10.1109/PCCC.1999.749452","url":null,"abstract":"We study the effect of memory access ordering policies on processor performance. Relaxed ordering policies increase available instruction-level parallelism, but such policies must be evaluated subject to their effect on memory consistency-since virtually all microprocessors are designed to be compatible with shared memory multiprocessor systems, even uniprocessor desktop computers are constrained by the rules of multiprocessor memory consistency models. We define the set of potential parallelism-restricting ordering rules found in strong memory models. We then construct a spectrum of possible memory models by progressively relaxing these restrictions. Some of our models are similar to those of existing commercial processors, other models illustrate potential alternatives. We simulate and analyze several uniprocessor benchmarks from the SPEC95 and SPLASH-2 suites using a super scalar processor simulator (Armadillo) developed at the University of Texas at Austin. This simulator models dataflow instruction execution, branch prediction, speculative execution, memory disambiguation and an aggressive memory system. Our experiments confirm the significant benefits of a weaker memory model on processor performance. Although the absolute performance varies considerably from benchmark to benchmark, the relative performance gains of relaxing specific memory ordering constraints is surprisingly similar across most of the benchmarks.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126287285","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 : 1999-02-10DOI: 10.1109/PCCC.1999.749460
F. Liotopoulos
We present a high performance, scalable architecture for a video on demand (VoD) system, using a three stage Clos switch. Three stage Clos switching networks have been used in the past in multiprocessor interconnection networks as well as for ATM switching fabrics due to their attractive low latency and fault tolerance properties. The proposed VoD system mainly consists of such a three stage Clos switch, which scales to 1024 OC-3 inputs and 1024 OC-3 outputs, offering more than 132 Gbps of pure switching capacity. Video data is transported through the switching network using the ATM cell format and switching protocol, connection oriented network services and fast virtual circuit switching. Routing is centrally performed by means of intelligent nearly nonblocking control algorithms, developed for Clos networks, which increase the switch utilization and significantly reduce the blocking probability at call setup. The proposed architecture can manipulate up to several Terabytes of video data and simultaneously serve 22000 to 66000 out of a total of 262144 end users. Depending on the number of middle stage switches and the control algorithm used, the blocking probability at call setup can range between zero and 5e-4.
{"title":"A high-capacity, scalable video-on-demand system architecture, based on a 3-stage Clos network","authors":"F. Liotopoulos","doi":"10.1109/PCCC.1999.749460","DOIUrl":"https://doi.org/10.1109/PCCC.1999.749460","url":null,"abstract":"We present a high performance, scalable architecture for a video on demand (VoD) system, using a three stage Clos switch. Three stage Clos switching networks have been used in the past in multiprocessor interconnection networks as well as for ATM switching fabrics due to their attractive low latency and fault tolerance properties. The proposed VoD system mainly consists of such a three stage Clos switch, which scales to 1024 OC-3 inputs and 1024 OC-3 outputs, offering more than 132 Gbps of pure switching capacity. Video data is transported through the switching network using the ATM cell format and switching protocol, connection oriented network services and fast virtual circuit switching. Routing is centrally performed by means of intelligent nearly nonblocking control algorithms, developed for Clos networks, which increase the switch utilization and significantly reduce the blocking probability at call setup. The proposed architecture can manipulate up to several Terabytes of video data and simultaneously serve 22000 to 66000 out of a total of 262144 end users. Depending on the number of middle stage switches and the control algorithm used, the blocking probability at call setup can range between zero and 5e-4.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128039792","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 : 1999-02-10DOI: 10.1109/PCCC.1999.749434
Raymond E. Miller, Z. U. Chaudry
This paper introduces an approach for protocol performance estimation directly from a formal model of the protocol. By using the approach presented in this paper, performance of a protocol can be quickly estimated at an early stage of protocol design. The simplicity of analysis, achieved by deterministic analysis, and the tight integration of the performance model, called the performance reachability graph (PRG), with the formal specification makes the approach in this paper a very useful protocol design-time tool. The approach provides a two way path between the specification model and the performance model. In one direction, the tight coupling between the specification and the performance models allows a protocol designer to get quick estimates of performance from the specification. In the other direction a designer can use the performance estimates to quickly identify portions of the specification responsible for undesired performance characteristics and consider changes to the specification to improve the overall performance.
{"title":"On estimating protocol performance from a formal specification","authors":"Raymond E. Miller, Z. U. Chaudry","doi":"10.1109/PCCC.1999.749434","DOIUrl":"https://doi.org/10.1109/PCCC.1999.749434","url":null,"abstract":"This paper introduces an approach for protocol performance estimation directly from a formal model of the protocol. By using the approach presented in this paper, performance of a protocol can be quickly estimated at an early stage of protocol design. The simplicity of analysis, achieved by deterministic analysis, and the tight integration of the performance model, called the performance reachability graph (PRG), with the formal specification makes the approach in this paper a very useful protocol design-time tool. The approach provides a two way path between the specification model and the performance model. In one direction, the tight coupling between the specification and the performance models allows a protocol designer to get quick estimates of performance from the specification. In the other direction a designer can use the performance estimates to quickly identify portions of the specification responsible for undesired performance characteristics and consider changes to the specification to improve the overall performance.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128852046","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 : 1999-02-10DOI: 10.1109/PCCC.1999.749446
Ezzat S. Atieh, M. Matalgah, M. Guizani
In this paper, we perform analysis and simulation for the calculation of the minimum buffer size requirements for Available Bit Rate (ABR) traffic. We utilized a recently developed feedback flow control congestion mechanism. This mechanism belongs to a class of Backpressure (BP) algorithms. It ensures no data loss and operates based on simple "stop" and "start" signals. In our analysis, a feedback scheme on multiple ABR connections is used. Two buffering approaches are analyzed: (1) A Dedicated Approach; in which the flow control mechanism is applied independently for each of the connections. Thus, each connection is provided with its own buffer. (2) A Shared Approach; in which there will be some form of buffer sharing among the ABR connections. We studied the effects of changing the distance between nodes (connection length), number of connections, and the peak rate of each connection on buffer requirements using the two approaches.
{"title":"Buffer requirements for ABR traffic using congestion control mechanism","authors":"Ezzat S. Atieh, M. Matalgah, M. Guizani","doi":"10.1109/PCCC.1999.749446","DOIUrl":"https://doi.org/10.1109/PCCC.1999.749446","url":null,"abstract":"In this paper, we perform analysis and simulation for the calculation of the minimum buffer size requirements for Available Bit Rate (ABR) traffic. We utilized a recently developed feedback flow control congestion mechanism. This mechanism belongs to a class of Backpressure (BP) algorithms. It ensures no data loss and operates based on simple \"stop\" and \"start\" signals. In our analysis, a feedback scheme on multiple ABR connections is used. Two buffering approaches are analyzed: (1) A Dedicated Approach; in which the flow control mechanism is applied independently for each of the connections. Thus, each connection is provided with its own buffer. (2) A Shared Approach; in which there will be some form of buffer sharing among the ABR connections. We studied the effects of changing the distance between nodes (connection length), number of connections, and the peak rate of each connection on buffer requirements using the two approaches.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116598528","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 : 1999-02-10DOI: 10.1109/PCCC.1999.749438
J. Harju, K. Pulakka
This article describes a congestion control protocol, based on the use of fuzzy controllers, for efficient utilisation of the capacity of the network. The basic control mechanism uses rate-based control, closely resembling the one specified by the ATM Forum for the Available Bit Rate (ABR) service category. Fuzzy logic is utilised in the network elements to enhance the required control decisions with the general aim of fair and optimal utilisation of the available bandwidth. The control protocol adapts to the changes of the load produced by CBR and VBR connections, and shares the available capacity of the network fairly between ABR connections. Simulations have been carried out to test the performance of the control system in the presence of several VBR and ABR connections with statistical traffic distributions and with varying buffer sizes of the network elements. Results of the tests show the adaptability and efficiency of the control system.
{"title":"Optimisation of the performance of a rate-based congestion control system by using fuzzy controllers","authors":"J. Harju, K. Pulakka","doi":"10.1109/PCCC.1999.749438","DOIUrl":"https://doi.org/10.1109/PCCC.1999.749438","url":null,"abstract":"This article describes a congestion control protocol, based on the use of fuzzy controllers, for efficient utilisation of the capacity of the network. The basic control mechanism uses rate-based control, closely resembling the one specified by the ATM Forum for the Available Bit Rate (ABR) service category. Fuzzy logic is utilised in the network elements to enhance the required control decisions with the general aim of fair and optimal utilisation of the available bandwidth. The control protocol adapts to the changes of the load produced by CBR and VBR connections, and shares the available capacity of the network fairly between ABR connections. Simulations have been carried out to test the performance of the control system in the presence of several VBR and ABR connections with statistical traffic distributions and with varying buffer sizes of the network elements. Results of the tests show the adaptability and efficiency of the control system.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131758310","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
扫码关注我们
求助内容：
应助结果提醒方式：