{"title":"Towards evolving Sensor Actor NETworks","authors":"R. Eltarras, Mohamed Eltoweissy, Moustafa Youssef","doi":"10.1109/INFOCOM.2008.4544586","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544586","url":null,"abstract":"Sensor Actor NETworks (SANET) represent for component of ubiquitous service environments promising interesting solutions to a wide range of problems. Despite the obvious increase in the research activities proposing architectures and protocols for SANETs, we are still no where near the production of industrial-grade SANET software that can be relied upon for mission critical applications. The cost of programming,prohibitive due to the lack of industrial tools capable of realizing adaptive SANET software in a cost effective way. We envision next generation SANET environments as large-scale autonomous systems 1) deployed by multiple infrastructure providers, 2)running multiple applications and 3) providing ubiquitous services collaboratively to both stationary and mobile users. Software adaptability is essential due to both the fragile topology and the change of the SANET goal or mission in response to diverse events.The system should be able to change its structure and behavior at run-time while maintaining its integrity. We introduce Elastic SANET (ESANET) as an attempt to realize a scalable, flexible,cost-effective and dynamic computing infrastructure capable efficiently running multiple applications on top of SANET hard-ware resources. ESANE1 software systems are likely to evolve over time. Deployment of software in ESANET is a progressive first class runtime operation. We propose a role-oriented software architecture that abstracts ESANET environments as fields of collaboration between specialized nodes, clusters, and overlays. We expect such architecture to achieve massive scalability and resilience to topology and context changes. Our proposed architecture could increase the network lifetime, not only by promoting efficient operation, but also by defining a mechanism to allow the network to recover from the death of individual nodes by preserving stocks of unspecialized standby stem nodes in a minimal power mode. Finally, we present a nano-middleware architecture and show how an evolution capable ESANET can be bootstrapped.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121917101","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":"Adaptive Kalman Filtering for anomaly detection in software appliances","authors":"F. Knorn, D. Leith","doi":"10.1109/INFOCOM.2008.4544581","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544581","url":null,"abstract":"Availability and reliability are often important features of key software appliances such as firewalls, web servers, etc. In this paper we seek to go beyond the simple heartbeat monitoring that is widely used for failover control. We do this by integrating more fine grained measurements that are readily available on most platforms to detect possible faults or the onset of failures. In particular, we evaluate the use of adaptive Kalman Filtering for automated CPU usage prediction that is then used to detect abnormal behaviour. Examples from experimental tests are given.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127169305","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}
H. Mei, B. V. van Beijnum, I. Widya, V. Jones, H. Hermens
{"title":"Enhancing the performance of mobile healthcare systems based on task-redistribution","authors":"H. Mei, B. V. van Beijnum, I. Widya, V. Jones, H. Hermens","doi":"10.1109/INFOCOM.2008.4544603","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544603","url":null,"abstract":"Mobile healthcare (m-health) systems have attracted a great deal of attention due to their potential to improve the quality of diagnosis, reduce medical costs and help address the challenges posed by the aging society. A generic m- health service platform has been developed and specialized to deal with emergency settings such as epileptic seizure detection, cardiac care and trauma care. The m-health infrastructure and services can be in this case described as both mission-critical and safety critical. Dynamic context-aware adaptation mechanisms are required in order to meet the stringent requirements on such mission critical applications. The use of mobile devices means that attention must be paid to resource optimization and in emergency situations timeliness of response is also a critical factor. These factors lead to critical performance requirements on the system across several dimensions. This paper presents an m-health application scenario requiring rapid response and identifies the system performance measures that are key to the success of such m-health solutions. As an extension to the m-health service platform we propose an adaptive middleware framework based on dynamic task redistribution. In particular, we present a computational model to estimate the QoS of m- health system given a particular task assignment and further to select the optimal assignment.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131066311","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":"Empirical model-based adaptive control of MANETs","authors":"A. Moursy, I. Ajbar, D. Perkins, M. Bayoumi","doi":"10.1109/INFOCOM.2008.4544616","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544616","url":null,"abstract":"The performance of mobile ad hoc networks (MANETs) depends upon a number of dynamic factors that ultimately influence protocol and overall system performance. Adaptive protocols have been proposed that adjust their operation based on the values of factors, such as traffic load, node mobility, and link quality. In this work, however, we are investigating the feasibility of an adaptive model-based self-controller that can manage the values of controllable factors in MANETs. In general, the proposed self-controller should determine a set of factor values that will maximize system performance or satisfy specific performance requirements. The model-based controller adapts or reconfigures system-wide parameters or protocol operation as a function of the dynamically changing network state. In this paper, we describe the proposed self-controller, its design issues, and provide a preliminary case study to demonstrate the effectiveness and tradeoffs of two potential empirical-modeling techniques: regression and artificial neural networks.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130903117","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":"Efficient algorithms for Index Coding","authors":"Mohammad Asad Rehman Chaudhry, Alex Sprintson","doi":"10.1109/INFOCOM.2008.4544612","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544612","url":null,"abstract":"The index coding problem has attracted a considerable amount of attention in recent years. The problem is motivated by several applications in wireless networking and distributed computing, including wireless architectures that utilize network coding and opportunistic listening. In this paper, we propose efficient exact and heuristic solutions for this problem. Our numerical study shows that exact solutions can be efficiently obtained for small instances of the problem, while heuristic solutions with low computation time can achieve near-optimal performance for large instances.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121312285","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":"Resource management in an active measurement service","authors":"E. Blanton, S. Fahmy, S. Banerjee","doi":"10.1109/INFOCOM.2008.4544643","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544643","url":null,"abstract":"Many network services such as voice, video, and collaborative applications require an informed view of network characteristics for effective operation. Sharing a network measurement service across multiple applications can significantly reduce measurement overhead, and remove the burden of performing network measurements from individual applications. To be effectively shared, a network measurement service must provide a variety of measurements to applications on-demand, including end-to-end available bandwidth, delay, and loss. We propose such a service, with a focus on quantifying and bounding the impact of active measurements on the network resources being measured. Resource bounds are necessary for wide-scale deployment, since not all users of the service can be trusted. The service informs applications of how service bounds affect their measurements. We introduce methods to characterize the behavior of active measurements for use in admission control and scheduling decisions. We evaluate our methods in experiments under realistic scenarios on the Emulab testbed.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122245838","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":"Cooperative content retrieval in nomadic sensor networks","authors":"I. Koukoutsidis, E. Jaho, I. Stavrakakis","doi":"10.1109/INFOCOM.2008.4544657","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544657","url":null,"abstract":"A nomadic sensor network consists of: (a) sensor nodes, that are fixed at some points and collect information about states or variables of the environment, and (b) mobile nodes that collect and disseminate this information. Mobile nodes usually belong to different classes, and are thus interested in different subsets of sensor node information. In such networks, dissemination of information content at smaller costs can be achieved if mobile nodes are cooperative and collect and carry information not only in their own interest, but also in the interest of other mobile nodes. A specific modeling scenario is considered in this paper where the network has the form of a graph; sensor nodes are located on the vertices of the graph and U-nodes move along the edges according to a random waypoint model. We present a game-theoretic analysis to find conditions under which a cooperative equilibrium can be sustained.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127599025","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":"Weeding spammers at the root: A precise approach to spam reduction","authors":"Tu Ouyang, M. Rabinovich","doi":"10.1109/INFOCOM.2008.4544636","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544636","url":null,"abstract":"Email spam has become one of the most critical threats affecting Internet user experiences. Existing anti-spam techniques, such as spam filters and reputation systems, face growing difficulties due to spammers' use of multimedia content (which is difficult to filter) and computer zombies (which mask true spammer identity). We propose SpamWeeder, a simple idea for spam prevention, which targets the root of the spam problem - the email address trafficking. SpamWeeder can track the email address trafficking channels, expose the parties at the source of these channels, and precisely block all email from all and only parties belonging to a given distribution channel. SpamWeeder can further generate warnings to users against submitting their email addresses to parties likely to engage in address trafficking. Finally, our approach is transparent to users and can be installed autonomously by an organization intranet, without need for any changes to the rest of the email infrastructure.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133637479","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 new Access Control Policy on the uplink of a DS-CDMA system","authors":"Zhaorong Zhou, Yide Zhang, G. Feng","doi":"10.1109/INFOCOM.2008.4544579","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544579","url":null,"abstract":"One of the key challenges in multi-services wireless cellular networks is the design of effective access control policy (ACP) algorithm, which not only has to ensure that the system guarantees potentially different QoS requirements from diverse applications, but also fully utilizes the scarce wireless bandwidth. On the uplink of a CDMA cellular network, successive interference cancellation (SIC) technique can be employed to reduce multiple access interference and improve system capacity. In this kind of system, K users correspond to K! decoding orders. Due to the constraint of received power, not all these decoding orders may be feasible. Examining the outputs of the ACP algorithm directly by the exhaustive search method (ESM) among all these K! possible decoding orders is a prohibitively time-consuming work, which leads to the impossible implementation of ACP algorithm. Carelessly accommodating a new session will be detrimental to all or some of other existing sessions in the system, even making the system collapsing. In this paper, we first address the issue of the searching algorithm of the Optimal Decoding Order (ODOS) in a DS-CDMA system with the constraint of the received power at the base station. Then, we develop a novel access control policy algorithm which employs the optimal decoding order, with the name of ODO-ACP algorithm. The proposed searching algorithm decoding order has the lowest computational complexity. Based on the output of ODOS algorithm, ODO-ACP could make fast decision on whether to accommodate a newly-arrival call request. Finally, we conduct computer simulations on the key system performance parameters, and the extensive simulation results validate the proposed algorithm.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"330 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134332115","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 Federated Network Architecture","authors":"H. Hassan, M. Eltoweissy, M. Youssef","doi":"10.1109/INFOCOM.2008.4544594","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.4544594","url":null,"abstract":"The layered architecture that guided the design of the Internet is deemed inadequate as a reference model for engineering protocols for NGN. Layered protocol suites impose a strict sequential order on protocol execution conflicting with the efficient engineering of end systems, as well as failing to express vertical functional integration, the separation of control and data planes, and the distributed nature of network functions. Furthermore, protocols developed according to the layered architecture are implemented as monolithic blocks with undefined or implicit dependencies lacking flexibility to adapt to changing application requirements. We claim that NGN architecture design should be dual faceted along a vertical and a horizontal dimension. The vertical dimension addresses complexity at a network node by abstracting the communication functionality into several components and defining component interactions, while the horizontal dimension addresses the distributed nature of the network, abstracting network links into communication paths, and defining procedures for creating, maintaining, as well as exchanging data between different network components along these paths. We propose a preliminary network architecture based on component federation. We focus on the vertical decomposition of the communication functions and their interactions considering the distributed consequences of these interactions along the horizontal dimension of the network.","PeriodicalId":260647,"journal":{"name":"IEEE INFOCOM Workshops 2008","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115969809","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}