Analysis of Performance of Dynamic Multicast Routing Algorithms

In this paper, three new dynamic multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree, Topology Based Tree and Minimum Diameter Tree. A simulation analysis is presented showing various performance aspects of the algorithms, in which a comparison is made with the greedy and core based tree techniques. The effects of the tree source location on dynamic membership change are also examined. The simulations demonstrate that the Source Optimised Tree algorithm achieves a significant improvement in terms of delay and link usage when compared to the Core Based Tree, and greedy algorithm

Stochastic user behaviour modelling and network simulation for resource management in cooperation with mobile telecommunications and broadcast networks

The latest generations of telecommunications networks have been designed to deliver higher data rates than widely used second generation telecommunications networks, providing flexible communication capabilities that can deliver high quality video images. However, these new generations of telecommunications networks are interference limited, impairing their performance in cases of heavy traffic and high usage. This limits the services offered by a telecommunications network operator to those that the operator is confident their network can meet the demand for. One way to lift this constraint would be for the mobile telecommunications network operator to obtain the cooperation of a broadcast network operator so that during periods when the demand for the service is too high for the telecommunications network to meet, the service can be transferred to the broadcast network. In the United Kingdom the most recent telecommunications networks on the market are third generation UMTS networks while the terrestrial digital broadcast networks are DVB-T networks. This paper proposes a way for UMTS network operators to forecast the traffic associated with high demand services intended to be deployed on the UMTS network and when demand requires to transfer it to a cooperating DVB-T network. The paper aims to justify to UMTS network operators the use of a DVB-T network as a support for a UMTS network by clearly showing how using a DVB-T network to support it can increase the revenue generated by their network

Performance Evaluation of Specialized Hardware for Fast Global Operations on Distributed Memory Multicomputers

Workstation cluster multicomputers are increasingly being applied for solving scientific problems that require massive computing power. Parallel Virtual Machine (PVM) is a popular message-passing model used to program these clusters. One of the major performance limiting factors for cluster multicomputers is their inefficiency in performing parallel program operations involving collective communications. These operations include synchronization, global reduction, broadcast/multicast operations and orderly access to shared global variables. Hall has demonstrated that a .secondary network with wide tree topology and centralized coordination processors (COP) could improve the performance of global operations on a variety of distributed architectures [Hall94a]. My hypothesis was that the efficiency of many PVM applications on workstation clusters could be significantly improved by utilizing a COP system for collective communication operations. To test my hypothesis, I interfaced COP system with PVM. The interface software includes a virtual memory-mapped secondary network interface driver, and a function library which allows to use COP system in place of PVM function calls in application programs. My implementation makes it possible to easily port any existing PVM applications to perform fast global operations using the COP system. To evaluate the performance improvements of using a COP system, I measured cost of various PVM global functions, derived the cost of equivalent COP library global functions, and compared the results. To analyze the cost of global operations on overall execution time of applications, I instrumented a complex molecular dynamics PVM application and performed measurements. The measurements were performed for a sample cluster size of 5 and for message sizes up to 16 kilobytes. The comparison of PVM and COP system global operation performance clearly demonstrates that the COP system can speed up a variety of global operations involving small-to-medium sized messages by factors of 5-25. Analysis of the example application for a sample cluster size of 5 show that speedup provided by my global function libraries and the COP system reduces overall execution time for this and similar applications by above 1.5 times. Additionally, the performance improvement seen by applications increases as the cluster size increases, thus providing a scalable solution for performing global operations

SwitchWare: Accelerating Network Evolution (White Paper)

We propose the development of a set of software technologies ( SwitchWare ) which will enable rapid development and deployment of new network services. The key insight is that by making the basic network service selectable on a per user (or even per packet) basis, the need for formal standardization is eliminated. Additionally, by making the basic network service programmable, the deployment times, today constrained by capital funding limitations, are tremendously reduced (to the order of software distribution times). Finally, by constructing an advanced, robust programming environment, even the service development time can be reduced. A SwitchWare switch consists of input and output ports controlled by a software-programmable element; programs are contained in sequences of messages sent to the SwitchWare switch\u27s input ports, which interpret the messages as programs. We call these Switchlets . This accelerates the pace of network evolution, as evolving user needs can be immediately reflected in the network infrastructure. Immediate reconfigurability enhances the adaptability of the network infrastructure in the face of unexpected situations. We call a network built from SwitchWare switches an active network

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Vehicle path verification using wireless sensor networks

Path Verification is a problem where a verifier would like to determine how closely a vehicle actually traversed a path that it claims to have traversed. This problem has critical significances in terms of vehicle mobility. Mobile nodes can be patrols officers or cab drivers, while respective verifiers can be police dispatchers or cab operators. In this paper, we design a sensor network assisted technique for vehicle path verification. In our design, a number of static wireless sensors placed in road segments will serve as witnesses and certify vehicles as they move. Post movement, these witness certificates will be utilized by the verifier to derive the actual path of a suspect vehicle. The challenge now is how to compare a Claimed Path as reported by the vehicle and the Actual Path derived from witness certificates. In this paper, we design a simple, yet effective technique for comparing similarity between two vehicle paths. Our technique extends from Continuous Dynamic Time Warping, which involves constructing a universal manifold from the two paths and then finding the geodesic on the resulting polygonal surface (shortest path along the surface) which is a diagonal from the origin of the surface to the terminal point. This distance is analogous to the Fréchet distance and yields a good measure of the similarity between two paths. Using simulations and real experiments, we demonstrate the performance of our technique from the perspective of detecting false paths claims from correct ones. We also design light-weight cryptographic techniques to prevent vehicle masquerading and certificate forging attacks. A proof of concept experiment was conducted on the streets of Rolla, Missouri. A sensor grid was established on a small section of Rolla and a vehicle with a transmitter was driven through the grid many times. The analysis of the data yielded results consistent with the expected ones --Abstract, page iii

Application of Asynchronous Transfer Mode (Atm) technology to Picture Archiving and Communication Systems (Pacs): A survey

Broadband Integrated Services Digital Network (R-ISDN) provides a range of narrowband and broad-band services for voice, video, and multimedia. Asynchronous Transfer Mode (ATM) has been selected by the standards bodies as the transfer mode for implementing B-ISDN; The ability to digitize images has lead to the prospect of reducing the physical space requirements, material costs, and manual labor of traditional film handling tasks in hospitals. The system which handles the acquisition, storage, and transmission of medical images is called a Picture Archiving and Communication System (PACS). The transmission system will directly impact the speed of image transfer. Today the most common transmission means used by acquisition and display station products is Ethernet. However, when considering network media, it is important to consider what the long term needs will be. Although ATM is a new standard, it is showing signs of becoming the next logical step to meet the needs of high speed networks; This thesis is a survey on ATM, and PACS. All the concepts involved in developing a PACS are presented in an orderly manner. It presents the recent developments in ATM, its applicability to PACS and the issues to be resolved for realising an ATM-based complete PACS. This work will be useful in providing the latest information, for any future research on ATM-based networks, and PACS