首页 > 最新文献

2008 International Conference on High Performance Switching and Routing最新文献

英文 中文
Internal congestion control in a cluster-based router 基于集群的路由器的内部拥塞控制
Pub Date : 2008-05-15 DOI: 10.1109/HSPR.2008.4734414
Qinghua Ye, Mike H. MacGregor
Congestion is a problem in any distributed system. In this paper, we present and evaluate a congestion control scheme to manage congestion internal to a cluster-based router. Our results show that it is possible to improve the overall forwarding rate of the router by reducing the injection rate of traffic to the internal network when the router is under heavy load. Our control algorithm is based on backward explicit congestion notification combined with a novel method for queue scheduling. We find that the forwarding rate of our prototype router can be increased by nearly 33% while the traffic in the internal network can be reduced by up to 59%. Fair allocation of resources under overload is guaranteed by our scheme.
拥塞在任何分布式系统中都是一个问题。在本文中,我们提出并评估了一种拥塞控制方案来管理集群路由器内部的拥塞。我们的研究结果表明,在路由器负载较重的情况下,可以通过降低内部网络的流量注入率来提高路由器的整体转发速率。我们的控制算法是基于向后显式拥塞通知和一种新的队列调度方法。我们发现,我们的原型路由器的转发率可以提高近33%,而内部网络的流量可以减少高达59%。该方案保证了过载情况下资源的公平分配。
{"title":"Internal congestion control in a cluster-based router","authors":"Qinghua Ye, Mike H. MacGregor","doi":"10.1109/HSPR.2008.4734414","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734414","url":null,"abstract":"Congestion is a problem in any distributed system. In this paper, we present and evaluate a congestion control scheme to manage congestion internal to a cluster-based router. Our results show that it is possible to improve the overall forwarding rate of the router by reducing the injection rate of traffic to the internal network when the router is under heavy load. Our control algorithm is based on backward explicit congestion notification combined with a novel method for queue scheduling. We find that the forwarding rate of our prototype router can be increased by nearly 33% while the traffic in the internal network can be reduced by up to 59%. Fair allocation of resources under overload is guaranteed by our scheme.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115404584","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}
引用次数: 2
A construction of shared optical buffer queue with switched delay lines 具有交换延迟线的共享光缓冲队列的构造
Pub Date : 2008-05-15 DOI: 10.1109/HSPR.2008.4734426
Xiaoliang Wang, Xiaohong Jiang, S. Horiguchi
In this paper, we focus on the feedback construction of FIFO shared optical buffer queue from bufferless switch and fiber delay lines. The construction consists of an (M+2)times(M+2) crossbar switch and M fiber delay lines with delay d1, d2, ... , dM which are connected from M outputs of the switch fabric to M inputs. We show that, when setting di = min(M + 1 - i, i), i = 1, ... , M, such a construction can work as a 1-to-2 shared buffer queue.
本文主要研究了基于无缓冲交换机和光纤延迟线的FIFO共享光缓冲队列的反馈构建。结构由1个(M+2) × (M+2)交叉开关和M条延时为d1、d2、…的光纤延迟线组成。, dM,从交换fabric的M个输出连接到M个输入。当设di = min(M + 1 - i, i)时,i = 1,…, M,这样的结构可以作为1对2的共享缓冲队列。
{"title":"A construction of shared optical buffer queue with switched delay lines","authors":"Xiaoliang Wang, Xiaohong Jiang, S. Horiguchi","doi":"10.1109/HSPR.2008.4734426","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734426","url":null,"abstract":"In this paper, we focus on the feedback construction of FIFO shared optical buffer queue from bufferless switch and fiber delay lines. The construction consists of an (M+2)times(M+2) crossbar switch and M fiber delay lines with delay d1, d2, ... , dM which are connected from M outputs of the switch fabric to M inputs. We show that, when setting di = min(M + 1 - i, i), i = 1, ... , M, such a construction can work as a 1-to-2 shared buffer queue.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117193299","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}
引用次数: 6
On joint sequence design for feedback-based two-stage switch architecture 基于反馈的两级开关结构联合序列设计
Pub Date : 2008-05-15 DOI: 10.1109/HSPR.2008.4734430
Bing Hu, K. Yeung
An N times N feedback-based two-stage switch is configured using a pre-determined and periodic joint sequence of N joint configurations. The joint sequence used is characterized by both in-order packet delivery and staggered symmetry properties. In this paper, we focus on designing optimal joint sequences. We first divide all possible joint sequences into four classes, with staggered symmetry property only, with in-order packet delivery property only, with both properties and with none of the properties. We then show that anchor output and ordered joint sequence are the necessary and sufficient conditions for packet inorder delivery. Since the staggered symmetry property is necessary for efficient feedback path implementation, we calculate that there are [(N-1)!]2 joint sequences with both inorder packet delivery and staggered symmetry properties. In order to find out the optimal joint sequence that can minimize the switch delay performance for a given traffic profile, we believe it can only be achieved by searching through the whole pool of [(N-1)!]2 joint sequences.
基于N * N反馈的两级开关采用N个关节配置的预先确定的周期关节序列进行配置。所使用的联合序列具有按顺序发送数据包和交错对称的特性。本文主要研究最优连接序列的设计问题。我们首先将所有可能的联合序列分为四类,仅具有交错对称性质,仅具有序包传递性质,同时具有这些性质和不具有任何性质。然后证明了锚输出和有序联合序列是数据包有序传递的充分必要条件。由于交错对称特性对于有效的反馈路径实现是必要的,我们计算出有[(N-1)![2]具有无序包传递和交错对称性质的联合序列。对于给定的流量轮廓,为了找出能使交换机延迟性能最小的最优联合序列,我们认为只能通过搜索整个池[(N-1)!]来实现。2个联合序列。
{"title":"On joint sequence design for feedback-based two-stage switch architecture","authors":"Bing Hu, K. Yeung","doi":"10.1109/HSPR.2008.4734430","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734430","url":null,"abstract":"An N times N feedback-based two-stage switch is configured using a pre-determined and periodic joint sequence of N joint configurations. The joint sequence used is characterized by both in-order packet delivery and staggered symmetry properties. In this paper, we focus on designing optimal joint sequences. We first divide all possible joint sequences into four classes, with staggered symmetry property only, with in-order packet delivery property only, with both properties and with none of the properties. We then show that anchor output and ordered joint sequence are the necessary and sufficient conditions for packet inorder delivery. Since the staggered symmetry property is necessary for efficient feedback path implementation, we calculate that there are [(N-1)!]2 joint sequences with both inorder packet delivery and staggered symmetry properties. In order to find out the optimal joint sequence that can minimize the switch delay performance for a given traffic profile, we believe it can only be achieved by searching through the whole pool of [(N-1)!]2 joint sequences.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124901919","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}
引用次数: 7
A map-and-route approach for Segment Shared Protection in multi-domain networks 多域网络中段共享保护的映射-路由方法
Pub Date : 2008-05-15 DOI: 10.1109/HSPR.2008.4734447
D. Truong, B. Jaumard
Routing and protection with an overlapping segment shared protection (OSSP) scheme in multi-domain networks is more difficult than that in single domain networks because of scalability requirements. We propose a novel approach for OSSP routing where the underlying idea is the prior identification of Potential Intra-domain Paths (PIP) for carrying working and backup traffic between domain border nodes. These PIPs help to reduce the multi-domain network to a simpler aggregated network where routing is performed without unnecessarily going down to the physical links. The novel approach offers an exact and highly scalable routing thanks to the prior identification of the PIPs and the introduction of a maximal share risk group feature. Experiments show that the quality of the proposed approach is close to the optimal single-domain network solution and outperforms the existing multi-domain network solutions.
由于对可扩展性的要求,在多域网络中采用重叠段共享保护(OSSP)方案进行路由和保护比在单域网络中更加困难。我们提出了一种新的OSSP路由方法,其基本思想是预先识别潜在的域内路径(PIP),用于在域边界节点之间承载工作和备份流量。这些pip有助于将多域网络简化为更简单的聚合网络,在聚合网络中执行路由,而不必走到物理链路上。由于预先识别pip和引入最大共享风险组特征,该方法提供了精确且高度可扩展的路由。实验表明,该方法的质量接近最优单域网络解,优于现有的多域网络解。
{"title":"A map-and-route approach for Segment Shared Protection in multi-domain networks","authors":"D. Truong, B. Jaumard","doi":"10.1109/HSPR.2008.4734447","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734447","url":null,"abstract":"Routing and protection with an overlapping segment shared protection (OSSP) scheme in multi-domain networks is more difficult than that in single domain networks because of scalability requirements. We propose a novel approach for OSSP routing where the underlying idea is the prior identification of Potential Intra-domain Paths (PIP) for carrying working and backup traffic between domain border nodes. These PIPs help to reduce the multi-domain network to a simpler aggregated network where routing is performed without unnecessarily going down to the physical links. The novel approach offers an exact and highly scalable routing thanks to the prior identification of the PIPs and the introduction of a maximal share risk group feature. Experiments show that the quality of the proposed approach is close to the optimal single-domain network solution and outperforms the existing multi-domain network solutions.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132451822","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}
引用次数: 3
Minimization of ACL storage by adding minimal hardware of range matching and logical gates to TCAM 通过向TCAM添加最小的范围匹配硬件和逻辑门来最小化ACL存储
Pub Date : 2008-05-15 DOI: 10.1109/HSPR.2008.4734431
Haesung Hwang, Koji Yamamoto, S. Ata, K. Inoue, M. Murata
Ternary content addressable memory (TCAM) is a special type of memory used in routers in order to achieve high speed packet classification. The classification is performed using the five fields in an access control list (ACL), port numbers being one of them. Since port numbers that are expressed in ranges require multiple entries in storage, this results in an increased cost of hardware. In this paper we propose a method to reduce the number of entries when expressing ranges in TCAM. We use range matching devices integrated within the TCAMpsilas control logic and optimized prefix expansion that utilizes logical AND and NOT gates in the TCAM array itself. In addition, we use real data of an existing network to show that the proposed architecture can store the ACL in an efficient way.
三元内容可寻址存储器(TCAM)是路由器中用于实现高速分组分类的一种特殊类型的存储器。使用访问控制列表(ACL)中的五个字段进行分类,端口号是其中之一。由于以范围表示的端口号需要存储中的多个条目,这将导致硬件成本的增加。本文提出了一种在TCAM中表示范围时减少条目数的方法。我们使用集成在tcamsilas控制逻辑中的范围匹配器件和优化的前缀扩展,该扩展利用了TCAM阵列本身的逻辑与非门。此外,我们用一个已有网络的实际数据证明了所提出的架构能够有效地存储ACL。
{"title":"Minimization of ACL storage by adding minimal hardware of range matching and logical gates to TCAM","authors":"Haesung Hwang, Koji Yamamoto, S. Ata, K. Inoue, M. Murata","doi":"10.1109/HSPR.2008.4734431","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734431","url":null,"abstract":"Ternary content addressable memory (TCAM) is a special type of memory used in routers in order to achieve high speed packet classification. The classification is performed using the five fields in an access control list (ACL), port numbers being one of them. Since port numbers that are expressed in ranges require multiple entries in storage, this results in an increased cost of hardware. In this paper we propose a method to reduce the number of entries when expressing ranges in TCAM. We use range matching devices integrated within the TCAMpsilas control logic and optimized prefix expansion that utilizes logical AND and NOT gates in the TCAM array itself. In addition, we use real data of an existing network to show that the proposed architecture can store the ACL in an efficient way.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132541190","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}
引用次数: 8
Self-routing design of nonblocking WDM switches based on arrayed waveguide grating 基于阵列波导光栅的无阻塞WDM开关自路由设计
Pub Date : 2008-05-15 DOI: 10.1109/HSPR.2008.4734457
Y. Fukushima, Xiaohong Jiang, A. Pattavina, S. Horiguchi
Arrayed waveguide grating (AWG) is a promising technology for constructing high-speed large-capacity WDM switches, because it can switch fast, is scalable to large size and consumes little power. To take the full advantages of high-speed AWG, the routing control of a massive AWG-based switch should be as simple as possible. In this paper, we focus on the self-routing design of AWG-based switches with O(1) constant routing complexity and propose a novel construction of self-routing AWG switches that can guarantee the attractive nonblocking property for both the wavelength-to-wavelength and wavelength-to-fiber request models. It is expected that the proposed construction will be useful for the design and all-optical implementation of future ultra high-speed optical packet/burst switches.
阵列波导光栅(AWG)具有切换速度快、可扩展到大尺寸、功耗小等优点,是构建高速大容量WDM交换机的一种很有前途的技术。为了充分发挥高速AWG的优势,大型AWG交换机的路由控制应该尽可能简单。本文重点研究了路由复杂度为0(1)不变的AWG交换机的自路由设计,提出了一种新的自路由AWG交换机结构,该结构既能保证波长到波长的请求模型,又能保证波长到光纤的请求模型具有良好的非阻塞特性。预计该结构将为未来超高速光分组/突发交换机的设计和全光实现提供参考。
{"title":"Self-routing design of nonblocking WDM switches based on arrayed waveguide grating","authors":"Y. Fukushima, Xiaohong Jiang, A. Pattavina, S. Horiguchi","doi":"10.1109/HSPR.2008.4734457","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734457","url":null,"abstract":"Arrayed waveguide grating (AWG) is a promising technology for constructing high-speed large-capacity WDM switches, because it can switch fast, is scalable to large size and consumes little power. To take the full advantages of high-speed AWG, the routing control of a massive AWG-based switch should be as simple as possible. In this paper, we focus on the self-routing design of AWG-based switches with O(1) constant routing complexity and propose a novel construction of self-routing AWG switches that can guarantee the attractive nonblocking property for both the wavelength-to-wavelength and wavelength-to-fiber request models. It is expected that the proposed construction will be useful for the design and all-optical implementation of future ultra high-speed optical packet/burst switches.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125386884","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}
引用次数: 3
Revealing the optimality gap for Traffic Engineering algorithms 揭示交通工程算法的最优性差距
Pub Date : 2008-05-15 DOI: 10.1109/HSPR.2008.4734435
Huan Liu
Traffic Engineering (TE) is important and necessary in order to fully utilize the existing network resources and reduce capital expenditure. Given its importance, many algorithms have been proposed in the literature. Unfortunately, there is still not a consistent methodology to evaluate these algorithms. Worse yet, some variants of the traffic engineering problem are known to be NP-hard. Thus, given a particular TE problem, in general, it is not possible to know the optimal solution; hence, it is difficult to assess how a particular heuristic algorithm performs. Even though several heuristic algorithms could be used to validate each other, the best solution from these algorithms could still be very far away from the optimal solution. We propose a novel methodology to evaluate TE algorithms. In this methodology, we construct TE problems with known optimal solutions and we then use these TE problem instances to test the performance of TE algorithms. We found that some TE algorithms perform poorly, and the result deviates from the optimum further as the problem size gets bigger. Our results suggest that there is large room for algorithm improvements and further research is required. Even though we only demonstrate the power of the methodology in the context of traffic engineering algorithms, the methodology is general enough that it could be applied in many other areas as well.
为了充分利用现有网络资源,减少资本支出,流量工程(Traffic Engineering, TE)是非常重要和必要的。鉴于其重要性,文献中提出了许多算法。不幸的是,仍然没有一个一致的方法来评估这些算法。更糟糕的是,交通工程问题的一些变体已知是np困难的。因此,给定一个特定的TE问题,一般来说,不可能知道最优解;因此,很难评估一个特定的启发式算法的执行情况。即使可以使用几种启发式算法来相互验证,这些算法的最佳解决方案仍然可能与最优解决方案相差甚远。我们提出了一种新的方法来评估TE算法。在这种方法中,我们构建具有已知最优解的TE问题,然后使用这些TE问题实例来测试TE算法的性能。我们发现一些TE算法表现不佳,并且随着问题规模的增大,结果进一步偏离最优。我们的结果表明,算法有很大的改进空间,需要进一步的研究。尽管我们只在交通工程算法的背景下展示了该方法的强大功能,但该方法是足够通用的,它也可以应用于许多其他领域。
{"title":"Revealing the optimality gap for Traffic Engineering algorithms","authors":"Huan Liu","doi":"10.1109/HSPR.2008.4734435","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734435","url":null,"abstract":"Traffic Engineering (TE) is important and necessary in order to fully utilize the existing network resources and reduce capital expenditure. Given its importance, many algorithms have been proposed in the literature. Unfortunately, there is still not a consistent methodology to evaluate these algorithms. Worse yet, some variants of the traffic engineering problem are known to be NP-hard. Thus, given a particular TE problem, in general, it is not possible to know the optimal solution; hence, it is difficult to assess how a particular heuristic algorithm performs. Even though several heuristic algorithms could be used to validate each other, the best solution from these algorithms could still be very far away from the optimal solution. We propose a novel methodology to evaluate TE algorithms. In this methodology, we construct TE problems with known optimal solutions and we then use these TE problem instances to test the performance of TE algorithms. We found that some TE algorithms perform poorly, and the result deviates from the optimum further as the problem size gets bigger. Our results suggest that there is large room for algorithm improvements and further research is required. Even though we only demonstrate the power of the methodology in the context of traffic engineering algorithms, the methodology is general enough that it could be applied in many other areas as well.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126919698","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}
引用次数: 0
期刊
2008 International Conference on High Performance Switching and Routing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1