{"title":"NODRoP, Nature Optimized Deferred Routing Protocol","authors":"David Palma, M. Curado","doi":"10.1109/INFCOMW.2009.5072169","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072169","url":null,"abstract":"An innovative and scalable routing scheme for Mobile Ad-hoc Networks (MANETs) is proposed, taking into account aspects such as Quality of Service (QoS) and Resiliency. These issues are tackled by using a robust routing scheme in conjunction with a dynamic cell deferred routing strategy. This approach consists in dividing the network into cells which maintain different and sufficient topology views, complementing each others. Such organization of the network in clusters, or cells, improves the overall scalability of the network routing protocol. A complexity analysis of the proposal reveals that it is feasible to achieve constant routing complexity for each cell, suggesting the possibility of the dissemination of Ad-hoc networks between a large number of devices.","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":"129425534","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":"The Case of a Precognition Optical Packet Switch","authors":"S. Suryaputra, J. Touch, J. Bannister","doi":"10.1109/INFCOMW.2009.5072196","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072196","url":null,"abstract":"This paper describes simulation analysis of an optical packet switch that has a limited capability to \"see\" packets that have not yet arrived at the input port. The goal of the effort is to design a variable-length optical packet switch without random access buffering. Relying on this future information, the switch tries to maximize the number of bytes switched. While we found that this optimization does not improve the throughput significantly, we are currently studying improvements of this architecture that hold greater promise.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"476 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":"126396823","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":"Communities of Interest for Internet Traffic Prioritization","authors":"Andrew J. Kalafut, J. van der Merwe, Minaxi Gupta","doi":"10.1109/INFCOMW.2009.5072118","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072118","url":null,"abstract":"Communities of Interest (COI) have been studied in the past to classify traffic within an enterprise network, and to mitigate denial-of-service (DoS) attacks. We investigate the use of Communities of Interest (COIs) to prioritize known good traffic on the Internet. Under our system, an ISP may construct a COI for each of its enterprise customers. The COI would contain entities which have previously had good communications with the customer. These COIs could then be used in combination with traffic differentiating mechanisms during periods of heavy traffic in order to prioritize traffic from communicating entities known to be good. We show that it is possible to construct an effective COI from information which would be available to an ISP about its customers, specifically sampled Netflow data. We investigate various heuristics to determine which flows actually represent good traffic whose endpoint should be inserted into the COI, and show that our heuristics are effective in differentiating wanted and unwanted traffic.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"284 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":"133988578","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":"Advanced Multimedia Search in P2P Overlays","authors":"M. Grega","doi":"10.1109/INFCOMW.2009.5072108","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072108","url":null,"abstract":"This paper presents the ongoing PhD work in the cross-domain area of P2P networking and advanced multimedia search methods. The author identifies and solves the problems encountered during the application of Query by Example search technique in structured and unstructured P2P overlays. A set of benchmarking methods as well as the results of large scale user tests are presented.","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":"130710464","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":"Near-Deterministic Inference of AS Relationships","authors":"Udi Weinsberg, Y. Shavitt, Eran Shir","doi":"10.1109/INFCOMW.2009.5072167","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072167","url":null,"abstract":"This paper aims to improve on existing methods by providing a near-deterministic inference scheme (ND-ToR ) for solving the ToR problem. The input for ND-ToR is the Internet Core, a sub-graph that consists of the globally top-level providers of the Internet and their interconnecting links with their already inferred relationship types. Theoretically, given an accurately classified core, the algorithm deterministically infers most of the remaining AS relationships using the AS-level paths relative to this core, without incurring additional inference errors. In real-world scenarios, where the core and AS-level paths can contain errors (due to misconfigurations or measurements mistakes), the algorithm introduces minimal inference mistakes. We show that ND-ToR has relaxed requirements from the core, and proves to be robust under changes in its definition, size and density.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"515 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":"132897565","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 Measurement of Complex Networks Using Link Queries","authors":"Fabien Tarissan, Matthieu Latapy, C. Prieur","doi":"10.1109/INFCOMW.2009.5072135","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072135","url":null,"abstract":"Complex networks are at the core of an intense research activity. However, in most cases, intricate and costly measurement procedures are needed to explore their structure. In some cases, these measurements rely on link queries: given two nodes, it is possible to test the existence of a link between them. These tests may be costly, and thus minimizing their number while maximizing the number of discovered links is a key issue. This paper studies this problem: we observe that properties classically observed on real-world complex networks give hints for their efficient measurement; we derive simple principles and several measurement strategies based on this, and experimentally evaluate their efficiency on real-world cases. In order to do so, we introduce methods to evaluate the efficiency of strategies. We also explore the bias that different measurement strategies may induce.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"121 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":"131447663","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 Control Theoretic Framework for Performance Optimization of IEEE 802.11 Networks","authors":"P. Patras, A. Banchs, P. Serrano","doi":"10.1109/INFCOMW.2009.5072094","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072094","url":null,"abstract":"In this paper we propose to model the behavior of a WLAN from a control theoretic perspective to achieve optimal performance in terms of e.g. throughput or delay. Control theory has been commonly used in industrial applications to provide the analytical tools for the design of closed-loop systems, in order to guarantee stable operation without lessening the ability to react to changes. We therefore propose to model a WLAN as a closed loop, where the controlled system is the wireless network and the controller is a module which adjusts the parameters of the WLAN based on the observed state of the network.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"46 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":"122094103","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}
Priya Mahadevan, P. Sharma, S. Banerjee, Parthasarathy Ranganathan
{"title":"Energy Aware Network Operations","authors":"Priya Mahadevan, P. Sharma, S. Banerjee, Parthasarathy Ranganathan","doi":"10.1109/INFCOMW.2009.5072138","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072138","url":null,"abstract":"Networking devices today consume a non-trivial amount of energy and it has been shown that this energy consumption is largely independent of the load through the devices. With a strong need to curtail the rising operational costs of IT infrastructure, there is a tremendous opportunity for introducing energy awareness in the design and operation of enterprise and data center networks. We focus on these networks as they are under the control of a single administrative domain in which network-wide control can be consistently applied. In this paper, we describe and analyze three approaches to saving energy in single administrative domain networks, without significantly impacting the networks' ability to provide the expected levels of performance and availability. We also explore the trade-offs between conserving energy and meeting performance and availability requirements. We conduct an extensive case study of our algorithms by simulating a real Web 2.0 workload in a real data center network topology using power characterizations that we obtain from real network hardware. Our results indicate that for our workload and data center scenario, 16% power savings (with no performance penalty and small decrease in availability) can be obtained merely by appropriately adjusting the active network elements (links). Significant additional savings (up to 75%) can be obtained by incorporating network traffic management and server workload consolidation.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"7 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":"124077743","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":"Context-Based Name Resolution Service for the Next-Generation Internet","authors":"R. Villaça, F. Verdi, M. Magalhães","doi":"10.1109/INFCOMW.2009.5072121","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072121","url":null,"abstract":"With the advent of new communication technologies and the ubiquity of wireless networks, computing devices have become portable and mobile, increasing the need to interconnect them. The new generation of applications tend to be ubiquitous and context-aware. In the current Internet, the existing name resolution service, the DNS, has a key role, since most of the applications make use of a name resolution to obtain the IP address of a host. However, it is proven that the DNS does not adequately support the requirements of the new generation of applications. This paper presents an architecture for a context-based name resolution service, along with a review of its main concepts and related works.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"35 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":"125769425","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}
Changhua Sun, Chengchen Hu, Yachao Zhou, Xin Xiao, B. Liu
{"title":"A More Accurate Scheme to Detect SYN Flood Attacks","authors":"Changhua Sun, Chengchen Hu, Yachao Zhou, Xin Xiao, B. Liu","doi":"10.1109/INFCOMW.2009.5072099","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072099","url":null,"abstract":"We propose to use the SYN/ACK-CliACK pair's behavior to detect the various SYN flood attacks more accurately. The SYN/ACK packets carry the full information of the TCP connections and it is impossible for the attacker to evade the detection by spoofing the control packets. Moreover, we use a space efficient data structure, counting Bloom filter, to recognize the CliACK packet and the memory cost is 2 MB even for 10 Gbps link speeds. We need to fully compare our scheme with the existing detection mechanisms in future.","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":"130500252","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
