24 research outputs found
Figure 1 -Typical User Configurations Customer-owned ATM switch Router OC3c ATM UNI Existing Base of computers and legacy LANs SUN Workstations SUN Workstations OC3c ATM UNIs SUN Workstations ATM-Based Trial Network OC3c ATM UNI Existing Base of computers
Abstract [4] [5] [6] [7] [8] were all in the trade press with various announcements and articles during this period
On Privacy of Encrypted Speech Communications
Silence suppression, an essential feature of speech communications over the Internet, saves bandwidth by disabling voice packet transmissions when silence is detected. However, silence suppression enables an adversary to recover talk patterns from packet timing. In this paper, we investigate privacy leakage through the silence suppression feature. More specifically, we propose a new class of traffic analysis attacks to encrypted speech communications with the goal of detecting speakers of encrypted speech communications. These attacks are based on packet timing information only and the attacks can detect speakers of speech communications made with different codecs. We evaluate the proposed attacks with extensive experiments over different type of networks including commercial anonymity networks and campus networks. The experiments show that the proposed traffic analysis attacks can detect speakers of encrypted speech communications with high accuracy based on traces of 15 minutes long on average
Real-Time Communication in Packet-Switched Networks
Abstract The dramatically increased bandwidths and processing capabilities of future high-speed networks make possible many distributed real-time applications, such as sensor-based applications and multimedia services. Since these applications will have tra c characteristics and performance requirements that di er dramatically from those of current data-oriented applications, new communication network architectures and protocols will be required. In this paper we discuss the performance requirements and tra c characteristics of various real-time applications, survey recent developments in the areas of network architecture and protocols for supporting real-time services, and develop frameworks in which these, and future, research e orts can be considered
Novel approaches to performance evaluation and benchmarking for energy-efficient multicast: empirical study of coded packet wireless networks
With the advancement of communication networks, a great number of multicast applications such as multimedia, video and audio communications have emerged. As a result, energy efficient multicast in wireless networks is becoming increasingly important in the field of Information and Communications Technology (ICT). According to the study by Gartner and Environmental Protection Agency (EPA) report presented to United State Congress in 2007,energy consumption of ICT nodes accounts for 3% of the worldwide energy supply and is responsible for 2% of the global Carbon dioxide (CO2) emission. However, several initiatives are being put in place to reduce the energy consumption of the ICT sector in general. A review of related literature reveals that existing approaches to energy efficient multicast are largely evaluated using a single metric and while the single metric is appropriate for effective performance, it is unsuitable for measuring efficiency adequately. This thesis studied existing coded packet methods for energy efficiency in ad hoc wireless networks and investigates efficiency frontier, which is the expected minimum energy within the minimum energy multicast framework. The energy efficiency performance was based on effective evaluation and there was no way an inefficient network could reach a level of being an efficiency frontier. Hence, this work looked at the position of how true efficiency evaluation is obtained when the entire network under examination attains their efficiency frontiers using ratios of weighted outputs to weighted inputs with multiple variables. To address these challenges and assist network operators when formulating their network policies and performing network administrations, this thesis proposed novel approaches that are based on Data Envelopment Analysis (DEA) methodology to appropriately evaluate the efficiency of multicast energy and further minimizes energy transmission in ad hoc wireless networks without affecting the overall network performance. The DEA, which was used to study the relative efficiency and productivity of systems in Economic and Operational Research disciplines, is a non-parametric method that relies on linear programming technique for optimization of discrete units of observation called the decision making units (DMUs)
Algorithms for security in robotics and networks
The dissertation presents algorithms for robotics and security. The first chapter gives an overview of the area of visibility-based pursuit-evasion. The following two chapters introduce two specific algorithms in that area. The algorithms are based on research done together with Dr. Giora Slutzki and Dr. Steven LaValle. Chapter 2 presents a polynomial-time algorithm for clearing a polygon by a single 1-searcher. The result is extended to a polynomial-time algorithm for a pair of 1-searchers in Chapter 3.;Chapters 4 and 5 contain joint research with Dr. Srini Tridandapani, Dr. Jason Jue and Dr. Michael Borella in the area of computer networks. Chapter 4 presents a method of providing privacy over an insecure channel which does not require encryption. Chapter 5 gives approximate bounds for the link utilization in multicast traffic