检索结果-内蒙古大学图书馆

Enabling decentralised microblogging through P2PVPNs

International Journal of Security and Networks 2013年第3期8卷 169-178页

作者： St Juste, Pierre Eom, Heungsik Woodruff, Benjamin Baker, Corey Figueiredo, Renato Advanced Computing and Information Systems Lab Wireless and Mobile Systems Laboratory Department of Electrical and Computer Engineering Florida United States

The need for user privacy in social networks has prompted the exploration of social networking designs which do not rely on the common centralised client-server model. Many peer-to-peer microblogging solutions have been proposed and/or implemented utilising various technologies such as DHTs, multicast trees, and/or gossip protocols. We propose a decentralised microblogging service that leverages available Peer-to-Peer Virtual Private Networking (P2PVPN) technologies. By leveraging the private IP connectivity of P2PVPNs, our design utilises both IP multicasting and data replication through high degree nodes to ensure that peers are able to publish messages with varying degree of scope. We study the implications of our data dissemination model for a decentralised microblogging service through simulation-based analysis using a 3-million user social graph from Orkut. We also developed a prototype implementation to demonstrate the feasibility of our design choices along with a small deployment on FutureGrid to test its performance on the internet. Copyright © 2013 Inderscience Enterprises Ltd.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

Reducing the Migration Times of Multiple VMs on WANs using a Feedback Controller

Reducing the Migration Times of Multiple VMs on WANs using a...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum

作者： Tae Seung Kang Mauricio Tsugawa Jose Fortes Takahiro Hirofuchi Advanced Computing and Information Systems Lab University of Florida National Institute of Advanced Industrial Science and Technology (AIST)

ISBN: (纸本)9781479913725

Virtual machine (VM) migration is affected by network latency and throughput, which are highly fluctuating and unpredictable in wide-area networks (WANs). Hence, it is difficult to statically minimize the time required to transfer a large number of VMs across WAN. The goal of this work is to migrate as many VMs as possible during a given period of time and it is motivated by disaster recovery scenarios. One approach is to migrate a large number of VMs in parallel, but this leads to long migration times of each individual VM. Long migration times are problematic in catastrophic circumstances where resources are limited and can fail within a short period of time. Thus, it is important to shorten both the total time required to migrate multiple VMs and the migration time of individual VMs. Due to network performance fluctuations, the optimal number of parallel migrations changes over time. This work proposes a feedback-based controller that adapts to the number of parallel VM migrations in response to changes in a WAN. The controller implements an algorithm inspired by the TCP congestion avoidance algorithm in order to regulate the number of VMs in transit depending on the network conditions. Experiments using a prototype controller confirm that it is possible to control the migration of a set of VMs shortening both the total and individual migration times. The experiments show that the controller shortens the individual migration time by up to 5.7 fold compared to that of the static VM migrations where the number of parallel migrations does not change until all migrations are completed. The contributions of this work are 1) introducing migration strategies for multiple VMs on WANs and 2) proposing a hypervisor-independent controller that adapts to network bandwidth fluctuations in disaster scenarios.

关键词： Disaster recovery Controller Self-adaptive Live migration Virtualization

来源：评论

学校读者我要写书评

暂无评论

Highlights from the 11th ISCB Student Council Symposium 2015. Dublin, Ireland. 10 July 2015

引用

BMC bioinformatics 2016年第3期17 Suppl 3卷 95页

