Pub Date : 2002-11-07DOI: 10.1109/HPSR.2002.1024230
A. Banchs, S. Tartarelli, F. Orlandi, Shohei Sato, Kazutomo Kobayashi, H. Pan
The Internet is now widely expected to become an important communication infrastructure of society, and therefore it is no longer sufficient to simply be able to provide connections. A higher quality of service (QoS) in communications is increasingly being required. As a new framework for providing QoS services, DiffServ is undergoing a speedy standardization process at the IETF. DiffServ not only can offer a tiered level of services, but can also provide guaranteed QoS to a certain extent. In order to provide this QoS, however, DiffServ must be properly configured; to determine this proper configuration, a deeper understanding of DiffServ and its interaction with the different traffic types (specially TCP) is required. However, while much work in the past has focused on understanding the behavior of DiffServ with low-speed links, much less work has been invested for high-speed links. In this paper, we take up the subject of configuring high-speed DiffServ routers. We reuse previous work of the authors on DiffServ configuration and run an exhaustive set of simulations with high-speed links. We observe substantial differences in the resulting behavior with respect to previous work for low-speed links.
{"title":"Configuration of DiffServ routers for high-speed links","authors":"A. Banchs, S. Tartarelli, F. Orlandi, Shohei Sato, Kazutomo Kobayashi, H. Pan","doi":"10.1109/HPSR.2002.1024230","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024230","url":null,"abstract":"The Internet is now widely expected to become an important communication infrastructure of society, and therefore it is no longer sufficient to simply be able to provide connections. A higher quality of service (QoS) in communications is increasingly being required. As a new framework for providing QoS services, DiffServ is undergoing a speedy standardization process at the IETF. DiffServ not only can offer a tiered level of services, but can also provide guaranteed QoS to a certain extent. In order to provide this QoS, however, DiffServ must be properly configured; to determine this proper configuration, a deeper understanding of DiffServ and its interaction with the different traffic types (specially TCP) is required. However, while much work in the past has focused on understanding the behavior of DiffServ with low-speed links, much less work has been invested for high-speed links. In this paper, we take up the subject of configuring high-speed DiffServ routers. We reuse previous work of the authors on DiffServ configuration and run an exhaustive set of simulations with high-speed links. We observe substantial differences in the resulting behavior with respect to previous work for low-speed links.","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":"123179200","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.1024224
N. Yamanaka, S. Okamoto, K. Shiomoto, E. Oki, W. Imajuku
This paper describes multilayer traffic engineering and signaling technologies in a photonic-GMPLS-router network. Multilayer traffic engineering, which yields the dynamic cooperation of IP and photonic layers, is described to provide IP services cost-effectively. To realize multilayer traffic engineering, we propose the OSPF extension, which advertises both the number of total wavelengths and the number of unreserved wavelengths, and the RSVP-TE extension, which realizes the least number of wavelength conversions. In addition, this paper presents a heuristic-based multilayer topology design scheme that uses IP traffic measurements in a generalized multiprotocol label switch (GMPLS). Our design scheme yields the optical label switch path (OLSP) network topology, i.e. OLSP placement, that minimizes network cost, in response to fluctuations in IP traffic demand. In other words, the OLSP network topology is dynamically reconfigured to match IP traffic demand. Networks are reconfigured by the proposed scheme so as to utilize the network resources cost-effectively.
本文介绍了光子-GMPLS-路由器网络中的多层流量工程和信令技术。多层流量工程实现了 IP 层和光子层的动态合作，可以经济高效地提供 IP 服务。为了实现多层流量工程，我们提出了同时公布总波长数和未保留波长数的 OSPF 扩展和实现最少波长转换的 RSVP-TE 扩展。此外，本文还介绍了一种基于启发式的多层拓扑设计方案，该方案在通用多协议标签交换机（GMPLS）中使用 IP 流量测量。我们的设计方案可生成光标签交换路径（OLSP）网络拓扑结构，即 OLSP 位置，从而最大限度地降低网络成本，以应对 IP 流量需求的波动。换句话说，OLSP 网络拓扑结构是动态重新配置的，以满足 IP 流量需求。建议的方案可重新配置网络，从而经济高效地利用网络资源。
{"title":"Traffic engineering and signaling technologies in photonic-GMPLS-router networks","authors":"N. Yamanaka, S. Okamoto, K. Shiomoto, E. Oki, W. Imajuku","doi":"10.1109/HPSR.2002.1024224","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024224","url":null,"abstract":"This paper describes multilayer traffic engineering and signaling technologies in a photonic-GMPLS-router network. Multilayer traffic engineering, which yields the dynamic cooperation of IP and photonic layers, is described to provide IP services cost-effectively. To realize multilayer traffic engineering, we propose the OSPF extension, which advertises both the number of total wavelengths and the number of unreserved wavelengths, and the RSVP-TE extension, which realizes the least number of wavelength conversions. In addition, this paper presents a heuristic-based multilayer topology design scheme that uses IP traffic measurements in a generalized multiprotocol label switch (GMPLS). Our design scheme yields the optical label switch path (OLSP) network topology, i.e. OLSP placement, that minimizes network cost, in response to fluctuations in IP traffic demand. In other words, the OLSP network topology is dynamically reconfigured to match IP traffic demand. Networks are reconfigured by the proposed scheme so as to utilize the network resources cost-effectively.","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":"127487050","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.1024257
Yunkai Zhou, Madhusudan Hosaagrahara, H. Sethu
This paper proposes a simple, fair and efficient scheduler for wireless networks called opportunity-based deficit round robin (ODRR). In most schedulers proposed for wireless networks, when a flow encounters errors and uses the allocated resource inefficiently, it is compensated with a larger allocation at a later time to ensure fairness in the number of bytes transmitted successfully. The ODRR scheduler, on the other hand, is based on the premise that fairness should be ensured in the opportunity given to the flows in the use of a resource, and not in the actual benefit received by the flows from the use of a resource. This strategy leads to a significantly more efficient use of the available resources in the system. The ODRR scheduler is versatile enough for use in allocating resources other than bandwidth, and in fact, may also be used in very different contexts such as in an ATM Internet backbone carrying IP packets and in wormhole switches popular in system area networks.
{"title":"Opportunity-based deficit round robin: a novel packet scheduling strategy for wireless networks","authors":"Yunkai Zhou, Madhusudan Hosaagrahara, H. Sethu","doi":"10.1109/HPSR.2002.1024257","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024257","url":null,"abstract":"This paper proposes a simple, fair and efficient scheduler for wireless networks called opportunity-based deficit round robin (ODRR). In most schedulers proposed for wireless networks, when a flow encounters errors and uses the allocated resource inefficiently, it is compensated with a larger allocation at a later time to ensure fairness in the number of bytes transmitted successfully. The ODRR scheduler, on the other hand, is based on the premise that fairness should be ensured in the opportunity given to the flows in the use of a resource, and not in the actual benefit received by the flows from the use of a resource. This strategy leads to a significantly more efficient use of the available resources in the system. The ODRR scheduler is versatile enough for use in allocating resources other than bandwidth, and in fact, may also be used in very different contexts such as in an ATM Internet backbone carrying IP packets and in wormhole switches popular in system area networks.","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":"116163700","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.1024218
R. Kawabe, S. Ata, M. Murata, M. Uga, K. Shiomoto, N. Yamanaka
Many address lookup methods for use on IP routers to improve their packet-forwarding capability have been proposed. However, their performance prediction ability is poor because actual traffic characteristics are not considered in their evaluation processes. The actual traffic must be considered in order to predict router performance more accurately, especially for layer 3 and 4 address lookups, whose performances are more affected by the flow characteristics. We describe a method for predicting IP lookup algorithm performance that is based on statistical analysis of the Internet traffic. We present an example of its application to an existing IP lookup algorithm and show, based on simulation results, that our method can provide accurate performance prediction for IP lookup algorithms.
{"title":"Performance prediction method for IP lookup algorithms","authors":"R. Kawabe, S. Ata, M. Murata, M. Uga, K. Shiomoto, N. Yamanaka","doi":"10.1109/HPSR.2002.1024218","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024218","url":null,"abstract":"Many address lookup methods for use on IP routers to improve their packet-forwarding capability have been proposed. However, their performance prediction ability is poor because actual traffic characteristics are not considered in their evaluation processes. The actual traffic must be considered in order to predict router performance more accurately, especially for layer 3 and 4 address lookups, whose performances are more affected by the flow characteristics. We describe a method for predicting IP lookup algorithm performance that is based on statistical analysis of the Internet traffic. We present an example of its application to an existing IP lookup algorithm and show, based on simulation results, that our method can provide accurate performance prediction for IP lookup 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":"128961903","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.1024625
N. Takahashi
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":"IP traffic performance test for video system/43.5Gbps BERT system","authors":"N. Takahashi","doi":"10.1109/HPSR.2002.1024625","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024625","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":"132375392","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.1024256
B. Sikdar, K. Chandrayana, K. Vastola, S. Kalyanaraman
The self-similarity of network traffic has been established in a variety of environments and it is well known that self-similar traffic can lead to larger queueing delays, higher drop rates and extended periods of congestion. In this paper, we investigate the impact of various buffer management algorithms on the self-similarity of network traffic. In this paper we investigate the impact of active and passive queue management policies used at the routers on the self-similarity of TCP traffic. We also propose a modification to the random early detection (RED) algorithm, aimed at reducing the timeouts and exponential backoffs in TCP flows, and show that it can lead to significant reductions in the traffic self-similarity under a wide range of network conditions, as compared to the currently implemented active and passive buffer management policies. We also show that though our techniques are aimed at TCP related causes, it is also effective in reducing the degree of self-similarity in traffic even when application and user level causes are also present, as long as TCP is used as the underlying transport protocol.
{"title":"Queue management algorithms and network traffic self-similarity","authors":"B. Sikdar, K. Chandrayana, K. Vastola, S. Kalyanaraman","doi":"10.1109/HPSR.2002.1024256","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024256","url":null,"abstract":"The self-similarity of network traffic has been established in a variety of environments and it is well known that self-similar traffic can lead to larger queueing delays, higher drop rates and extended periods of congestion. In this paper, we investigate the impact of various buffer management algorithms on the self-similarity of network traffic. In this paper we investigate the impact of active and passive queue management policies used at the routers on the self-similarity of TCP traffic. We also propose a modification to the random early detection (RED) algorithm, aimed at reducing the timeouts and exponential backoffs in TCP flows, and show that it can lead to significant reductions in the traffic self-similarity under a wide range of network conditions, as compared to the currently implemented active and passive buffer management policies. We also show that though our techniques are aimed at TCP related causes, it is also effective in reducing the degree of self-similarity in traffic even when application and user level causes are also present, as long as TCP is used as the underlying transport protocol.","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":"134242466","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.1024220
I. L. Chvets, M. MacGregor
The key steps in routing an IP packet are: determining which outgoing interface should be used to forward the packet, switching the packet to that interface, and scheduling the packet for transmission on the outgoing link. The first step requires comparing the destination address to those in a routing table to find the best match. This step can be accelerated by caching the results of recent lookups, and referencing the cache instead of recomputing the lookup. We document a new cache organization especially suited to the address reference behavior of IP traffic, and report performance results for caches based on this new design approach. The new cache design reported shows miss ratios approximately one-half those of conventional caches.
{"title":"Multi-zone caches for accelerating IP routing table lookups","authors":"I. L. Chvets, M. MacGregor","doi":"10.1109/HPSR.2002.1024220","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024220","url":null,"abstract":"The key steps in routing an IP packet are: determining which outgoing interface should be used to forward the packet, switching the packet to that interface, and scheduling the packet for transmission on the outgoing link. The first step requires comparing the destination address to those in a routing table to find the best match. This step can be accelerated by caching the results of recent lookups, and referencing the cache instead of recomputing the lookup. We document a new cache organization especially suited to the address reference behavior of IP traffic, and report performance results for caches based on this new design approach. The new cache design reported shows miss ratios approximately one-half those of conventional caches.","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":"131770309","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.1024212
V. L. Do, K. Yun
The virtual output queue (VOQ) has been used in input queued and input-output queued packet switches which require switch plane scheduling algorithms to achieve high throughput. However, existing scheduling algorithms such as iSLIP are designed for scheduling fixed size cell units and introduce unfairness in packet latency among VOQs if used for scheduling variable sized packet units. A self-optimized latency (SOL) scheduling algorithm is proposed to deal with scheduling variable-length packets. The SOL is a credit-based scheduling algorithm which assigns a credit flow for each VOQ. During operation, the SOL examines credit flows to grant access to VOQs through the switch plane. Moreover, the SOL also works in conjunction with an average packet length scheduling concept to modify credit flows based on size of packets transferred through the switch plane in order to increase fairness among VOQs. Simulation results show that the SOL scheduling algorithm in a switch plane significantly reduces the packet latency compared to iSLIP scheduling algorithm.
{"title":"Packet latency optimization for VOQs in variable-length packet switches","authors":"V. L. Do, K. Yun","doi":"10.1109/HPSR.2002.1024212","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024212","url":null,"abstract":"The virtual output queue (VOQ) has been used in input queued and input-output queued packet switches which require switch plane scheduling algorithms to achieve high throughput. However, existing scheduling algorithms such as iSLIP are designed for scheduling fixed size cell units and introduce unfairness in packet latency among VOQs if used for scheduling variable sized packet units. A self-optimized latency (SOL) scheduling algorithm is proposed to deal with scheduling variable-length packets. The SOL is a credit-based scheduling algorithm which assigns a credit flow for each VOQ. During operation, the SOL examines credit flows to grant access to VOQs through the switch plane. Moreover, the SOL also works in conjunction with an average packet length scheduling concept to modify credit flows based on size of packets transferred through the switch plane in order to increase fairness among VOQs. Simulation results show that the SOL scheduling algorithm in a switch plane significantly reduces the packet latency compared to iSLIP scheduling algorithm.","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":"126573146","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.1024215
R. Izmailov, D. Niculescu
We consider off-line versions of path provisioning and path protection problems for general circuit switched networks. Both problems deal with a given network topology and a list of integral demand flows. The objective is to route the flows and to allocate the bandwidth in a way that minimizes the total amount of bandwidth used for working and protection paths. We consider path-based protection where, in the case of a single link failure, all the flows utilizing the failed link can be rerouted to a precomputed set of paths. We demonstrate that flow splitting can bring significant advantages for both provisioning and protection problems. Since the problem is NP-complete, we propose and analyze two simple heuristics. We show that one of these heuristics performs almost as well as the optimal solution.
{"title":"Flow splitting approach for path provisioning and path protection problems","authors":"R. Izmailov, D. Niculescu","doi":"10.1109/HPSR.2002.1024215","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024215","url":null,"abstract":"We consider off-line versions of path provisioning and path protection problems for general circuit switched networks. Both problems deal with a given network topology and a list of integral demand flows. The objective is to route the flows and to allocate the bandwidth in a way that minimizes the total amount of bandwidth used for working and protection paths. We consider path-based protection where, in the case of a single link failure, all the flows utilizing the failed link can be rerouted to a precomputed set of paths. We demonstrate that flow splitting can bring significant advantages for both provisioning and protection problems. Since the problem is NP-complete, we propose and analyze two simple heuristics. We show that one of these heuristics performs almost as well as the optimal solution.","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":"132288516","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.1024629
J. Yamamoto, H. Nishi, S. Nishimura
{"title":"RHiNET-3/SW: high performance optical network switch for parallel computing environment","authors":"J. Yamamoto, H. Nishi, S. Nishimura","doi":"10.1109/HPSR.2002.1024629","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024629","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":"130614493","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
扫码关注我们
求助内容：
应助结果提醒方式：