Parul Gupta, A. Vishwanath, S. Kalyanaraman, Yonghua Lin
{"title":"Unlocking wireless performance with co-operation in co-located base station pools","authors":"Parul Gupta, A. Vishwanath, S. Kalyanaraman, Yonghua Lin","doi":"10.1109/COMSNETS.2010.5431996","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431996","url":null,"abstract":"Multi-cell base station co-operation techniques, ranging from load-balancing, joint resource-allocation to macro-diversity schemes, have been known to improve wireless system performance significantly by exploiting the higher degrees of freedom to make more optimized decisions. However, the realization of these techniques has remained limited largely due to constraints on inter-BS communication and the latencies involved in information exchange for distributed base stations. Base station pooling is an interesting alternative network architecture where all the BS computational resources (enabled by software radio) are pooled in a central location and connected via fiber to simple radio-front ends mounted on remote cell-towers. In this paper, we study the potential of base station co-operation in a pooled base station model, and present some of its advantages with a focus on interference, macro-diversity and mobility management.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126537517","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}
{"title":"SpinThrift: Saving energy in viral workloads","authors":"Nishanth R. Sastry, J. Crowcroft","doi":"10.1145/1851290.1851305","DOIUrl":"https://doi.org/10.1145/1851290.1851305","url":null,"abstract":"This paper looks at optimising the energy costs for data storage when the work load is highly skewed by a large number of accesses from a few popular articles, but whose popularity varies dynamically. A typical example of such a work load is news article access, where the most popular is highly accessed, but which article is most popular keeps changing. The properties of dynamically changing popular content are investigated using a trace drawn from a social news web site. It is shown that a) popular content have a much larger window of interest than non-popular articles. i.e. popular articles typically have a more sustained interest rather than a brief surge of interest. b) popular content are accessed by multiple unrelated users. In contrast, articles whose accesses spread only virally, i.e. from friend to friend, are shown to have a tendency not to be popular. Using this data, we improve upon Popular Data Concentration (PDC), a technique which is used to save energy by spinning down disks that do not contain popular data. PDC requires keeping the data ordered by their popularity, which involves significant amount of data migration, when the most popular articles keep changing. In contrast, our technique, SpinThrift, detects popular data by the proportion of non-viral accesses made, and results in lesser data migration, whilst using a similar amount of energy as PDC.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129305236","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}
Jeff Seibert, Xin Sun, C. Nita-Rotaru, Sanjay G. Rao
{"title":"Towards securing data delivery in peer-to-peer streaming","authors":"Jeff Seibert, Xin Sun, C. Nita-Rotaru, Sanjay G. Rao","doi":"10.1109/COMSNETS.2010.5431991","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431991","url":null,"abstract":"The goal of enabling ubiquitous video broadcasting on the Internet has been a long cherished vision in the networking community. Prior efforts aimed at achieving this goal based on the IP Multicast architecture have been unsuccessful. In recent years, peer-to-peer (P2P) streaming has emerged as a promising alternative technology, which has matured to the point that there are several commercial offerings available to users. While these developments are encouraging, P2P streaming systems are susceptible to attacks by malicious participants, and their viability depends on how effectively they can perform under such attacks. In this paper, we explore this issue in the context of mesh-based designs, which have emerged as the dominant architecture for P2P streaming. We provide a taxonomy of the implicit commitments made by nodes when peering with others. We show that when these commitments are not enforced explicitly, they can be exploited by malicious nodes to conduct attacks that degrade the data delivery service. We consider an important class of attacks where malicious nodes deliberately become neighbors of a large number of nodes and do not upload data to them. We focus on these attacks given the limited attention paid to them, and the significant impact they can have on overall data delivery. We present mechanisms that can enhance the resilience of mesh-based streaming against such attacks. A key part of the solution is a novel reputation scheme that combines feedback from both the control and data planes of the overlay. We evaluate our design with real-world experiments on the PlanetLab testbed and show that our design is effective. Even when there are 30% attackers, nodes can receive 92% of the data with our schemes compared to 10% of the data without our schemes. Overall these results indicate the feasibility of enabling effective P2P streaming even under the presence of malicious participants.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"142 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134529820","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}
Deepak Jeswani, Nakul Korde, D. Patil, M. Natu, J. Augustine
{"title":"Probe station selection algorithms for fault management in computer networks","authors":"Deepak Jeswani, Nakul Korde, D. Patil, M. Natu, J. Augustine","doi":"10.1109/COMSNETS.2010.5431990","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431990","url":null,"abstract":"In this paper, we address the problem of probe station selection. Probe station nodes are the nodes that are instrumented with the functionality of sending probes and analyzing probe results. The placement of probe stations affects the diagnosis capability of the probes sent by the probe stations. The probe station placement also involves the overhead of instrumentation. Thus it is important to minimize the required number of probe stations without compromising on the required diagnosis capability of the probes. In this paper, we address the problem of selection of probe stations to detect failures in the network. We present an algorithm for probe station selection using a reduction of the probe station selection problem to the Minimum Hitting Set problem. We address several issues involved while selecting probe stations such as link failures and probe station failures. We present experimental evaluation to show the effectiveness of the proposed approach.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132156775","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}
{"title":"Restricting internt access: Ideology and technology","authors":"S. Wong, E. Altman","doi":"10.1109/COMSNETS.2010.5431999","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431999","url":null,"abstract":"The Internet growth has allowed unprecedent wide spread access to cultural creation including music and films, to knowledge, and to a wide range of consumers' information. At the same time, it has become a huge source of business opportunities. Along with great benefits that this access to the Internet provides, the open and free access to the Internet has encountered large opposition from both political, economical and ethical reasons. An ongoing battle over the control on Internet access has been escalating over all these fronts. In this paper we describe first some of the ideological roots of free access to the Internet along with its main opponents. We then focus on the problem of 'Internet piracy' and analyze the efficiency of efforts to reduce the availability of copyrighted creations that are available for non-authorized free download.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"54 17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131729238","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}
{"title":"Towards a relation oriented service architecture","authors":"Ram Kumar, Andreas Häber, A. Yazidi, F. Reichert","doi":"10.1109/COMSNETS.2010.5431972","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431972","url":null,"abstract":"Over the past three decades, the Internet has evolved from a point to point, open, academic network to an applications and services oriented critical infrastructure. The Internet has become a vital component of society today, from its simple origin as an academic research project. During this transition, numerous applications and usages of the network emerged that cannot be efficiently implemented by adhering to the original design tenets of the Internet. Some of the tenets have been broken, others diluted and new ones are emerging to accommodate new paradigms. Moreover, applications and services have been moving slowly but consistently towards a uniform model based on Service Oriented Approach (SOA). The shift towards abstract models, objects and services however is not efficiently supported by the underlying delivery platforms, especially the legacy Internet architecture. An architectural rethinking is necessary at the network level well to accommodate future services, applications and routing priorities. We argue that there is a pressing need to move towards a next generation network architecture built to natively support network resource abstraction, mobility, security, enhanced routing, privacy, context communications, QoS, parallel processing, heterogeneous networking etc. This change should be manifested according to the principles of SOA to ensure interoperability, backwards compatibility and migration. In this paper, we propose 'relationship' as the glue that can hold together various available services and discuss the motivation behind the thoughts to introduce the tenets for the new architecture in the form of a new framework called ROSA. We define 'Relation' as an association among dynamically collaborating nodes, devices and services in a network, characterized by 'relationship metrics'.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123553516","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}
{"title":"Regulating user arrivals at a Mobile IP Home Agent","authors":"Maulik Desai, T. Nandagopal","doi":"10.1109/COMSNETS.2010.5432017","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432017","url":null,"abstract":"With the increasing levels of data usage in mobile cellular networks, Mobile IP and its variants serve as the de facto standard for mobility management. At high user loads, the Mobile IP Home Agent is unable to support registration requests within the required delay limit, leading to registration failures during peak user periods. The typical way of addressing this problem currently is to over-provision the Home Agent or to add multiple Home Agents with Load-Balancing in order to handle peak loads. In this paper, we propose an algorithm that regulates user arrivals by manipulating their registration lifetimes, thereby smoothing the arrival process at the Home Agent. Our proposed algorithm controls the variance in server loads very effectively with negligible computational and storage overhead. It also does not penalize users to register more often in order to satisfy the requirement of uniform load at the HA. Simulations with various user arrival and lifetime distributions show that our scheme is highly effective at the regulation of user registration load at the Home Agent.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114606634","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}
{"title":"Networking at 60 GHz: The emergence of multiGigabit wireless","authors":"Upamanyu Madhow","doi":"10.1109/COMSNETS.2010.5431983","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431983","url":null,"abstract":"The large swathes of unlicensed spectrum available worldwide at 60 GHz offer the potential for an order of magnitude increase in wireless link speeds, to multiGigabit rates, relative to current technology. Oxygen absorption and rain attenuation bound the attainable range outdoors using this band, while blockage by walls and furniture limits the range indoors. However, these are the same features that make 60 GHz ideally suited for short-range networks with aggressive spatial reuse, both indoors (with link ranges of the order of 10 meters) and outdoors (with link ranges of the order of 100 meters). With the rapid scaling of silicon processes, low-cost CMOS implementations for 60 GHz radios are becoming available. However, the design of commercially viable multiGigabit networks based on such radios must account for the unique physical attributes of “millimeter wave” communication, and often requires a drastic rethinking of design guidelines established for wireless networking at lower carrier frequencies. In this paper, we give a flavor of the technical issues involved through an overview of a subset of our recent research in this area, including modeling and design of indoor 60 GHz networks, interference analysis for outdoor 60 GHz mesh networks and its implication for medium access control design, and analysis and prototyping of spatial multiplexing in line-of-sight indoor channels.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125298556","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}
{"title":"A generic framework for mobility prediction and resource utilization in wireless networks","authors":"P. S. Prasad, P. Agrawal","doi":"10.1109/COMSNETS.2010.5432004","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432004","url":null,"abstract":"User mobility influences the performance seen by a mobile device in a wireless network. Knowledge of mobility patterns can be exploited to properly allocate network resources and enhance the performance and quality of service experienced by a mobile device for applications and services. Hence, mobility prediction plays an important role in the efficient operation of wireless networks such as WANs and WLANs. Access to mobility related information such as user movement provides an opportunity for networks to efficiently manage resources to satisfy user needs. Towards this goal, a generic methodology based on a control theoretic framework is proposed. The effectiveness of the approach using a prediction engine based on Hidden Markov Model (HMM) is illustrated. Incorporation of this engine in a control theoretic framework with feedback from an adaptive controller permits the efficient allocation of network resources to applications. The above framework is quite general and the HMM based engine can be replaced by other suitable models such as neural networks or ARMA. Simulation results for the HMM based model illustrate the effectiveness of the approach.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127298752","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}
{"title":"Effectiveness of copy-transmission in Go-Back-N ARQ system with selective repeat in intra-block and with limited retransmissions","authors":"S. Fujii, T. Kaneko, Y. Hayashida","doi":"10.1109/COMSNETS.2010.5432007","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432007","url":null,"abstract":"In this paper, we consider the effectiveness of copy-transmission for a class of Go-Back-N ARQ scheme with block of multiple frames and with limited number of retransmissions (M). The retransmitted block is consisted from multiple-copies (C) of each requested frame. Based on the exact formulas of the probability generating function of slots needed to transmit a block and numerical examples, it is shown how to determine C and M for maximizing the throughput and minimizing the average transmission delay of a block within a specified tolerable value of unrecovered frame error rate.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134118283","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}