{"title":"A backward-compatible inter-domain multipath routing framework","authors":"Xiaomin Chen, M. Chamania, A. Jukan","doi":"10.1109/INFCOMW.2011.5928794","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928794","url":null,"abstract":"We present a framework to facilitate the inter-domain multipath routing for carrier networks that are based on circuit switching technologies, without significant changes to the existing inter-domain protocols. We first introduce a simple mechanism, namely, Single Routing Plane Multipath (SRPM) which can be easily implemented in the existing PCE-based inter-domain architectures. The main idea behind the SRPM method is to represent multiple link disjoint paths as a single virtual edge in the PCE and thus use the existing single path routing mechanisms to enable multipath routing. We further present a more generic mechanism, referred to as Multiple Routing Plane Multipath (MRPM) method, with the goal to facilitate the provisioning of multipath connections over dynamically selected domain chains. In this method, we propose to virtualize the network into multiple slices and represent as multiple routing topologies by the PCEs. In this way, multiple routing planes are constructed to facilitate inter-domain routing. For both methods, we consider the buffer size as constraint for multipath routing due to the resulting differential delay. The results show that the proposed methods can significantly improve the blocking performance and are backward compatible, while only slightly impacting the intra-domain traffic.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"47 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":"125343130","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":"HealthKiosk: A family-based connected healthcare system for long-term monitoring","authors":"C. Liu, J. Wen, Qi Yu, Bo Yang, Wenjie Wang","doi":"10.1109/INFCOMW.2011.5928816","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928816","url":null,"abstract":"In this paper, we present “HealthKiosk”, a family-based healthcare system, to provide rich contextual information and alerting mechanisms for continuous monitoring of health conditions. HealthKiosk significantly improves the reach and quality of regional and community healthcare services, and could potentially minimize the efforts of care professionals for the chronical illness, not only applicable for the elderly but also children and young fitness trainers. The proposed architecture leverages the RESTful design style, nevertheless introducing a novel development of the “sensor proxy”, both in a stationary PC style and as a mobile widget. The sensor proxy behaves not only as a bridge between the raw sensor readings and the kiosk controller, but also as a data processing logic to integrate, correlate, and transform a variety of data from multiple data sources to an integrated XML format. We demonstrate the system performance by showing two complete case studies for both stationary and mobile sensor proxies used in the developed HealthKiosk system. Finally, the proposed solution has been piloted and deployed at the Peking University People's Hospital (PKUPH) for diabetes patients, via building an evidence-based clinical care solution focusing on chronic disease management in China.","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":"128300753","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":"PEACE: An efficient and secure patient-centric access control scheme for eHealth care system","authors":"Mrinmoy Barua, X. Liang, R. Lu, X. Shen","doi":"10.1109/INFCOMW.2011.5928953","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928953","url":null,"abstract":"In this paper, we propose an efficient and secure patient-centric access control (PEACE) scheme for the emerging electronic health care (eHealth) system. In order to assure the privacy of patient personal health information (PHI), we define different access privileges to data requesters according to their roles, and then assign different attribute sets to the data requesters. By using these different sets of attribute, we construct the patient-centric access policies of patient PHI. The PEACE scheme can guarantee PHI integrity and confidentiality by adopting digital signature and pseudo-identity techniques. It encompasses identity based cryptography to aggregate remote patient PHI securely. Extensive security and performance analyses demonstrate that the PEACE scheme is able to achieve desired security requirements at the cost of an acceptable communication delay.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"12 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":"124124389","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}
V. S. Chava, E. Salvadori, A. Zanardi, S. Dalsass, G. Galimberti, A. Tanzi, G. Martinelli, O. Gerstel
{"title":"Impairment and regenerator aware lightpath setup using distributed reachability graphs","authors":"V. S. Chava, E. Salvadori, A. Zanardi, S. Dalsass, G. Galimberti, A. Tanzi, G. Martinelli, O. Gerstel","doi":"10.1109/INFCOMW.2011.5928800","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928800","url":null,"abstract":"GMPLS-based transparent optical networks suffer from accumulation of physical layer impairments (PLIs) along the optical path and inefficient wavelength utilization due to wavelength continuity constraint. To increase the optical reach, resource utilization, and average call acceptance ratio, network operators resort to translucent optical networks in which a limited number of regenerators are placed at a selected set of nodes. In this scenario development of an optical control plane which is aware of PLIs, location and number of regenerators, is of paramount importance for on-demand lightpath provisioning. In this paper, we propose a novel three phase approach—reachability graph construction, route computation on reachability graph, and signaling—impairment and regenerator aware routing and wavelength assignment (IRA-RWA). We also propose corresponding GMPLS protocol extensions. The simulation results suggest that our proposed approach together with LSP stitching signaling mechanism can be deployed in realworld translucent optical networks.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"39 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":"126780898","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 light-weight message authentication mechanism tailored for Smart Grid communications","authors":"M. Fouda, Z. Fadlullah, N. Kato, R. Lu, X. Shen","doi":"10.1109/INFCOMW.2011.5928776","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928776","url":null,"abstract":"Smart Grid (SG) technology, which aims at bringing the world's aging electric grids into the 21st century by utilizing intelligent transmission and distributed networks, has been gaining momentum in recent years. Despite its attractive features, the SG technology remains vulnerable to some security threats, such as spoofing and man-in-the-middle attacks. In this paper, to address these potential security issues, we propose a light-weight and secure message authentication mechanism. The proposed mechanism is based on Diffie-Hellman key establishment protocol and hash-based message authentication code, which allows various smart meters at different points of the SG to make mutual authentication and achieve message authentication with low latency and few signal message exchanges. Detailed security analysis shows it can satisfy the desirable security requirements. In addition, extensive computer-based simulation also demonstrates its efficiency.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"76 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":"126211226","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}
R. Ramanathan, A. Bar-Noy, P. Basu, M. Johnson, W. Ren, A. Swami, Q. Zhao
{"title":"Beyond graphs: Capturing groups in networks","authors":"R. Ramanathan, A. Bar-Noy, P. Basu, M. Johnson, W. Ren, A. Swami, Q. Zhao","doi":"10.1109/INFCOMW.2011.5928935","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928935","url":null,"abstract":"Currently, the de facto representational choice for networks is graphs. A graph captures pairwise relationships (edges) between entities (vertices) in a network. Network science, however, is replete with group relationships that are more than the sum of the pairwise relationships. For example, collaborative teams, wireless broadcast, insurgent cells, coalitions all contain unique group dynamics that need to be captured in their respective networks. We propose the use of the (abstract) simplicial complex to model groups in networks. We show that a number of problems within social and communications networks such as network-wide broadcast and collaborative teams can be elegantly captured using simplicial complexes in a way that is not possible with graphs. We formulate combinatorial optimization problems in these areas in a simplicial setting and illustrate the applicability of topological concepts such as “Betti numbers” in structural analysis. As an illustrative case study, we present an analysis of a real-world collaboration network, namely the ARL NS-CTA network of researchers and tasks.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"21 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":"130616711","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 nanoscale communication channel with fluorescence resonance energy transfer (FRET)","authors":"M. Kuscu, O. Akan","doi":"10.1109/INFCOMW.2011.5928851","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928851","url":null,"abstract":"In this study, a novel and physically realizable nanoscale communication paradigm is introduced based on a well-known phenomenon, Fluorescence Resonance Energy Transfer (FRET) for the first time in the literature. FRET is a nonradiative energy transfer process between fluorescent molecules based on the dipole-dipole interactions of molecules. Energy is transferred rapidly from a donor to an acceptor molecule in a close proximity such as 0 to 10 nm without radiation of a photon. Low dependency on the environmental factors, controllability of its parameters and relatively wide transfer range make FRET a promising candidate to be used for a high rate nanoscale communication channel. In this paper, the simplest form of the FRET-based molecular communication channel for a single transmitter and a single receiver nanomachine is modeled. Furthermore, using the information theoretical approach, the capacity of the point-to-point communication channel is investigated and the dependency of the capacity on some environmental and intrinsic parameters is analyzed. It is shown that the capacity can be increased by appropriately selecting the donor-acceptor pair, the medium, the intermolecular distance and the orientation of the molecules.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"13 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":"134589895","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":"Stepping stone detection at the server side","authors":"Ruei-Min Lin, Yi-Chun Chou, Kuan-Ta Chen","doi":"10.1109/INFCOMW.2011.5928952","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928952","url":null,"abstract":"Proxy server was originally invented to enhance the performance of web browsing; however, it has been commonly used to perform online crime and malicious activities without being traced. Nevertheless, there is no general method available for detecting the use of stepping stones from the server's perspective. In this paper, based on Nagle's algorithm, we propose a server-based scheme to detect whether a host that establishes a TCP connection to the server is a stepping stone or not. Via Internet experiments on the PlanetLab, we show that our scheme achieves an average of 92% detection rate whenever our scheme applies. We believe the scheme, as a strong complement to current methods, can secure critical Internet services from being jeopardized by anonymous attacks.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"16 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":"130792920","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}
W. Meng, Wendong Xiao, Lihua Xie, A. Pandharipande
{"title":"Diffusion based projection method for distributed source localization in wireless sensor networks","authors":"W. Meng, Wendong Xiao, Lihua Xie, A. Pandharipande","doi":"10.1109/INFCOMW.2011.5928872","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928872","url":null,"abstract":"Source localization based on energy measurements is an important problem in wireless sensor networks (WSNs). It is well known that the associated objective function is not convex and may have multiple local optima and saddle points. Most of the existing algorithms can not achieve global optima. In this paper, we formulate the source localization as a convex feasibility problem (CFP) and propose a diffusion based projection method as a solution. In the proposed method, no fusion center is required; the sensor nodes need to communicate only with their closest neighbors and all the sensors update their estimations simultaneously and finally they are able to achieve consensus on a possible minimizer asymptotically. The proposed method has low complexity and achieves global optimality. Theoretical analysis and simulation results show that the proposed method has good estimation performance whether or not the CFP is consistent or inconsistent.","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":"131114896","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":"Theoretical treatment of sink scheduling problem in wireless sensor networks","authors":"Yu Gu, Yusheng Ji, Jie Li, Bao-hua Zhao","doi":"10.1109/INFCOMW.2011.5928866","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928866","url":null,"abstract":"Sink Scheduling, in the form of scheduling multiple sinks among sink sites to leverage traffic burden, is an effective mechanism for the energy-efficiency of wireless sensor networks (WSNs). Due to the inherent difficulty (NP-hard in general), existing works on this topic mainly focus on heuristic/greedy algorithms and theoretic results remain unknown. In this paper, we fill in the research blank with two algorithms. The first one is based on the Column Generation (CG). It decomposes the original problem into two sub problems and solve them iteratively to approach the optimal solution. However, due to its high computational complexity, this algorithm is only suitable for small scale networks. The other one is a polynomial-time algorithm based on relaxation techniques to obtain an upperbound, which can serve as a performance benchmark for other algorithms on this problem. Through comprehensive simulations, we evaluate the efficiency of proposed algorithms.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"27 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":"115061272","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}