Pub Date : 2015-04-22DOI: 10.1109/LANMAN.2015.7114737
A. Rajandekar, B. Sikdar
Machine to machine (M2M) communications are expected to form one of the fundamental building blocks of the future Internet of Things (IoT). In view of the scarcity of spectrum and the service requirements of traditional users, providing network access to the extremely large number of devices in IoT and M2M scenarios is one of the fundamental problems for network designers and operators. As a possible solution to this issue, this paper explores the possibility of using the unlicensed industrial, scientific and medical (ISM) band for supporting M2M communications while co-existing with traditional users of this band. Since IEEE 802.11 or WiFi based networks are the most common networking technology in the ISM band, this paper presents an evaluation of “white spaces” in WiFi networks (i.e. periods where the WiFi network is not using the channel) that may be used opportunistically for M2M communications. Using a MMPP/G/1/K queue to model the operation of a WiFi access point, we characterize the WiFi white spaces in terms of their frequency, duration, and their probability distribution. Our results show that WiFi white spaces provide considerable transmission opportunities that may be exploited for M2M communications.
{"title":"On exploiting white spaces in WiFi networks for opportunistic M2M communications","authors":"A. Rajandekar, B. Sikdar","doi":"10.1109/LANMAN.2015.7114737","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114737","url":null,"abstract":"Machine to machine (M2M) communications are expected to form one of the fundamental building blocks of the future Internet of Things (IoT). In view of the scarcity of spectrum and the service requirements of traditional users, providing network access to the extremely large number of devices in IoT and M2M scenarios is one of the fundamental problems for network designers and operators. As a possible solution to this issue, this paper explores the possibility of using the unlicensed industrial, scientific and medical (ISM) band for supporting M2M communications while co-existing with traditional users of this band. Since IEEE 802.11 or WiFi based networks are the most common networking technology in the ISM band, this paper presents an evaluation of “white spaces” in WiFi networks (i.e. periods where the WiFi network is not using the channel) that may be used opportunistically for M2M communications. Using a MMPP/G/1/K queue to model the operation of a WiFi access point, we characterize the WiFi white spaces in terms of their frequency, duration, and their probability distribution. Our results show that WiFi white spaces provide considerable transmission opportunities that may be exploited for M2M communications.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116154175","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114741
Xiaofei Wang, Xiuhua Li, Victor C. M. Leung
To solve the mobile traffic explosion problem, there have been many efforts to try to offload the mobile traffic from infrastructured cellular links to direct local short-range communications among users. In this paper, we propose a novel framework of traffic offloading by Tag-Assisted Social-Aware opportunistic sharing in mobile social networks, TASA, to offload traffic by device-to-device sharing. Based on the evaluation of the tags of users and contents, we select a subset of users who are likely to receive the same content as initial seeds depending on their spreading impacts in online SNSs and their mobility patterns in offline MSNs. Then users share the content via opportunistic local connectivity (e.g., Bluetooth, Wi-Fi Direct, LTE D2D) with each other. The observation from SNS activities reveals that individual users have distinct access patterns, which allows TASA to further exploit the user-dependent access delay between the content generation time and each users access time for traffic offloading purposes. We model and analyze the traffic offloading and content spreading among users by taking into account various options in linking SNS and MSN trace data. The trace-driven evaluation demonstrates that TASA can reduce up to 78.9% of the cellular traffic.
{"title":"TASA: traffic offloading by tag-assisted social-aware opportunistic sharing in mobile social networks","authors":"Xiaofei Wang, Xiuhua Li, Victor C. M. Leung","doi":"10.1109/LANMAN.2015.7114741","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114741","url":null,"abstract":"To solve the mobile traffic explosion problem, there have been many efforts to try to offload the mobile traffic from infrastructured cellular links to direct local short-range communications among users. In this paper, we propose a novel framework of traffic offloading by Tag-Assisted Social-Aware opportunistic sharing in mobile social networks, TASA, to offload traffic by device-to-device sharing. Based on the evaluation of the tags of users and contents, we select a subset of users who are likely to receive the same content as initial seeds depending on their spreading impacts in online SNSs and their mobility patterns in offline MSNs. Then users share the content via opportunistic local connectivity (e.g., Bluetooth, Wi-Fi Direct, LTE D2D) with each other. The observation from SNS activities reveals that individual users have distinct access patterns, which allows TASA to further exploit the user-dependent access delay between the content generation time and each users access time for traffic offloading purposes. We model and analyze the traffic offloading and content spreading among users by taking into account various options in linking SNS and MSN trace data. The trace-driven evaluation demonstrates that TASA can reduce up to 78.9% of the cellular traffic.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129529959","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114722
S. S. Adhatarao, Jiachen Chen, M. Arumaithurai, Xiaoming Fu, K. Ramakrishnan
Information Centric Networks (ICN) enable accessing data oblivious of its location, by allowing end-systems to retrieve content based on names. But, architectures such as Named Data Networking (NDN) and Content Oriented Publish/Subscribe System (COPSS) do not yet provide a mechanism for end-system applications to obtain these names. There is a need for an object resolution system that addresses a most important and as yet unimplemented component of obtaining a name in ICN. In this paper, we propose ORICE, an architectural design for Object Resolution services in Information-Centric Environment that satisfies this need. The architecture enables intelligent resolution service by placing the service in the application layer and allows for the service diversity by separating the name space management from resolution service. Through preliminary evaluation, we show that with the help of ORICE, the states stored in the network can be dramatically reduced while ensuring complete data delivery.
{"title":"ORICE: an architecture for object resolution services in information-centric environment","authors":"S. S. Adhatarao, Jiachen Chen, M. Arumaithurai, Xiaoming Fu, K. Ramakrishnan","doi":"10.1109/LANMAN.2015.7114722","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114722","url":null,"abstract":"Information Centric Networks (ICN) enable accessing data oblivious of its location, by allowing end-systems to retrieve content based on names. But, architectures such as Named Data Networking (NDN) and Content Oriented Publish/Subscribe System (COPSS) do not yet provide a mechanism for end-system applications to obtain these names. There is a need for an object resolution system that addresses a most important and as yet unimplemented component of obtaining a name in ICN. In this paper, we propose ORICE, an architectural design for Object Resolution services in Information-Centric Environment that satisfies this need. The architecture enables intelligent resolution service by placing the service in the application layer and allows for the service diversity by separating the name space management from resolution service. Through preliminary evaluation, we show that with the help of ORICE, the states stored in the network can be dramatically reduced while ensuring complete data delivery.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124220943","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114725
Mohammad Y. Hajjat, N. ShankaranarayananP., A. Sivakumar, Sanjay G. Rao
In this paper, we conduct a detailed study characterizing the performance of multi-tier web applications on commercial cloud platforms and evaluate the potential of techniques to improve the resilience of such applications to performance fluctuations in the cloud. In contrast to prior works that have studied the performance of individual cloud services or that of compute-intensive scientific applications (e.g., map-reduce based), our study focuses on multi-tier web applications. Our work is conducted in the context of four real-world web applications which we instrumented to collect the overall response time and the time spent in each application tier, for each transaction. Our results indicate that cloud applications undergo frequent periods of poor performance that typically (i) are short-lived lasting a few minutes; and (ii) may be attributed to a small subset of application components, though different subsets may be involved at different times. While geo-distributing applications can help mitigate performance variability, coarse-grained approaches that merely choose the best performing data-center (DC) provide only modest benefits. More significant benefits could accrue, however, if combination of cloud services located across multiple datacenters (DCs) are chosen to serve each request.
{"title":"Measuring and characterizing the performance of interactive multi-tier cloud applications","authors":"Mohammad Y. Hajjat, N. ShankaranarayananP., A. Sivakumar, Sanjay G. Rao","doi":"10.1109/LANMAN.2015.7114725","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114725","url":null,"abstract":"In this paper, we conduct a detailed study characterizing the performance of multi-tier web applications on commercial cloud platforms and evaluate the potential of techniques to improve the resilience of such applications to performance fluctuations in the cloud. In contrast to prior works that have studied the performance of individual cloud services or that of compute-intensive scientific applications (e.g., map-reduce based), our study focuses on multi-tier web applications. Our work is conducted in the context of four real-world web applications which we instrumented to collect the overall response time and the time spent in each application tier, for each transaction. Our results indicate that cloud applications undergo frequent periods of poor performance that typically (i) are short-lived lasting a few minutes; and (ii) may be attributed to a small subset of application components, though different subsets may be involved at different times. While geo-distributing applications can help mitigate performance variability, coarse-grained approaches that merely choose the best performing data-center (DC) provide only modest benefits. More significant benefits could accrue, however, if combination of cloud services located across multiple datacenters (DCs) are chosen to serve each request.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123601559","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114720
Jiacheng Shang, Lingfan Yu, Chaojing Xue, Wenzhong Li
Wireless mesh network (WMN) has been proposed to extend wireless coverage by using multi-hop communication to enable network service for mobile devices via densely deployed mesh APs. While modern wireless devices are capable of using multiple WiFi interfaces, the Multipath TCP (MPTCP) protocol has been employed to make full use of the capacity of multiple radios. A key question of MPTCP communication in WMN is to decide the best access point (AP) association for each wireless interface to achieve maximum network performance. In this paper, we propose an optimal AP association scheme based on goodput measurement. We setup a wireless mesh testbed with densely deployed APs to study the impact of signal strength and multi-hop communication. We fit the measured data by a three-dimensional surface, which shows that network goodput can be estimated by a function of Received Signal Strength Indicator (RSSI) and hops. With the proposed estimation function, we formulate the AP association problem as a mathematical optimization problem and solve it by Integer Programming.We implement the proposed strategy in the real deployed testbed and evaluate its performance using MPTCP, which shows that it improves MPTCP goodput significantly compared to several existing strategies.
{"title":"Optimizing AP association in wireless mesh network with multipath TCP","authors":"Jiacheng Shang, Lingfan Yu, Chaojing Xue, Wenzhong Li","doi":"10.1109/LANMAN.2015.7114720","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114720","url":null,"abstract":"Wireless mesh network (WMN) has been proposed to extend wireless coverage by using multi-hop communication to enable network service for mobile devices via densely deployed mesh APs. While modern wireless devices are capable of using multiple WiFi interfaces, the Multipath TCP (MPTCP) protocol has been employed to make full use of the capacity of multiple radios. A key question of MPTCP communication in WMN is to decide the best access point (AP) association for each wireless interface to achieve maximum network performance. In this paper, we propose an optimal AP association scheme based on goodput measurement. We setup a wireless mesh testbed with densely deployed APs to study the impact of signal strength and multi-hop communication. We fit the measured data by a three-dimensional surface, which shows that network goodput can be estimated by a function of Received Signal Strength Indicator (RSSI) and hops. With the proposed estimation function, we formulate the AP association problem as a mathematical optimization problem and solve it by Integer Programming.We implement the proposed strategy in the real deployed testbed and evaluate its performance using MPTCP, which shows that it improves MPTCP goodput significantly compared to several existing strategies.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116265138","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114736
Jason J. Quinlan, A. Zahran, Kadangode K. Ramakrishnan, C. Sreenan
HTTP streaming currently dominates Internet traffic. It is increasingly common that video players employ adaptive bitrate (ABR) streaming strategies to maximise the user experience by selecting the highest video representation while targeting stall-free playback. Our interest lies in the common situation where a set of video flows are competing for access to a shared bottleneck link, such as in a cellular radio access network. We observe that ISPs (e.g. cellular operators) are considering innetwork techniques for resource allocation and sharing among different users. Buoyed by the ability of software defined networks (SDN) to offer flow-specific control and traffic shaping, we focus on traffic shaping techniques, and experimentally analyse the effect on ABR video flows when sharing a bottleneck link. We conduct experiments using the GPAC video player operating over a Mininet virtual network. We conclude that traffic shaping can allow a balance of fairness, efficiency and quality. Traffic shaping ABR videos reduce the number of stalls and quality switches, while also reducing the peaks for the aggregate network traffic.
{"title":"Delivery of adaptive bit rate video: balancing fairness, efficiency and quality","authors":"Jason J. Quinlan, A. Zahran, Kadangode K. Ramakrishnan, C. Sreenan","doi":"10.1109/LANMAN.2015.7114736","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114736","url":null,"abstract":"HTTP streaming currently dominates Internet traffic. It is increasingly common that video players employ adaptive bitrate (ABR) streaming strategies to maximise the user experience by selecting the highest video representation while targeting stall-free playback. Our interest lies in the common situation where a set of video flows are competing for access to a shared bottleneck link, such as in a cellular radio access network. We observe that ISPs (e.g. cellular operators) are considering innetwork techniques for resource allocation and sharing among different users. Buoyed by the ability of software defined networks (SDN) to offer flow-specific control and traffic shaping, we focus on traffic shaping techniques, and experimentally analyse the effect on ABR video flows when sharing a bottleneck link. We conduct experiments using the GPAC video player operating over a Mininet virtual network. We conclude that traffic shaping can allow a balance of fairness, efficiency and quality. Traffic shaping ABR videos reduce the number of stalls and quality switches, while also reducing the peaks for the aggregate network traffic.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121565270","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114735
A. S. Rajan, Sameh Gobriel, C. Maciocco, Kannan Babu Ramia, Sachin Kapur, A. Singh, Jeffrey Erman, V. Gopalakrishnan, R. Jana
Network function virtualization (NFV) promises significant cost savings, flexibility and ease of deployment. However, potential challenges in implementing virtualized network elements that can support real-world performance requirements are still an open question. For example, traditional telecom networks have a lot of complex interdependencies that can affect performance. In this paper, we study the potential bottlenecks in virtualizing cellular core network functions. Using a combination of analysis and experimentation, we quantify the impact of software-based EPC elements on various metrics including physical processing, memory, IO, and bandwidth resource requirements. We use production grade, software-based cellular network elements running on general purpose Linux servers, driven by a variety of realistic workloads derived from a realworld cellular network, to examine the combined effects of control and data planes on an LTE enhanced packet core (EPC). In particular, we discover that the SGW handles about 33% of the control plane transactions and is a potential source for performance bottlenecks as a result of the interdependencies between control and data plane processing. Our results indicate that simply replacing existing EPC elements with virtualized equivalents can have severe performance bottlenecks and that virtualized EPC elements need to be carefully designed.
{"title":"Understanding the bottlenecks in virtualizing cellular core network functions","authors":"A. S. Rajan, Sameh Gobriel, C. Maciocco, Kannan Babu Ramia, Sachin Kapur, A. Singh, Jeffrey Erman, V. Gopalakrishnan, R. Jana","doi":"10.1109/LANMAN.2015.7114735","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114735","url":null,"abstract":"Network function virtualization (NFV) promises significant cost savings, flexibility and ease of deployment. However, potential challenges in implementing virtualized network elements that can support real-world performance requirements are still an open question. For example, traditional telecom networks have a lot of complex interdependencies that can affect performance. In this paper, we study the potential bottlenecks in virtualizing cellular core network functions. Using a combination of analysis and experimentation, we quantify the impact of software-based EPC elements on various metrics including physical processing, memory, IO, and bandwidth resource requirements. We use production grade, software-based cellular network elements running on general purpose Linux servers, driven by a variety of realistic workloads derived from a realworld cellular network, to examine the combined effects of control and data planes on an LTE enhanced packet core (EPC). In particular, we discover that the SGW handles about 33% of the control plane transactions and is a potential source for performance bottlenecks as a result of the interdependencies between control and data plane processing. Our results indicate that simply replacing existing EPC elements with virtualized equivalents can have severe performance bottlenecks and that virtualized EPC elements need to be carefully designed.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125925599","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114729
Sidney Roberts, Paul Garnett, Ranveer Chandra
More than 4 billion people are not connected to the Internet. This is either because there is no infrastructure or because Internet access is not affordable. This digital divide is extreme in Africa. At Microsoft, we have been investigating various technologies to bridge this divide. In this paper we describe our research around the TV White Spaces, and how we have leveraged it, and worked with our partners to connect communities in Kenya, Tanzania, Ghana, Botswana, Namibia and South Africa.
{"title":"Connecting africa using the TV white spaces: from research to real world deployments","authors":"Sidney Roberts, Paul Garnett, Ranveer Chandra","doi":"10.1109/LANMAN.2015.7114729","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114729","url":null,"abstract":"More than 4 billion people are not connected to the Internet. This is either because there is no infrastructure or because Internet access is not affordable. This digital divide is extreme in Africa. At Microsoft, we have been investigating various technologies to bridge this divide. In this paper we describe our research around the TV White Spaces, and how we have leveraged it, and worked with our partners to connect communities in Kenya, Tanzania, Ghana, Botswana, Namibia and South Africa.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124577491","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114734
Zhou Zhang, Y. Liu, Jianping Wu, Gang Ren, J. Bi
IP spoofing based attacks remains a serious and open security problem due to the fact that the current Internet implements no source address authentication mechanisms. A series of anti-spoofing practices have long been proposed while their actual implementation seems far from satisfactory. Route based filters were extensively studied in the design of Inter-AS source address validation methods. Traditional route based filters only use route direction information to establish filtering rules, causing inherited fake negatives. A novel inter-AS filter based on route path vector is proposed to reduce or even eliminate such fake negatives in this article. We name the filter IPVF (Inter-AS Path Vector Filter), which utilizes the route information of both path and distance, exhibits measurable increase in performance and incurs acceptable additional bandwidth cost. Moreover, traditional route based filtering rules is easy to be deduced by attackers. Since the filtering rules of IPVF could change over time by setting parameters, its actual improvement in performance could be exponentially increased.
{"title":"An inter-AS path vector filter: towards elimination of false negatives","authors":"Zhou Zhang, Y. Liu, Jianping Wu, Gang Ren, J. Bi","doi":"10.1109/LANMAN.2015.7114734","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114734","url":null,"abstract":"IP spoofing based attacks remains a serious and open security problem due to the fact that the current Internet implements no source address authentication mechanisms. A series of anti-spoofing practices have long been proposed while their actual implementation seems far from satisfactory. Route based filters were extensively studied in the design of Inter-AS source address validation methods. Traditional route based filters only use route direction information to establish filtering rules, causing inherited fake negatives. A novel inter-AS filter based on route path vector is proposed to reduce or even eliminate such fake negatives in this article. We name the filter IPVF (Inter-AS Path Vector Filter), which utilizes the route information of both path and distance, exhibits measurable increase in performance and incurs acceptable additional bandwidth cost. Moreover, traditional route based filtering rules is easy to be deduced by attackers. Since the filtering rules of IPVF could change over time by setting parameters, its actual improvement in performance could be exponentially increased.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126770081","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114728
Shunfu Jin, Xiaotong Ma, Wuyi Yue
In order to improve the spectrum efficiency and achieve greener communication in wireless applications, in this paper we propose a novel energy saving strategy in cognitive networks based on software defined radio. By establishing a preemptive priority queue model with single vacation, we capture the stochastic behavior of the proposed strategy. Using the method of matrix geometric solution, we derive both the average latency of secondary user packets and the energy saving rate. Finally, we provide numerical results to demonstrate the influence of the sleep timer length on the system performance, and to investigate the trade-off between different performance measures.
{"title":"Energy saving strategy in cognitive networks based on software defined radio","authors":"Shunfu Jin, Xiaotong Ma, Wuyi Yue","doi":"10.1109/LANMAN.2015.7114728","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114728","url":null,"abstract":"In order to improve the spectrum efficiency and achieve greener communication in wireless applications, in this paper we propose a novel energy saving strategy in cognitive networks based on software defined radio. By establishing a preemptive priority queue model with single vacation, we capture the stochastic behavior of the proposed strategy. Using the method of matrix geometric solution, we derive both the average latency of secondary user packets and the energy saving rate. Finally, we provide numerical results to demonstrate the influence of the sleep timer length on the system performance, and to investigate the trade-off between different performance measures.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132100481","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
扫码关注我们
求助内容：
应助结果提醒方式：