作者： Katie Wilkins Mehedi Hassan Margherita Francescatto Jakob Jespersen R. Gonzalo Parra Bart Cuypers Dan DeBlasio Alexander Junge Anupama Jigisha Farzana Rahman Griet Laenen Sander Willems Lieven Thorrez Yves Moreau Nagarajan Raju Sonia Pankaj Chothani C. Ramakrishnan Masakazu Sekijima M. Michael Gromiha Paddy J Slator Nigel J Burroughs Przemysław Szałaj Zhonghui Tang Paul Michalski Oskar Luo Xingwang Li Yijun Ruan Dariusz Plewczynski Giulia Fiscon Emanuel Weitschek Massimo Ciccozzi Paola Bertolazzi Giovanni Felici Pieter Meysman Manu Vanaerschot Maya Berg Hideo Imamura Jean-Claude Dujardin Kris Laukens Westa Domanova James R. Krycer Rima Chaudhuri Pengyi Yang Fatemeh Vafaee Daniel J. Fazakerley Sean J. Humphrey David E. James Zdenka Kuncic Plant Pathology and Plant-Microbe Biology Section School of Integrative Plant Science Cornell University Ithaca USA Graduate Field of Computational Biology Cornell University Ithaca USA School of Computing & Mathematics University of South Wales Cardiff UK Department of Genome Biology for Neurodegenerative Diseases German Center for Neurodegenerative Diseases (DZNE) within the Helmholtz Association ᅟ Germany Department of Surgery Massachusetts General Hospital The Broad Institute of MIT and Harvard Boston USA Department of Systems Biology Technical University of Denmark Kemitorvet Denmark Protein Physiology Lab Facultad de Ciencias Exactas y Naturales Universidad de Buenos Aires Buenos Aires Argentina Molecular Parasitology Unit (MPU) Institute of Tropical Medicine Antwerp Belgium Advanced Database Research and Modeling (ADReM) research group University of Antwerp Antwerpen Belgium Department of Computer Science University of Arizona Tucson USA Department of Veterinary Clinical and Animal Sciences Center for non-coding RNA in Technology and Health University of Copenhagen Copenhagen Denmark University College Dublin Dublin Ireland Department of Electrical Engineering (ESAT) STADIUS Center for Dynamical Systems Signal Processing and Data Analytics KU Leuven Leuven Belgium Minds Medical IT Department Leuven Belgium Scientific Institute of Public Health (WIV-ISP) Platform of Biotechnology and Molecular Biology (PBB) Brussels Belgium Department of Development and Regeneration @ Kulak KU Leuven Kortrijk Belgium Department of Biotechnology Bhupat and Jyoti Metha School of Biosciences Indian Institute of Technology Madras Chennai India Philips Research North America Briarcliff Manor USA Global Scientific Information and Computing Center (GSIC) Tokyo Institute of Technology Tokyo Japan Systems Biology Centre University of Warwick Senate House Coventry UK Systems Biology Doctoral Training Centre University of Warwick Senate House Coventry UK Center for B

A1 Highlights from the eleventh ISCB Student Council Symposium 2015 Katie Wilkins, Mehedi Hassan, Margherita Francescatto, Jakob Jespersen, R. Gonzalo Parra, Bart Cuypers, Dan DeBlasio, Alexander Junge, Anupama Jigisha, Farzana Rahman O1 Prioritizing a drug’s targets using both gene expression and structural similarity Griet Laenen, Sander Willems, Lieven Thorrez, Yves Moreau O2 Organism specific protein-RNA recognition: A computational analysis of protein-RNA complex structures from different organisms Nagarajan Raju, Sonia Pankaj Chothani, C. Ramakrishnan, Masakazu Sekijima; M. Michael Gromiha O3 Detection of Heterogeneity in Single Particle Tracking Trajectories Paddy J Slator, Nigel J Burroughs O4 3D-NOME: 3D NucleOme Multiscale Engine for data-driven modeling of three-dimensional genome architecture Przemysław Szałaj, Zhonghui Tang, Paul Michalski, Oskar Luo, Xingwang Li, Yijun Ruan, Dariusz Plewczynski O5 A novel feature selection method to extract multiple adjacent solutions for viral genomic sequences classification Giulia Fiscon, Emanuel Weitschek, Massimo Ciccozzi, Paola Bertolazzi, Giovanni Felici O6 A systems Biology Compendium for Leishmania donovani Bart Cuypers, Pieter Meysman, Manu Vanaerschot, Maya Berg, Hideo Imamura, Jean-Claude Dujardin, Kris Laukens O7 Unravelling signal coordination from large scale phosphorylation kinetic data Westa Domanova, James R. Krycer, Rima Chaudhuri, Pengyi Yang, Fatemeh Vafaee, Daniel J. Fazakerley, Sean J. Humphrey, David E. James, Zdenka Kuncic

