{"title":"OpenADN: A Case for Open Application Delivery Networking","authors":"S. Paul, R. Jain, Jianli Pan, Jay Iyer, D. Oran","doi":"10.1109/ICCCN.2013.6614165","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614165","url":null,"abstract":"There are two key issues that prevent Application Service Providers (ASPs) from fully leveraging the cloud \"advantage.\" First, in modern enterprise and Internet-based application environments, a separate middlebox infrastructure for providing application delivery services such as security (e.g., firewalls, intrusion detection), performance (e.g., SSL off loaders), and scaling (e.g., load balancers) is deployed. In a cloud datacenter, the ASP does not have any control over the network infrastructure, thus making it hard for them to deploy middleboxes for their cloud-based application deployments. Second, modern services virtualize the application endpoint. A service can no longer be statically mapped to a single end host. Instead, the service is partitioned and replicated across multiple end hosts for better performance and scaling. In enterprise datacenters, service requests are intercepted by an application-level routing service (APR) in the data plane and dynamically mapped to the correct service partition and the best (e.g. least loaded) instance of that partition. However, although multi-cloud (or Inter-cloud) environments allow ASPs to globally distributed their applications over multiple cloud datacenters leased from multiple cloud providers, ASPs need support of a globally distributed APR infrastructure to intelligently route application traffic to the right service instance. But, since such an infrastructure would be extremely hard to own and mange, it is best to design a shared solution where APR could be provided as a service by a third party provider having a globally distributed presence, such as an ISP. Although these requirements seem separate, they can be converged into a single abstraction for supporting application delivery in the cloud context. A sample design of this abstraction is OpenADN, presented here.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122054868","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":"Network Characterization and Perceptual Evaluation of Skype Mobile Videos","authors":"S. Jana, A. Pande, An Chan, P. Mohapatra","doi":"10.1109/ICCCN.2013.6614157","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614157","url":null,"abstract":"We characterize the performance of both video and network layer properties of Skype, the most popular video telephony application. The performance in both mobile and stationary scenarios is investigated; considering network characteristics such as packet loss, propagation delay, available bandwidth and their effects on the perceptual video quality, measured using spatial and temporal no-reference video metrics. Based on 200+ live traces, we study the performance of this mobile video telephony application. We model video quality as a function of input network parameters and derive a feed-forward Artificial-Neural-Network that accurately predicts video quality given network conditions (0.0206 ≤ MSE ≤ 0.570). The accuracy of this model improves significantly by incorporating end-user mobility as an input to the model.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125327822","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":"Service Instantiation in an Internet with Choices","authors":"Abhishek Dwaraki, T. Wolf","doi":"10.1109/ICCCN.2013.6614194","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614194","url":null,"abstract":"New Internet architectures have been proposed to address some of the shortcomings of the current Internet. Many new architectures represent existing and novel networking functionality as network \"services\". These services are fundamental building blocks that need to be described and can be composed in an effective manner. Any service-based network architecture fundamentally struggles to assign specific physical resources to a service when a user requests for a service. This \"instantiation\" problem of mapping an advertised service to a reservable physical entity becomes complex when advanced services comprise of multiple basic services. In our work, we present a resolution to the service instantiation problem that can identify multiple potential solutions. Since candidate solutions may use multiple metrics to express quality, our approach takes into account multiple criteria and yields results that are fewer in number but more optimal than others in nature. We show that this approach can be used to to make an efficiently tradeoff between time taken and the number of solutions obtained without having to explore the complete solution space. Thus, our approach presents a practical heuristic for instantiating network services in the future Internet.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116214569","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":"MOTAG: Moving Target Defense against Internet Denial of Service Attacks","authors":"Quan Jia, Kun Sun, A. Stavrou","doi":"10.1109/ICCCN.2013.6614155","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614155","url":null,"abstract":"Distributed Denial of Service (DDoS) attacks still pose a significant threat to critical infrastructure and Internet services alike. In this paper, we propose MOTAG, a moving target defense mechanism that secures service access for authenticated clients against flooding DDoS attacks. MOTAG employs a group of dynamic packet indirection proxies to relay data traffic between legitimate clients and the protected servers. Our design can effectively inhibit external attackers' attempts to directly bombard the network infrastructure. As a result, attackers will have to collude with malicious insiders in locating secret proxies and then initiating attacks. However, MOTAG can isolate insider attacks from innocent clients by continuously \"moving\" secret proxies to new network locations while shuffling client-to-proxy assignments. We develop a greedy shuffling algorithm to minimize the number of proxy re- allocations (shuffles) while maximizing attack isolation. Simulations are used to investigate MOTAG's effectiveness on protecting services of different scales against intensified DDoS attacks.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126704418","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":"Probabilistic Analysis of Message Forwarding","authors":"L. Moser, P. Melliar-Smith","doi":"10.1109/ICCCN.2013.6614173","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614173","url":null,"abstract":"In this paper, we present a novel algorithm that finds the probability density function for the number of distinct nodes reached, within a specific number of levels of message forwarding, for a fixed size network. The algorithm also finds the expected number of distinct nodes to which a message is forwarded, within a specific number of levels of message forwarding, as the sum of the number of nodes, weighted by the probability of reaching that number of nodes. In addition, the algorithm finds the probability density function for the number of distinct nodes at a given level of message forwarding, and the expected number of distinct nodes at that level. Using the algorithm, we calculate these probability density functions and expected values for various size networks, degrees of message forwarding, probabilities of message forwarding, and levels of message forwarding. The algorithm has application to the Internet, peer-to-peer networks, ad-hoc networks, and social networks, and to multicasting, gossiping, and rumor and epidemic protocols.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126119755","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 Verification Service Architecture for the Future Internet","authors":"A. Babaoglu, R. Dutta","doi":"10.1109/ICCCN.2013.6614096","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614096","url":null,"abstract":"In this paper, we propose a service architecture for verification, a necessary component of a choice-based economy architecture of the future Internet. Such a verification architecture motivates and addresses the task of enabling users to verify, or obtain third-party verification of, whether the service components offered by various network service providers were responsible for meeting or failing to meet overall service expectations. To be useful, such an architecture must allow viable business propositions for each of the principals, and provide meaningful results at reasonable cost and overhead. We articulate the architectural decisions, requirements, roles and interfaces. We then describe a proof-of-concept prototype realized in NS- 3. Finally, we make observations contrasting our results with previous approaches and discuss the implementation challenges to realize this work in practice.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127500770","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}
S. H. D. Mata, J. Magalhaes, Alexandre Cardoso, P. R. Guardieiro, Helio A. Carvalho
{"title":"Performance Comparison of ENUM Name Servers","authors":"S. H. D. Mata, J. Magalhaes, Alexandre Cardoso, P. R. Guardieiro, Helio A. Carvalho","doi":"10.1109/ICCCN.2013.6614167","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614167","url":null,"abstract":"ENUM is a protocol for mapping E.164 telephone numbers into Internet URIs. In this paper, we present a performance evaluation of ENUM name servers considering the new requirements and challenges imposed on traditional DNS servers with the incorporation of ENUM protocol. We defined three performance metrics for this performance evaluation: query throughput, response time, and CPU usage. Using a benchmarking testbed, we evaluated four name servers implementations (BIND, MyDNS-NG, NSD and PowerDNS) in different scenarios considering distinct size of database. Moreover, we improved the existing methodology for this kind of evaluation, since we identified the limitations of DNSPerf and proposed a new procedure for the evaluation. Results show that BIND and NSD servers achieved a high query throughput with great scalability features. On the other hand, PowerDNS server had a lower throughput and high sensibility to database size. MyDNS-NG server presented a quite low query throughput and poor scalability and, therefore, it is not suitable for ENUM purposes. These results bring to light a new reality for studies of ENUM servers, since they have not been evaluated in such a extended scenarios and size of the database.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116936151","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}
C. Casey, Srivatsan Rajagopalan, M. Yan, G. Booker, A. Sprintson, W. Magnussen
{"title":"Supporting Voice over LTE: Solutions, Architectures, and Protocols","authors":"C. Casey, Srivatsan Rajagopalan, M. Yan, G. Booker, A. Sprintson, W. Magnussen","doi":"10.1109/ICCCN.2013.6614200","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614200","url":null,"abstract":"Modern cellular networks are expected to support both voice and a growing volume of data traffic. The rapid growth in data traffic has promoted network operators to move to Long Term Evolution (LTE), a 4th generation of wireless network infrastructure. However, LTE architecture does not support native circuit switching services and relies on the IP Multimedia Subsystem (IMS) for supporting voice and Short Messaging Service (SMS). Unfortunately, the uptake of IMS has not been as rapid as expected and deployments of IMS cores have been limited. This poses a major issue for operators who wish to deploy LTE in the near future. In particular, voice and SMS drive a majority of service provider revenue, who are concerned with voice quality, call continuity, and reliable SMS delivery in deployed LTE networks. In this paper we analyze several contending approaches to delivering voice services over LTE networks. Each approach will be illustrated with sequence diagrams to explain how voice and SMS services are rendered. We compare the proposed solutions in terms of complexity, cost, features, and interoperability.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128195650","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}
Yang Guo, Lloyd G. Greenwald, Mary R. Schurgot, Matteo Varvello
{"title":"Performance Model for a Cache Enabled Content Distribution Framework over MANET","authors":"Yang Guo, Lloyd G. Greenwald, Mary R. Schurgot, Matteo Varvello","doi":"10.1109/ICCCN.2013.6614168","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614168","url":null,"abstract":"On-path caching has been proved to be effective in shortening the content retrieval time and educing the traffic workload imposed on the underlying network. In this paper, we study the effectiveness of on-path caching for the content distribution in the wireless network environment with GPSR as the underlying routing protocol. We extend the general cache network model introduced in [14] to account for GPSR's loopy paths. We further develop the performance models to take into account the effect of wireless link loss, different error recovery strategies, and the GPSR routing induced long and loopy paths. The performance models allow us to assess the average content availability, the average number of messages per content retrieval, and the average content retrieval latencies for an on-path caching enabled content distribution network over MANETs. The results show that on-path caching can significantly improve the content availability, reduce the average number of required messages to acquire a content object, and shorten the content retrieval latency. In addition, the study shows that the on-path caching is able to mitigate the negative impact caused by the long and loopy paths due to the GPSR routing.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128116908","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":"Spreading the Load in a Tree Type Routing Structure","authors":"D. Delaney, Lina Xu, G. O’hare","doi":"10.1109/ICCCN.2013.6614196","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614196","url":null,"abstract":"Many routing protocols have advanced the Wire- less Sensor Network (WSN) paradigm with each new method offering unique ways to maximise Quality of Service (QoS) while minimising energy cost to the network. Tree routing is a well examined method with a proven record in offering a high level of service with trees constructed to fulfil a particular routing objective defined by a chosen metric. The tree structure can be maintained with low overall network overhead but exhibits a weakness with regard to load balancing. Without effective load balancing particular nodes in the network may be subject to excessive network load, leading to uneven energy consumption in the network. This in turn can lead to an unwanted scenario of premature node failure. Neighbourhood metrics is presented in this paper as a means to preserve network objectives while achieving improved load distribution in a tree type routing structure. Neighbourhood metrics offer a framework for expand- ing on currently used metrics to include information on the quality of a nodes neighbourhood in addition to the current forwarding route. Neighbourhood metrics is compared to the current state of the art in the form of the Routing Protocol for Low Power and Lossy Networks (RPL) implementation using the direct Expected Transmissions (ETX) metric. Neighbourhood metrics exhibits improved load distribution in a number of open public testbeds.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124185921","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}