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

{"title":"Service-oriented MPLS network management in a virtual networking environment","authors":"B. Thurm, M. Hennig","doi":"10.1109/ICCCN.2003.1284209","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284209","url":null,"abstract":"Using XML-based Web services for network management purposes gains more and more attention as the underlying principles seem to be highly appropriate for developing efficient and interoperable management systems. Hereby, a major advantage is the standard, XML-based way of accessing, finding, and defining management functionality in a distributed, Web-based environment. In this context, the following paper presents a novel management interface allowing to control MPLS (multiprotocol label switching) devices via Web service calls. Moreover, a novel virtual networking environment based on UML (user-mode Linux) is presented which can be used to establish comprehensive network scenarios efficiently without using dedicated hardware.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"66 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":"126207948","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":"Single and multipath logical topology design and traffic grooming algorithm in IP over WDM networks","authors":"Kwangil Lee, M. Shayman","doi":"10.1109/ICCCN.2003.1284150","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284150","url":null,"abstract":"In this paper we investigate single- and multipath logical topology design and traffic grooming algorithms. Since the problem of the optimal logical topology design for all traffic demands is NP-complete, we design a logical topology by sequentially constructing the shortest path for one source-destination pair at a time. In the single path case, the demand for each source-destination pair must be routed on a single path. In the multipath case, if it is not feasible to route a demand on a single path, the traffic demand is divided into multiple subdemands and a path is provided for each subdemand. Each path is a locally optimized path in the sense that there are no other paths with less hop count that may be constructed from existing links and newly created links. We propose heuristic algorithms for logical topology design and traffic grooming in both the single path and multipath cases. The performance of these algorithms in terms of weighted hop count and throughput is evaluated using the GLASS/SSF simulator. The results indicate that a proposed single path algorithm outperforms other known algorithms in terms of weighted hop count and throughput. Also, we observed that multipath algorithms improve network throughput and a multipath algorithm with widest-shortest paths reduces the weighted hop count compared to single path algorithms.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"71 s300","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113953543","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":"MAPS - a generalized scheme for quality of service routing under delay-bandwidth constraints","authors":"Lei Zhang, J. Muppala, S. Chanson","doi":"10.1109/ICCCN.2003.1284214","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284214","url":null,"abstract":"In this paper we present a generalized scheme for quality of service routing with both delay and bandwidth constraints using a delay weighted flow approach. The objective is to minimize call blocking probability. A request is routed along the path capable of supporting the required quality of service and which most preserves the routing ability of the network for future requests. A general mathematical model has been formulated to solve this problem. Simulation results show that the proposed scheme outperforms existing schemes.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"43 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":"116781895","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":"Web server performance in a WAN environment","authors":"Vsevolod Panteleenko, V. Freeh","doi":"10.1109/ICCCN.2003.1284195","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284195","url":null,"abstract":"This paper analyzes web server performance under simulated WAN conditions. The workload simulates many critical network characteristics, such as network delay, bandwidth limit for client connections, and small MTU sizes to dial-up clients. A novel aspect of this study is the examination of the internal behavior of the web server at the network protocol stack and the device driver. We discovered that WAN network characteristics may significantly change the behavior of the web server compared to LAN-based simulations and may make many of optimizations of server design irrelevant in this environment. Particularly, we found that the small MTU size of the dial-up or wireless user connections can increase the processing overhead several times.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"22 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":"131464578","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 random graph approach for multicast scheduling and performance analysis","authors":"Guowen Han, Yuanyuan Yang","doi":"10.1109/ICCCN.2003.1284181","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284181","url":null,"abstract":"In this paper, we consider scheduling in multicast switching networks, which aims to minimize the multicast latency for a set of multicast requests. Such a problem has been proved to be NP-complete. We propose a simple, fast greedy multicast scheduling algorithm and derive a lower bound and an upper bound on the performance of the algorithm. As can be seen, while a lower bound is fairly straightforward, the upper bound is much more difficult to obtain. By translating the multicast scheduling problem into a graph theory problem and employing a random graph approach, we are able to obtain a probabilistic upper bound on the performance of the multicast scheduling algorithm. Our analytical and simulation results show that the performance of the proposed multicast scheduling algorithm is quite close to the lower bound and is statistically guaranteed by the probabilistic upper bound.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"4 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":"127927025","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":"Robust sensor localization algorithm in wireless ad-hoc sensor networks","authors":"Xiang Ji, H. Zha","doi":"10.1109/ICCCN.2003.1284219","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284219","url":null,"abstract":"Wireless ad-hoc sensor networks are being developed to collect data across the area of deployment. To stamp the collected data and facilitate communication protocols, it is necessary to identify the location of each sensor. Most existing localization algorithms make use of trilateration or multilateration based on range measurements obtained from RSSI, TOA, TDOA and AoA. In the paper, we first study some situations that most existing sensor localization methods fail to perform well. An example of such situations is when the topology of a sensor network is anisotropic. We propose a distributed sensor localization method with estimation-comparison-correction paradigm to address these conditions. In detail, multidimensional scaling (MDS) technique is applied to recover a series of local maps for adjacent sensors in two (or three) dimensional space. The maps along the route from an anchor to another anchor are stitched together to estimate the sensors' physical locations. Then, the estimated anchor locations are compared with the anchors' physical locations for correction, and estimated sensor locations are corrected at the same time to approximate their physical locations. By iterative estimation, comparison, and correction, the method reduces sensor localization errors caused by anisotropic network topology and complex terrain, which were seldom addressed in previous research.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"26 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":"134171075","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":"BEAM: a framework for bridge negotiation in Bluetooth scatternets","authors":"R. Duggirala, R. L. Ashok, D. Agrawal","doi":"10.1109/ICCCN.2003.1284191","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284191","url":null,"abstract":"Bluetooth is a short-range wireless technology designed to connect various low power, resource constrained devices such as cameras, cell-phones, laptops, handhelds, etc. Devices form autonomous ad hoc networks of up to 8 active devices, referred to as piconets. Piconets may be inter-connected by one or more bridge devices to form a scatternet. The Bluetooth specification is very clear about piconet formation, maintenance, operation and termination, but only mentions the concept of a scatternet. The bridges are the most important part of the scatternet as they bear the responsibility of a switch -relaying traffic from one piconet to another. Generally, the implicit assumption made is that the bridge already exists or that the bridge can be formed in some manner. However, the issues surrounding the bridge are complex and involve the masters of more than one piconet. In this paper we propose a framework - the bridge establishment, adaptation and maintenance (BEAM) - for bridge formation, maintenance, negotiation and termination. We have enunciated the mechanisms by which a node may be made a bridge and how it may be used to add or replace subsequent bridges. The framework has been designed to be flexible so that, it may be used by any of the scatternet formation or performance improvement algorithms. It is a logical step absolutely necessary for real world Bluetooth scatternet working and is simply an enabling mechanism to be used in conjunction with other protocols. It is presented in the form of a design specification or a protocol that may be customized by different implementers, and yet maintain a very high degree of interoperability.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"51 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":"114482305","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 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":"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}