{"title":"DORA: Distributed Cognitive Random Access of Unslotted Markovian Channels under Tight Collision Constraints","authors":"Liqiang Zhang","doi":"10.1109/ICCCN.2013.6614126","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614126","url":null,"abstract":"We consider the design of distributed strategies that allow multiple secondary users to opportunistically access multiple unslotted Markovian channels with unknown parameters and tight collision constraints, a challenging problem setting that has not been well addressed by existing work. An optimal strategy would strike a balance among exploration, which is to measure all the channels to identify the best one(s), exploitation, which is to stay on the currently best channel(s) as much as possible, and competition, that is to spread out users in order to avoid overcrowding the best channel(s). Moreover, a strategy has to abide collision constraint of each channel to become an acceptable one. We first assume known channel parameters and formulate a CNLP (constrained nonlinear programming) problem, which we solved through an algorithm we called DORA-Known that computes an optimal randomized access strategy. Next, We address the online channel-parameter learning problem by transforming it into a problem of DTMC (discrete-time Markov chain) estimation with incomplete data, and solving it with an EM (expectation-maximization) based algorithm. We then propose an algorithm called DORA-Learning that extends DORA-Known to incorporate the online channel learning. The proposed algorithms are evaluated and compared with a state-of-art approach that assumes known channel parameters, and two reinforcement learning based schemes. Experimental results illustrate significant performance gain of the two DORA algorithms over the other three approaches.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"341 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":"115605886","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":"Modular EGS Architectures for Optical Interconnections","authors":"D. G. Garao, G. Maier, A. Pattavina","doi":"10.1109/ICCCN.2013.6614154","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614154","url":null,"abstract":"Interconnection systems inside switching equipment, high-performance computers and data-centers are nowadays facing more and more demanding requirements. Optical interconnections based on multistage switching networks provide more bandwidth and less energy consumption compared to electronic counterparts. In this work a procedure to design the architecture of optical multistage switching networks is proposed which exploits the properties of multistage networks, on one side, and of optical switching systems on the other side. Thanks to the modularity of the architecture, a generic-size fabric can be implemented by simply cascading multiple stage-modules. In this paper we show in details the application of the approach to the Extended Generalized Shuffle (EGS) networks, though the method can be extended to other types of networks. The proposed procedure supports various implementation technologies, as, for example, integrated optics with micro-ring resonators, free- space optics with 2-D MEMS, networks on chip.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"81 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":"124876977","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":"Evaluation of Cloud-RAID: A Secure and Reliable Storage above the Clouds","authors":"Maxim Schnjakin, C. Meinel","doi":"10.1109/ICCCN.2013.6614137","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614137","url":null,"abstract":"Cloud Computing as a service-on-demand architecture has grown in importance over the previous few years. One driver of its growth is the ever increasing amount of data which is supposed to outpace the growth of storage capacity. The usage of cloud technology enables organizations to manage their data with low operational expenses. However, the benefits of cloud computing come along with challenges and open issues such as security, reliability and the risk to become dependent on a provider for its service. In general, a switch of a storage provider is associated with high costs of adapting new APIs and additional charges for inbound and outbound bandwidth and requests. In this paper, we present a system that improves availability, confidentiality and reliability of data stored in the cloud. To achieve this objective, we encrypt user's data and make use of the RAID-technology principle to manage data distribution across cloud storage providers. We conduct a proof-of-concept testbed experiment for our application to evaluate the performance and cost effectiveness of our approach. We deployed our application using eight commercial cloud storage repositories in different countries. Our approach allows users to avoid vendor lock-in, and reduces significantly the cost of switching providers. We also observed that our implementation improved the perceived availability and, in most cases, the overall performance when compared with individual cloud providers. Moreover, we estimated the monetary costs to be competitive to the cost of using a single cloud provider.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"272 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":"122935546","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 Software-Defined Networking Approach for Disaster-Resilient WANs","authors":"K. Nguyen, Q. Minh, S. Yamada","doi":"10.1109/ICCCN.2013.6614094","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614094","url":null,"abstract":"The current technology of Internet provides an acceptable level of resilience in normal operation. However, the Internet may get catastrophic impacts when unexpected disasters such as earthquakes, tsunami, etc. happen. Specifically, the Internet infrastructure including Wide Area Networks (WANs) face many challenges to normal operation including power outage, link, device failures, rerouting packets, traffic engineering, etc. In this paper, we follow a systematic approach for realizing disaster-resilient WANs using Software-Defined Networking (SDN) technology. SDN enables the network control plane to be decoupled from the network forwarding hardware, and moves the control plane to a programmable component, i.e., the network controller. The network management and operation therefore increase flexibility. To confirm the feasibility of SDN-based resilient network towards fast disaster recovery, we have constructed two evaluations under the real large scale network topology. One is to investigate the latencies between controllers and switches in order to find the appropriate number and locations of controllers. Another one is to simulate a reactive switch-over from a faulty link to an alternative link, assuming a realistic scenario. The results show that the switch-over time depends on the latencies between networking devices and a controller. Additionally, even those latency values equal the worst-case latency, the fast rerouting of TCP traffic is achievable.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"8 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":"114497698","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":"Analyzing and Modeling Temporal Patterns of Human Contacts in Cellular Networks","authors":"Hayang Kim, H. Zang, Xiaoli Ma","doi":"10.1109/ICCCN.2013.6614108","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614108","url":null,"abstract":"As the usage of wireless devices rapidly increases, mobile phones have become an important aid for people to maintain social relationships. Analysis on cellular networks through mobile communication records, especially when such records contain temporal and spatial information, can potentially unveil fundamental laws that govern the dynamics of social networks. In this paper, we use call detail records (CDRs) collected from a nation-wide cellular network in North America for more than one month. We analyze contact patterns over one million pairs of people using real call data as looking into pairwise call records for each pair. First, we investigate the impacts of social relationships on contacts and discover that family members show different characteristics from non-family pairs in terms of contact regularity or duration. Next, we characterize inter-contact time and contact duration using finite mixture models of Gaussian, Lognormal, and Gamma distributions for each pair. Our mixture models for pairwise communication patterns of cellular users capture and demonstrate burstiness, periodicity, and inhomogeneity of human communication.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"23 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":"129538688","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":"VSS: The Virtual Sensor System","authors":"M. Pandit, D. Yoon, J. Shen","doi":"10.1109/ICCCN.2013.6614210","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614210","url":null,"abstract":"Human Computer Interface still remains a main challenge for successful communication. In the ever changing world of technology, where touch screen devices, tablets, smartphones have been rapidly evolving with the aim to make interaction between man and the machine simple and robust. This has predominately changed the traditional mouse and keyboard interaction. We have designed and implemented a small system called the Virtual Sensor System based on the concept of web service in the middleware C# in .NET using Microsoft WPF (Windows Presentation Foundation). It is intended to be an interface between various computing systems and heterogeneous sensors. As a testbed for this system, the gesture recognition system is developed using a Kinect Sensor.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"34 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":"132006394","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}
Francisco A. Silva, P. A. M. S. Neto, V. Garcia, Fernando A. M. Trinta, R. Assad
{"title":"VeloZ: A Charging Policy Specification Language for Infrastructure Clouds","authors":"Francisco A. Silva, P. A. M. S. Neto, V. Garcia, Fernando A. M. Trinta, R. Assad","doi":"10.1109/ICCCN.2013.6614208","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614208","url":null,"abstract":"Cloud Accounting refers to how cloud usage is recorded and charged. It is present at all commercialized cloud services (SaaS, PaaS and IaaS), since they have to monitor the consumption aiming to charge the customers. In a previous research we performed a systematic mapping study regarding cloud accounting and identified a set of shortcomings in the existing accounting models for IaaS. One of these limitations was related to charging policy specification. Charging policies are mechanisms that establish rules to convert usage records into monetary information. This paper presents a Domain Specific Language (DSL) for charging policy specification: VeloZ. Such DSL enables cloud providers to write charging policies following the economic model RaaS. According to RaaS, the IaaS must be provisioned in a high granularity in terms of resource types and such granularity is profitable for both, provider and customer. We evaluated the DSL under a real cloud platform called JiTCloud. The experiment results evidences that VeloZ can be considered feasible in terms of flexibility and reliability.","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":"134397029","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}
P. Horváth, M. Yampolskiy, Yuan Xue, X. Koutsoukos, J. Sztipanovits
{"title":"Reliability Analysis of Wireless Real-Time Control Networks","authors":"P. Horváth, M. Yampolskiy, Yuan Xue, X. Koutsoukos, J. Sztipanovits","doi":"10.1109/ICCCN.2013.6614181","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614181","url":null,"abstract":"Probability of successful delivery under deadline constraints is one of the most important performance measures in a wireless real-time multihop control and sensor network. In this paper we approach the problem of determining the probability of successful packet delivery by calculating the per-link outage probability for different fading channel models. We provide easily computable results for the end-to-end reliability for two different physical layer designs. Furthermore, we show that incorporating physical layer information into routing and scheduling decisions can result in significant performance improvements when strict deadlines are imposed on the system.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"32 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":"125801667","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":"Hybrid Multicast Traffic Grooming in Transparent Optical Networks with Physical Layer Impairments","authors":"T. Panayiotou, G. Ellinas, N. Antoniades","doi":"10.1109/ICCCN.2013.6614142","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614142","url":null,"abstract":"This paper investigates the problem of multicast traffic grooming in transparent optical networks utilizing a novel grooming approach that is based on routing/grooming of multicast calls on hybrid graphs. The proposed approach exhibits improved performance when compared to existing grooming schemes especially when the physical layer impairments are taken into account.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"1 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":"129820393","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}
Mohamad Jomaa, Khaleel W. Mershad, Noor Abbani, Yaman Sharaf-Dabbagh, Bashar Romanous, H. Artail, M. Saghir, Hazem M. Hajj, Haitham Akkary, M. Awad
{"title":"A Mediation Layer for Connecting Data-Intensive Applications to Reconfigurable Data Nodes","authors":"Mohamad Jomaa, Khaleel W. Mershad, Noor Abbani, Yaman Sharaf-Dabbagh, Bashar Romanous, H. Artail, M. Saghir, Hazem M. Hajj, Haitham Akkary, M. Awad","doi":"10.1109/ICCCN.2013.6614087","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614087","url":null,"abstract":"A novel and rapidly growing area of research concerns data-intensive applications and the technical challenges that accompany it. One of those challenges is developing approaches and mechanisms that render high performance in processing and storing data. We joined this research effort by proposing a reconfigurable active solid state drives (RASSD) system that deals with such applications, through employing basic hardware, namely FPGA's connected to SSD's, to service the above applications as processing nodes, and take advantage of the close proximity between storage and processing. In this paper, we propose an intelligent middleware system for interfacing workstation-based and mobile applications to the distributed RASSD system. In order to provide high performance in terms of time and functionality, the middleware manages the data processing on the RASSD nodes through special pieces of code that we call drivelets, along with FPGA configuration files (bitstreams). Another important responsibility of the proposed middleware architecture lies in the unguided management of applications' flows, where it uses an intelligent script-parsing mechanism to turn one general request from the client into a sequence of operations needed to generate the required results. The middleware design allows for the integration of mobile applications into the overall architecture of the RASSD system, and allowing them to run data intensive applications that otherwise it is unfeasible for them to execute. We validate our design by comparing it to an existing middleware architecture, and present two use-cases with their results and discussion.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"47 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":"127214284","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}