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....

PERFORMANCES OF ORTHOGONAL WAVELET DIVISION MULTIPLEX (OWDM) SYSTEM UNDER AWGN, RAYLEIGH, AND RICEAN CHANNEL CONDITIONS

Mohammed Tarique 

Department of Electrical Engineering, Ajman University of Science and Technology, P.O. Box 2202, Fujairah, United Arab Emirates 

ABSTRACT 

Orthogonal Wavelet Division Multiplexing (OWDM) has been considered as an alternative of Orthogonal Frequency Division Multiplexing (OFDM) in the recent years. OWDM has lower computational complexity and higher flexibility compared to its OFDM counterpart. The core component of OWDM is wavelet. Wavelet has been a much investigated and applied topic in digital image processing for a long time. Recently, it has drawn considerable attention of the researchers working in communication field. In this work we investigate the performances of OWDM under different channel conditions. We consider three channel conditions namely Additive White Gaussian Noise (AWGN), Rayleigh, Ricean, and frequency selective. We consider a number of wavelets namely Haar, Daubechies, Biorthogonal, Reverse Biorthogonal, Coiflets, and Symlets in OWDM design. For system model we choose Digital Video Broadcasting-Terrestrial (DVB-T). Originally DVB-T system was designed based on OFDM. In this work we use OWDM instead. The simulation results show OWDM outperforms OFDM in terms of bit error rate (BER), noise resiliency, and peak-to-average ration. The results also show that the Haar wavelet based OWDM outperforms other wavelets based OWDM system under all three considered three channel conditions. 

KEYWORDS

 Digital Video Broadcasting, OWDM, wavelets, AWGN, multipath, Rayleigh, Ricean, frequency selective  

More Details....

GEOGRAPHIC MAPS CLASSIFICATION BASED ON L*A*B COLOR SYSTEM

 Salam m. Ghandour1 and Nidal M. Turab2 

1CIS Dept. University Of Jordan, Amman Jordan 2Computer Networks And Information Security Dept. , Al Ahliyya Amman University, Amman- Jordan 

ABSTRACT 

Today any geographic information system (GIS) layers became vital part of any GIS system , and consequently , the need for developing automatic approaches to extract GIS layers from different image maps like digital maps or satellite images is very important. Map classification can be defined as an image processing technique which creates thematic maps from scanned paper maps or remotely sensed images. Each resultant theme will represent a GIS layer of the images. A new proposed approach to extract GIS layers (classes) automatically based on L*A*B colorsystem selected from ( A and B ) is proposed in this paper, our experiments shows that the hsi color space gives better than L*A*B.

KEYWORDS 

L*a*b color space, HSI color space, GIS, GIS layers, classification

More Details...

HIDING A MESSAGE IN MP3 USING LSB WITH 1, 2, 3 AND 4 BITS

Alaa AbedulsalamAlarood1,2,Azizah Abed Manaf1 , Mohammed J. Alhaddad2 and Mohammed Salem Atoum3 

1Department of Computing, University Technology Malaysia, Johor Bahru. 2Department of information Technology, King Abdulaziz University, Jeddah 3Department of Computer Science, Irbid National University, Irbid 

ABSTRACT

 Steganography is the art of hiding information in ways that prevent the detection of hidden messages. This paper presentsa new method which randomly selects position in MP3 file to hide a text secret messageby using Least Significant Bit (LSB) technique. The text secret message isused in start and ends locations a unique signature or key.The methodology focuses to embed one bit, two bits, three bitsor four bits from secret message into MP3 file by using LSB techniques. The evaluation and performancemethods are based on robustness (BER and correlation), Imperceptibility (PSNR) and hiding capacity (Ratio between Sizes of text message and MP3 Cover) indicators.The experimental results show the new method is more security. Moreover the contribution of this paper is the provision of a robustness-based classification of LSB steganography models depending on their occurrence in the embedding position. 

KEYWORDS 

Steganography, LSB, mp3 data set, hiding a message 

More Details...

SIMPLIFIED CBA CONCEPT AND EXPRESS CHOICE METHOD FOR INTEGRATED NETWORK MANAGEMENT SYSTEM

Mohammad Al Rawajbeh1 , Vladimir Sayenko2 and Mohammad I. Muhairat3 

1Department of Computer Networks, Al-Zaytoonah University of Jordan, Amman, Jordan 2Kharkov National University of Radio Electronics (KhNURE) Kharkiv, Ukraine 3Department of Software Engineering, Al-Zaytoonah University of Jordan, Amman, Jordan 

ABSTRACT 

