发布求助
文献互助 智能选刊 最新文献

IEEE INFOCOM Workshops 2009最新文献

筛选
英文 中文
From Contacts to Graphs: Pitfalls in Using Complex Network Analysis for DTN Routing 从接触到图:DTN路由中使用复杂网络分析的陷阱
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072147
T. Hossmann, F. Legendre, T. Spyropoulos
{"title":"From Contacts to Graphs: Pitfalls in Using Complex Network Analysis for DTN Routing","authors":"T. Hossmann, F. Legendre, T. Spyropoulos","doi":"10.1109/INFCOMW.2009.5072147","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072147","url":null,"abstract":"Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are made using locally collected knowledge about node behavior (e.g., past contacts between nodes) to predict which nodes are likely to deliver a content or bring it closer to the destination. One promising way of predicting future contact opportunities is to aggregate contacts seen in the past to a social graph and use metrics from complex network analysis (e.g., centrality and similarity) to assess the utility of a node to carry a piece of content. This aggregation presents an inherent tradeoff between the amount of time-related information lost during this mapping and the predictive capability of complex network analysis in this context. In this paper, we use two recent DTN routing algorithms that rely on such complex network analysis, to show that contact aggregation significantly affects the performance of these protocols. We then propose simple contact mapping algorithms that demonstrate improved performance up to a factor of 4 in delivery ratio, and robustness to various connectivity scenarios for both protocols.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127340405","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}
引用次数: 44
DIMDS: A Dynamic Identity Management and Discovery System 动态身份管理和发现系统
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072128
Konstantinos Lampropoulos, S. Denazis
{"title":"DIMDS: A Dynamic Identity Management and Discovery System","authors":"Konstantinos Lampropoulos, S. Denazis","doi":"10.1109/INFCOMW.2009.5072128","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072128","url":null,"abstract":"Next Generation Networks (NGN) advocating network convergence, face a series of important technical challenges, one of them is the management of diverse user identities. Existing solutions tackle only a small range of identity issues, often imposing modifications in established network protocols. We present a new identity management and discovery framework that does not impose modifications on existing network protocols as it binds together and manages all different types of identities while it is agnostic to naming and addressing formats.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128414481","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}
引用次数: 1
A Framework for Rank Computation and Aggregation in Fuzzy Environments 模糊环境下的秩计算与聚合框架
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072095
Asheq Khan, C. Qiao, S. Tripathi
{"title":"A Framework for Rank Computation and Aggregation in Fuzzy Environments","authors":"Asheq Khan, C. Qiao, S. Tripathi","doi":"10.1109/INFCOMW.2009.5072095","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072095","url":null,"abstract":"In many network and IT systems, users submit loosely-defined (or fuzzy) requests to obtain answers, solutions or resources. In this paper, we focus on trouble-shooting problem tickets in an IT service management system. In such a system, problems are typically reported using vague user-generated descriptions of the symptoms (e.g., 'my email is not working!') in a ticket. IT Specialists are then responsible for identifying the troubled component from the reported symptoms. Usually, the ticket is sent to one Specialist at a time until it is resolved hence, an efficient mechanism to select the (next) potential Specialist becomes critical towards a timely resolution of the ticket. \u0000 \u0000In this paper, we introduce a framework to deal with fuzzy requests in a distributed environment. We first show the importance of considering both the traditional graph-based network routing efficiency as well as social network theory to generate important ranking metrics. For each newly arrived ticket, we propose several selection and ranking policies to choose and rank IT Specialists who can potentially resolve the ticket. We evaluate the ranking system with synthetic tickets, generated by an in-depth simulated IT management model that closely mimics an operational system. Our preliminary results suggest the importance of considering both routing efficiency and social connectivity to minimize the resolution time of a ticket.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122271866","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}
引用次数: 2
Optimal Topology Design of Complex Networks 复杂网络的最优拓扑设计
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072173
F. S. Souza, A. S. da Cunha, G. Mateus
{"title":"Optimal Topology Design of Complex Networks","authors":"F. S. Souza, A. S. da Cunha, G. Mateus","doi":"10.1109/INFCOMW.2009.5072173","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072173","url":null,"abstract":"Given a network, link costs and a maximum cost budget, in this work we apply Integer Programming techniques to determine the optimal set of links that should be included in the network, in order to provide complex network features. This is accomplished by solving, through Branch-and-bound, a Mixed Integer Program based on network flows. We also present a column generation algorithm that, hopefully, will allow us to deal with larger networks. A statistical evaluation of the optimal network topologies found with our methods allowed us to establish a clear relationship between the budget value and a complex network feature (small world, power law degree distribution, for example). In particular, we found that the budget size plays, in our model, a similar role played by the probability of addition or rewiring arcs in stochastic procedures for generating network topologies.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"16 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132584963","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}
引用次数: 3
Uncoordinated Peer Selection in P2P Backup and Storage Applications P2P备份存储应用中的不协调对等体选择
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072202
László Toka, P. Michiardi
{"title":"Uncoordinated Peer Selection in P2P Backup and Storage Applications","authors":"László Toka, P. Michiardi","doi":"10.1109/INFCOMW.2009.5072202","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072202","url":null,"abstract":"In this work we tackle the problem of on-line backup and storage with a peer-to-peer approach. We propose a novel system architecture involving the users' devices that confederate by pooling their resources and offer an alternative to capital-intensive data-centers. In contrast to current peer-to-peer architectures that build upon distributed hash-tables, we investigate whether an uncoordinated approach to data placement would prove effective in providing embedded incentives for users to offer local resources to the system. By modeling peers as selfish entities striving for minimizing their cost in participating to the system, we analyze equilibrium topologies that materialize from the process of peer selection, whereby peers establish bi-lateral links that involve storing data in a symmetric way. System stratification, colluding peers with similar contribution efforts, is an essential outcome of the peer selection process: peers are lured to improve the \"quality\" of local resources they provide to reach lower operational costs. Our results are corroborated by both a game-theoretic analysis and a numerical evaluation of several system configurations.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"33 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122396484","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}
引用次数: 4
Saving Energy for (and from) a Sunny Day: Lowering Peak Demands with Batteries 为晴天节约能源:用电池降低高峰需求
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072184
Matthew P. Johnson, A. Bar-Noy, Yi Feng, Ou Liu
{"title":"Saving Energy for (and from) a Sunny Day: Lowering Peak Demands with Batteries","authors":"Matthew P. Johnson, A. Bar-Noy, Yi Feng, Ou Liu","doi":"10.1109/INFCOMW.2009.5072184","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072184","url":null,"abstract":"The authors discuss a recently introduced scheduling problem and solve several versions optimally with efficient combinatorial algorithms. The authors solve the offline problem for two kinds of batteries: unbounded battery in O (n) time and bounded in O (n 2 ). Separately, the authors show how to find the optimal offline battery size, for the setting in which the final battery level must equal the initial battery level. This is the smallest battery size that achieves the optimal peak. The online problem we study is very strict. A meta-strategy in many online problems is to balance expensive periods with cheap ones, so that the overall cost stays low.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127420170","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}
引用次数: 0
Online Job Provisioning for Large Scale Science Experiments over an Optical Grid Infrastructure 基于光网格的大规模科学实验在线作业配置
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072171
Xiang Yu, C. Qiao, Dantong Yu
{"title":"Online Job Provisioning for Large Scale Science Experiments over an Optical Grid Infrastructure","authors":"Xiang Yu, C. Qiao, Dantong Yu","doi":"10.1109/INFCOMW.2009.5072171","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072171","url":null,"abstract":"Many emerging science experiments require that the massive data generated by big instruments be accessible and analyzed by a large number of geographically dispersed users. Such large scale science experiments are enabled by an Optical Grid infrastructure which integrates Grid software with a WDM network. This paper studies the following problem in an Optical Grid environment: given an online job request, how to optimally find a host to execute the job, taking into account the need to stage missing input files stored at other places, with the goal of satisfying the job's QoS requirements, subject to dynamic computing and network resource usage status? We first formulate the optimization problem as a Mixed Integer Linear Programming (MILP). As the MILP solution quickly gets intractable when the network size grows larger, we also propose an adaptive heuristic called AOJP. Our simulation results demonstrate both the effectiveness and the efficiency of AOJP.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127851114","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}
引用次数: 4
Proxima: Towards Lightweight and Flexible Anycast Service Proxima:迈向轻量级和灵活的任播服务
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072180
Guodong Wang, Yang Chen, Lei Shi, E. Lua, Beixing Deng, Xing Li
{"title":"Proxima: Towards Lightweight and Flexible Anycast Service","authors":"Guodong Wang, Yang Chen, Lei Shi, E. Lua, Beixing Deng, Xing Li","doi":"10.1109/INFCOMW.2009.5072180","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072180","url":null,"abstract":"Anycast paradigm has been widely adopted by Internet application to find nearby resources. The current IP anycast implementation suffers from poor scalability. To overcome that, this paper proposes Proxima, a network coordinates (NC) based application layer infrastructure, which is capable to provide lightweight and flexible anycast service. Proxima accurately chooses the best receiver from a group of candidates according to the Round Trip Time (RTT) for certain application. Our experimental results have demonstrated the excellent performance of Proxima in real sever selection scenario.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126686237","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}
引用次数: 7
An Experimental Study on Wi-Fi Ad-Hoc Mode for Mobile Device-to-Device Video Delivery 移动设备对设备视频传输的Wi-Fi Ad-Hoc模式实验研究
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072111
Bo Xing, K. Seada, N. Venkatasubramanian
{"title":"An Experimental Study on Wi-Fi Ad-Hoc Mode for Mobile Device-to-Device Video Delivery","authors":"Bo Xing, K. Seada, N. Venkatasubramanian","doi":"10.1109/INFCOMW.2009.5072111","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072111","url":null,"abstract":"The demand for video content is continuously increasing as video sharing on the Internet is becoming enormously popular recently. This demand, with its high bandwidth requirements, has a considerable impact on the load of the network infrastructure. As more users access videos from their mobile devices, the load on the current wireless infrastructure (which has limited capacity) will be even more significant. Based on observations from many local video sharing scenarios, in this paper, we study the tradeoffs of using Wi-Fi ad-hoc mode versus infrastructure mode for video streaming between adjacent devices. We thus show the potential of direct device-to-device communication as a way to reduce the load on the wireless infrastructure and to improve user experiences. Setting up experiments for Wi-Fi devices connected in ad-hoc mode, we collect measurements for various video streaming scenarios and compare them to the case where the devices are connected through access points. The results show the improvements in latency, jitter and loss rate. More importantly, the results show that the performance in direct device-to-device streaming is much more stable in contrast to the access point case, where different factors affect the performance causing widely unpredictable qualities.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116574771","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}
引用次数: 35
Mobility at the Application Level 应用程序级别的移动性
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072164
B. Y. L. Kimura, Edson Dos Santos Moreira
{"title":"Mobility at the Application Level","authors":"B. Y. L. Kimura, Edson Dos Santos Moreira","doi":"10.1109/INFCOMW.2009.5072164","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072164","url":null,"abstract":"We devised an architecture, implemented at the application level, to provide support for mobility with good performance. This paper briefly describes experimental findings on a comparison between the performance of the proposed system and the traditional MIPv6. These experiments are part of a preliminary set of tests aiming to evaluate Mobility Management strategies in upper network layers.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128793004","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}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信