Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)最新文献

{"title":"A transparent framework for enabling incoming TCP connections to hosts behind a NAT gateway","authors":"Vinay S. Pai, P. Rana","doi":"10.1109/ICCCN.2003.1284226","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284226","url":null,"abstract":"This paper proposes a transparent and dynamic system to enable incoming TCP connections to hosts behind a NAT gateway without changes to client applications. We achieve this transparency with a daemon monitoring the gateway and modifications to the TCP/IP stack only on clients that need to receive incoming connections. Thus, we separate the issues of fire walling from address space conservation by allowing multiple hosts to be multiplexed onto a single IP address without affecting bidirectional connectivity.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125577705","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":"Analysis and improvement on IPSec anti-replay window protocol","authors":"F. Zhao, S. F. Wu","doi":"10.1109/ICCCN.2003.1284223","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284223","url":null,"abstract":"The anti-replay sliding window is used in IPSec to resist the replay attack. However, when experiencing the severe packet reordering, IPSec anti-replay sliding window can potentially drop a lot of good but late packets, thus the end-to-end performance is dramatically degraded. In this paper, we rigorously analyze the performance of IPSec anti-replay sliding window under the different reordering models and then come up with a set of robust anti-replay window protocols. The performance and efficiency of each protocol are compared through the simulation. Also we argue that by deploying our new proposal, it is possible to dramatically reduce the overhead of IPSec and save a lot of bandwidth.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130673001","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":"TAN: a packet switched network for VLSI testing","authors":"S. Vengatachalam, M. Nourani, M. Akhbarizadeh","doi":"10.1109/ICCCN.2003.1284233","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284233","url":null,"abstract":"In this paper, we introduce the idea of using packet switched network as the mode of communication between automatic test equipment and the VLSI chip under test in a multisite ATE architecture. We show that our architecture, which we refer to as test area network reduces the complexity and time involved in testing tens of chips at a time. To increase the ATE utilization, we distribute a portion of ATE's task of signature verification to the intelligent test-heads, which are now capable of applying patterns and verifying signatures produced by the chip being tested. Our analysis and empirical results indicate a speed up of 4 to 10 by using existing network infrastructure.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134361049","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 fast ternary CAM design for IP networking applications","authors":"Bruce Gamache, Z. Pfeffer, S. Khatri","doi":"10.1109/ICCCN.2003.1284205","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284205","url":null,"abstract":"In this paper we describe a VLSI implementation and complete circuit design of a fast ternary CAM (TCAM). TCAMs are commonly used to perform routing lookups in the backbone of IP networks and small gateways. Our TCAM is designed to have a greater capacity and speed than any commercial offering at this time. In contrast with existing TCAM approaches, our TCAM allows complete flexibility in the location where any new entry is inserted. This is achieved by a novel longest prefix match (LPM) determination circuit, whose delay increases logarithmically with the number of bits to be looked up. We have implemented our TCAM with 512 bits of prefix entry with 512 bits of destination information, allowing it to implement large address lookups as well as quality of service mechanisms. This would make our TCAM design particularly suitable for IPv6 routing lookup applications. The speed improvement of our TCAM over currently available TCAMs results from various carefully selected VLSI architectural and implementation choices. The TCAM size is 21 Mb and is broken up into a regular grid of 13x13 smaller TCAM blocks for improved speed characteristics. Routing lookup operations use a heavily pipelined approach for maximum throughput, while ensuring a lookup latency of 3 clock cycles. Individual match lines in these blocks are split into 4 sections to reduce RC delay in the lookup process. Our LPM determination circuit is implemented using an efficient wired-NOR circuit for further reduced delay. Sense amplifiers are utilized in the LPM and SRAM sections of the TCAM and are located in the center of each TCAM subblock in order to improve lookup speed. We have implemented and validated our design using state-of-the-art circuit analysis and design tools. We have also generated mask layouts of the entire TCAM design using current layout tools. The complete TCAM circuit design is approximately 18mm on a side, with a total capacity of 21Mb. Our TCAM has an ability to perform routing lookups at a line rate of 76.8Gb/s which is twice as fast as the fastest commercially available TCAM today.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133298300","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":"Multicast loss recovery with active injection","authors":"Jun Peng, B. Sikdar","doi":"10.1109/ICCCN.2003.1284153","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284153","url":null,"abstract":"It is well known that request suppression, local recovery and retransmission scoping are the three crucial elements for scalability and efficiency in multicast loss recovery. None of existing multicast loss recovery schemes can simultaneously have good performance in all the three aspects without introducing significant overhead. The scheme proposed in this paper approaches the multicast loss recovery issue from a new perspective and achieves good performance in all the three aspects with very limited overhead. Our analysis shows that the proposed scheme has a significantly better overall performance as compared to existing schemes.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123967613","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":"Dial-controlled hash: reducing path oscillation in multipath networks","authors":"Minwen Ji","doi":"10.1109/ICCCN.2003.1284168","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284168","url":null,"abstract":"In a multipath network with a naive traffic partitioning scheme, varied packet loss rates as well as varied delays on multiple paths could seriously reduce TCP bandwidth. We propose a scheme, called dial-controlled hash (DCH), for dynamically partitioning traffic flows across multiple paths. DCH allows for fine-grained load balance, minimizes path oscillation for each traffic flow, and does not require per-flow state maintenance or packet tagging. We evaluate DCH in two simulated networks, a parallel link topology and a corporate intranet with trace-based traffic generation. In both simulations, we compare the proposed scheme to a number of alternatives. DCH reduces path oscillation by a factor of 1.6-37 and improves TCP bandwidth by up to 66that, without a good flow partitioning scheme, there is a limit on how much one can save by using low-quality networks in combination with high-quality ones.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114899161","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":"Protocol for peer-to-peer networking in mobile environments","authors":"Rüdiger Schollmeier, I. Gruber, F. Niethammer","doi":"10.1109/ICCCN.2003.1284159","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284159","url":null,"abstract":"Peer-to-Peer (P2P) as well as mobile ad hoc networks (MANETs) follow the same idea of creating a network without the help of central entities. However P2P and MANETs operate on different network layers. A combination of both, creates new services and possibilities, but also faces several problems. Introducing P2P computing in ad-hoc networks without considering the particular requirements of ad hoc networks has a poor performance. This paper addresses these problems and introduces the mobile peer-to-peer protocol (MPP) suite as novel approach. It spans from the network layer to the application layer, and tries to reuse existing protocols as far as possible. MPP allows a realistic operation of Peer-to-Peer services over ad hoc networks. The Peer-to-Peer layer must be well aware about the wireless network to minimize the traffic and to cope with frequent route breaks. Additionally the network layer needs knowledge about the Peer-to-Peer application, in order to establish routes only to appropriate communication partners. MPP thus forms the necessary framework to allow the creation of a vast variety of different services over ad hoc networks.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121491929","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":"Cost-based QoS routing","authors":"Jian Chu, C. Lea, A. Wong","doi":"10.1109/ICCCN.2003.1284213","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284213","url":null,"abstract":"This paper presents cost-based QoS routing and compares its performance with the commonly used widest-shortest-path routing. The advantages of cost-based routing are demonstrated in two major areas. First, it is stable under heavy-loaded conditions. Second, it requires a lower state-update overhead and is more robust to the inaccuracy of state information. The concept presented in the paper can be applied to any reservation-based QoS approach - like IntServ or MPLS type networks.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131692023","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 history-based scheduling protocol for ad hoc networks","authors":"Yu Du, Ye Bao, J. Garcia-Luna-Aceves","doi":"10.1109/ICCCN.2003.1284174","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284174","url":null,"abstract":"This paper presents the history-based scheduling (HBS) protocol for collision-free channel access in ad hoc networks. In HBS, the channel is scheduled based on the history of activity of each node in order to attain higher channel utilization than traditional distributed scheduling schemes based on node activation. Conflict-free access to the channel is determined at each node based on a priority list of the nodes within two hops of each node that takes into account the activity history of each node. To keep the activity history of each node synchronized, a node that is assigned the channel and has no data packet to transmit simply transmits a \"nothing-to-transmit\" (NT) packet in that time slot. In this way, the exchange of the signal packet should be reduced. The throughput and delay characteristics of HBS are compared analytically and by simulation with those of CSMA/CA and the node activation multiple access (NAMA) protocol.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130589973","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":"Achieving delay and throughput decoupling in distributed fair queueing over ad hoc networks","authors":"Jerry Cheng, Songwu Lu","doi":"10.1109/ICCCN.2003.1284173","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284173","url":null,"abstract":"This paper describes an algorithm that achieves delay and throughput decoupling in distributed fair scheduling in multihop ad-hoc wireless networks. The solution allows to support both low-bandwidth, low-delay and high-bandwidth, high delay applications in a single framework, without wasting much bandwidth to realize the low-delay requirement. We demonstrate the effectiveness of our algorithm in servicing various types of applications through ns-2 simulations.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"2019 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122306331","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}