Pub Date : 2002-11-07DOI: 10.1109/HPSR.2002.1024252
Jingxuan Liu, N. Ansari
Optical burst switching (OBS) is a promising technology to facilitate IP-over-WDM. In order to improve the quality of services (QoS) in OBS transmission networks, an adaptive method based on linear predictive filtering is proposed to dynamically allocate the limited optical buffers to different classes of traffic. Optical buffers are allocated on a per-class and per-label basis, according to the incoming traffic intensity and priority. This buffer management strategy decreases traffic loss caused by resource contention, and gives the loss-sensitive traffic precedence to access buffers over the loss-tolerant traffic. A new system model is introduced, and simulations show that our proposed adaptive-filter-based dynamic buffer allocation method provides better QoS compliance to traffic with higher priority, and achieves a lower system weighted loss than a fixed-sized buffer system does.
{"title":"Class-based dynamic buffer allocation for optical burst switching networks","authors":"Jingxuan Liu, N. Ansari","doi":"10.1109/HPSR.2002.1024252","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024252","url":null,"abstract":"Optical burst switching (OBS) is a promising technology to facilitate IP-over-WDM. In order to improve the quality of services (QoS) in OBS transmission networks, an adaptive method based on linear predictive filtering is proposed to dynamically allocate the limited optical buffers to different classes of traffic. Optical buffers are allocated on a per-class and per-label basis, according to the incoming traffic intensity and priority. This buffer management strategy decreases traffic loss caused by resource contention, and gives the loss-sensitive traffic precedence to access buffers over the loss-tolerant traffic. A new system model is introduced, and simulations show that our proposed adaptive-filter-based dynamic buffer allocation method provides better QoS compliance to traffic with higher priority, and achieves a lower system weighted loss than a fixed-sized buffer system does.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131980876","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024631
S. Yamano, Y. Oshima, T. Kanoh, C. Onuma
{"title":"High performance demonstration in optical-IP merged network","authors":"S. Yamano, Y. Oshima, T. Kanoh, C. Onuma","doi":"10.1109/HPSR.2002.1024631","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024631","url":null,"abstract":"","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126871377","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024255
Jingshown Wu, Hsien-Po Shiang, Kun-Tso Chen, H. Tsao
In this paper, we analyze the performance of a high-speed variable length self-routing packet switch. Conventional crossbar switches need a powerful central control unit, complex matching algorithms, and speed up to have high throughput and low delay. Contrary, in this switch the routing function is performed by each switching element with an address correlator. In addition this switch employs multiplane structure and input port expansion scheme to alleviate head of line (HOL) blocking. We study delay, and throughput of this switch for various numbers of planes and expansion ratio under uniform traffic assumption. Results show that with reasonable number of planes and expansion ratio, the self-routing switch performs almost the same as output queue (OQ) switches, which have low input delay and 100% throughput. The simulation results agree with the analytical calculation very well.
{"title":"Delay and throughput analysis of the high speed variable length self-routing packet switch","authors":"Jingshown Wu, Hsien-Po Shiang, Kun-Tso Chen, H. Tsao","doi":"10.1109/HPSR.2002.1024255","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024255","url":null,"abstract":"In this paper, we analyze the performance of a high-speed variable length self-routing packet switch. Conventional crossbar switches need a powerful central control unit, complex matching algorithms, and speed up to have high throughput and low delay. Contrary, in this switch the routing function is performed by each switching element with an address correlator. In addition this switch employs multiplane structure and input port expansion scheme to alleviate head of line (HOL) blocking. We study delay, and throughput of this switch for various numbers of planes and expansion ratio under uniform traffic assumption. Results show that with reasonable number of planes and expansion ratio, the self-routing switch performs almost the same as output queue (OQ) switches, which have low input delay and 100% throughput. The simulation results agree with the analytical calculation very well.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115617871","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024251
Yu-Kung Ke, John A. Copeland
In this paper we introduce a path-finding algorithm, maximal reservable bandwidth tree (MRBT), for the QoS-based routing to establish connections with the bandwidth requirement. Our goal aims to eliminate the use of per-flow state information, commonly used for the guaranteed service with the rated-base service discipline scheme, and needed to be stored at each router along an established path. Instead, we aggregate flows at the same egress router, into a MRBT; each router only needs to maintain the aggregated flows state information on a per-MRBT basis. Each MRBT is a directed tree that reversely roots at a (egress) border node and spans all the other (ingress) border nodes, and the maximal reservable bandwidth (MRB) between each border node and the root is calculated according to the most updated advertisements of the physical-link bandwidth within a routing domain. At each instance, the total number of the MRBT in a routing domain is proportional to the number of the border nodes and the frequency of the QoS-based routing information advertisement. Because of the nature of the path mergence, each MRBT structure can be stored by recording each of its outgoing branches (or interface) at each local node, and the affected MRB between each node and the root can be easily updated upon the establishment or the release of each connection. We compare the MRBT algorithm simply to the modified Dijkstra's algorithm, which calculates the paths with the MRB between each pair of border nodes. Using computer simulation, we measure their performance in terms of the successful setup of connections and the scalability in terms of the amount of state information stored at each node. Our results show that MRBT could provide good scalability, which relieves the burden of per-flow traffic management, while maintaining competitive performance.
{"title":"Maximal reservable bandwidth tree - a new approach to reduce the storage of state information","authors":"Yu-Kung Ke, John A. Copeland","doi":"10.1109/HPSR.2002.1024251","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024251","url":null,"abstract":"In this paper we introduce a path-finding algorithm, maximal reservable bandwidth tree (MRBT), for the QoS-based routing to establish connections with the bandwidth requirement. Our goal aims to eliminate the use of per-flow state information, commonly used for the guaranteed service with the rated-base service discipline scheme, and needed to be stored at each router along an established path. Instead, we aggregate flows at the same egress router, into a MRBT; each router only needs to maintain the aggregated flows state information on a per-MRBT basis. Each MRBT is a directed tree that reversely roots at a (egress) border node and spans all the other (ingress) border nodes, and the maximal reservable bandwidth (MRB) between each border node and the root is calculated according to the most updated advertisements of the physical-link bandwidth within a routing domain. At each instance, the total number of the MRBT in a routing domain is proportional to the number of the border nodes and the frequency of the QoS-based routing information advertisement. Because of the nature of the path mergence, each MRBT structure can be stored by recording each of its outgoing branches (or interface) at each local node, and the affected MRB between each node and the root can be easily updated upon the establishment or the release of each connection. We compare the MRBT algorithm simply to the modified Dijkstra's algorithm, which calculates the paths with the MRB between each pair of border nodes. Using computer simulation, we measure their performance in terms of the successful setup of connections and the scalability in terms of the amount of state information stored at each node. Our results show that MRBT could provide good scalability, which relieves the burden of per-flow traffic management, while maintaining competitive performance.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123981682","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024258
Konghong Pun, M. Hamdi
The Clos-network is widely recognized as a scalable architecture for high-performance switches and routers. One of the key challenges in designing a Clos-network switch for a high-speed environment is the design of the dispatching/scheduling so as to be efficient for a wide range of traffic patterns, yet practical to be implemented in hardware. Based on the static round-robin scheduling technique, we propose the SRRD cell dispatching algorithm and its variants for Clos-network switches in this paper. Our algorithms are based on the request-grant-accept (RGA) handshaking scheme, which can be implemented using simple distributed arbiters at the input and output of the Clos-network. The intuition behind our SRRD schemes is to desynchronize the pointers of the arbiters in a static way and by to use a rotating-search technique to improve the performance under non-uniform traffic. Our simulation results demonstrate that our algorithms achieve the lowest delay and highest throughput among all other related schemes. In addition, their hardware implementations seem to be even simpler than that of related algorithms.
{"title":"Static round-robin dispatching schemes for Clos-network switches","authors":"Konghong Pun, M. Hamdi","doi":"10.1109/HPSR.2002.1024258","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024258","url":null,"abstract":"The Clos-network is widely recognized as a scalable architecture for high-performance switches and routers. One of the key challenges in designing a Clos-network switch for a high-speed environment is the design of the dispatching/scheduling so as to be efficient for a wide range of traffic patterns, yet practical to be implemented in hardware. Based on the static round-robin scheduling technique, we propose the SRRD cell dispatching algorithm and its variants for Clos-network switches in this paper. Our algorithms are based on the request-grant-accept (RGA) handshaking scheme, which can be implemented using simple distributed arbiters at the input and output of the Clos-network. The intuition behind our SRRD schemes is to desynchronize the pointers of the arbiters in a static way and by to use a rotating-search technique to improve the performance under non-uniform traffic. Our simulation results demonstrate that our algorithms achieve the lowest delay and highest throughput among all other related schemes. In addition, their hardware implementations seem to be even simpler than that of related algorithms.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116957092","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024639
R. Onvural
{"title":"Pacemaker/sup TM/ OC-48 traffic management engine demo","authors":"R. Onvural","doi":"10.1109/HPSR.2002.1024639","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024639","url":null,"abstract":"","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124637217","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024624
Y. Hiranuma, Y. Ozaki, S. Hasegawa
Planning to conduct testing demos using RouterTesterRouterTester 900, such as Performance Measurement, Stress and Conformance Tests for High-speed Internet Backbone, Optical Networks, GigabitlTerabit Routers, ATMAP, MPLS/GMPLS, Routing & Signaling Protocols and Traffic Engineering & Control. Also planning to demo Network Analyzer/Distributed Network AnalyzerNQT including IP Protocol Analysis QoS(Vo1P) Tests for Next Generation Mobile Network, MPLWGMPLS, Routing & Signaling Protocols and VoIP. Regarding Multi-rate 10G Tester, Demo for I&M Target Application (Signal Wizard & Remote Operation) will be conducted.
{"title":"Router tester/routertester 900 - next generation network environment test demo - Network analyzer/distributed network analyzer/VQT - next generation IP protocol analysis demo - Multi-rate 10G tester - signal wizard (all channel test) & remote operation demo","authors":"Y. Hiranuma, Y. Ozaki, S. Hasegawa","doi":"10.1109/HPSR.2002.1024624","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024624","url":null,"abstract":"Planning to conduct testing demos using RouterTesterRouterTester 900, such as Performance Measurement, Stress and Conformance Tests for High-speed Internet Backbone, Optical Networks, GigabitlTerabit Routers, ATMAP, MPLS/GMPLS, Routing & Signaling Protocols and Traffic Engineering & Control. Also planning to demo Network Analyzer/Distributed Network AnalyzerNQT including IP Protocol Analysis QoS(Vo1P) Tests for Next Generation Mobile Network, MPLWGMPLS, Routing & Signaling Protocols and VoIP. Regarding Multi-rate 10G Tester, Demo for I&M Target Application (Signal Wizard & Remote Operation) will be conducted.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127963853","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024225
R. Yang, M. Liang, Y. Chu, Cheng-Shong Wu
A dynamic thresholds buffer control scheme called partial sharing and partial partitioning (PSPP) is proposed. This scheme uses complete sharing (CS) for inactive ports and complete partitioning (CP) for active ports with dynamic buffer adjustability. Computer simulation shows that the loss performance of the PSPP is better than the CS and CP techniques under various traffic conditions even without threshold retuning.
{"title":"Dynamic thresholds for shared buffer switches with variable length packets","authors":"R. Yang, M. Liang, Y. Chu, Cheng-Shong Wu","doi":"10.1109/HPSR.2002.1024225","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024225","url":null,"abstract":"A dynamic thresholds buffer control scheme called partial sharing and partial partitioning (PSPP) is proposed. This scheme uses complete sharing (CS) for inactive ports and complete partitioning (CP) for active ports with dynamic buffer adjustability. Computer simulation shows that the loss performance of the PSPP is better than the CS and CP techniques under various traffic conditions even without threshold retuning.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124444045","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024628
T. Nakazawa
RHiNET-3/SW is an optical network switch that enables high-performance parallel computing in a flooror building-area environment. It can provide 10-Gbps x 8-port network switching with 1-km transmission length using 12channel parallel optical links. The switch consists of eight pairs of IO-Gbps optical link modules, one-chip CMOS ASIC switch LSI and four CMOS ASIC deskew-LSIs. Each optical link module transmits 8B10B encoded 10-bit characters and a 1-bit transmission clock at a data rate of 1.25 Gbps. The deskew-LSI can adjust the skew of 256 ns in I-km multimode fiber ribbons. By the frame synchronization used in the deskew-LSI, RHiNET-3/SW provides a longtransmission-length synchronized parallel optical data transmission. RHiNET-3/S W provides topology-free, deadlockfree and reliable network communication for the high-performance parallel computing. In order to build topology-free and deadlock-flee network, the switch supports 32 virtual channels with 640-Byte buffer memory. By using large amount of embedded memory on the switch LSI, RHiNET-3/S W allows low-latency, high-bandwidth performance. To provide highly reliable network, the switch uses hop-by-hop retransmission mechanism. This mechanism does not require any software procedure such as TCP to maintain reliability. We produced a cabinet of RHiNET-3/SW as 1-unit height and a prototype system of RHiNET-3 in 19-inch rack. RHiNET-3/SW enables high-bandwidth (80 Gbps), and long-transmission-length( 1 km) network communication by means of distributed parallel computing. This work is done with Real World Computing Partnership (RWCP) Tsukuba research center and RWCP optical interconnection Hitachi laboratory.
{"title":"Acousto-optic tunable filter (AOTF)","authors":"T. Nakazawa","doi":"10.1109/HPSR.2002.1024628","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024628","url":null,"abstract":"RHiNET-3/SW is an optical network switch that enables high-performance parallel computing in a flooror building-area environment. It can provide 10-Gbps x 8-port network switching with 1-km transmission length using 12channel parallel optical links. The switch consists of eight pairs of IO-Gbps optical link modules, one-chip CMOS ASIC switch LSI and four CMOS ASIC deskew-LSIs. Each optical link module transmits 8B10B encoded 10-bit characters and a 1-bit transmission clock at a data rate of 1.25 Gbps. The deskew-LSI can adjust the skew of 256 ns in I-km multimode fiber ribbons. By the frame synchronization used in the deskew-LSI, RHiNET-3/SW provides a longtransmission-length synchronized parallel optical data transmission. RHiNET-3/S W provides topology-free, deadlockfree and reliable network communication for the high-performance parallel computing. In order to build topology-free and deadlock-flee network, the switch supports 32 virtual channels with 640-Byte buffer memory. By using large amount of embedded memory on the switch LSI, RHiNET-3/S W allows low-latency, high-bandwidth performance. To provide highly reliable network, the switch uses hop-by-hop retransmission mechanism. This mechanism does not require any software procedure such as TCP to maintain reliability. We produced a cabinet of RHiNET-3/SW as 1-unit height and a prototype system of RHiNET-3 in 19-inch rack. RHiNET-3/SW enables high-bandwidth (80 Gbps), and long-transmission-length( 1 km) network communication by means of distributed parallel computing. This work is done with Real World Computing Partnership (RWCP) Tsukuba research center and RWCP optical interconnection Hitachi laboratory.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132545491","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024259
T. Sekiguchi, Youichi Koyama, Kenji Fujikawa, Yasuo Okabe, K. Iwama
In this paper, we argue a method to collect information of each existing multicast flow on hierarchical networks. SRSVP, a QoS-based multicast routing protocol, is designed as it collects flow-specific information, called PQ by putting it into signaling messages, so that the derived QoS path becomes more efficient. HQLIP, an underlying QoS-based unicast routing protocol, handles a network as a hierarchical structure for scalable QoS-based routing. We have designed and implemented an algorithm to compute PQ (hierarchical PQ) corresponding to aggregated link information on hierarchical networks for SRSVP to compute better QoS paths. We have attempted to make the algorithm more efficient by examining behaviors of routers.
{"title":"Hierarchical path QoS on a QoS-based multicast protocol SRSVP","authors":"T. Sekiguchi, Youichi Koyama, Kenji Fujikawa, Yasuo Okabe, K. Iwama","doi":"10.1109/HPSR.2002.1024259","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024259","url":null,"abstract":"In this paper, we argue a method to collect information of each existing multicast flow on hierarchical networks. SRSVP, a QoS-based multicast routing protocol, is designed as it collects flow-specific information, called PQ by putting it into signaling messages, so that the derived QoS path becomes more efficient. HQLIP, an underlying QoS-based unicast routing protocol, handles a network as a hierarchical structure for scalable QoS-based routing. We have designed and implemented an algorithm to compute PQ (hierarchical PQ) corresponding to aggregated link information on hierarchical networks for SRSVP to compute better QoS paths. We have attempted to make the algorithm more efficient by examining behaviors of routers.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133750680","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
扫码关注我们
求助内容：
应助结果提醒方式：