The process of choosing and integrating a network management system (NMS) to an existing computer network became a big question due to the complexity of used technologies and the variety of NMS options. Most of computer networks are being developed according to their internal rules in cloud environments. The use of NMS requires not only infrastructural changes, consequently increasing the cost of integration and maintenance, but also increases the risk of potential failures. In this paper, conception and method of express choice to implement and integrate a network management system are presented. Review of basic methods of cost analysis for IT systems is presented. The simplified conception of cost benefits analysis (CBA) is utilized as a basis of the offered method. A final estimation is based on three groups of parameters: parameters of expected integration risk evaluation, expected effect and level of completed management tasks. The explanation of the method is provided via example. 

KEYWORDS 

Network Management; NMS; CBA; Integrated System; Cost Analysis; Efficiency Criterion 

More Details...

STUDY THE EFFECT OF PARAMETERS TO LOAD BALANCING IN CLOUD COMPUTING

Tran Cong Hung and Nguyen Xuan Phi 

 Posts and Telecommunications Institute of Technology, Vietnam 

ABSTRACT 

The rapid growth of users on the cloud service and number of services to the user increases the load on the servers at cloud datacenter. This issue is becoming a challenge for the researchers. And requires used effectively a load balancing technique not only to balance the resources for servers but also reduce the negative impact to the end-user service. The current, load balancing techniques have solved the various problems such as: (i) load balancing after a server was overloaded; (ii) load balancing and load forecast for the allocation of resources; iii) improving the parameters affecting to load balancing in cloud. The study of improving these parameters have great significance to improving system performance through load balancing. From there, we can propose more effective methods of load balancing, in order to increase system performance. Therefore, in this paper we researched some parameters affecting the performance load balancing on the cloud computing. 

KEYWORDS 

Load balancing; Virtual Mmachines;Lload Balancing Parameters;Cloud Computing.  

More Details....

LIGHT FIDELITY (LI-FI) BASED INDOOR COMMUNICATION SYSTEM

Farooq Aftab, Muhammad Nafees Ulfat khan,Shahzad Ali 

School of Computer and Communication Engineering,University of Science and Technology Beijing china (USTB) 

ABSTRACT 

Indoor wireless communication is an essential part of next generation wireless communication system.For an indoor communication number of users and their device are increasing very rapidly so as a result capacity of frequency spectrum to accommodate further users in future is limited and also it would be difficult for service providers to provide more user reliable and high speed communication so this short come can be solve in future by using Li-Fi based indoor communication system. Li-Fi which is an emerging branch of optical wireless communication can be useful in future as a replacement and backup of Wireless Fidelity (Wi-Fi)for indoor communication because it can provide high data rate of transmission along with high capacity to utilize more users as its spectrum bandwidth is much broader than the radio spectrum. In this paper we will look at the different aspects of the Li-Fi based indoor communication system,summarizes some of the research conducted so far andwe will also proposed a Li-Fi based communication model keeping in mind coverage area for multiple user and evaluate its performance under different scenarios . 

KEYWORDS 

LightFidelity,Indoor communication, Visible light communications, Wi-Fi. 

More Details.....

PERFORMANCE ANALYSIS OF THE LINK-ADAPTIVE COOPERATIVE AMPLIFY-AND-FORWARD RELAY NETWORKS WITH OPPORTUNISTIC RELAYING STRATEGY

Bhuvan Modi, O. Olabiyi and A.Annamalai 

Center of Excellence for Communication Systems Technology Research 

Department of Electrical and Computer Engineering, Prairie View A & M University, TX 77446 United States of America 

ABSTRACT 

This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks that employ adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift keying (M-PSK) digital modulation techniques in Nakagami-m fading channel. In particular, we present and compared the analysis of CAF relay networks with different cooperative diversity and opportunistic routing strategies such as regular Maximal Ratio Combining (MRC), Selection Diversity Combining (SDC), Opportunistic Relay Selection with Maximal Ratio Combining (ORS-MRC) and Opportunistic Relay Selection with Selection Diversity Combining (ORS-SDC). We advocate a simple yet unified numerical approach based on the marginal moment generating function (MGF) of the total received SNR to compute the average symbol error rate (ASER), mean achievable spectral efficiency, and outage probability performance metrics. 

KEYWORDS 

Cooperative communications, adaptive M-QAM/MPSK modulation, Opportunistic relay selection 

More Details....

A NOVEL ROUTING PROTOCOL FOR TARGET TRACKING IN WIRELESS SENSOR NETWORKS

Sanjay Pahuja and Tarun Shrimali 

School of Computer and Information Science, Indira Gandhi National Open University, New Delhi, India

 ABSTRACT

