{"title":"Source-end DDoS defense","authors":"J. Mirkovic, G. Prier, P. Reiher","doi":"10.1109/NCA.2003.1201153","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201153","url":null,"abstract":"A successful source-end DDoS (distributed denial-of-service) defense enables early suppression of the attack and minimizes collateral damage. However, such an approach faces many challenges: (a) distributing the attack hinders detection; (b) defense systems must guarantee good service to legitimate traffic during the attack; and (c) deployment costs and false alarm levels must be sufficiently small and effectiveness must be high to provide deployment incentive. We discuss each of the challenges and describe one successful design of a source-end DDoS defense system-the D-WARD system. D-WARD was implemented in a Linux router. We include experimental results to illustrate D-WARD's performance.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124217433","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":"High speed system area networks (InfiniBand). challenges and solutions","authors":"D. Cassaday, K. Dierling, I. Colloff, D. García","doi":"10.1109/NCA.2003.1201159","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201159","url":null,"abstract":"Key issues/challenges/questions effecting IB and its adoption: • How will IB play with other IO interconnect and networking technologies (pcix, pci2.0, pciexpress, ethernet, fibre channel) • What role will IB play in future data centers. • What are IBs strengths and weaknesses compared to other interconnect technologies. • Why is the IB architecture so complex? • Some segments of the HPC community are interested in very large clusters (256 nodes and above). Are their special challenges building such clusters and how is the InfiniBand community addressing these?","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132265925","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":"Transparent distributed redirection of HTTP requests","authors":"A. Baggio, M. V. Steen","doi":"10.1109/NCA.2003.1201133","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201133","url":null,"abstract":"Replication in the World-Wide Web covers a wide range of techniques. Often, the redirection of a client browser towards a given replica of a Web page has to be explicit and is performed after the client's request has reached the Web server storing the requested page. As an alternative, we propose to perform the redirection as close to the client as possible in a fully distributed manner Distributed redirection ensures that we find a replica wherever it is stored and that the closest possible replica is always found first. By exploiting locality, we can keep latency low.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130901560","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":"Reducing the reservation establishment time in IP tunnels by using staged refresh timers","authors":"Paulo Cesar S. Vidal, O. Duarte","doi":"10.1109/NCA.2003.1201180","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201180","url":null,"abstract":"This paper presents a state aggregation mechanism of the RSVP protocol for multicast flows using IP-in-IP tunneling. The mechanism relies on periodic refresh messages between routers to maintain the reservation states (soft-state approach). Because of the loss of tunnel RSVP messages, the mechanism presents a very long latency at reservation establishment. The problem reduces the performance of multimedia applications. We report the use of staged refresh timers in the aggregation mechanism at the set-up procedure of the resource reservation. The simulation results show a significant decrease of the establishment time of multicast sessions.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132344415","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":"Group communication based on standard interfaces","authors":"M. Wiesmann, X. Défago, A. Schiper","doi":"10.1109/NCA.2003.1201148","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201148","url":null,"abstract":"While group communication systems have been proposed for some time, they are still not used much in actual systems. We believe that one reason for this is the lack of standardisation of group communication system interfaces. The paper proposes an architecture, using the standard decomposition into services, where services are based on standard interfaces: both interactions between services and interactions with the application use existing, open standards. A decomposition of the group communication into services is presented, along with a description of applicable standards. As an example, a group membership service based on the LDAP standard is discussed.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124365170","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}
Jangeun Jun, Pushkin Peddabachagari, Mihail L. Sichitiu
{"title":"Theoretical maximum throughput of IEEE 802.11 and its applications","authors":"Jangeun Jun, Pushkin Peddabachagari, Mihail L. Sichitiu","doi":"10.1109/NCA.2003.1201163","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201163","url":null,"abstract":"The goal of this paper is to present exact formulae for the throughput of IEEE 802.11 networks in the absence of transmission errors and for various physical layers, data rates and packet sizes. Calculation of the throughput is more than a simple exercise. It is a mandatory part of provisioning any system based on 802.11 technology (whether in ad-hoc or infrastructure mode). We will discuss the practical importance of theoretical maximum throughput and present several applications.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127780033","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":"Distributed cooperation schemes for document lookup in multiple cache servers","authors":"R. Lancellotti, B. Ciciani, M. Colajanni","doi":"10.1109/NCA.2003.1201136","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201136","url":null,"abstract":"Architectures consisting of multiple cache servers are a popular solution to deal with performance and network resource utilization issues related to the growth of the Web request. Cache cooperation is often carried out through purely hierarchical and flat schemes that suffer from scalability problems when the number of servers increases. We propose, implement and compare the performance of three novel distributed cooperation models based on a two-tier organization of the cache servers. The experimental results show that the proposed architectures are effective in supporting cooperative document lookup and download They guarantee cache hit rates comparable to those of the most performing protocols with a significant reduction of the cooperation overhead Moreover in case of congested network, they reduce the 90-percentile of the system response time up to nearly 30% with respect to the best pure cooperation mechanisms.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126650507","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":"On scalable information retrieval systems","authors":"O. Frieder, D. Grossman, Abdur Chowdhury","doi":"10.1109/NCA.2003.1201162","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201162","url":null,"abstract":"Scalable information retrieval systems are crucial to meeting the growing volumes of data. We describe work done to facilitate scalability by reducing duplication, providing integration with structured data, and supporting integration and question answering via an intranet mediator. All examples given are taken directly from prior and on-going efforts in the IIT Information Retrieval Laboratory in collaboration with AOL and NCR.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123980068","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}