关键词： Visceral Leishmaniasis Feature Selection Method Frequent Itemset Mining Leishmania Donovani Student Council

来源：评论

学校读者我要写书评

暂无评论

A Self-Adaptive Scheduling (SAS) Solution for Enhancing VoIP Service Quality in OFDM-based Mobile Networks

A Self-Adaptive Scheduling (SAS) Solution for Enhancing VoIP...

引用

IEEE International Conference on Communications

作者： Tammy Chang Yang Wang Anpeng Huang Department of Electrical Engineering Stanford University California United States Institute of Network Computing and Information Systems Peking University Beijing China State Key Lab of Advanced Optical Communication Systems and Networks Peking University Beijing China

To save signaling overhead, Serai-Persistent Scheduling (SPS) is the standard for delivering Voice-over-IP (VoIP) in OFDM-based mobile networks. But uncompressed or variable-size compressed VoIP packets are problematic for SPS because they spill over the assigned semi-persistent resource whenever the ROHC (Robust Header Compression) mechanism is in an initialization or reset period, propagating system latency and accumulating unnecessary signaling overhead. In response, we propose a Self-Adaptive Scheduling (SAS) algorithm, where dynamic scheduling is used as an adaptive mechanism to assist in scheduling oversized packets, triggered by buffer information already known to the system, without requiring dedicated signaling. To analyze the performance of our proposal in theory, we created a novel theoretical model to describe VoIP traffic considering the uncompressed voice state. This is, to our best knowledge, the first effort to model the effect of uncompressed packets on VoIP performance in mobile networks from the system-level point of view. Theoretical analysis and simulation experiments validate our proposal, demonstrating its ability to enhance the VoIP user experience for a minor signaling overhead cost.

关键词： Decision support systems Quality of service Reliability

来源：评论

学校读者我要写书评

暂无评论

Towards self-caring mapreduce: Proactively reducing fault-induced execution-time penalties

Towards self-caring mapreduce: Proactively reducing fault-in...

引用

International Conference on High Performance computing and Simulation

作者： Kadirvel, Selvi Fortes, Jose A.B. Advanced Computing and Information Systems Lab University of Florida United States

ISBN: (纸本)9781612843810

Self-Caring IT systems are those that can proactively avoid system failures rather than reactively handle failures after they have occurred. In this paper, we are interested in failures in which a MapReduce job is unable to execute within an SLA-based completion time. The existing fault tolerance capability provided by Map Reduce frameworks is simple and the penalty associated with handling failures could potentially lead to excessive job execution times. Our goal in this paper is to bring out the severity of this penalty for different job characteristics and configurable framework parameters. We first quantitatively evaluate the penalty in execution time associated with node failures in the open-source MapReduce framework, Hadoop using the MRPerf simulator. This increase in execution time is particularly expensive in pay-as-you-go cloud infrastructures where users are charged by resource usage duration. Our solution minimizes job-completion-time SLA violations by augmenting the existing fault-tolerance capability of the MapReduce framework using a dynamic resource scaling approach. This resource scaling approach leverages the elastic properties of a cloud, in order to mitigate execution time penalties and hence proactively avoids a potential job failure. Using our proposed approach for various job and framework parameters, we show that performance penalties can be decreased by up to 78% in the case of single-node failures and by up to 100% in the case of 4-node failures at minimal additional cost. © 2011 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Litter: A lightweight peer-to-peer microblogging service

Litter: A lightweight peer-to-peer microblogging service

引用

2011 IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social computing, SocialCom 2011

作者： St Juste, Pierre S. Wolinsky, David Boykin, P. Oscar Figueiredo, Renato J. Advanced Computing and Information Systems Lab University of Florida Gainesville FL 32611 United States

ISBN: (纸本)9780769545783

