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

IEEE INFOCOM Workshops 2009最新文献

筛选
英文 中文
Dimensioning WiMAX Mesh Networks with Multiple Channels 多通道WiMAX网状网络的量纲化
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072129
Salim Nahle, N. Malouch, S. Fdida
{"title":"Dimensioning WiMAX Mesh Networks with Multiple Channels","authors":"Salim Nahle, N. Malouch, S. Fdida","doi":"10.1109/INFCOMW.2009.5072129","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072129","url":null,"abstract":"In this paper, and for the purpose of optimizing the performance of WiMAX mesh networks using multiple channels, we search the minimum number of channels that maximizes the throughput capacity. WiMAX operates in the licensed bands, so it is important to use only the sufficent number of the scarce wireless channels. Moreover, it helps to decide whether or not to use frequency spatial reuse (FSR) that incurs additional control information, which is relatively large as an accurate knowledge of the interference state at each SS must be accumulated at a central entity that sets the schedule (which is the BS in our case). Numerical simulations show that in most of the cases, with 3 or 4 channels, the maximum throughput capacity can be obtained for single interface WiMAX mesh networks, and no gains are obtained if more channels are used.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"13 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":"125576566","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
Mobile Networks: Naming vs. Tunnelling 移动网络:命名vs隧道化
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072163
Devan Rehunathan, S. Bhatti
{"title":"Mobile Networks: Naming vs. Tunnelling","authors":"Devan Rehunathan, S. Bhatti","doi":"10.1109/INFCOMW.2009.5072163","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072163","url":null,"abstract":"Using data of passenger numbers and train schedules from the London Underground metropolitan railway system, we compare a Tunnelling-based to a Naming-based approach for supporting mobile networks. We show that, in terms of packet overhead, a naming based approach may have similar performance overhead to a tunnelling approach, and so may offer a viable alternative, whilst also offering other benefits.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"20 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":"125895105","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
Social Pocket Switched Networks 社交口袋交换网络
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072190
Anna-Kaisa Pietilainen, C. Diot
{"title":"Social Pocket Switched Networks","authors":"Anna-Kaisa Pietilainen, C. Diot","doi":"10.1109/INFCOMW.2009.5072190","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072190","url":null,"abstract":"Pocket Switched Network (PSN) communications paradigm builds on opportunistic contacts between mobile devices and human mobility to disseminate content without relying on any infrastructure. We propose MobiClique, a mobile social software that builds and maintains an ad hoc social network overlay over a Pocket Switched Network and allows users to exchange messages between each other and groups of users sharing similar interests. We describe MobiClique implementation and initial experimental results.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"34 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":"121688730","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}
引用次数: 22
Assuring QoS in Wireless Mesh Networks with Misbehaving Users 具有不良行为用户的无线Mesh网络的QoS保证
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072116
S. Szott
{"title":"Assuring QoS in Wireless Mesh Networks with Misbehaving Users","authors":"S. Szott","doi":"10.1109/INFCOMW.2009.5072116","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072116","url":null,"abstract":"This paper deals with the problem of QoS provisioning in wireless mesh networks in the presence of misbehaving users. To mitigate the impact of such users, a misbehavior-aware QoS architecture is proposed. The results of simulation studies show the most beneficial forms of misbehavior in mesh networks. Finally, the best method for detecting a particular type of misbehavior (backoff cheating) is suggested.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"3 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":"125024041","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
ISP-Operated CDN ISP-Operated CDN
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072157
N. Kamiyama, Tatsuya Mori, R. Kawahara, Shigeaki Harada, H. Hasegawa
{"title":"ISP-Operated CDN","authors":"N. Kamiyama, Tatsuya Mori, R. Kawahara, Shigeaki Harada, H. Hasegawa","doi":"10.1109/INFCOMW.2009.5072157","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072157","url":null,"abstract":"The transmission bandwidth consumed by delivering rich content, such as movie files, is enormous, so it is urgent for ISPs to design an efficient delivery system minimizing the amount of network resources consumed. To efficiently deliver web content, a content delivery networks (CDNs) have been widely used. CDN providers collocate a huge number of servers within multiple ISPs without being informed the detailed network information, i.e., network topologies, from ISPs. Minimizing the amount of network resources consumed is difficult because a CDN provider selects a server for each request based on only rough estimates of response time. To serve users rich content economically and efficiently, an ISP itself should optimally provide servers with huge storage capacities at a limited number of locations within its network. In this paper, we investigate the content deployment method, the content delivery process, and the server allocation method that are desirable for this ISP-operated CDN. Moreover, we evaluate the effectiveness of the ISP-operated CDN using network topologies of actual ISPs.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"21 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":"134269324","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}
引用次数: 28
A Unified Security Backplane for Trust and Reputation Systems in Decentralized Networks 分布式网络中信任和声誉系统的统一安全背板
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072105
F. Tegeler, Jun Lei, Xiaoming Fu
{"title":"A Unified Security Backplane for Trust and Reputation Systems in Decentralized Networks","authors":"F. Tegeler, Jun Lei, Xiaoming Fu","doi":"10.1109/INFCOMW.2009.5072105","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072105","url":null,"abstract":"Presented in this paper a preliminary proposal of a security framework for delivering security properties to Trust and Reputation management systems in decentralized networks. When TR metrics are used in this framework, nodes can be held responsible for their actions and identity spoofing is prevented. By protecting trust reply messages and/or the interaction with trust holding agents, false reporting or message alteration is not possible anymore. Therefore, the security backplane delivers a unified framework for TR metrics allowing easy secure deployment. We plan to evaluate our framework with different TR metrics using simulations with colluding malicious nodes. Furthermore, we will analyze in details how different views can impact the overall behavior of the network and the overhead imposed by our solution.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"14 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":"133367261","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
Using NATO! for Partially Reliable Large Scale Multicast Streaming in Broadcast Wireless Networks 使用北约!广播无线网络中部分可靠的大规模组播流
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072203
R. Cohen, Alexander Landau
{"title":"Using NATO! for Partially Reliable Large Scale Multicast Streaming in Broadcast Wireless Networks","authors":"R. Cohen, Alexander Landau","doi":"10.1109/INFCOMW.2009.5072203","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072203","url":null,"abstract":"Streaming multicast is one of the most important Transport layer services in future broadcast wireless networks. This service enables the delivery of real-time voice and video applications to an almost unlimited number of mobile devices, by taking advantage of a base station's ability to transmit a single packet to all the nodes in its cell. While strict delivery assurance is not necessary and not possible for such applications, some level of assurance is provided using Transport layer FEC (Forward Error Correction) codes. In this paper we show how to improve the performance of large-scale partially reliable multicast streaming in broadcast wireless networks, using the NATO! scheme. NATO!, presented in another paper, is a generic real-time scheme that allows a node to estimate the size of any subset of nodes affected by the same event using a few messages received from this subset.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"3 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":"131833689","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
Fair Multicast Congestion Control (M2C) 公平组播拥塞控制(M2C)
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072144
Vincent Lucas, Jean-Jacques Pansiot, D. Grad, B. Hilt
{"title":"Fair Multicast Congestion Control (M2C)","authors":"Vincent Lucas, Jean-Jacques Pansiot, D. Grad, B. Hilt","doi":"10.1109/INFCOMW.2009.5072144","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072144","url":null,"abstract":"We propose a new TCP-friendly multicast congestion control for very large groups of receivers. This protocol named M2C is layered and receiver-driven. Like TCP, M2C is composed of a Congestion Avoidance and a Slow Start state. However, M2C can re-activate the Slow Start when the current rate is far below the fair one. This protocol is well designed for continuous and long lived data streams, such as multicast IPTV. We study M2C performances in terms of bandwidth-sharing fairness and loss rate. This evaluation shows that M2C is robust and TCP-friendly for most network situations. Besides, we also provide an analysis of the signaling generated. Finally, we compare M2C and WEBRC performances, showing significant improvements.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"34 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":"131955627","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}
引用次数: 6
Sniper: Social-Link Defense for Network Coordinate Systems 狙击:网络坐标系统的社会链接防御
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072189
Xiaohan Zhao, E. Lua, Yang Chen, Xiaoxiao Song, Beixing Deng, Xing Li
{"title":"Sniper: Social-Link Defense for Network Coordinate Systems","authors":"Xiaohan Zhao, E. Lua, Yang Chen, Xiaoxiao Song, Beixing Deng, Xing Li","doi":"10.1109/INFCOMW.2009.5072189","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072189","url":null,"abstract":"Recent work on securing the Network Coordinate (NC) service attempts to defend attacks based on nodes' past behavior and activities. They detect malicious nodes only after attacks occurred. In order to secure NC system before malicious nodes mount attacks, we propose a social-link defense system for NC service--Sniper. We are able to provide NC system with trusted neighbors (landmarks) using social-link filtering technique. Our preliminary results demonstrate that Sniper can protect NC system successfully before they are attacked by malicious nodes.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"115 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":"134418341","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
Efficient Traffic Routing of Optical Networks for Future Demands 面向未来需求的光网络高效流量路由
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072137
K. Assis, K. Cruz
{"title":"Efficient Traffic Routing of Optical Networks for Future Demands","authors":"K. Assis, K. Cruz","doi":"10.1109/INFCOMW.2009.5072137","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072137","url":null,"abstract":"We propose a linear formulation for the flow routing of packets in Virtual Topology Design (VTD) of optical networks. The formulation maximizes the established the future ability to accept additional traffic through optimization of the remaining idle capacity. The results suggest that t is feasible to preserve enough open capacity to avoid blocking of future traffic in networks with scarce resources.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"22 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":"132834638","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
首页 上一页 下一页 尾页
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学术官方微信