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

IEEE INFOCOM Workshops 2009最新文献

筛选
英文 中文
Denial of Service Attacks in Networks with Tiny Buffers 小缓冲区网络中的拒绝服务攻击
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072124
V. Havary-Nassab, A. Koulakezian, Y. Ganjali
{"title":"Denial of Service Attacks in Networks with Tiny Buffers","authors":"V. Havary-Nassab, A. Koulakezian, Y. Ganjali","doi":"10.1109/INFCOMW.2009.5072124","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072124","url":null,"abstract":"Recently, several papers have studied the possibility of shrinking buffer sizes in Internet core routers to just a few dozen packets under certain constraints. If proven right, these results can open doors to building all-optical routers, since a major bottleneck in building such routers is the lack of large optical memories. However, reducing buffer sizes might pose new security risks: it is much easier to fill up tiny buffers, and thus organizing Denial of Service (DoS) attacks seems easier in a network with tiny buffers. To the best of our knowledge, such risks have not been studied before; all the focus has been on performance issues such as throughput, drop rate, and flow completion times. In this paper, we study DoS attacks in the context of networks with tiny buffers.We show that even though it is easier to fill up tiny buffers, synchronizing flows is more difficult. Therefore to reduce the network throughput, the attacker needs to utilize attacks with high packet injection rates. Since such attacks are easily detected, we conclude that DoS attacks are in fact more difficult in networks with tiny buffers.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"8 s4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120858163","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
From Network Microeconomics to Network Infrastructure Emergence 从网络微观经济学到网络基础设施涌现
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072148
V. Marbukh
{"title":"From Network Microeconomics to Network Infrastructure Emergence","authors":"V. Marbukh","doi":"10.1109/INFCOMW.2009.5072148","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072148","url":null,"abstract":"This paper suggests that evolutionary models of network infrastructure in market economy can be derived from the underlying selfish behavior of users and providers of network services in the same way as non-equilibrium thermodynamics is derived from the underlying statistical physics of interacting particles. This approach may be useful for overcoming restrictions of existing models failing to account for the effect of the details of user/provider selfish behavior on the infrastructure evolutionary path. Network security considerations may be a part of this user/provider behavior. Our main assumption is that \"almost perfect competition\" keeps the system close to the \"social optimum\".","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"61 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":"124783085","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
Improving QoS in Wireless Sensor Networks through Adaptable Mobile Agents 利用自适应移动代理提高无线传感器网络的QoS
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072153
Igor M. B. Spadoni, R. B. Araujo, Cesar Marconde
{"title":"Improving QoS in Wireless Sensor Networks through Adaptable Mobile Agents","authors":"Igor M. B. Spadoni, R. B. Araujo, Cesar Marconde","doi":"10.1109/INFCOMW.2009.5072153","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072153","url":null,"abstract":"This paper describes our ongoing work on a novel data dissemination protocol that adds autonomic features to Wireless Sensor Networks (WSN) for emergency management applications. In our solution, adaptable mobile agents are used to carry out data collection, fusion and delivery of information. The key features of these agents are their novel dynamic addressing scheme and their flexibility to behavior and structure changes that can guarantee the application required quality of service in harsh conditions, such as in fire situations.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"65 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":"115867644","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 Encoding Method to Signal 3 States with a Single PCN Bit 一种用单个PCN位表示3种状态的编码方法
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072110
M. Arumaithurai, Ruediger Geib, Rene Rex, Xiaoming Fu
{"title":"An Encoding Method to Signal 3 States with a Single PCN Bit","authors":"M. Arumaithurai, Ruediger Geib, Rene Rex, Xiaoming Fu","doi":"10.1109/INFCOMW.2009.5072110","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072110","url":null,"abstract":"Pre-Congestion Notification (PCN) is currently being developed by the IETF to provide admission control in DiffServ networks for non-elastic flows. Various marking schemes are being proposed as part of this effort. We evaluate a new marking behaviour that could be used to signal three different states by means of a single bit. This scheme is of interest to networks operating with MPLS as the Label QoS coding space is limited to three EXP bits. Similar to the ECN standard for MPLS, this research assumes that just two codepoints will be available to indicate different congestion states. Of these two codepoints, one would be used to differentiate between PCN and non-PCN traffic and the other would be used for PCN marking. This paper outlines the approach and presents the advantages and limitations of the proposal using the evaluations performed. A comparison of the method with a two bit PCN marking approach is also studied.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"2001 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":"131362326","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
Detecting Spammers and Content Promoters in Online Video Social Networks 在线视频社交网络检测垃圾邮件发送者和内容推广者
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1145/1571941.1572047
Fabrício Benevenuto, Tiago Rodrigues, Virgílio A. F. Almeida, J. Almeida, Marcos André Gonçalves
{"title":"Detecting Spammers and Content Promoters in Online Video Social Networks","authors":"Fabrício Benevenuto, Tiago Rodrigues, Virgílio A. F. Almeida, J. Almeida, Marcos André Gonçalves","doi":"10.1145/1571941.1572047","DOIUrl":"https://doi.org/10.1145/1571941.1572047","url":null,"abstract":"A number of online video social networks, out of which YouTube is the most popular, provides features that allow users to post a video as a response to a discussion topic. These features open opportunities for users to introduce polluted content, or simply pollution, into the system. For instance, spammers may post an unrelated video as response to a popular one aiming at increasing the likelihood of the response being viewed by a larger number of users. Moreover, opportunistic users--promoters--may try to gain visibility to a specific video by posting a large number of (potentially unrelated) responses to boost the rank of the responded video, making it appear in the top lists maintained by the system. Content pollution may jeopardize the trust of users on the system, thus compromising its success in promoting social interactions. In spite of that, the available literature is very limited in providing a deep understanding of this problem. In this paper, we go a step further by addressing the issue of detecting video spammers and promoters. Towards that end, we manually build a test collection of real YouTube users, classifying them as spammers, promoters, and legitimates. Using our test collection, we provide a characterization of social and content attributes that may help distinguish each user class. We also investigate the feasibility of using a state-of-the-art supervised classification algorithm to detect spammers and promoters, and assess its effectiveness in our test collection. We found that our approach is able to correctly identify the majority of the promoters, misclassifying only a small percentage of legitimate users. In contrast, although we are able to detect a significant fraction of spammers, they showed to be much harder to distinguish from legitimate users.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"61 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":"123517604","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}
引用次数: 246
Problems with Providing QoS in EDCA Ad-Hoc Networks with Hidden and Exposed Nodes 具有隐藏和暴露节点的EDCA Ad-Hoc网络中提供QoS的问题
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072178
K. Kosek
{"title":"Problems with Providing QoS in EDCA Ad-Hoc Networks with Hidden and Exposed Nodes","authors":"K. Kosek","doi":"10.1109/INFCOMW.2009.5072178","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072178","url":null,"abstract":"In this paper we investigate the problem of providing QoS within IEEE 802.11 EDCA ad-hoc networks. Our study shows that a strong unfairness in medium access between certain nodes may appear. It also shows that the possible unfairness is dependent on the actual placement of nodes. Furthermore, the inability of the four-way handshake mechanism to improve the performance of the analyzed networks is also mentioned. Finally, in the paper we indicate the need of proposing both a new MAC layer protocol and a valid EDCA analytical model including hidden nodes.","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":"124608005","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
Enhancements of WLAN MAC Performance WLAN MAC性能的增强
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072140
Lei Zhang, P. Sénac, M. Diaz
{"title":"Enhancements of WLAN MAC Performance","authors":"Lei Zhang, P. Sénac, M. Diaz","doi":"10.1109/INFCOMW.2009.5072140","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072140","url":null,"abstract":"The real potential of broadband wireless networks lies on the mobility, the success of Wi-Fi network with IEEE 802.11x technology makes it possible to access broadband with low cost. Numerous research work have focused on several issues inherited from the wireless technology such as security, reliability, transmission rate, etc. However, if we take a closer look at the core feature of 802.11, the contention based CSMA/CA access method, three intrinsic problems can be still identified: 1) Performance degradation due to the lack of flow control between the MAC and upper layer resulting in potential MAC buffer overflow; 2) Unfair bandwidth share issues; 3) 802.11 Performance Anomaly. In this paper, based on the 802.11 MAC layer analytical model, we give a brief description on our cross layer based solutions to the mentioned problems. The preliminary results from the simulation and experiments have demonstrated the feasibility of our proposals. Real deployment is planned in our future work.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"16 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":"121776427","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
DMRC: Dissemination of Multimedia in Vehicular Networks Using Rateless Codes 在车载网络中使用无速率码的多媒体传播
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072132
Mohsen Sardari, F. Hendessi, F. Fekri
{"title":"DMRC: Dissemination of Multimedia in Vehicular Networks Using Rateless Codes","authors":"Mohsen Sardari, F. Hendessi, F. Fekri","doi":"10.1109/INFCOMW.2009.5072132","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072132","url":null,"abstract":"In this paper, we address the problem of delivering multimedia content to a sparse vehicular network from roadside infostations, using efficient vehicle-to-vehicle collaboration. Due to the highly dynamic nature of the underlying vehicular network topology, we depart from architectures requiring centralized coordination, reliable MAC scheduling, or global network state knowledge, and instead adopt a distributed paradigm with simple protocols. In other words, we investigate the problem of reliable dissemination from multiple sources when each node in the network shares a limited amount of its resources for cooperating with others. By using rateless coding at the Road Side Unit (RSU) and using vehicles as data carriers, we describe an efficient way to achieve reliable dissemination to all nodes (even disconnected clusters in the network). In the nutshell, we explore vehicles as mobile storage devices. We then develop a method to keep the density of the rateless coded packets as a function of distance from the RSU at the desired level set for the target decoding distance. We investigate various tradeoffs involving buffer size, maximum capacity, and the mobility parameter of the vehicles.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"16 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":"122520626","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}
引用次数: 39
A Walkable Kademlia Network for Virtual Worlds 虚拟世界的步行卡德米亚网络
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072106
Matteo Varvello, C. Diot, E. Biersack
{"title":"A Walkable Kademlia Network for Virtual Worlds","authors":"Matteo Varvello, C. Diot, E. Biersack","doi":"10.1109/INFCOMW.2009.5072106","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072106","url":null,"abstract":"In this work, we design and evaluate Walkad, a P2P architecture for the management of range queries in virtual worlds. We design Walkad as an extension of Kademlia, a very popular DHT successfully adopted in eMule. Walkad organizes the Kademlia keyspace in a reverse binary trie, i.e., a tree-based data structure where nodes of each level of the tree are labeled using the Gray Code.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"45 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":"117139514","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}
引用次数: 17
Rate Adaptation for Conversational 3G Video 会话3G视频的速率适应
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072183
Varun Singh, J. Ott, I. Curcio
{"title":"Rate Adaptation for Conversational 3G Video","authors":"Varun Singh, J. Ott, I. Curcio","doi":"10.1109/INFCOMW.2009.5072183","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072183","url":null,"abstract":"Wireless cellular environments, such as UMTS, are often affected by congestion and errors, which are inherent to wireless transmission channels due to fading, interference, resource scarcity, mobility, etc. For a conversational video application to be successful i.e., to provide good viewing quality to the receiver at all times, the sender must be able to quickly adapt its sending/encoding rate (and other related parameters) to that offered by the link. Moreover, for a rate adaptation scheme to be successful, the receiver must provide timely feedback in order to mitigate further losses due to congestion. In this paper, we investigate different rate adaptation mechanisms and redefine them for 3GPP networks, reusing existing RTCP extensions standardized in the IETF and in 3GPP where possible.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"88 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":"129658010","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}
引用次数: 46
首页 上一页 下一页 尾页
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学术官方微信