Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Distributed Framework and Applications, 2008. DFmA 2008. First International Conference on

Date 21-22 Oct. 2008

Filter Results

Displaying Results 1 - 25 of 33
  • Analysis of a Replication-Aware Transaction model by means of Stochastic Reward Networks

    Publication Year: 2008 , Page(s): 5 - 12
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2181 KB) |  | HTML iconHTML  

    Replication-aware transaction model presents a technique in which failures in the scope of a transaction issued on a group of replicated objects are simply ignored. In this technique, the failed replicated objects are removed from their relevant object group and are re-created somewhere else if needed. Therefore, there is no need to roll the whole transaction back. Previous evaluation of the technique based on an implemented prototype on FT-CORBA and CORBA Transaction Service (OTS) has shown better transaction throughput compared to other methods. This paper re-evaluates this technique by modeling it using stochastic reward networks (SRNs). The performance measurements derived from running the SRN model differs from the one gained from the implemented prototype. We discuss these differences and analyze how the SRN model and the implemented prototype revealed interesting points which were not previously considered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formulating the influence of peer-to-peer systems scale up on access transparency

    Publication Year: 2008 , Page(s): 13 - 19
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (10528 KB) |  | HTML iconHTML  

    Distributed systems concepts have been presented since 1960 and there are many more attempts to develop these concepts to reach a real distributed system. But none of them able to implement all distributed systems goals and have some limitation. The major part of these limitations is related to no clear quantity relation are defined for distributed systems concepts. These limitations cause the developments were very special purpose like P2P system. P2P systems were developed on internet that is a dynamically scalable and heterogeneous system. Therefore scalability is one of the important challenges in P2P systems. On the other hand P2P systems have tried to provide transparent sharing in the Internet, especially transparent access to resources. Access transparency is more important to P2P systems because it affects more the system configuration, dynamicity and performance therefore the other important challenge in P2P systems is access transparency. However in distributed systems there isn't any clear mathematic relation between these two concepts, scalability and access transparency. Although we know that any increase in the scalability of a P2P systems cause complexity in access transparency establishing because the frequency of data exchanges as well as the system's process communication time increases exponentially. It is thus important for a P2P system to decide dynamically how far to allow the scale up, given the additional overheads it has to suffer from establishing data access transparency. This tradeoff decision in the statically or dynamically created P2P system can be made either quite centrally by a single manager, completely distributed by independent machines, or in a hybrid way. In this paper we first define scalability concept base on set theories and then adapted concept of access transparency to P2P systems and define some metrics for it. Finally formulates the relation between scalability and access transparency in P2P systems. The relation hel- - ps to calculate the overhead of establishing data access transparency when a P2P system is scaled up. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed push-based XML access control model for better scalability

    Publication Year: 2008 , Page(s): 20 - 26
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1319 KB) |  | HTML iconHTML  

    XML access control is a non-trivial topic as XML language becomes a standard for data representation and transmission on the Web. Existing access control approaches to the published XML documents are not likely to scale well since they specify and enforce their access control policies in centralized servers. This paper proposed a distributed model for providing a scalable access control to the published XML documents. The proposed model is cost-effectively distributed for meeting the increased workload along with avoiding the possible bottlenecks. As a result, the proposed model effectively scales with the increased system and management workloads. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing the cost of an heterogeneous distributed platform

    Publication Year: 2008 , Page(s): 27 - 34
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (889 KB) |  | HTML iconHTML  

    Distributed platforms become heterogeneous in more and more domains, as heterogeneous computing (HC) onto grids or reconfigurable factories in the industry. For production grids and factories, it is mandatory to control and optimize the economic cost of a such platforms regarding performance objectives. We present in this paper a study which purpose is to optimize the size of such environments depending on the workflow to execute or product to realize. The target platforms are either micro-factories, sized to manufacture products at the micrometric scale, or the heterogeneous computing domain where the key point is to reserve processors of an execution platform onto a grid to compute workflows like medical imaging applications. Thanks to the sizing of the platform, optimal or not, scheduling a workflow in HC environment or a production in the micro-factory is easy because the size of the platform already takes the performance constraints into account. In this paper, we present general results on the platform size optimization. Numerical results are also presented to illustrate 3 cases of our study. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel distributed genetic algorithm development based on microcontrollers framework

    Publication Year: 2008 , Page(s): 35 - 40
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (7047 KB) |  | HTML iconHTML  

    This work is focused on the implementation of evolutionary based computer algorithms, genetic algorithms (GAs), on microcontrollers. Genetic algorithms are powerful optimizing techniques that are used successfully to solve problems in many different disciplines. One such application would be in WCDMA adaptive beam forming technique. Adaptive antenna has dynamic beam to cater for users' needs and provides better capacity for mobile communication but requires more intelligent and advance beam forming algorithm such as genetic algorithm which requires heavy computation. Microcontrollers are low resource platforms that are normally not associated with GAs, which are typically resource intensive. The focus of this project is to expand the role of existing small scale PIC microcontrollers into a multiple-microcontrollers system to resolve limited resource issues in meeting complex project needs. This implementation will be based on parallel distributed model, which will reduce the complexity of each microcontroller to solve large complex problem and increase problem solving speed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ant Colony Optimization for optimal path finding in protein interaction network

    Publication Year: 2008 , Page(s): 41 - 44
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1451 KB) |  | HTML iconHTML  

    Recently, we have proposed ant colony optimization (ACO) algorithm together with traveling salesman problem (TSP) approach to cluster proteins in protein interaction network (PIN). Our proposal described the general adaptation of ACO to perform the clustering tasks, including the optimal path finding in PIN. In this paper, we focus precisely on the process of finding an optimal path by ACO for the given PIN. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards the improvement of the software quality: An Enterprise 2.0 architecture for distributed software developments

    Publication Year: 2008 , Page(s): 52 - 59
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (5985 KB) |  | HTML iconHTML  

    Software development is tightly dependent on the tools available for supporting its processes. Organizational and sociotechnical peculiarities such as indefinition of roles, geographically distributed development teams, new business models and diverse cultural interactions steer these tools. Software development supported by web-based services, built on top of Web 2.0 technologies, is emerging as a new paradigm for distributed software development. New generation software forges (web-based development environments) such as EzForge are becoming the infrastructure that provides the required features for hosting collections of software development projects. They are composed of an integrated set of tools, interacting in a mashup-like environment, each one suited for a specific task, and therefore simple enough to keep total complexity low. An adequate selection of tools helps developers to focus on the implementation of the requirements, while at the same time they cope with complex information coming from many individuals and organizations. The complexity of distributed software development requires a controlled and a strong collaboration amongst developers, which has to be supported by the selected architecture. Moreover, an increased demand on quality assurance is required by the many organizations aiming to achieve a certain quality level. A new architecture based on the Web 2.0 core ideas and methods overcomes these challenges in software development, representing a cornerstone to achieve satisfactory results in this ambitious environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processing identical workflows on SOA grids: Comparison of three approaches

    Publication Year: 2008 , Page(s): 60 - 67
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (905 KB) |  | HTML iconHTML  

    In this paper we consider the scheduling of a batch of workflows on a service oriented grid. A job is represented by a directed acyclic graph without forks (intree) but with typed tasks. The processors are distributed and each processor have a set of services that carry out equivalent task types. The objective function is to minimize the makespan of the batch execution. Three algorithms are studied in this context: an online algorithm, a genetic algorithm and a steady-state algorithm. The contribution of this paper is on the experimental analysis of these algorithms and on their adaptation to the context. We show that their performances depend on the size and complexity of the batch and on the characteristics of the execution platform. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • iNet-Grid: A real-time Grid monitoring and troubleshooting system

    Publication Year: 2008 , Page(s): 68 - 72
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (6041 KB) |  | HTML iconHTML  

    The purpose of Grid monitoring and management is to monitor services in Grid environment for fault detection, performance analysis, performance tuning, load balancing and scheduling. This paper emphasis on presenting a new framework namely iNet-Grid deployed for Grid monitoring and troubleshooting purposes. The iNet-Grid is integrated on top of Ganglia. iNet-Grid has been tested and successfully accomplished on USM network with the preliminary results have shown the positive outcomes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A strategy for Grid based t-way test data generation

    Publication Year: 2008 , Page(s): 73 - 78
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2516 KB) |  | HTML iconHTML  

    Although desirable as an important activity for ensuring quality assurances and enhancing reliability, complete and exhaustive software testing is next to impossible due to resources as well as timing constraints. While earlier work has indicated that pairwise testing (i.e. based on 2-way interaction of variables) can be effective to detect most faults in a typical software system, a counter argument suggests such conclusion cannot be generalized to all software system faults. In some system, faults may also be caused by more than two parameters. As the number of parameter interaction coverage (i.e. the strength) increases, the number of t-way test set also increases exponentially. As such, for large system with many parameters, considering higher order t-way test set can lead toward combinatorial explosion problem (i.e. too many data set to consider). We consider this problem for t-way generation of test set using the Grid strategy. Building and complementing from earlier work in In-Parameter-Order-General (or IPOG) and its modification (or MIPOG), we present the Grid MIPOG strategy (G_MIPOG). Experimental results demonstrate that G_MIPOG scales well against the sequential strategies IPOG and MIPOG with the increase of the computers as computational nodes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of game theory and fictitious play in data placement

    Publication Year: 2008 , Page(s): 79 - 83
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (911 KB) |  | HTML iconHTML  

    Data allocation comprises data placement or migration into or between the data servers in a distributed data sharing system. In the process of data placement, static equations would mostly select only the best data servers. This would overload some of the data servers. An algorithm for optimizing file-placement in data grid environment (DGE) is presented. The algorithm adapts game theory and fictitious play to provide a mechanism for load balancing. The algorithm considers the overall placement behaviours and dependencies. A discreet-time based simulator has been developed to test proposed algorithm. Initial simulation result showed that game theory and fictitious play can improve the overall performance of the system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient queue and GSI security management framework for mobile desktop grid

    Publication Year: 2008 , Page(s): 84 - 88
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4233 KB) |  | HTML iconHTML  

    This research proposes job request management system (JRMS) which is robust against network coverage and battery power failure and manages the request messages on the local storage media while mobile disconnection or battery power failure. Password-based authentication system and lightweight Blowfish cryptography are used for secure data request transmission between the mobile device and the grid proxy server. We justify our work on the basis of quantitative and qualitative research evaluation which proves that our framework is effective as well as efficient for high-end mobile devices. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Framework for evaluating update propagation techniques in large scale data grid

    Publication Year: 2008 , Page(s): 89 - 95
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (11123 KB) |  | HTML iconHTML  

    This paper introduces a framework for evaluating update propagation techniques in large scale Data Grid. The framework qualitatively compares the update propagation techniques using an analytical model based network queuing model. To achieve accuracy, the framework takes into account, the computing element, storage element capacity in additional to the arrival rate, and the computational complexity moreover it consider the heterogeneity of the grid environment and the heterogeneity of the jobs. The framework can predict the utilization, response time, update propagation response time of the update propagation techniques. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal number of replicas in data grid environment

    Publication Year: 2008 , Page(s): 96 - 101
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1373 KB) |  | HTML iconHTML  

    Data replication is a promising technique to increase access to performance and data availability in data grid (DG) systems. Current work on data replication in grid systems focuses on infrastructure for replication, and mechanisms for creating or deleting replicas. The problem to determine minimum number of replicas as well as their locations in DG has not been studied, well enough. In this paper, we propose an algorithm formulated by using dynamic programming-based algorithm to find optimal number of replicas (ONR) of a dataset over DG systems, so that the read cost (i.e. transferring object over the data grid systems to the end-user) and the cost of storage (i.e. site building cost) can be minimized. We have also proposed a sketch of the proof for our algorithm and its integrity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blexisma2: A distributed agent framework for constructing a semantic lexical database based on conceptual vectors

    Publication Year: 2008 , Page(s): 102 - 110
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2756 KB) |  | HTML iconHTML  

    In the framework of meaning representation in Natural Language Processing (NLP), we aim to develop a system that can be used for heterogeneous applications such as Machine Translation, Information Retrieval or Lexical Access. This system is based on six hypotheses which concern meaning representation and acquisition. In this paper, we discuss the related hypotheses that motivate the construction of a such system and how these hypotheses, together with NLP software engineering concerns, led us to conceive a distributed multi-agent system for our goals. We present Blexisma2, a distributed multi-agent system for NLP, its conceptual properties, and an example of inter-agent collaboration. The system is currently being tested on a Grid computing environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coordinator association approach to mobile agent based intrusion detection system

    Publication Year: 2008 , Page(s): 111 - 114
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (548 KB) |  | HTML iconHTML  

    Mobile agent has been adopted in the field of intrusion detection system primarily to resist against distributed attacks and makes it more flexible and scalable. Mineral models has been proposed. However, common shortcoming exist with these models like dependency on a central node or hierarchical decision making which cause to single point of failure. increasing the load of network and disability to detect sophisticated attacks. A central coordinator mobile agents architecture and neighborhood watch in virtual areas are two potential concepts that could overcome the limitation of existing models. In this work a coordinator association approach for mobile agent based IDS will be presented. The merits of this approach will be compared against existing IDSs and implementation and configuration issues will be discussed detail. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enabling grid computing for examination feedback analysis in learning system

    Publication Year: 2008 , Page(s): 115 - 120
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (6276 KB) |  | HTML iconHTML  

    In this paper, we present a distributed computing scheme for examination feedback analysis based on grid. The proposed scheme is motivated by the observation that as the number of examinations increases, the feedback analysis would become extremely slow if a single server is used. Grid computing can be used to solve the problem by evenly distributing the workload of the system to all the available nodes, thus greatly enhancing the performance of feedback analysis in a learning system. We use hyper grid learning system (HGLS)-a learning system with examination service-we developed as an example to describe the proposed scheme. We note that although discussed in the context of HGLS, the proposed scheme can be easily adapted and applied to all the e-learning systems based on grid computing. To evaluate the performance of the proposed scheme, we compare the performance of the proposed scheme with single node servers. Our experimental result shows that the proposed scheme can greatly enhance the performance of the feedback analysis in a learning system base on grid. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Converged PKI-based authorization, authentication management and delegation for an e-business

    Publication Year: 2008 , Page(s): 121 - 125
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1150 KB) |  | HTML iconHTML  

    Real E-business system has some vulnerable facts like denial of service; unavailability of distributed certificates and also creates inconsistency policy by independent stakeholders these leads to enhance the domain by converging PKI-based security services. The proposed system makes use of an existing e-business infrastructure and adds security services such as access control, authentication management and delegation by integrating AC-based DAC, X.509 PMI and X509 ID Certificates respectively. The mechanism was evidently integrated into an existing e-business infrastructure with the use of network security packages that are available in PKI to make the e-business applications more robust. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protecting teredo clients from source routing exploits

    Publication Year: 2008 , Page(s): 126 - 133
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (8112 KB) |  | HTML iconHTML  

    Tunneling techniques such as configured tunnel, 6to4, ISATAP and Teredo are common mechanisms in the early deployment of IPv6 to connect between two isolated IPv6 LANs or hosts by using the IPv4 infrastructure. We focused on Teredo tunnel as it allows users behind NATs to obtain IPv6 connectivity. Teredo tunnel has been designed to encapsulate IPv6 packet in UDP using IPv6-in-UDPin-IPv4 technology. Though, Teredo tunnel raised some security threats including source routing exploits. This paper describes source routing exploits at the Teredo client and proposes a Teredo Client Protection Algorithm (TCPA) as an alternative mechanism to protect Teredo clients from IPv6 routing header risks. Since source routing in the IPv6 header could be exploited by either external or internal attackers, we believed our TCPA algorithm plays an impact in preventing potential attacks. TCPA is based on the filtration principle of matching. It operates on the Teredo client to deny the IPv6 packets which have routing header addresses unless the user allows these addresses traverse through it. The TCPA was implemented as a simulation in a real environment and the results showed that the proposed method is efficient and its logic sounds enough to protect Teredo client from attackers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid stepping stone detection method

    Publication Year: 2008 , Page(s): 134 - 138
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1074 KB) |  | HTML iconHTML  

    Stepping stone detection can be defined as a process to discover an intermediate host correlation that used by intruder. Most of the intruders cover their track by login into intermediate host first before execute the real attack. This intermediate hosts here known as stepping stone. This paper introduces a hybrid stepping stone detection method which combines the network-based and host-based stepping stone method. By taking the special capabilities of each method, solid stepping stone detection architecture has been produced. A great explanation regarding to the architecture has been done, together with the details of each chosen approach as to develop the overall hybrid stepping stone detection method. The study shows that by applying the hybrid concept in stepping stone detection, benefits can be gained from the less number of false positive and false negative rates, robust against active perturbation and the overall stepping stone methods becomes more precise. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entropy based variable rate compression for low-bandwidth multi-media streams

    Publication Year: 2008 , Page(s): 139 - 145
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4122 KB) |  | HTML iconHTML  

    Trans-coding of Audio and video content is a recompression based on pre-processing the input and converting into a stream able wireless format over low bandwidth network which does not maintain an exactly constant bit rate. As the portable devices have an circular buffer other ad hoc networks which handles the incoming stream the encoder time indexes the stream bits according to the first frame's request and compresses and delivers packet according to the dynamic channel bandwidth. The circular buffer is said to contain the start sequence of the frame and the remaining are delivered before the Presentation Time field without ever overrunning the buffer. The compression model uses a similar algorithm as Huffman codes and the streams are optimized to be able easily seek into each frame by using a variable unitary part and fixed offset which is multiple of 2 for easy decoding. Only the frames are transmitted and the values are shared using a lookup table between the encoder and the decoder. In this paper the encoder uses multi-channel audio to mix different PCM samples across 64 volume levels of dynamic range to achieve trans-coding fps. In this paper we define an on-demand adaptive algorithm called trans-repairing for constrained devices which takes original 2n symbols and re-pairs it into m n symbols which are the current needs of low-power, low-bandwidth heterogeneous GPRS, ZigBee and other ad-hoc networks forming a collaborative multi-media smart wireless network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of embedded sensor platform for multimedia application

    Publication Year: 2008 , Page(s): 146 - 150
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1272 KB) |  | HTML iconHTML  

    Nowadays, sensor networks application become more and more important. The improvements in mechanical systems (MEMS) and the complexity of data sensed such as images or videos have resulted in the development of wireless multimedia sensor network (WMSN). However, because of the main challenge in WSN is power management, several sensor platforms with processing unit and memory limitations are not adapted for complex application like multimedia. In this paper, we present a new embedded sensor node platform with enough computing power for high bandwidth wireless communication. This new platform based on Fox board includes several sensors such as GPS positioning receiver, current consumption sensor, image sensor and wireless communication interfaces. In this work, we have shown and evaluated the transmission of high quality images using Bluetooth. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Color image segmentation using constrained compound Markov Random Field model and homotopy continuation method

    Publication Year: 2008 , Page(s): 151 - 158
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1097 KB) |  | HTML iconHTML  

    In this paper, we propose a supervised color image segmentation using homotopy continuation method and Markov random field (MRF) model. We propose a constrained compound MRF model to take care of color texture and scene images. Ohta (I1, I2, I3) model is used as the color for image segmentation. We also have extended the proposed model to inter-color-planes as well as intra-color-planes of the color model and thus a double constrained compound MRF (DCCMRF) model is proposed. The a priori MRF model parameters are estimated using the proposed homotopy continuation based method. The model parameters are the maximum pseudo likelihood estimates. The DCCRMRF model with estimated model parameters exhibited improved segmentation accuracy as compared to DCMRF, MRF, double MRF (DMRF) and JSEG method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Handling transmission error for IPv6 packets over high speed networks

    Publication Year: 2008 , Page(s): 159 - 163
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3261 KB) |  | HTML iconHTML  

    The escalating growth of web based services has led to the rapid growth of the Internet. As such the current Internet protocol version 4 (IPv4) is rapidly running out of IP addresses. A new generation of IP known as IPv6 proposed and developed by the Internet engineering task force (IETF) is gaining popularity in wide-spread use today. IPv6 offers many advantages including large address space, simple header, security, mobility and extensibility, over IPv4. In the Internet, transmission of data from one computer to another passes through a series of layers with control information added as headers at each layer. The header overheads can be reduced if the functionalities in the headers can be handled efficiently. In this paper we propose to remove error handling at the data link layer and handle it at the network layer by utilizing the features of the IPv6 header especially extension header, and the characteristics of the high speed network medium. The proposed concept would reduce the overhead of the header at the data link layer resulting in increasing the data transfer rate and reducing the bandwidth utilization of IPv6 packets over high speed networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • performance improvement of IPv6 packet transmission through address resolution using direct mapping

    Publication Year: 2008 , Page(s): 164 - 169
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2846 KB) |  | HTML iconHTML  

    The primary function of the Internet protocol (IP) is delivering datagram's across an internetwork and addressing is one of the most important functions of IP. Communication between hosts over an internetwork is accomplished using IP addresses, but the actual communication over a physical network takes place using physical addresses. The mapping of IP addresses to physical addresses is done through address resolution methods. As address resolution is performed at each hop along the path through the Internet, efficiency of this process is of concern. In IP, address resolution queries and responses consume bandwidth, and end nodes are forced to waste CPU cycles receiving and discarding address resolution queries for other nodes which is an overhead. This paper explores the possibility of improving the performance of IPv6 packet transmission through the use of an efficient address resolution method. The performance of application processes depends on the throughput of the server and network. The throughput of a server depends on its processing power and load while the throughput of a network is directly influenced by the efficiency of routers, switches and bandwidth used. This paper proposes to use address resolution through direct mapping instead of dynamic binding which would enhance the efficiency of the address resolution process and plausibly improve the performance of IPv6 packet transmission. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.