Microblogging has become an important part of the social web evolution and is being utilized in many aspects such as advertising, political campaigns, and popular uprisings. Due to its heavy centralization, many have proposed decentralized alternatives based on a variety of models. This paper suggests a fully distributed approach built on top of existing peer-topeer technologies. We demonstrate that, by exploiting the services of current peer-to-peer middleware along with the properties of the social graph, it is possible to create a simple, yet practical microblogging service that is impervious to many of the shortcomings of their centralized counterparts. The approach has been implemented as a software prototype that is readily available for download in order to test our design in real life environments. © 2011 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Litter: A Lightweight Peer-to-Peer Microblogging Service

Litter: A Lightweight Peer-to-Peer Microblogging Service

引用

IEEE International Conference on and IEEE International Confernece on Social computing (SocialCom) Privacy, Security, Risk and Trust (PASSAT)

作者： Pierre St. Juste David Wolinsky P. Oscar Boykin Renato J. Figueiredo Advanced Computing and Information Systems Lab University of Florida Gainesville FL USA

Microblogging has become an important part of the social web evolution and is being utilized in many aspects such as advertising, political campaigns, and popular uprisings. Due to its heavy centralization, many have proposed decentralized alternatives based on a variety of models. This paper suggests a fully distributed approach built on top of existing peer-to-peer technologies. We demonstrate that, by exploiting the services of current peer-to-peer middleware along with the properties of the social graph, it is possible to create a simple, yet practical microblogging service that is impervious to many of the shortcomings of their centralized counterparts. The approach has been implemented as a software prototype that is readily available for download in order to test our design in real life environments.

关键词： Peer to peer computing Conferences IP networks Prototypes Virtual private networks Publishing Protocols

来源：评论

学校读者我要写书评

暂无评论

Reports of the AAAI 2011 conference workshops

Reports of the AAAI 2011 conference workshops

引用

作者： Agmon, Noa Agrawal, Vikas Aha, David W. Aloimonos, Yiannis Buckley, Donagh Doshi, Prashant Geib, Christopher Grasso, Floriana Green, Nancy Johnston, Benjamin Kaliski, Burt Kiekintveld, Christopher Law, Edith Lieberman, Henry Mengshoel, Ole J. Metzler, Ted Modayil, Joseph Oard, Douglas W. Onder, Nilufer O'Sullivan, Barry Pastra, Katerina Precup, Doina Ramachandran, Sowmya Reed, Chris Sariel-Talay, Sanem Selker, Ted Shastri, Lokendra Singh, Satinder Smith, Stephen F. Srivastava, Siddharth Sukthankar, Gita Uthus, David C. Williams, Mary-Anne Department of Computer Science University of Texas at Austin United States Center for Knowledge Driven Information Systems Infosys Labs India Adaptive Systems Section Naval Research Laboratory Washington DC United States Department of Computer Science University of Maryland College Park United States EMC's Center of Excellence in Ireland Research Europe at EMC Ireland Department of Computer Science University of Georgia United States School of Informatics University of Edinburgh United Kingdom Department of Computer Science University of Liverpool United Kingdom Department of Computer Science University of North Carolina Greensboro United States Faculty of Engineering and Information Technology University of Technology Sydney Australia VeriSign Inc. United States Department of Computer Science University of Texas at El Paso United States Machine Learning Department Carnegie Mellon University United States Massachusetts Institute of Technology Media Laboratory United States Carnegie Mellon University's Silicon Valley Campus United States Darrell W. Hughes Program for Religion and Science Dialogue Oklahoma City University United States Department of Computing Science University of Alberta Canada College of Information Studies Institute for Advanced Computer Studies University of Maryland College Park United States Department of Computer Science Michigan Technological University United States Department of Computer Science University College Cork Ireland Cognitive Systems Research Insitute Athens Greece School of Computer Science McGill University Canada Stottler Henke Inc. United States School of Computing University of Dundee United Kingdom Department of Computer Engineering Istanbul Technical University Turkey Convergence Lab Infosys Technologies Ltd. United States Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor United States Robotics Institute Carnegie Mellon University United States University of Wisconsin

