DIA-TORUS:A NOVEL TOPOLOGY FOR NETWORK ON CHIP DESIGN

Deewakar Thakyal and Pushpita Chatterjee 

SRM Research Institute, Bangalore 

ABSTRACT 

The shortcomings of conventional bus architectures are in terms of scalability and the ever increasing demand of more bandwidth. And also the feature size of sub-micron domain is decreasing making it difficult for bus architectures to fulfill the requirements of modern System on Chip (SoC) systems. Network on chip (NoC) architectures presents a solution to the earlier mentioned shortcomings by employing a packet based network for inter IP communications. A pivotal feature of NoC systems is the topology in which the system is arranged. Several parameters which are topology dependent like hop count, path diversity, degree and other various parameters affect the system performance. We propose a novel topology forNoC architecture which has been thoroughly compared with the existing topologies on the basis of different network parameters. 

KEYWORDS

 Network on chip, Torus, Topology, NoC


More Details...

CONGESTION AWARE LINK COST ROUTING FOR MANETS

 Tripti Sharma1 and Dr. Vivek Kumar2

 1 IPEC, Ghaziabad, UP, India and 2GKV, Haridwar, UK, India. 

ABSTRACT

 Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network (MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of the important issues which cause performance degradation of a network, due to long delay and high packet loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along with this optimization, in this protocol, every node finds its congestion status and participates in the route discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end delay, throughput, and packet drop when compared to existing protocols. 

KEYWORDS 

Self-configuration, Packet loss, Congestion, Link cost  

More Details...

A NOVEL METHOD TO TEST DEPENDABLE COMPOSED SERVICE COMPONENTS

Khaled Farj1 and Adel Smeda2

 1 Faculty of Science, University of Al-Jabel Al-Gharbi, P.O. Box 64200, Gharian, Libya 2 Faculty of Accounting, University of Al-Jabel Al-Gharbi, Gharian, Libya 

ABSTRACT

 Assessing Web service systems performance and their dependability are crucial for the development of today’s applications. Testing the performance and Fault Tolerance Mechanisms (FTMs) of composed service components is hard to be measured at design time due to service instability is often caused by the nature of the network conditions. Using a real internet environment for testing systems is difficult to set up and control. We have introduced a fault injection toolkit that emulates a WAN within a LAN environment between composed service components and offers full control over the emulated environment in addition to the capability to inject network-related faults and application specific faults. The toolkit also generates background workloads on the system under test so as to produce more realistic results. We describe an experiment that has been performed to examine the impact of fault tolerance protocols deployed at a service client by using our toolkit system. 

KEYWORDS 

 Web Services, Fault Tolerance Methodologies, and Software Fault Injection & Composed Web service.  

More Details..

PERFORMANCE AND COMPLEXITY ANALYSIS OF A REDUCED ITERATIONS LLL ALGORITHM

Nizar OUNI1 and Ridha BOUALLEGUE2 

1National Engineering School of Tunis, SUP’COM, InnovCom laboratory, Tunisia 2 SUP’COM, InnovCom laboratory, Tunisia 

ABSTRACT

 Multiple-input multiple-output (MIMO) systems are playing an increasing and interesting role in the recent wireless communication. The complexity and the performance of the systems are driving the different studies and researches. Lattices Reduction techniques bring more resources to investigate the complexity and performances of such systems. 

In this paper, we look to modify a fixed complexity verity of the LLL algorithm to reduce the computation operations by reducing the number of iterations without important performance degradation. Our proposal shows that we can achieve a good performance results while avoiding extra iteration that doesn’t bring much performance. 

KEYWORDS

 MIMO systems, LR-aided, Lattice, LLL, BER, Complexity

More Details...

DYNAMICALLY ADAPTABLE IMPROVED OLSR (DA-IOLSR) PROTOCOL

P. S. Vinayagam 

Assistant Professor, Department of Computer Science, Pondicherry University Community College, Puducherry, India 

ABSTRACT 

Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to adapt the virtual backbone to topology changes. This assumes significance especially in networks that experience very high mobility. Changes in the network topology caused by node additions, node deletions and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions. 

KEYWORDS

OLSR, Ad hoc network, Topology change, Virtual Backbone, Connected Dominating Set, MPR

More Details...

PERFORMANCE AND COMPLEXITY ANALYSIS OF A REDUCED ITERATIONS LLL ALGORITHM

Nizar OUNI1 and Ridha BOUALLEGUE2 

1National Engineering School of Tunis, SUP’COM, InnovCom laboratory, Tunisia 2 SUP’COM, InnovCom laboratory, Tunisia 

ABSTRACT 

Multiple-input multiple-output (MIMO) systems are playing an increasing and interesting role in the recent wireless communication. The complexity and the performance of the systems are driving the different studies and researches. Lattices Reduction techniques bring more resources to investigate the complexity and performances of such systems. In this paper, we look to modify a fixed complexity verity of the LLL algorithm to reduce the computation operations by reducing the number of iterations without important performance degradation. Our proposal shows that we can achieve a good performance results while avoiding extra iteration that doesn’t bring much performance. 

KEYWORDS 

MIMO systems, LR-aided, Lattice, LLL, BER, Complexity. 

More Details...

DYNAMICALLY ADAPTABLE IMPROVED OLSR (DA-IOLSR) PROTOCOL

P. S. Vinayagam Assistant Professor, Department of Computer Science, Pondicherry University Community College, Puducherry, India

 ABSTRACT 

Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to adapt the virtual backbone to topology changes. This assumes significance especially in networks that experience very high mobility. Changes in the network topology caused by node additions, node deletions and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions. 

KEYWORDS 

OLSR, Ad hoc network, Topology change, Virtual Backbone, Connected Dominating Set, MPR  

More Details....