The Experts below are selected from a list of 617304 Experts worldwide ranked by ideXlab platform
Klaus Wehrle - One of the best experts on this subject based on the ideXlab platform.
-
A Performance Comparison of recent network simulators
IEEE International Conference on Communications, 2009Co-Authors: Eduardo Weingartner, Hendrik Vom Lehn, Klaus WehrleAbstract:A widespread methodology for Performance analysis in the field of communication systems engineering is network simulation. While ns-2 has established itself as virtually the standard network simulation tool, other network simulators have gained more and more attention during the last years. In this paper, we briefly survey new developments in the field of network simulation and conduct a Performance Comparison study by implementing an identical simulation set-up in five simulators, namely ns-2, OMNet++, ns-3, SimPy and JiST/SWANS. Our results reveal large differences according to both run-time Performance and memory usage.
-
ICC - A Performance Comparison of Recent Network Simulators
2009 IEEE International Conference on Communications, 2009Co-Authors: Eduardo Weingartner, H. Vom Lehn, Klaus WehrleAbstract:A widespread methodology for Performance analysis in the field of communication systems engineering is network simulation. While ns-2 has established itself as virtually the standard network simulation tool, other network simulators have gained more and more attention during the last years. In this paper, we briefly survey new developments in the field of network simulation and conduct a Performance Comparison study by implementing an identical simulation set-up in five simulators, namely ns-2, OMNet++, ns-3, SimPy and JiST/SWANS. Our results reveal large differences according to both run-time Performance and memory usage.
Lang Tong - One of the best experts on this subject based on the ideXlab platform.
-
A Performance Comparison between ad hoc and centrally controlled CDMA wireless LANs
IEEE Transactions on Wireless Communications, 2002Co-Authors: J.q. Bao, Lang TongAbstract:A Performance Comparison is presented between two types of code-division multiple-access wireless local area networks: centrally controlled and ad hoc networks. Based on a finite-population model, the network throughput, the average packet delay, and the network first exit time are derived for both systems. Two aspects of the Performance Comparison are addressed: (1) the Comparison between the centrally controlled and the ad hoc architecture; and (2) the impact of spreading gain and error control coding on both systems. The efficiency of bandwidth utilization is investigated by normalizing the network Performance with respect to the consumed bandwidth. Evaluations of these Performance Comparisons are also provided.
-
GLOBECOM - A Performance Comparison of CDMA ad-hoc and cellular networks
Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137), 1Co-Authors: J.q. Bao, Lang TongAbstract:A Performance Comparison is presented between two types of CDMA random access systems: cellular and ad hoc. Based on a finite population model, the network throughput is derived for both systems. Two aspects of the Performance Comparison are addressed: (1) the throughput Comparison; and (2) the impact of spreading gain and error control coding on the throughput in both systems. Evaluations of these Performance Comparisons are also provided.
Jong-shik Ha - One of the best experts on this subject based on the ideXlab platform.
-
ICIC (2) - Performance Comparison of SCTP and TCP over linux platform
Lecture Notes in Computer Science, 2005Co-Authors: Jong-shik HaAbstract:Stream Control Transmission Protocol (SCTP) is the third transport layer protocol next to TCP and UDP. The SCTP provides some distinctive features over the TCP. This paper is purposed to compare SCTP and TCP in the Performance perspective. We compare the throughput of SCTP and TCP for the three different test scenarios: the Performance Comparison of SCTP and TCP for the different size of the user input data for the socket system call, the analysis of the fairness under competition of SCTP and TCP traffic, and the Performance Comparison of the SCTP multi-homing and single-homing cases. From the results, it is shown that the SCTP provides better throughput over TCP for a larger user input data. We also see that the SCTP traffic tends to compete fairly with TCP and that the multi-homing SCTP provides better Performance than the single-homing case.
Eduardo Weingartner - One of the best experts on this subject based on the ideXlab platform.
-
A Performance Comparison of recent network simulators
IEEE International Conference on Communications, 2009Co-Authors: Eduardo Weingartner, Hendrik Vom Lehn, Klaus WehrleAbstract:A widespread methodology for Performance analysis in the field of communication systems engineering is network simulation. While ns-2 has established itself as virtually the standard network simulation tool, other network simulators have gained more and more attention during the last years. In this paper, we briefly survey new developments in the field of network simulation and conduct a Performance Comparison study by implementing an identical simulation set-up in five simulators, namely ns-2, OMNet++, ns-3, SimPy and JiST/SWANS. Our results reveal large differences according to both run-time Performance and memory usage.
-
ICC - A Performance Comparison of Recent Network Simulators
2009 IEEE International Conference on Communications, 2009Co-Authors: Eduardo Weingartner, H. Vom Lehn, Klaus WehrleAbstract:A widespread methodology for Performance analysis in the field of communication systems engineering is network simulation. While ns-2 has established itself as virtually the standard network simulation tool, other network simulators have gained more and more attention during the last years. In this paper, we briefly survey new developments in the field of network simulation and conduct a Performance Comparison study by implementing an identical simulation set-up in five simulators, namely ns-2, OMNet++, ns-3, SimPy and JiST/SWANS. Our results reveal large differences according to both run-time Performance and memory usage.
Bernhard Seeger - One of the best experts on this subject based on the ideXlab platform.
-
SSD - Performance Comparison of Segment Access Methods Implemented on Top of the Buddy-Tree
Advances in Spatial Databases, 1991Co-Authors: Bernhard SeegerAbstract:Multidimensional segment access methods efficiently organize one- and multidimensional intervals on secondary storage. In this paper, we present a detailed discussion and a comprehensive experimental Performance Comparison of these methods. Each of the segment access methods is implemented on top of an ordinary point access method using the techniques clipping, overlapping regions and transformation. As the basic point access method we have chosen the buddy-tree. The Performance of the buddy-tree is less influenced by the underlying data distribution, and therefore, the resulting segment access methods can be judged with respect to their individual techniques. Besides the different versions of buddy-trees, the R*-tree (an improved approach of the R-tree) and the grid file participate in our experimental Performance Comparison.
-
SSD - Performance Comparison of point and spatial access methods
Lecture Notes in Computer Science, 1990Co-Authors: Hans-peter Kriegel, M. Schiwietz, Ralf Schneider, Bernhard SeegerAbstract:In the past few years a large number of multidimensional point access methods, also called multiattribute index structures, has been suggested, all of them claiming good Performance. Since no Performance Comparison of these structures under arbitrary (strongly correlated nonuniform, short "ugly") data distributions and under various types of queries has been performed, database researchers and designers were hesitant to use any of these new point access methods. As shown in a recent paper, such point access methods are not only important in traditional database applications. In new applications such as CAD/CIM and geographic or environmental information systems, access methods for spatial objects are needed. As recently shown such access methods are based on point access methods in terms of functionality and Performance. Our Performance Comparison naturally consists of two parts. In part I we will compare multidimensional point access methods, whereas in part II spatial access methods for rectangles will be compared. In part I we present a survey and classification of existing point access methods. Then we carefully select the following four methods for implementation and Performance Comparison under seven different data files (distributions) and various types of queries: the 2-level grid file, the BANG file, the hB-tree and a new scheme, called the BUDDY hash tree. We were surprised to see one method to be the clear winner which was the BUDDY hash tree. It exhibits an at least 20 % better average Performance than its competitors and is robust under ugly data and queries. In part II we compare spatial access methods for rectangles. After presenting a survey and classification of existing spatial access methods we carefully selected the following four methods for implementation and Performance Comparison under six different data files (distributions) and various types of queries: the R-tree, the BANG file, PLOP hashing and the BUDDY hash tree. The result presented two winners: the BANG file and the BUDDY hash tree. This Comparison is a first step towards a standardized tested or benchmark. We offer our data and query files to each designer of a new point or spatial access method such that he can run his implementation in our testbed.
