Pub Date : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928904
Chris Y. T. Ma, N. Rao, David K. Y. Yau
Cyber-physical systems encompass a wide range of systems such as sensor networks, cloud computing complexes, and communication networks. They require both the cyber and physical components to function, and hence are susceptible to attacks on either. A cyber-physical system is characterized by the physical space that represents physical components, and the cyber space that represents computations and communications. In this paper, we present a number of game theoretic formulations of attack and defense aspects of cyber-physical systems under different cost and benefit functions and different budgets of the attacker and defender. We discuss the outcomes of the underlying game under linear, negative exponential, and S-shaped benefit functions. We show that the outcomes are determined by the Nash Equilibria (which sometimes occur at budget limits), which in turn determine the system survival.
{"title":"A game theoretic study of attack and defense in cyber-physical systems","authors":"Chris Y. T. Ma, N. Rao, David K. Y. Yau","doi":"10.1109/INFCOMW.2011.5928904","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928904","url":null,"abstract":"Cyber-physical systems encompass a wide range of systems such as sensor networks, cloud computing complexes, and communication networks. They require both the cyber and physical components to function, and hence are susceptible to attacks on either. A cyber-physical system is characterized by the physical space that represents physical components, and the cyber space that represents computations and communications. In this paper, we present a number of game theoretic formulations of attack and defense aspects of cyber-physical systems under different cost and benefit functions and different budgets of the attacker and defender. We discuss the outcomes of the underlying game under linear, negative exponential, and S-shaped benefit functions. We show that the outcomes are determined by the Nash Equilibria (which sometimes occur at budget limits), which in turn determine the system survival.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"140 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":"127494412","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.5928803
Zheng Wan, N. Xiong, N. Ghani, M. Peng, A. Vasilakos, Liang Zhou
With the increase of wireless bandwidth, wireless video applications become more and more popular. A high speed core network is needed for large-scale applications to collect video from wireless terminals in a distributed way. It is necessary to guarantee video transmission in wireless networks because video data should be firstly transmitted via wireless channel. Since wireless bandwidth is still limited and fluctuates frequently, it is difficult to protect wireless video transmission. In this paper, we propose an adaptive cross layer scheduling schema to reduce video transmission distortion in IEEE 802.11e networks. Firstly, it is preferred to insert each video frame into the access category (AC) with minimum relative queuing delay to reduce transmission delay. Secondly, a dynamic frame assignment algorithm (DFAA) is proposed to guarantee the transmission of high priority frames efficiently, with the constraint of limited bandwidth. Finally, each parameter of DFAA is equipped with a fuzzy logic controller which can produce appropriate adjustment to reply quickly to the variation of video data rate, coding structure and network load. Extensive simulation results are presented to validate the effectiveness of our proposed scheme.
{"title":"Adaptive scheduling for wireless video transmission in high-speed networks","authors":"Zheng Wan, N. Xiong, N. Ghani, M. Peng, A. Vasilakos, Liang Zhou","doi":"10.1109/INFCOMW.2011.5928803","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928803","url":null,"abstract":"With the increase of wireless bandwidth, wireless video applications become more and more popular. A high speed core network is needed for large-scale applications to collect video from wireless terminals in a distributed way. It is necessary to guarantee video transmission in wireless networks because video data should be firstly transmitted via wireless channel. Since wireless bandwidth is still limited and fluctuates frequently, it is difficult to protect wireless video transmission. In this paper, we propose an adaptive cross layer scheduling schema to reduce video transmission distortion in IEEE 802.11e networks. Firstly, it is preferred to insert each video frame into the access category (AC) with minimum relative queuing delay to reduce transmission delay. Secondly, a dynamic frame assignment algorithm (DFAA) is proposed to guarantee the transmission of high priority frames efficiently, with the constraint of limited bandwidth. Finally, each parameter of DFAA is equipped with a fuzzy logic controller which can produce appropriate adjustment to reply quickly to the variation of video data rate, coding structure and network load. Extensive simulation results are presented to validate the effectiveness of our proposed scheme.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"102 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":"130148887","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.5928792
Junmin Gu, D. Katramatos, Xin Liu, V. Natarajan, A. Shoshani, A. Sim, Dantong Yu, S. Bradley, S. McKee
Modern scientific data-intensive applications brought about the need for novel data transfer technologies and automated tools capable of effectively utilizing available raw network bandwidth and intelligently assisting scientists in replicating large volumes of data to desired locations in a timely manner. In this paper we describe the design of StorNet, an integrated end-to-end resource provisioning and management system for high performance data transfers that can operate with heterogeneous network protocols and storage systems in a federated computing environment. StorNet allocates and co-schedules storage and network resources involved in data transfers. It is based on existing Storage Resource Manager, TeraPaths, and OSCARS capabilities. StorNet provides data intensive applications with the capability of predictable, yet efficient delivery of data at rates of multiple gigabits/second, bridging end-to-end advanced storage and network technologies in a transparent way.
{"title":"StorNet: Co-scheduling of end-to-end bandwidth reservation on storage and network systems for high-performance data transfers","authors":"Junmin Gu, D. Katramatos, Xin Liu, V. Natarajan, A. Shoshani, A. Sim, Dantong Yu, S. Bradley, S. McKee","doi":"10.1109/INFCOMW.2011.5928792","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928792","url":null,"abstract":"Modern scientific data-intensive applications brought about the need for novel data transfer technologies and automated tools capable of effectively utilizing available raw network bandwidth and intelligently assisting scientists in replicating large volumes of data to desired locations in a timely manner. In this paper we describe the design of StorNet, an integrated end-to-end resource provisioning and management system for high performance data transfers that can operate with heterogeneous network protocols and storage systems in a federated computing environment. StorNet allocates and co-schedules storage and network resources involved in data transfers. It is based on existing Storage Resource Manager, TeraPaths, and OSCARS capabilities. StorNet provides data intensive applications with the capability of predictable, yet efficient delivery of data at rates of multiple gigabits/second, bridging end-to-end advanced storage and network technologies in a transparent way.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"11 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":"131029532","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.5928899
Aditya Wagh, Xu Li, Jingyan Wan, C. Qiao, Changxu Wu
Building effective Vehicular Cyber-Physical Systems (VCPS) to improve road safety is a non-trivial challenge, especially when we examine how the driver benefits from the existing and proposed technologies in the presence of Human Factors (HF) related negative factors such as information overload, confusion, and distraction. In this paper, we address a human-centric data fusion problem in VCPS. To the best of our knowledge, this work is the first to apply HF to the data fusion problem, which has both theoretical value and practical implications. In particular, we present a new architecture by defining a distinct High-Level (HL) data fusion layer with HF considerations, that is placed between the safety applications on the VCPS and the human driver. A data fusion algorithm is proposed to fuse multiple messages (based on reaction time, message type, preferred evasive actions, severity of the hazards, etc) and to maximize the total utility of the messages. The algorithm is tested with real human drivers to demonstrate the potential benefit of incorporating such human-centric fusion in existing warning systems.
{"title":"Human centric data fusion in Vehicular Cyber-Physical Systems","authors":"Aditya Wagh, Xu Li, Jingyan Wan, C. Qiao, Changxu Wu","doi":"10.1109/INFCOMW.2011.5928899","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928899","url":null,"abstract":"Building effective Vehicular Cyber-Physical Systems (VCPS) to improve road safety is a non-trivial challenge, especially when we examine how the driver benefits from the existing and proposed technologies in the presence of Human Factors (HF) related negative factors such as information overload, confusion, and distraction. In this paper, we address a human-centric data fusion problem in VCPS. To the best of our knowledge, this work is the first to apply HF to the data fusion problem, which has both theoretical value and practical implications. In particular, we present a new architecture by defining a distinct High-Level (HL) data fusion layer with HF considerations, that is placed between the safety applications on the VCPS and the human driver. A data fusion algorithm is proposed to fuse multiple messages (based on reaction time, message type, preferred evasive actions, severity of the hazards, etc) and to maximize the total utility of the messages. The algorithm is tested with real human drivers to demonstrate the potential benefit of incorporating such human-centric fusion in existing warning systems.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"10 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":"130678687","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.5928784
Weiwei Jia, Haojin Zhu, Z. Cao, Lifei Wei, Xiaodong Lin
To enhance the security of mobile cloud users, a few proposals have been presented recently. However we argue that most of them are not suitable for mobile cloud where mobile users might join or leave the mobile networks arbitrarily. In this paper, we design a secure mobile user-based data service mechanism (SDSM) to provide confidentiality and fine-grained access control for data stored in the cloud. This mechanism enables the mobile users to enjoy a secure outsourced data services at a minimized security management overhead. The core idea of SDSM is that SDSM outsources not only the data but also the security management to the mobile cloud in a trust way. Our analysis shows that the proposed mechanism has many advantages over the existing traditional methods such as lower overhead and convenient update, which could better cater the requirements in mobile cloud computing scenarios.
{"title":"SDSM: A secure data service mechanism in mobile cloud computing","authors":"Weiwei Jia, Haojin Zhu, Z. Cao, Lifei Wei, Xiaodong Lin","doi":"10.1109/INFCOMW.2011.5928784","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928784","url":null,"abstract":"To enhance the security of mobile cloud users, a few proposals have been presented recently. However we argue that most of them are not suitable for mobile cloud where mobile users might join or leave the mobile networks arbitrarily. In this paper, we design a secure mobile user-based data service mechanism (SDSM) to provide confidentiality and fine-grained access control for data stored in the cloud. This mechanism enables the mobile users to enjoy a secure outsourced data services at a minimized security management overhead. The core idea of SDSM is that SDSM outsources not only the data but also the security management to the mobile cloud in a trust way. Our analysis shows that the proposed mechanism has many advantages over the existing traditional methods such as lower overhead and convenient update, which could better cater the requirements in mobile cloud computing scenarios.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"105 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":"132451425","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.5928850
Juncheng Jia, W. Zhuang
With the advance of both hardware and software technologies, the concept of software defined radio (SDR) is becoming more and more popular in the academic and industrial communities. Its popularity has been increased by the recent intensive research of cognitive radio technology, which is built on top of SDR. One of key features of SDR is its capability of frequency agility, which means a single SDR can access multiple channels, subject to a certain total frequency bandwidth (channel span) constraint. Compared with the traditional multiple-radio solutions, the SDR setup has the advantages of higher flexibility and reduced hardware size (cost). In this paper, we investigate the achievable capacity of a wireless network with single-SDR equipped transceivers, especially a multiple-hop network, for any given network flows. We propose new approaches to formulate the single-SDR constraint, which is unique for the derivation of capacity upper bounds. We also propose a heuristic algorithm to obtain a lower bound for the capacity. Both numerical and simulation results are presented to demonstrate the potential capacity for an SDR network and compared it with a multipleradio network.
{"title":"Capacity of multi-hop wireless network with frequency agile software defined radio","authors":"Juncheng Jia, W. Zhuang","doi":"10.1109/INFCOMW.2011.5928850","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928850","url":null,"abstract":"With the advance of both hardware and software technologies, the concept of software defined radio (SDR) is becoming more and more popular in the academic and industrial communities. Its popularity has been increased by the recent intensive research of cognitive radio technology, which is built on top of SDR. One of key features of SDR is its capability of frequency agility, which means a single SDR can access multiple channels, subject to a certain total frequency bandwidth (channel span) constraint. Compared with the traditional multiple-radio solutions, the SDR setup has the advantages of higher flexibility and reduced hardware size (cost). In this paper, we investigate the achievable capacity of a wireless network with single-SDR equipped transceivers, especially a multiple-hop network, for any given network flows. We propose new approaches to formulate the single-SDR constraint, which is unique for the derivation of capacity upper bounds. We also propose a heuristic algorithm to obtain a lower bound for the capacity. Both numerical and simulation results are presented to demonstrate the potential capacity for an SDR network and compared it with a multipleradio network.","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":"129248034","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.5928865
T. Nakano, J. Shuai
Molecular communication or communication based on molecules in aqueous environments often relies on free diffusion of signal molecules where a transmitter nanomachine releases signal molecules that randomly walk in the environments to reach the receiver nanomachine. Since the signal molecules randomly walk in the three dimensional environments, the number of molecules that can reach the receiver significantly decreases over distance. A challenge in molecular communication is therefore to overcome the attenuation of molecular signals over distance. In this paper, we investigate a design of repeater nanomachines that amplify signal molecules to enable molecular communication over extended distances. The repeater nanomachines are placed between a transmitter and the receiver, where signal molecules released by the transmitter are amplified by the intermediate repeaters to reach the receiver. A specific biological model and design of molecular communication are used for designing repeaters, with simulation results showing the conditions for the repeaters to amplify, signal molecules for long distance molecular communication.
{"title":"Repeater design and modeling for molecular communication networks","authors":"T. Nakano, J. Shuai","doi":"10.1109/INFCOMW.2011.5928865","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928865","url":null,"abstract":"Molecular communication or communication based on molecules in aqueous environments often relies on free diffusion of signal molecules where a transmitter nanomachine releases signal molecules that randomly walk in the environments to reach the receiver nanomachine. Since the signal molecules randomly walk in the three dimensional environments, the number of molecules that can reach the receiver significantly decreases over distance. A challenge in molecular communication is therefore to overcome the attenuation of molecular signals over distance. In this paper, we investigate a design of repeater nanomachines that amplify signal molecules to enable molecular communication over extended distances. The repeater nanomachines are placed between a transmitter and the receiver, where signal molecules released by the transmitter are amplified by the intermediate repeaters to reach the receiver. A specific biological model and design of molecular communication are used for designing repeaters, with simulation results showing the conditions for the repeaters to amplify, signal molecules for long distance molecular communication.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"86 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":"126448874","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.5928945
Junzhou Zhao, John C.S. Lui, D. Towsley, X. Guan, Yadong Zhou
Follower networks such as Twitter and Digg are becoming popular form of social information networks. This paper seeks to gain insights into how they evolve and the relationship between their structure and their ability to spread information. By studying the Douban follower network, which is a popular online social network in China, we provide some evidences showing its suitability for information spreading. For example, it exhibits an unbalanced bow-tie structure with a large out-component, which indicates that the majority of users can spread information widely; the effective diameter of the strongly connected component is shrinking as the user base grows, which facilitates spreading; and the transitivity property shows that people in a follower network tend to shorten the path of information flow, i.e., it takes fewer hops to spread information. Also, we observe the following users' behaviors, a user's following activity decays exponentially during her lifetime and the following behaviors differ according to the age of the account. These findings provide a deep understanding on the evolution of follower networks, and can provide guidelines on how to build an efficient information diffusion system.
{"title":"Empirical analysis of the evolution of follower network: A case study on Douban","authors":"Junzhou Zhao, John C.S. Lui, D. Towsley, X. Guan, Yadong Zhou","doi":"10.1109/INFCOMW.2011.5928945","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928945","url":null,"abstract":"Follower networks such as Twitter and Digg are becoming popular form of social information networks. This paper seeks to gain insights into how they evolve and the relationship between their structure and their ability to spread information. By studying the Douban follower network, which is a popular online social network in China, we provide some evidences showing its suitability for information spreading. For example, it exhibits an unbalanced bow-tie structure with a large out-component, which indicates that the majority of users can spread information widely; the effective diameter of the strongly connected component is shrinking as the user base grows, which facilitates spreading; and the transitivity property shows that people in a follower network tend to shorten the path of information flow, i.e., it takes fewer hops to spread information. Also, we observe the following users' behaviors, a user's following activity decays exponentially during her lifetime and the following behaviors differ according to the age of the account. These findings provide a deep understanding on the evolution of follower networks, and can provide guidelines on how to build an efficient information diffusion system.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"24 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":"122544867","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.5928831
F. Cuomo, Anna Abbagnale, A. Cianfrani, Marco Polverini
Nowadays a big effort is spent to reduce the Internet energy consumption. Actual Internet topologies have space to power off some links and devices to reduce the energy consumed in off-peak periods still guaranteeing connectivity among terminals. In this work we leverage the algebraic connectivity of the graph modeling an ISP network in order to define the ESACON (Energy Saving based on Algebraic CONnectivity) algorithm. We then consider the network connectivity as a first target performance to be assured. To this aim we identify a metric based on the algebraic connectivity that, on one side, allows to switch off several links with the consequent significant energy saving and, on the other side, still preserves network connectivity and network performance for efficiently supporting the Internet traffic. We find that ESACON achieves better performance with respect to similar topology-aware approaches; moreover ESACON performance are comparable with ones of a complex traffic-aware solution.
{"title":"Keeping the connectivity and saving the energy in the internet","authors":"F. Cuomo, Anna Abbagnale, A. Cianfrani, Marco Polverini","doi":"10.1109/INFCOMW.2011.5928831","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928831","url":null,"abstract":"Nowadays a big effort is spent to reduce the Internet energy consumption. Actual Internet topologies have space to power off some links and devices to reduce the energy consumed in off-peak periods still guaranteeing connectivity among terminals. In this work we leverage the algebraic connectivity of the graph modeling an ISP network in order to define the ESACON (Energy Saving based on Algebraic CONnectivity) algorithm. We then consider the network connectivity as a first target performance to be assured. To this aim we identify a metric based on the algebraic connectivity that, on one side, allows to switch off several links with the consequent significant energy saving and, on the other side, still preserves network connectivity and network performance for efficiently supporting the Internet traffic. We find that ESACON achieves better performance with respect to similar topology-aware approaches; moreover ESACON performance are comparable with ones of a complex traffic-aware solution.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"301 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":"123119939","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.5928817
Yili Gong, Wenjie Wang, C. Liu
In this paper, we explicitly consider the scenario of supporting applications with high-bandwidth and low-latency requirements in mobile social networks (MSNs), by leveraging the existing social network sites. Our solution does not assume any centralized server who coordinates the data storage, access, and group management. We address the fundamental challenge supporting such applications, namely: the limited bandwidth availability and intense bandwidth requirement that may hinder the deployment of these applications. We propose a link-based congestion management (LCM) mechanism to adjust the source rate of each stream, and a prioritized flow management mechanism composed of a novel concept of “stress weight” and its associated utility function. Extensive simulation results show that our proposal achieves 50% less rate reduction under the severe congestions, and the achievable source rate of the proposed LCM scheme is over one order of magnitude higher than the alternative approach.
{"title":"Efficient prioritized congestion management for social network based live sharing","authors":"Yili Gong, Wenjie Wang, C. Liu","doi":"10.1109/INFCOMW.2011.5928817","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928817","url":null,"abstract":"In this paper, we explicitly consider the scenario of supporting applications with high-bandwidth and low-latency requirements in mobile social networks (MSNs), by leveraging the existing social network sites. Our solution does not assume any centralized server who coordinates the data storage, access, and group management. We address the fundamental challenge supporting such applications, namely: the limited bandwidth availability and intense bandwidth requirement that may hinder the deployment of these applications. We propose a link-based congestion management (LCM) mechanism to adjust the source rate of each stream, and a prioritized flow management mechanism composed of a novel concept of “stress weight” and its associated utility function. Extensive simulation results show that our proposal achieves 50% less rate reduction under the severe congestions, and the achievable source rate of the proposed LCM scheme is over one order of magnitude higher than the alternative approach.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"17 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":"125162468","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
扫码关注我们
求助内容：
应助结果提醒方式：