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

IEEE INFOCOM Workshops 2009最新文献

筛选
英文 中文
From Packets to XLFrames: Sand and Rocks for Transfer of Mice and Elephants 从数据包到xlframe:用于转移老鼠和大象的沙子和石头
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072149
D. Divakaran, E. Altman, G. Post, L. Noirie, P. Primet
{"title":"From Packets to XLFrames: Sand and Rocks for Transfer of Mice and Elephants","authors":"D. Divakaran, E. Altman, G. Post, L. Noirie, P. Primet","doi":"10.1109/INFCOMW.2009.5072149","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072149","url":null,"abstract":"Looking into the future, this paper presents the effects of having packets of large sizes, called XLFrames (XLFs), in a network. The analysis is motivated by the fact that the Internet is soon to witness stupendous amounts of traffic that have to be processed and switched at amplifying line rates; and this brings forth multiple challenges in the form of energy efficiency, network performance and end-host performance. Increasing the size of packets in the Internet has far-reaching incentives that otherwise appear hard to achieve. We foresee an Internet that multiplexes both packets (sand) and XLFs (rocks). As a first step, we analyse the effects of introducing XLFs in a network, and find the following: (i) the amount of packet-header processing is greatly reduced, (ii) while the fair multiplexing of XLFs with standard packets can be achieved using a careful queue management in routers.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"54 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":"121857676","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}
引用次数: 5
Fighting Attacks in P2P Live Streaming. Simpler is Better 打击P2P直播中的攻击。越简单越好
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072145
A. Vieira, S. Campos, J. Almeida
{"title":"Fighting Attacks in P2P Live Streaming. Simpler is Better","authors":"A. Vieira, S. Campos, J. Almeida","doi":"10.1109/INFCOMW.2009.5072145","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072145","url":null,"abstract":"P2P live streaming applications are becoming more popular each day. In contrast to the client-server model, the P2P approach overcomes problems such as system scalability and need for powerful resources in a single point. However, P2P networks may suffer from attacks and opportunistic behaviors. In this paper we present a decentralized reputation system to fight attacks in P2P live streaming networks which is simpler than previously proposed mechanisms. It allows peers rehabilitation and also permits interaction with potential polluters while they are acting fairly. In case polluters initiate an attack, peers can quickly identify and isolate them. Our results show that the overhead to block polluters is very small compared to the retransmission imposed by polluted data. During an attack, nodes in the proposed P2P system need a retransmission peak of 50% of the original media, while in previous systems they may need more than 100%. Moreover, the proposed system identifies and blocks pollution almost two times faster than other systems and under polluters collusion, it can handle situation without a significant overhead.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"23 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":"125939137","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}
引用次数: 12
A Novel Algorithm for Maximizing the Lifetime of Sensor Networks and the Use of an m²-Mote to Refresh Battery Power On-the-Fly 一种传感器网络寿命最大化的新算法及使用m²-Mote动态更新电池电量
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072100
O. Adeluyi, S. Moh, Jeong-A Lee
{"title":"A Novel Algorithm for Maximizing the Lifetime of Sensor Networks and the Use of an m²-Mote to Refresh Battery Power On-the-Fly","authors":"O. Adeluyi, S. Moh, Jeong-A Lee","doi":"10.1109/INFCOMW.2009.5072100","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072100","url":null,"abstract":"In this paper we present a novel algorithm that significantly improves the efficiency of wireless sensor networks, while providing a low and stable energy consumption profile irrespective of the number of nodes. We also present a modified-mica Mote (m2-Mote) that uses a rectenna to produce dc-power from scavenged RF-energy for charging the node batteries. From our analysis and simulation of a 500node network with one sink node, we found that our approach results in 99% reduction in the amount of energy consumed with the addition of each new node to the sensor network when compared with LEACH. Similarly, it doubles the average lifespan of LEACH based networks and gives more than five times the average lifetime of networks based on direct communication.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"80 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":"126204600","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
Assortative Mixing in BitTorrent-Like Networks 类bittorrent网络中的分类混合
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072115
Fabricio Murai, Daniel R. Figueiredo
{"title":"Assortative Mixing in BitTorrent-Like Networks","authors":"Fabricio Murai, Daniel R. Figueiredo","doi":"10.1109/INFCOMW.2009.5072115","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072115","url":null,"abstract":"In this work, we propose a simple model to understand the mechanisms within the BitTorrent protocol that are responsible for driving the system into high levels of AM. Using the model, we investigate the influence that system parameters have on the emergence AM. In particular, we show that the \"optimistic unchoke\" mechanism of BitTorrent plays a major role in this process.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"58 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":"128924016","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
Selective Packet Discard in Mobile Video Delivery Based on Macroblock-Based Distortion Estimation 基于宏块失真估计的移动视频传输选择性丢包
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072185
M. Schier, M. Welzl
{"title":"Selective Packet Discard in Mobile Video Delivery Based on Macroblock-Based Distortion Estimation","authors":"M. Schier, M. Welzl","doi":"10.1109/INFCOMW.2009.5072185","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072185","url":null,"abstract":"Mobile devices are often characterized by their relatively low processing power. Applications running on these devices should therefore avoid heavy computations in order to save valuable battery lifetime. We present a selective packet discard scheme for streaming video which does not need receiver-side calculations, therefore perfectly satisfying this constraint in many common scenarios (e.g. Mobile IPTV). Decisions are made by the sender, based on a distortion estimation performed at the macroblock level. Our estimation procedure only requires superficial decoding of the video bitstream and takes important indicators like macroblock composition of frames, temporal dependencies and potential scene cuts into account. Experiments show that a considerable increase of perceived video quality by an average of 3 to 4dB in terms of PSNR compared to frame-level estimation methods can be achieved.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"6 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":"131533214","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}
引用次数: 11
LORD: A Locality-Based Distributed Data Sharing System for Highly Dense and Dynamic MANETs 基于位置的高密度动态manet分布式数据共享系统
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072160
Ze Li, Haiying Shen
{"title":"LORD: A Locality-Based Distributed Data Sharing System for Highly Dense and Dynamic MANETs","authors":"Ze Li, Haiying Shen","doi":"10.1109/INFCOMW.2009.5072160","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072160","url":null,"abstract":"The rapid development of mobile communication techniques enables mobile video-on-demand and video sharing applications, which allow the sharing of video data among mobile handset users and vehicles whenever and wherever. These applications have been penetrating into our daily life with dramatic speed. Traditional video sharing systems built on infrastructure wireless networks suffer from the problems of single point of failure, hot spots, and low-scalable transmission. Mobile Ad Hoc Network (MANET) consisting of mobile nodes is a promising alternative structure for flexible and distributed video data sharing without central control. This paper presents a locality-based video sharing system for highly dense and dynamic MANET, namely LORD. LORD provides a series of protocols about region-based video centric storage and retrieval, which can provide highly efficient, scalable and dynamism-resilient video sharing services with low overhead. Simulation results are provided to show the superiority of LORD.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"24 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":"132010779","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
Modeling Unavailability in Peer-to-Peer Systems 点对点系统中的建模不可用性
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072166
D. Menasché, Antonio A. de Aragao Rocha, Bin Li, D. Towsley, A. Venkataramani
{"title":"Modeling Unavailability in Peer-to-Peer Systems","authors":"D. Menasché, Antonio A. de Aragao Rocha, Bin Li, D. Towsley, A. Venkataramani","doi":"10.1109/INFCOMW.2009.5072166","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072166","url":null,"abstract":"In this paper we model peer-to-peer systems where content may become unavailable. First, using Markov Chains we capture the impact of parameters such as the server upload rate and the popularity of the files on the performance of the system. Then, we show the applicability of our model to the problem of optimal bundling. Bundling files together, rather than disseminating them separately, is a possible solution to improve availability in BitTorrent.","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":"131214756","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
Network Coding in Ad Hoc Networks: A Realistic Simulation Study 网络编码在Ad Hoc网络:一个现实的仿真研究
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072168
Saed Tarapiah, C. Casetti, C. Chiasserini
{"title":"Network Coding in Ad Hoc Networks: A Realistic Simulation Study","authors":"Saed Tarapiah, C. Casetti, C. Chiasserini","doi":"10.1109/INFCOMW.2009.5072168","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072168","url":null,"abstract":"In this paper, we evaluate the impact of random linear network coding, in a realistic ad hoc network environment through the network simulator ns-2. Using a realistic MAC layer, we observe the effects of packets loss and propagation delay on network coding. Next, we compare the performance of broadcasting based on network coding with that of two simpler schemes, namely flooding-based and deferred broadcasting.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"31 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":"127212872","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
A Learning-Based Channel Allocation Protocol for Multi-Radio Wireless Mesh Networks 一种基于学习的多无线网状网络信道分配协议
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072098
Sofia Pediaditaki, M. Marina
{"title":"A Learning-Based Channel Allocation Protocol for Multi-Radio Wireless Mesh Networks","authors":"Sofia Pediaditaki, M. Marina","doi":"10.1109/INFCOMW.2009.5072098","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072098","url":null,"abstract":"We propose a novel approach to distributed multi-radio channel allocation that is based on learning and a protocol following this approach (termed LCAP). Each node in LCAP independently and iteratively learns the channel allocation using a probabilistic adaptation algorithm that ensures network connectivity while reducing interference. Key enabler of the proposed approach is a novel neighbor discovery mechanism that exploits the mesh network deployment model in practice while being compliant to the 802.11 standard. LCAP addresses the limitations of prior work by not placing any restriction on network structure or traffic patterns, while being localized and negotiation-free for scalable operation.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"27 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":"127337071","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
GMPLS-Based Optical Circuit Switch with Neighbor Auto-Discovery Mechanism 基于gmpls的具有邻居自动发现机制的光电路交换机
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072150
K. Shiomoto, K. Shimizu, R. Hayashi, I. Inoue
{"title":"GMPLS-Based Optical Circuit Switch with Neighbor Auto-Discovery Mechanism","authors":"K. Shiomoto, K. Shimizu, R. Hayashi, I. Inoue","doi":"10.1109/INFCOMW.2009.5072150","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072150","url":null,"abstract":"We propose an optical circuit switching node architecture with automatic neighbor discovery. It implements a trunk module attached to an all optical switching element, which exchanges test messages with neighbor nodes to identify interface addresses of wavelength links of neighbor nodes. By employing a method called \"random connection\", we completely avoid manual configuration tasks. By developing an analytical model to evaluate the time to finish identifying the interface addresses, we confirmed that automatic neighbor discovery is performed within tens of second assuming a slot is 100 ms in the switch node with twenty of ports, which requires much less time to configure interface addresses of wavelength link than manual tasks.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"2012 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":"121507193","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学术官方微信