Analyzing the Performance of Mesh and Fat-Tree Topologies for Network on Chip Design
The demand of integration of many heterogeneous semiconductor intellectual property (IP) blocks has been introducing a new chip design paradigm so called on chip network. This paradigm promisingly offers a packet switched network among IPs to reduce the main problems in the very deep sub micron technologies that arise from non-scalable global wire delay, failure to achieve global synchronization, errors due to the signal integrity, non-scalable bus based functional interconnection, etc. This paper introduces interconnected or switched network topologies and also analyze their performances in terms of communication protocol related to the issues such as routing strategy, buffer size, routing algorithm , etc. The above mentioned evaluations are done by utilizing the tool that has been widely used in the research domain of computer network design, so called NS-2.

title: The Optimum Network on Chip Architectures for Video Object Plane Decoder Design
abstract: On Chip Network (OCN) has been proposed as a new methodology for addressing the design challenges of future massly integrated system in nanoscale. In this paper, three differently heterogenous Tree-based network topologies are proposed as the OCN architectures for Video Object Plane Decoder (VOPD). The topologies are designed in order to maximize the system throughput. This paper also evaluates the proposed topologies by comparing them to other conventional topologies such as 2-D Mesh and Fat-Tree with respects to throughput, power consumption and size. We use the power modelling tool, known as Orion model to calculate the static powers, areas, and dynamic energies of three topologies. The experiment results show that our Tree-based topologies offer similar throughputs as Fat-Tree does and much higher throughputs compared to 2-D Mesh while use less chip areas and power consumptions.

title: Java Memory Allocation with Lazy Worst Fit for Small Objects
abstract: Memory allocation is an important part of modern programming languages, including garbage-collected languages such as Java. We propose a fast memory allocation scheme for Java using lazy worst fit (LWF), where pointer increment is used as the primary allocation method and worst fit is used as a backup. We evaluated LWF on a working Java virtual machine with non-moving garbage collection, and the results show that LWF is practically useful since the overhead of fit allocation and the amount of fragmentation are low.

title: Design and control of a novel 4-DOFs parallel robot H4
abstract: This paper deals with the design and dynamic control simulation of a new type and dynamic control simulation of a new type of 4-DOFs parallel mechanism providing 3 translations and 1 rotation for high-speed handling and machining. This parallel mechanism is named as H4. A model-based dynamic control scheme is developed to improve the accuracy of the trajectory tracking. A simplified dynamic model is used for the H4 robot to decrease the cost of computation. A dynamic simulation is performed using ADAMS/sup TM/. In addition, the adept motion is used as a benchmark test to evaluate the effect of the dynamic control. The simulation results show that the dynamic control dramatically improves the trajectory tracking accuracy.

title: Link-disjoint embedding of complete binary trees in meshes

title: Mobile multi-layered IPsec
abstract: To achieve high throughput in wireless networks, smart forwarding and processing of packets in access routers is critical for overcoming the effects of the wireless links. However, these services cannot be provided if data sessions are protected using end-to-end encryption as with IPsec, because the information needed by these algorithms resides inside the portion of the packet that is encrypted, and can therefore not be used by the access routers. A previously proposed protocol, called Multi-layered IPsec (ML-IPsec) modifies IPsec in a way so that certain portions of the datagram may be exposed to intermediate network elements, enabling these elements to provide performance enhancements. In this paper we extend ML-IPsec to deal with mobility and make it suitable for wireless networks. We define and implement an efficient key distribution protocol to enable fast ML-IPsec session initialization, and two mobility protocols that are compatible with Mobile IP and maintain ML-IPsec sessions. Our measurements show that, depending on the mobility protocol chosen, integrated Mobile IP/ML-IPsec handoffs result in a pause of 53–100 milliseconds, of which only 28–75 milliseconds may be attributed to ML-IPsec. Further, we provide detailed discussion and performance measurements of our MML-IPsec implementation. We find the resulting protocol, when coupled with SNOOP, greatly increases throughput over scenarios using standard TCP over IPsec (165% on average). By profiling the MML-IPsec implementation, we determine the bottleneck to be sending packets over the wireless link. In addition, we propose and implement an extension to MML-IPsec, called dynamic MML-IPsec, in which a flow may switch between plaintext, IPsec and MML-IPsec. Using dynamic MML-IPsec, we can balance the tradeoff between performance and security.

title: On monitoring transparent optical networks
abstract: Fault identification and localization problems in optical networks have become crucial. Due to network transparency and high data rates, optical networks are vulnerable to sophisticated attacks on the physical infrastructure, and hence require adequate fault monitoring in order to accurately identify and locate network failures. In transparent optical networks, faults may propagate to various parts of the network from the origin, and multiple alarms can be generated for a single failure. In order to reduce the number of redundant alarms, simplify fault localization, as well as lower financial investment in network monitoring equipment, fault monitor placement should be optimized for a given network. In this paper, we formulate a problem on the optimal placement of network monitoring devices and propose a solution approach. We provide a brief summary of available physical-layer monitoring devices, and present a scheme for optimal monitor placement.