The AAAI-11 workshop program was held Sunday and Monday, August 7-18, 2011, at the Hyatt Regency San Francisco in San Francisco, California USA. The AAAI-11 workshop program included 15 workshops covering a wide range of topics in artificial intelligence. The titles of the workshops were Activity Context Representation: Techniques and Languages;Analyzing Microtext;Applied Adversarial Reasoning and Risk Modeling;Artificial Intelligence and Smarter Living: The Conquest of Complexity;Artifiicial Intelligence for Data Center Management and Cloud computing;Automated Action Planning for Autonomous Mobile Robots;Computational Models of Natural Argument;Generalized Planning;Human Computation;Human-Robot Interaction in Elder Care;Interactive Decision Theory and Game Theory, 2010;Language-Action Tools for Cognitive Artificial Agents: Integrating Vision, Action, and Language;Lifelong Learning from Sensorimotor Experience;Plan, Activity, and Intent Recognition;and Scalable Integration of Analytics and Visualization. This article presents short summaries of those events. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Human robot interaction

来源：评论

学校读者我要写书评

暂无评论

Deetoo: Scalable unstructured search built on a structured overlay

Deetoo: Scalable unstructured search built on a structured o...

引用

2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010

作者： Choi, Tae Woong Boykin, P. Oscar Advanced Computing Information Systems Lab University of Florida United States

ISBN: (纸本)9781424465347

We present Deetoo, an algorithm to perform completely general queries, for instance high-dimensional proximity queries or regular expression matching, on a P2P network. Deetoo is an efficient unstructured query system on top of existing structured P2P ring topologies. Deetoo provides a reusable search tool to work alongside a DHT, thus, it provides new capabilities while reusing existing P2P models and software. Since our algorithm is for unstructured search, there is no structural relationship between the queries and the network topology and hence no need to provide a mapping of queries onto a fixed DHT structure. Deetoo is optimal in terms of the trade-off in querying and caching cost. For networks of size N, O(√N) cost for both caching and querying is required to achieve a constant (in N) search success probability. Queries execute a time of O(log2 N).© 2010 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Addressing the P2P bootstrap problem for small overlay networks

Addressing the P2P bootstrap problem for small overlay netwo...

引用

2010 IEEE 10th International Conference on Peer-to-Peer computing, P2P 2010

作者： Wolinsky, David Isaac Juste, Pierre St. Boykin, P. Oscar Figueiredo, Renato Advanced Computing Information Systems Lab. University of Florida United States

ISBN: (纸本)9781424471416

Peer-to-Peer (P2P) overlays provide a framework for building distributed applications consisting of few to many resources with features including self-configuration, scalability, and resilience to node failures. Such systems have been successfully adopted in large-scale Internet services for content delivery networks, file sharing, and data storage. In small-scale systems, they can be useful to address privacy concerns as well as support for network applications that lack dedicated servers. The bootstrap problem, finding an existing peer in the overlay, remains a challenge to enabling these services for small-scale P2P systems. In large networks, the solution to the bootstrap problem has been the use of dedicated services, though creating and maintaining these systems requires expertise and resources, which constrain their usefulness and make them unappealing for small-scale systems. This paper surveys and summarizes requirements that allow peers potentially constrained by network connectivity to boot-strap small-scale overlays through the use of existing public overlays. In order to support bootstrapping, a public overlay must support the following requirements: a method for reflection in order to obtain publicly reachable addresses, so peers behind network address translators and firewalls can receive incoming connection requests;communication relaying to share public addresses and communicate when direct communication is not feasible;and rendezvous for discovering remote peers, when the overlay lacks stable membership. After presenting a survey of various public overlays, we identify two overlays that match the requirements: XMPP overlays, such as Google Talk and Live Journal Talk, and Brunet, a structured overlay based upon Symphony. We present qualitative experiences with prototypes that demonstrate the ability to bootstrap small-scale private structured overlays from public Brunet or XMPP infrastructures. ©2010 IEEE.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：