Wireless sensor networks (WSNs) are large scale integration consists of hundreds or thousands or more number of sensor nodes. They are tiny, low cost, low weight, and limited battery, primary storage, processing power. They have wireless capabilities to monitor physical or environmental conditions. This paper compared the performance analysis of some existing routing protocols for target tracking application with proposed hierarchical binary tree structure to store the routing information. The sensed information is stored in controlled way at multiple sensor nodes (e.g. node, parent node and grandparent node) which deployed using complete binary tree data structure. This reduces traffic implosion and geographical overlapping. Simulation result showed improved network lifetime by 20%, target detection probability by 25%, and reduces error rate by 20%, energy efficiency, fault tolerance, and routing efficiency. We have evaluated our proposed algorithm using NS2. 

KEYWORDS 

WSN, HLTS, SPIN, LEACH, DD, Network Simulator 2.  

More Details...

TCP INCAST AVOIDANCE BASED ON CONNECTION SERIALIZATION IN DATA CENTER NETWORKS

Shigeyuki Osada1,2, Ryo Miyayama1 , Yukinobu Fukushima1 and Tokumi Yokohira1 

1The Graduate School of Natural Science and Technology, Okayama University, 3-1-1, Tsushima-Naka, Kita-Ku, Okayama, 700-8530, Japan 2 The Japan Research Institute, 2-18-1, Higashi-Gotanda, Shinagawa-Ku, Tokyo, 141-0022, Japan 

ABSTRACT 

In distributed file systems, a well-known congestion collapse called TCP incast (Incast briefly) occurs because many servers almost simultaneously send data to the same client and then many packets overflow the port buffer of the link connecting to the client. Incast leads to throughput degradation in the network. In this paper, we propose three methods to avoid Incast based on the fact that the bandwidth-delay product is small in current data center networks. The first method is a method which completely serializes connection establishments. By the serialization, the number of packets in the port buffer becomes very small, which leads to Incast avoidance. The second and third methods are methods which overlap the slow start period of the next connection with the current established connection to improve throughput in the first method. Numerical results from extensive simulation runs show the effectiveness of our three proposed methods. 

KEYWORDS 

TCP, Data Center, Distributed File System, TCP Incast


More Details....

SIMULATING CORTICAL MAPS FOR ATTENTION SHIFT IN AUTISM

L.-H. Tan, S.-Y. Cho and Y.-Y. Nguwi 

School of Business (IT), James Cook University, Singapore

 ABSTRACT 

Autism is a pervasive neuro-developmental disorder, primarily encompassing difficulties in the social, language, and communicative domains. Because autism is a spectrum disorder, it affects each individual differently and has varying degrees. There are three core aspects of impairment based upon the Diagnostic and Statistical Manual of Mental Disorders (DSM-IV), namely impairment in socialization, impairment in communication, and restricted repetitive activities or interests. This work describes the experiment aims at expressing autistic traits through the use of self-organizing map. Works related to simulating autism through self-organizing map is limited. This work compare and contrast the difference in attention index for normal learning and marred attention shift learning ability. It was found that the attention index of normal learning is 9 times better marred attention shift for both random and pre-fixed input data. In the marred attention shift context, neurons adapt more towards the mean of both sources combined under marred context while some neurons adapt towards mean of one source under normal context. The normal learning ability produces maps with neurons orienting towards mean values of combined stimuli source. Impairment in learning ability produces similar cortical maps compared to normal learning ability. The major difference is in the attention index. 

KEYWORDS 

self-organizing map, attention shift, autism, neural network

More Details...

ADAPTIVE MULTI-TENANCY POLICY FOR ENHANCING SERVICE LEVEL AGREEMENT THROUGH RESOURCE ALLOCATION IN CLOUD COMPUTING

MasnidaHussin, AbdullahMuhammed and NorAsilahWatiAbd Hamid

 Department of Communication Technology and Network, Faculty of Computer Science and Information Technology, University of Putra Malaysia, 43400 UPM Serdang, Selangor, Malaysia 

ABSTRACT 

The appearance of infinite computing resources that available on demand and fast enough to adapt with load surges makes Cloud computing favourable service infrastructure in IT market. Core feature in Cloud service infrastructures is Service Level Agreement (SLA) that led seamless service at high quality of service to client. One of the challenges in Cloud is providing heterogeneous computing services for the clients. With the increasing number of clients/tenants in the Cloud, unsatisfied agreement is becoming a critical factor. In this paper, we present an adaptive resource allocation policy which attempts to improve accountable in Cloud SLA while aiming for enhancing system performance. Specifically, our allocation incorporates dynamic matching SLA rules to deal with diverse processing requirements from tenants.Explicitly, it reduces processing overheadswhile achieving better service agreement. Simulation experiments proved the efficacy of our allocation policy in order to satisfy the tenants; and helps improve reliable computing. 

