Pub Date : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928943
S. Scellato, C. Mascolo
While in recent years online social networks have been largely shaping user experience on the Web, only in the last year there has been a soaring increase of novel location-based social applications. By allowing users to check-in at places and share their location with friends, these social platforms provide a new facet of user online behavior.
{"title":"Measuring user activity on an online location-based social network","authors":"S. Scellato, C. Mascolo","doi":"10.1109/INFCOMW.2011.5928943","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928943","url":null,"abstract":"While in recent years online social networks have been largely shaping user experience on the Web, only in the last year there has been a soaring increase of novel location-based social applications. By allowing users to check-in at places and share their location with friends, these social platforms provide a new facet of user online behavior.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127279674","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}
Since the radio access of secondary users is typically confined to ensure sufficient operation for primary users in underlay cognitive radio networks (CRNs), the inevitably induced latency and interference pose new challenges on existing routing schemes for Quality-of-Service (QoS) provisioning. Due to stringent accessing and interference constraints, secondary users appeal to exploit multi-path routing based on multi-hop relaying protocol to support QoS requirements. Via our model, we derive the end-to-end delay statistics including medium access and retransmission delay, where we successfully relate path diversity to end-to-end reliability and optimize the delivery delay by adjusting transmission power. We analyze the performance of the duplication-based and coding-aided multi-path routing schemes, where opportunistic transmission is employed to improve the delivery delay due to channel awareness, and encoding packets on multiple paths further achieves throughput efficiency. This paper firstly presents insights and performance analysis to facilitate multi-path routing with QoS provisioning in underlay CRN.
{"title":"Multi-path routing with end-to-end statistical QoS Provisioning in Underlay Cognitive Radio Networks","authors":"Pin-Yu Chen, Shin-Ming Cheng, Weng-Chon Ao, Kwang-Cheng Chen","doi":"10.1109/INFCOMW.2011.5928921","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928921","url":null,"abstract":"Since the radio access of secondary users is typically confined to ensure sufficient operation for primary users in underlay cognitive radio networks (CRNs), the inevitably induced latency and interference pose new challenges on existing routing schemes for Quality-of-Service (QoS) provisioning. Due to stringent accessing and interference constraints, secondary users appeal to exploit multi-path routing based on multi-hop relaying protocol to support QoS requirements. Via our model, we derive the end-to-end delay statistics including medium access and retransmission delay, where we successfully relate path diversity to end-to-end reliability and optimize the delivery delay by adjusting transmission power. We analyze the performance of the duplication-based and coding-aided multi-path routing schemes, where opportunistic transmission is employed to improve the delivery delay due to channel awareness, and encoding packets on multiple paths further achieves throughput efficiency. This paper firstly presents insights and performance analysis to facilitate multi-path routing with QoS provisioning in underlay CRN.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126131382","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}
Scalable mobility support is an important task in large-scale mobile Internet. A considerable amount of research on distributed hash table (DHT) based mobility support schemes, which are highly user scalable and load balanced, has been done. However these schemes have shortcomings in query and update performances and network scalability. It is because although routing of overlay itself is effective, there is inconsistency between logical and physical topologies, so the actual physical network performances are not necessarily efficient. In this article, while modeling the overlay mapping query to a Markov decision process (MDP), we define the reward function combining physical layer information with application layer information. Then we present a Markov decision routing (MDR) algorithm, which improves backward induction to get the global optimal strategy, and can balance the complexity of the time and space.We propose a DHT and MDR-based mobility management (DMDRMM) scheme. The numerical results show that the scheme inherits the advantages of the DHT-based management structure, and optimizes the update and query performances of dDHT especially for large-scale network.
{"title":"A DHT and MDP-based mobility management scheme for large-scale mobile internet","authors":"Yujia Zhai, Yue Wang, I. You, Jian Yuan, Yong Ren, X. Shan","doi":"10.1109/INFCOMW.2011.5928842","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928842","url":null,"abstract":"Scalable mobility support is an important task in large-scale mobile Internet. A considerable amount of research on distributed hash table (DHT) based mobility support schemes, which are highly user scalable and load balanced, has been done. However these schemes have shortcomings in query and update performances and network scalability. It is because although routing of overlay itself is effective, there is inconsistency between logical and physical topologies, so the actual physical network performances are not necessarily efficient. In this article, while modeling the overlay mapping query to a Markov decision process (MDP), we define the reward function combining physical layer information with application layer information. Then we present a Markov decision routing (MDR) algorithm, which improves backward induction to get the global optimal strategy, and can balance the complexity of the time and space.We propose a DHT and MDR-based mobility management (DMDRMM) scheme. The numerical results show that the scheme inherits the advantages of the DHT-based management structure, and optimizes the update and query performances of dDHT especially for large-scale network.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125972335","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928951
Nandhakumar Kathiresshan, Zhifeng Xiao, Yang Xiao
We propose EagleEye, an accountable logging framework as a middleware for distributed and networked systems. EagleEye offloads the logging function from the distributed application program so that applications can focus on the logic handling without worrying about when and how to do logging. By capturing and analyzing network packets, EagleEye is able to reproduce the entire networking event history in the application layer, which is the basis of implementing an accountable system. We provide a case study by replacing the logging component of PeerReview [1] with EagleEye. The evaluation result shows that EagleEye can achieve equivalent accountability without modifying the host application program, which can save numerous workloads of modifying, republishing, and redeploying the host software.
{"title":"EagleEye: A logging framework for accountable distributed and networked systems","authors":"Nandhakumar Kathiresshan, Zhifeng Xiao, Yang Xiao","doi":"10.1109/INFCOMW.2011.5928951","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928951","url":null,"abstract":"We propose EagleEye, an accountable logging framework as a middleware for distributed and networked systems. EagleEye offloads the logging function from the distributed application program so that applications can focus on the logic handling without worrying about when and how to do logging. By capturing and analyzing network packets, EagleEye is able to reproduce the entire networking event history in the application layer, which is the basis of implementing an accountable system. We provide a case study by replacing the logging component of PeerReview [1] with EagleEye. The evaluation result shows that EagleEye can achieve equivalent accountability without modifying the host application program, which can save numerous workloads of modifying, republishing, and redeploying the host software.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130074456","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928922
G. Bartlett, J. Heidemann, C. Papadopoulos
As desktops and servers become more complicated, they employ an increasing amount of automatic, non-user initiated communication. Such communication can be good (OS updates, RSS feed readers, and mail polling), bad (keyloggers, spyware, and botnet command-and-control), or ugly (adware or unauthorized peer-to-peer applications). Communication in these applications is often regular, but with very long periods, ranging from minutes to hours. This infrequent communication and the complexity of today's systems makes these applications difficult for users to detect and diagnose. In this paper we present a new approach to identify low-rate periodic network traffic and changes in such regular communication. We employ signal-processing techniques, using discrete wavelets implemented as a fully decomposed, iterated filter bank. This approach not only detects low-rate periodicities, but also identifies approximate times when traffic changed. We implement a self-surveillance application that externally identifies changes to a user's machine, such as interruption of periodic software updates, or an installation of a keylogger.
{"title":"Low-rate, flow-level periodicity detection","authors":"G. Bartlett, J. Heidemann, C. Papadopoulos","doi":"10.1109/INFCOMW.2011.5928922","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928922","url":null,"abstract":"As desktops and servers become more complicated, they employ an increasing amount of automatic, non-user initiated communication. Such communication can be good (OS updates, RSS feed readers, and mail polling), bad (keyloggers, spyware, and botnet command-and-control), or ugly (adware or unauthorized peer-to-peer applications). Communication in these applications is often regular, but with very long periods, ranging from minutes to hours. This infrequent communication and the complexity of today's systems makes these applications difficult for users to detect and diagnose. In this paper we present a new approach to identify low-rate periodic network traffic and changes in such regular communication. We employ signal-processing techniques, using discrete wavelets implemented as a fully decomposed, iterated filter bank. This approach not only detects low-rate periodicities, but also identifies approximate times when traffic changed. We implement a self-surveillance application that externally identifies changes to a user's machine, such as interruption of periodic software updates, or an installation of a keylogger.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129208695","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928884
Limei Peng, C. Qiao, Wan Tang, Chan-Hyun Youn, Xinwan Li, Guiling Wu, Jianping Chen, Ting Wang
In this paper, we propose and evaluate a novel approach to switching traffic between the pods (or containers) of servers all optically. We show that the proposed approach, called Labeled Optical Burst Switching with Home Circuit (or LOBS-HC) requires a fewer wavelengths (and transceivers) than existing approaches based on wavelength routing or optical circuit switching (OCS). In addition, it is also more suitable than optical burst switching (OBS) and electronic switching. Simulation results from OPNET confirm that LOBS-HC achieves good performance for dynamic inter-pod traffic that is common in a datacenter.
{"title":"A novel approach to optically switching inter-pod traffic in datacenters","authors":"Limei Peng, C. Qiao, Wan Tang, Chan-Hyun Youn, Xinwan Li, Guiling Wu, Jianping Chen, Ting Wang","doi":"10.1109/INFCOMW.2011.5928884","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928884","url":null,"abstract":"In this paper, we propose and evaluate a novel approach to switching traffic between the pods (or containers) of servers all optically. We show that the proposed approach, called Labeled Optical Burst Switching with Home Circuit (or LOBS-HC) requires a fewer wavelengths (and transceivers) than existing approaches based on wavelength routing or optical circuit switching (OCS). In addition, it is also more suitable than optical burst switching (OBS) and electronic switching. Simulation results from OPNET confirm that LOBS-HC achieves good performance for dynamic inter-pod traffic that is common in a datacenter.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133034424","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928807
Rong Yu, Yan Zhang, Yanrong Chen, Chujia Huang, Yang Xiao, M. Guizani
It is envisioned that home networks will shift from the current machine-to-human communications to the machine-to-machine (M2M) paradigm with the rapid penetration of embedded devices in home surroundings. In this paper, we first proposed an architecture of home M2M networks that is decomposed into three sub-areas depending on the radio service ranges and potential applications. We then concentrate on the Quality-of-Service (QoS) management in home M2M networks. Although generic QoS architectures for home M2M networks have been proposed in existing standards, the concrete QoS schemes and algorithms are still missing. Based on the proposed architecture, a cross-layer design of distributed admission and rate control is put forwarded. This proposed scheme, named DRAC, is integrated with a game theory analysis module to model the competition of radio bandwidth among M2M home devices, and embrace the distributed operations of QoS-aware and fair sharing in transmission opportunities. Simulation results indicate that the proposed DRAC scheme allows the M2M home devices to intelligently share the radio bandwidth based on QoS demands in resource-constrained home M2M networks.
{"title":"Distributed rate and admission control in home M2M networks: A non-cooperative game approach","authors":"Rong Yu, Yan Zhang, Yanrong Chen, Chujia Huang, Yang Xiao, M. Guizani","doi":"10.1109/INFCOMW.2011.5928807","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928807","url":null,"abstract":"It is envisioned that home networks will shift from the current machine-to-human communications to the machine-to-machine (M2M) paradigm with the rapid penetration of embedded devices in home surroundings. In this paper, we first proposed an architecture of home M2M networks that is decomposed into three sub-areas depending on the radio service ranges and potential applications. We then concentrate on the Quality-of-Service (QoS) management in home M2M networks. Although generic QoS architectures for home M2M networks have been proposed in existing standards, the concrete QoS schemes and algorithms are still missing. Based on the proposed architecture, a cross-layer design of distributed admission and rate control is put forwarded. This proposed scheme, named DRAC, is integrated with a game theory analysis module to model the competition of radio bandwidth among M2M home devices, and embrace the distributed operations of QoS-aware and fair sharing in transmission opportunities. Simulation results indicate that the proposed DRAC scheme allows the M2M home devices to intelligently share the radio bandwidth based on QoS demands in resource-constrained home M2M networks.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124157305","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928950
Theerasak Thapngam, Shui Yu, Wanlei Zhou, G. Beliakov
Current DDoS attacks are carried out by attack tools, worms and botnets using different packet-transmission strategies and various forms of attack packets to beat defense systems. These problems lead to defense systems requiring various detection methods in order to identify attacks. Moreover, DDoS attacks can mix their traffics during flash crowds. By doing this, the complex defense system cannot detect the attack traffic in time. In this paper, we propose a behavior based detection that can discriminate DDoS attack traffic from traffic generated by real users. By using Pearson's correlation coefficient, our comparable detection methods can extract the repeatable features of the packet arrivals. The extensive simulations were tested for the accuracy of detection. We then performed experiments with several datasets and our results affirm that the proposed method can differentiate traffic of an attack source from legitimate traffic with a quick response. We also discuss approaches to improve our proposed methods at the conclusion of this paper.
{"title":"Discriminating DDoS attack traffic from flash crowd through packet arrival patterns","authors":"Theerasak Thapngam, Shui Yu, Wanlei Zhou, G. Beliakov","doi":"10.1109/INFCOMW.2011.5928950","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928950","url":null,"abstract":"Current DDoS attacks are carried out by attack tools, worms and botnets using different packet-transmission strategies and various forms of attack packets to beat defense systems. These problems lead to defense systems requiring various detection methods in order to identify attacks. Moreover, DDoS attacks can mix their traffics during flash crowds. By doing this, the complex defense system cannot detect the attack traffic in time. In this paper, we propose a behavior based detection that can discriminate DDoS attack traffic from traffic generated by real users. By using Pearson's correlation coefficient, our comparable detection methods can extract the repeatable features of the packet arrivals. The extensive simulations were tested for the accuracy of detection. We then performed experiments with several datasets and our results affirm that the proposed method can differentiate traffic of an attack source from legitimate traffic with a quick response. We also discuss approaches to improve our proposed methods at the conclusion of this paper.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121413960","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928813
Yun Li, Nan Yu, Weiyi Zhang, Weiliang Zhao, X. You, M. Daneshmand
LEACH protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of lifetime and throughput related to the time length of each round are deduced. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.
{"title":"Enhancing the performance of LEACH protocol in wireless sensor networks","authors":"Yun Li, Nan Yu, Weiyi Zhang, Weiliang Zhao, X. You, M. Daneshmand","doi":"10.1109/INFCOMW.2011.5928813","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928813","url":null,"abstract":"LEACH protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of lifetime and throughput related to the time length of each round are deduced. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115873103","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928912
Mira Yun, Danielle Bragg, Amrinder Arora, Hyeong-Ah Choi
We consider the problem of identifying battlefield events using sensors deployed in the area. The goal is to alert centralized headquarters about the occurrence of significant events so that it can respond appropriately to the events. We propose a mechanism using which the sensors can exchange information using signatures of events instead of data to save on transmission costs. Further, we propose an algorithm that dynamically generates phases of information exchange based on the cost and selectivity of each filter.We present simulation results that compare the proposed algorithm to other alternatives. Our results show that the proposed algorithm detects events while minimizing the transmission and processing costs at sensors.
{"title":"Battle event detection using sensor networks and distributed query processing","authors":"Mira Yun, Danielle Bragg, Amrinder Arora, Hyeong-Ah Choi","doi":"10.1109/INFCOMW.2011.5928912","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928912","url":null,"abstract":"We consider the problem of identifying battlefield events using sensors deployed in the area. The goal is to alert centralized headquarters about the occurrence of significant events so that it can respond appropriately to the events. We propose a mechanism using which the sensors can exchange information using signatures of events instead of data to save on transmission costs. Further, we propose an algorithm that dynamically generates phases of information exchange based on the cost and selectivity of each filter.We present simulation results that compare the proposed algorithm to other alternatives. Our results show that the proposed algorithm detects events while minimizing the transmission and processing costs at sensors.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116729429","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
扫码关注我们
求助内容：
应助结果提醒方式：