Pub Date : 2009-12-14DOI: 10.1109/ANTS.2009.5409878
Amitkeerti M. Lagare, D. Das
IEEE 802.16e WiMAX standard classifies packets in the decreasing order of priority as UGS, RTPS, eRTPS, nRTPS, BE. This mechanism of classification is application dependent and a user will not be able to request for a change in priority even though higher priority traffic bandwidth might be available and the user is ready to pay more for elevation of low priority traffic to higher priority. We propose a new technique in this paper to implement user based priority between subscriber station (SS) and base station (BS). We suggest eight different priority levels for SS/User. For eight different priorities classification and information exchange between SS and BS, we propose to use unused bits of common encoding Type-Length-Value (TLV) sub-header in the Range Response (RNG-RSP) header. The simulation results reveal that the throughput of BE traffic for high priority user is 50% more than regular user when the number of User Equipment (UE) / SS in the system is 10.
{"title":"Novel user-based packet classification in 802.16e to provide better performance","authors":"Amitkeerti M. Lagare, D. Das","doi":"10.1109/ANTS.2009.5409878","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409878","url":null,"abstract":"IEEE 802.16e WiMAX standard classifies packets in the decreasing order of priority as UGS, RTPS, eRTPS, nRTPS, BE. This mechanism of classification is application dependent and a user will not be able to request for a change in priority even though higher priority traffic bandwidth might be available and the user is ready to pay more for elevation of low priority traffic to higher priority. We propose a new technique in this paper to implement user based priority between subscriber station (SS) and base station (BS). We suggest eight different priority levels for SS/User. For eight different priorities classification and information exchange between SS and BS, we propose to use unused bits of common encoding Type-Length-Value (TLV) sub-header in the Range Response (RNG-RSP) header. The simulation results reveal that the throughput of BE traffic for high priority user is 50% more than regular user when the number of User Equipment (UE) / SS in the system is 10.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116937885","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409852
L. Wosinska, Jiajia Chen
The economical aspects are most critical in the access part of the networks because of the low sharing factor of the total cost. It makes the deployment of fiber access networks relatively slow due to the high investment cost involved. Several fiber access network architectures such as homerun (sometimes referred to as point-to-point P2P), active optical networks (AONs) and passive optical networks (PONs) have been developed to support the growing bandwidth demand from both residential and business customers. Meanwhile, fault management and reliable service delivery becomes more significant due to increased dependency on electronic services all over society and the growing importance of reliable service delivery. However, there is a tradeoff between the cost of protection and the level of service reliability. Obviously, in the access part of the networks, improving reliability performance by duplication of network resources (and capital expenditures CAPEX) can be too expensive. Therefore, a real challenge for an access network operator is to operate a cost-efficient, yet reliable network that provides leading edge services at low price and with minimal downtime. In this paper we present the evolution of fiber access networks and compare reliability performance in relation to investment and management cost for some representative cases. We consider both standard and novel architectures for deployment in both sparse and dense populated areas. While some recent works focused on PON protection schemes with reduced CAPEX the current and future effort is put on minimizing the operational expenditures (OPEX) during the access network lifetime.
{"title":"How much to pay for protection in fiber access networks: Cost and reliability tradeoff","authors":"L. Wosinska, Jiajia Chen","doi":"10.1109/ANTS.2009.5409852","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409852","url":null,"abstract":"The economical aspects are most critical in the access part of the networks because of the low sharing factor of the total cost. It makes the deployment of fiber access networks relatively slow due to the high investment cost involved. Several fiber access network architectures such as homerun (sometimes referred to as point-to-point P2P), active optical networks (AONs) and passive optical networks (PONs) have been developed to support the growing bandwidth demand from both residential and business customers. Meanwhile, fault management and reliable service delivery becomes more significant due to increased dependency on electronic services all over society and the growing importance of reliable service delivery. However, there is a tradeoff between the cost of protection and the level of service reliability. Obviously, in the access part of the networks, improving reliability performance by duplication of network resources (and capital expenditures CAPEX) can be too expensive. Therefore, a real challenge for an access network operator is to operate a cost-efficient, yet reliable network that provides leading edge services at low price and with minimal downtime. In this paper we present the evolution of fiber access networks and compare reliability performance in relation to investment and management cost for some representative cases. We consider both standard and novel architectures for deployment in both sparse and dense populated areas. While some recent works focused on PON protection schemes with reduced CAPEX the current and future effort is put on minimizing the operational expenditures (OPEX) during the access network lifetime.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114175257","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409860
T. Takabatake, Y. Komano
Recently, the improvements in processing performance of a computer and high speed communication of an optical fiber have been achieved, so that the amount of data which are processed by a computer and flowed on a network has been increasing greatly. However, in a client-server system, since the server receives and processes the amount of data from the clients through the network, a load on the server is increasing. Thus, there are needed to introduce a server with high processing ability and to have a line with high bandwidth. In this paper, concerning to P2P networks to resolve the load on a specific server, a criterion called an Indexed-Priority Metric has been proposed and its performance is evaluated. The proposed metric is to allocate some files to each node. As a result, the load on a specific server can distribute them to each node equally well. Simulation results show that the proposed metric can make files distribution on the specific server.
{"title":"Evaluation of the P2P file sharing technique by Indexed-Priority Metric","authors":"T. Takabatake, Y. Komano","doi":"10.1109/ANTS.2009.5409860","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409860","url":null,"abstract":"Recently, the improvements in processing performance of a computer and high speed communication of an optical fiber have been achieved, so that the amount of data which are processed by a computer and flowed on a network has been increasing greatly. However, in a client-server system, since the server receives and processes the amount of data from the clients through the network, a load on the server is increasing. Thus, there are needed to introduce a server with high processing ability and to have a line with high bandwidth. In this paper, concerning to P2P networks to resolve the load on a specific server, a criterion called an Indexed-Priority Metric has been proposed and its performance is evaluated. The proposed metric is to allocate some files to each node. As a result, the load on a specific server can distribute them to each node equally well. Simulation results show that the proposed metric can make files distribution on the specific server.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115135896","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409864
R. Ravindran, Changcheng Huang, K. Thulasiraman
This paper deals with the problem of sharing VPN service provider's core topology and link state information with its VPNs. This is provided as a service using topology abstraction principles. The topology abstractions are generated considering factors such as VPN SLA requirements, fairness and maximizing core network utilization. The paper deals with algorithms applicable to generate topology abstraction for the VPNs in a centralized manner. In this context we define a problem called the VPN core capacity sharing problem. We study this problem using algorithms based on multi-commodity flow theory. We observe from simulation analysis over several topologies that applying the maximum multi-commodity flow based partitioning scheme improves the call performance and network utilization statistics compared to a previously proposed topology abstraction scheme based on maximum concurrent flow theory.
{"title":"VPN topology abstraction service using centralized core capacity sharing scheme","authors":"R. Ravindran, Changcheng Huang, K. Thulasiraman","doi":"10.1109/ANTS.2009.5409864","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409864","url":null,"abstract":"This paper deals with the problem of sharing VPN service provider's core topology and link state information with its VPNs. This is provided as a service using topology abstraction principles. The topology abstractions are generated considering factors such as VPN SLA requirements, fairness and maximizing core network utilization. The paper deals with algorithms applicable to generate topology abstraction for the VPNs in a centralized manner. In this context we define a problem called the VPN core capacity sharing problem. We study this problem using algorithms based on multi-commodity flow theory. We observe from simulation analysis over several topologies that applying the maximum multi-commodity flow based partitioning scheme improves the call performance and network utilization statistics compared to a previously proposed topology abstraction scheme based on maximum concurrent flow theory.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126454312","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409851
A. Wander, A. Varma
We consider traffic models for the evaluation of buffer-constrained routers, such as routers with all-optical data paths. We show that conventional models may substantially underestimate the packet loss behavior. We propose an alternative method based on the multi-fractal wavelet model (MWM). Using this new model, we show that routers are susceptible to high losses under bursty Internet traffic conditions. However, if traffic can be shaped into a deterministic arrival stream, then large-scale buffer-constrained routers are possible within backbone networks.
{"title":"Evaluating buffer-constrained routers under bursty and shaped traffic","authors":"A. Wander, A. Varma","doi":"10.1109/ANTS.2009.5409851","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409851","url":null,"abstract":"We consider traffic models for the evaluation of buffer-constrained routers, such as routers with all-optical data paths. We show that conventional models may substantially underestimate the packet loss behavior. We propose an alternative method based on the multi-fractal wavelet model (MWM). Using this new model, we show that routers are susceptible to high losses under bursty Internet traffic conditions. However, if traffic can be shaped into a deterministic arrival stream, then large-scale buffer-constrained routers are possible within backbone networks.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133034033","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409870
Mihiro Nojima, M. Hamamura
Optical code-division multiple access (OCDMA) using feedback-controlled spreading sequences (FCSSs) (FCSS/OCDMA) is presented. The bit-error rate characteristics of asynchronous FCSS/OCDMA are demonstrated by simulations in the presence of avalanche photodiode noise and thermal noise. The results indicate that FCSS/OCDMA achieves the single-user performance of conventional on-off keying (OOK) OCDMA (OOK-OCDMA) with double optical hard-limiters.
{"title":"Performance of on-off keying optical code-division multiple access using feedback-controlled spreading sequences","authors":"Mihiro Nojima, M. Hamamura","doi":"10.1109/ANTS.2009.5409870","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409870","url":null,"abstract":"Optical code-division multiple access (OCDMA) using feedback-controlled spreading sequences (FCSSs) (FCSS/OCDMA) is presented. The bit-error rate characteristics of asynchronous FCSS/OCDMA are demonstrated by simulations in the presence of avalanche photodiode noise and thermal noise. The results indicate that FCSS/OCDMA achieves the single-user performance of conventional on-off keying (OOK) OCDMA (OOK-OCDMA) with double optical hard-limiters.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132322061","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409871
A. Mukhopadhyay, S. Chatterjee, Sajal Saha, S. Ghose, Debashis Saha
This paper proposes a call admission control (CAC) scheme for heterogeneous wireless overlay networks (WONs) that combine the benefits of the three commonly used techniques- guard channel, buffer management and priority scheduling with fuzzy logic application. The simulation results show that the scheme is extremely efficient offering a high degree of quality of service (QoS).
{"title":"An efficient call admission control scheme on overlay networks using fuzzy logic","authors":"A. Mukhopadhyay, S. Chatterjee, Sajal Saha, S. Ghose, Debashis Saha","doi":"10.1109/ANTS.2009.5409871","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409871","url":null,"abstract":"This paper proposes a call admission control (CAC) scheme for heterogeneous wireless overlay networks (WONs) that combine the benefits of the three commonly used techniques- guard channel, buffer management and priority scheduling with fuzzy logic application. The simulation results show that the scheme is extremely efficient offering a high degree of quality of service (QoS).","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132337082","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409894
R. Aparna, B. B. Amberker, D. Pola, P. Bathia
Numerous emerging applications like teleconferencing, scientific discussion etc. are relied on secure group communication model. Scalable group rekeying is one of the important issues in secure group communication since the group is dynamic in nature. Updating the group key and delivering it to group members securely must be carried out in an efficient manner, i.e., the number of encryptions performed and rekey messages constructed must be less. In this paper we propose a new method to manage secure group using binomial key tree approach. We show that number of encryptions performed and rekey messages constructed during membership change are less compared to the scheme proposed by Wong and others. In our scheme, it is not required to balance the tree after membership change. We compute the average encryption and rekey costs and show that the scheme is scalable.
{"title":"Secure group communication using binomial trees","authors":"R. Aparna, B. B. Amberker, D. Pola, P. Bathia","doi":"10.1109/ANTS.2009.5409894","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409894","url":null,"abstract":"Numerous emerging applications like teleconferencing, scientific discussion etc. are relied on secure group communication model. Scalable group rekeying is one of the important issues in secure group communication since the group is dynamic in nature. Updating the group key and delivering it to group members securely must be carried out in an efficient manner, i.e., the number of encryptions performed and rekey messages constructed must be less. In this paper we propose a new method to manage secure group using binomial key tree approach. We show that number of encryptions performed and rekey messages constructed during membership change are less compared to the scheme proposed by Wong and others. In our scheme, it is not required to balance the tree after membership change. We compute the average encryption and rekey costs and show that the scheme is scalable.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"787 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116415756","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409856
G. Varghese, Debajit Ghosh
3GPP Long Term Evolution (LTE) is a Next Generation (4G) Wireless Technology, providing an evolutionary path for 3G/UMTS deployments. The LTE network architecture is based on a flat all-IP architecture which requires a full mesh connectivity between the LTE evolved Base stations (eNBs). Carrier Ethernet has emerged as a strong candidate to meet the highly scalable and flexible requirements of the wireless backhaul networks. Carrier Ethernet provides capabilities to address the end-to-end service OAM requirements of the wireless backhaul networks in a similar way as that of ATM, SONET/SDH systems. This paper explores the end-to-end service OAM requirements, challenges and options for wireless backhaul networks based on carrier ethernet. The paper analyzes the various fault monitoring (FM), performance monitoring (PM) and fault tolerance requirements in LTE wireless backhaul networks. The paper then goes on to propose a service OAM model which addresses these OAM requirements in an optimal manner for large networks. The paper concludes by validating ITU-T Y.1731 for meeting the basic service OAM requirements and suggests modifications to meet the CCM scalability requirements.
{"title":"Wireless backhaul for LTE - service OAM considerations","authors":"G. Varghese, Debajit Ghosh","doi":"10.1109/ANTS.2009.5409856","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409856","url":null,"abstract":"3GPP Long Term Evolution (LTE) is a Next Generation (4G) Wireless Technology, providing an evolutionary path for 3G/UMTS deployments. The LTE network architecture is based on a flat all-IP architecture which requires a full mesh connectivity between the LTE evolved Base stations (eNBs). Carrier Ethernet has emerged as a strong candidate to meet the highly scalable and flexible requirements of the wireless backhaul networks. Carrier Ethernet provides capabilities to address the end-to-end service OAM requirements of the wireless backhaul networks in a similar way as that of ATM, SONET/SDH systems. This paper explores the end-to-end service OAM requirements, challenges and options for wireless backhaul networks based on carrier ethernet. The paper analyzes the various fault monitoring (FM), performance monitoring (PM) and fault tolerance requirements in LTE wireless backhaul networks. The paper then goes on to propose a service OAM model which addresses these OAM requirements in an optimal manner for large networks. The paper concludes by validating ITU-T Y.1731 for meeting the basic service OAM requirements and suggests modifications to meet the CCM scalability requirements.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127692176","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 : 2009-12-14DOI: 10.1109/ANTS.2009.5409867
E. Palkopoulou, D. Schupke, T. Bauschert
Energy efficiency and the minimization of capital expenditures (CAPEX) for network equipment are studied for two network architectures: IP over WDM and IP over OTN over WDM. Case study results from mixed integer linear programming (MILP) formulations indicate that a CAPEX optimized network yields solutions having minimum energy consumption for both architectures. However, it is shown that the most cost efficient architecture is not always the least energy consuming. We quantify the occurring tradeoff and observe that network equipment CAPEX are dominating in terms of cost. Additionally, it is observed that the relative power contribution of different network layers is independent of the average inter-node traffic demand for both studied architectures.
能源效率和资本支出最小化的网络设备(CAPEX)研究了两种网络架构:IP over WDM和IP over OTN over WDM。混合整数线性规划(MILP)公式的案例研究结果表明，资本支出优化的网络产生的解决方案对两种架构都具有最小的能耗。然而，研究表明，最具成本效益的架构并不总是能耗最少的。我们量化了发生的权衡，并观察到网络设备资本支出在成本方面占主导地位。此外，我们观察到不同网络层的相对功率贡献与所研究的两种架构的平均节点间流量需求无关。
{"title":"Energy efficiency and CAPEX minimization for backbone network planning: Is there a tradeoff?","authors":"E. Palkopoulou, D. Schupke, T. Bauschert","doi":"10.1109/ANTS.2009.5409867","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409867","url":null,"abstract":"Energy efficiency and the minimization of capital expenditures (CAPEX) for network equipment are studied for two network architectures: IP over WDM and IP over OTN over WDM. Case study results from mixed integer linear programming (MILP) formulations indicate that a CAPEX optimized network yields solutions having minimum energy consumption for both architectures. However, it is shown that the most cost efficient architecture is not always the least energy consuming. We quantify the occurring tradeoff and observe that network equipment CAPEX are dominating in terms of cost. Additionally, it is observed that the relative power contribution of different network layers is independent of the average inter-node traffic demand for both studied architectures.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127818297","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
扫码关注我们
求助内容：
应助结果提醒方式：