KEYWORDS 

Resource allocation, Cloud computing, Service Level Agreement (SLA), Adaptive Service Agreement

More Details...

ENERGY SAVINGS IN APPLICATIONS FOR WIRELESS SENSOR NETWORKS TIME CRITICAL REQUIREMENTS

Tran Cong Hung1 and Ho Huu Trung1,2 

1 Post & Telecommunications Institute of Technology, Vietnam
2 Ho Chi Minh City University of Technology, Vietnam

 ABSTRACT

 Along with handling and poor storage capacity, each sensor in wireless sensor network (WSN) is equipped with a limited power source and very difficult to be replaced in most application environments. Improving the energy savings in applications for wireless sensor networks is necessary. In this paper, we mainly focus on energy consumption savings in applications for wireless sensor networks time critical requirements. Our Paper accompanying analysis of advanced technologies for energy saving techniques for the optimization of energy efficiency together with the data transmission is optimal. Moreover, we propose improvements to increase energy savings in applications for wireless sensor networks require time critical (LEACH improvements). Simulation results show that our proposed protocol significantly better than LEACH about the formation of clusters in each round, the average power, the number of nodes alive and average total received data in base stations. 

KEYWORDS 

Sensor network, energy efficiency, routing 

More Details...

PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSN

Mehran Mokhtari1 and Masoomeh Tavakoli2 

1 Sama Technical and Vocational Training College, Islamic Azad University, Qaemsharh, IRAN 2Education Qaemshar, Qaemsharh, IRAN 

ABSTRACT

In this article it has presented leach extended hierarchical 3-level clustered heterogeneous and dynamics algorithm. On suggested protocol (LEH3LA) with planning of selected auction cluster head, and alternative cluster head node, problem of delay on processing, processing of selecting members, decrease of expenses, and energy consumption, decrease of sending message, and receiving messages inside the clusters, selecting of cluster heads in large sensor networks were solved. This algorithm uses hierarchical heterogeneous network (3-levels), collective intelligence, and intra-cluster interaction for communications. Also it will solve the problems of sending data in Multi-BS mobile networks, expanding inter-cluster networks, overlap cluster, genesis orphan nodes, boundary change dynamically clusters, using backbone networks, cloud sensor. Using sleep/wake scheduling algorithm or TDMA-schedule alternative cluster head node provides redundancy, and fault tolerance. Local processing in cluster head nodes, and alternative cluster head, intra-cluster and inter-cluster communications such as Multi-HOP cause increase on processing speed, and sending data intra-cluster and inter-cluster. Decrease of overhead network, and increase the load balancing among cluster heads. Using encapsulation of data method, by cluster head nodes, energy consumption decrease during sending data. Also by improving quality of service (QoS) in CBRP, LEACH, 802.15.4, decrease of energy consumption in sensors, cluster heads and alternative cluster head nodes, cause increase on lift time of sensor networks. 

KEYWORDS 

Encapsulation, Multi-BS, Multi-HOP, Cloud sensor, Auction cluster head, Alternative cluster head nodes  

More Details..

OMT: A DYNAMIC AUTHENTICATED DATA STRUCTURE FOR SECURITY KERNELS

Somya D. Mohanty1 , Mahalingam Ramkumar2 and Naresh Adhikari3

1Department of Computer Science, University of North Carolina - Greensboro, Greensboro, USA 2Department of Computer Science and Engineering, Mississippi State University, Starkville, USA 3Department of Computer Science and Engineering, Mississippi State University, Starkville, USA

ABSTRACT

We introduce a family of authenticated data structures — Ordered Merkle Trees (OMT) — and illustrate their utility in security kernels for a wide variety of sub-systems. Specifically, the utility of two types of OMTs: a) the index ordered merkle tree (IOMT) and b) the range ordered merkle tree (ROMT), are investigated for their suitability in security kernels for various sub-systems of Border Gateway Protocol (BGP), the Internet’s inter-autonomous system routing infrastructure. We outline simple generic security kernel functions to maintain OMTs, and sub-system specific security kernel functionality for BGP subsystems (like registries, autonomous system owners, and BGP speakers/routers), that take advantage of OMTs.

KEYWORDS 

Security Kernels, Broader Gateway Protocol (BGP), Authenticated Data Structure (ADS)

More Details ...