This paper introduces a search and shift mechanism for high throughput content-addressable memory(CAM). A CAM is a memory unit that process single clock cycle content matching instead of addresses using well dedicated comparison circuitry. Most mismatches can be found by searching a few bits of a search word. The most critical design challenge in CAM is to reduce power consumption associated with reduced area and increased speed. To lower power dissipation, a word circuit is often divided into two sections that are sequentially searched or even pipelined. Because of this process, most of match lines in the second section are unused. Since searching the last few bits is very fast compared to searching the rest of the bits, throughput can be increased by asynchronously initiating second-stage searches on the unused match lines as soon as a firststage search is complete. A reordered overlapped search mechanism for high throughput low energy content addressable memories (CAMs) is the existing method. By this method the latency and throughput does not shows a better improvement. Here a method of search and shift mechanism for cam is proposed to improve the latency and throughput. This method also reduces power consumption. Here a cache memory is using to store the compared result. This will reduce the number of registers used for output bits. A 32x16 bit CAM is implemented and evaluated using Xilinx simulation. Thus the proposed method improves the latency by k+1 cycles and throughput by K cycles and reduces the power consumption also.
This document describes a multi-path routing algorithm for IP networks based on flow optimization. It presents an intra-domain routing algorithm that uses multi-commodity flow optimization to enable load-sensitive forwarding over multiple paths without being constrained by traditional routing protocols like OSPF. The key idea is to aggregate all traffic destined for the same egress node into one commodity during optimization, reducing the number of commodities significantly. This makes the computation tractable and allows forwarding based on destination addresses.
I-Min: An Intelligent Fermat Point Based Energy Efficient Geographic Packet F...graphhoc
Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring both lesser energy consumption and experiencing lesser delay in packet delivery is thus suitable for networks which are delay sensitive and energy hungry at the same time. Thus a smart packet forwarding technique addressing both the issues is thus the one looked for by any geographic routing protocol. In the present paper we have proposed a Fermat point based forwarding technique which reduces the delay experienced during packet delivery as well as the energy consumed for transmission and reception of data packets.
Extensive Reviews of OSPF and EIGRP Routing Protocols based on Route Summariz...IJERA Editor
The increasing demand of computer networks is growing rapidly day by day. The growing need to distribute applications across multiple networks with high capacity and high-performance intermediate switching nodes and networks. This research primarily focuses on route redistribution and route summarization of different intra-domain routing protocols such as EIGRP and OSPF. Routing Protocols that use facilitate to exchange routing information between routers. Reasons such as multiple departments managed by multiple network Administrators, company mergers. In any case, having a multiple routing protocol and different autonomous system in networks then without route redistribution we cannot advertise route from source to destination. Of course Network complexity will increase with the size of routing table of routers then route summarization is necessity, to reduce traffic and complexity of network.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
PALBMRP: Power Aware Load Balancing Multipath Routing Protocol for MANETEswar Publications
A set of mobile hosts or nodes that form a dynamic topology which is ad hoc in nature is called MANET. There are several challenges while designing a routing protocol for MANET due to the limited energy, less processing capability, fewer resources and dynamic environmental changes. Most of the existing energy efficient protocols focuses on choosing a route or path through the nodes with maximum residual energy and distribute a network traffic blindly among generated paths. Network congestion caused due to traffic and node packet carrying capability based on its remaining energy are not considered which leads to increasing number of dead nodes and result in more energy depletion. Hence we have proposed a Power Aware Load Balancing Multipath Routing Protocol (PALBMRP) which selects an optimal energy efficient route based on multiple parameters i.e. residual energy, delay, congestion and hop count and perform load balancing by considering nodes minimal residual energy to transmit packets according to its capacity. The simulation shows the proposed protocol reduced overall energy consumption up to 9%, increased packet delivery ratio up to 12%, and reduced end to end delay up to 3%, compared to AOMDV and LBMMRE-AOMDV [1].
This document describes a multi-path routing algorithm for IP networks based on flow optimization. It presents an intra-domain routing algorithm that uses multi-commodity flow optimization to enable load-sensitive forwarding over multiple paths without being constrained by traditional routing protocols like OSPF. The key idea is to aggregate all traffic destined for the same egress node into one commodity during optimization, reducing the number of commodities significantly. This makes the computation tractable and allows forwarding based on destination addresses.
I-Min: An Intelligent Fermat Point Based Energy Efficient Geographic Packet F...graphhoc
Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring both lesser energy consumption and experiencing lesser delay in packet delivery is thus suitable for networks which are delay sensitive and energy hungry at the same time. Thus a smart packet forwarding technique addressing both the issues is thus the one looked for by any geographic routing protocol. In the present paper we have proposed a Fermat point based forwarding technique which reduces the delay experienced during packet delivery as well as the energy consumed for transmission and reception of data packets.
Extensive Reviews of OSPF and EIGRP Routing Protocols based on Route Summariz...IJERA Editor
The increasing demand of computer networks is growing rapidly day by day. The growing need to distribute applications across multiple networks with high capacity and high-performance intermediate switching nodes and networks. This research primarily focuses on route redistribution and route summarization of different intra-domain routing protocols such as EIGRP and OSPF. Routing Protocols that use facilitate to exchange routing information between routers. Reasons such as multiple departments managed by multiple network Administrators, company mergers. In any case, having a multiple routing protocol and different autonomous system in networks then without route redistribution we cannot advertise route from source to destination. Of course Network complexity will increase with the size of routing table of routers then route summarization is necessity, to reduce traffic and complexity of network.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
PALBMRP: Power Aware Load Balancing Multipath Routing Protocol for MANETEswar Publications
A set of mobile hosts or nodes that form a dynamic topology which is ad hoc in nature is called MANET. There are several challenges while designing a routing protocol for MANET due to the limited energy, less processing capability, fewer resources and dynamic environmental changes. Most of the existing energy efficient protocols focuses on choosing a route or path through the nodes with maximum residual energy and distribute a network traffic blindly among generated paths. Network congestion caused due to traffic and node packet carrying capability based on its remaining energy are not considered which leads to increasing number of dead nodes and result in more energy depletion. Hence we have proposed a Power Aware Load Balancing Multipath Routing Protocol (PALBMRP) which selects an optimal energy efficient route based on multiple parameters i.e. residual energy, delay, congestion and hop count and perform load balancing by considering nodes minimal residual energy to transmit packets according to its capacity. The simulation shows the proposed protocol reduced overall energy consumption up to 9%, increased packet delivery ratio up to 12%, and reduced end to end delay up to 3%, compared to AOMDV and LBMMRE-AOMDV [1].
Energy of Bandwidth and Storage Routing Protocol for Opportunistic NetworksEswar Publications
Opportunistic Networks is communication environment which has no stable path. Therefore, in this environment, the routing algorithms are partitioned into two main classes which are metric-based and contact-based. Essentially, contact based algorithms target for a high routing performance and small delay at the same time. However; these protocols consume high resources in terms of Energy, Bandwidth and Storage. Practically, opportunistic nodes such as smart phones and tablets suffer from the limitation of the energy and physical
memory. In addition, the environment connectivity instability leads to low bandwidth links. This work proposes a resource concentrate routing protocol for opportunistic networks, named Energy of Bandwidth and Storage Routing Protocol (EBSRP). The energy is considered as a main factor calculated as a function of bandwidth and storage. The proposed EBSRP has its queuing policy calculated as a function of energy ratio. The Simulation results are used to analyze the performance of EBSRP and it is compared with Epidemic using different
replication and dropping policies based on energy, bandwidth, and storage. The results show that the proposed protocol has better performance than Epidemic in terms of delivery ratio, delay, and overhead.
Comparison of routing protocols with performance parameters for different num...ijctet
This document compares the performance of three reactive routing protocols (Bellman-Ford, DSR, and WRP) in mobile ad hoc networks under different numbers of nodes. It analyzes the protocols based on four performance metrics: end-to-end delay, packet delivery ratio, drop ratio, and normalized routing load. The document finds that Bellman-Ford and WRP have lower delay than DSR, DSR has a higher delivery ratio and lower drop ratio than the other protocols, and DSR and Bellman-Ford have lower routing overhead than WRP. Increasing the number of nodes generally causes delay and routing overhead to increase, and the packet delivery ratio to decrease.
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
An Offline Hybrid IGP/MPLS Traffic Engineering Approach under LSP ConstraintsEM Legacy
This document proposes a novel hybrid IGP/MPLS traffic engineering method based on genetic algorithms to handle long or medium-term traffic variations. The method treats the maximum number of hops an LSP may take and the number of LSPs applied solely to improve routing as constraints. Results comparing this hybrid approach to pure IGP routing and full mesh MPLS with and without flow splitting on the German scientific network and other networks are presented.
The 3GPP Long Term Evolution Advanced (LTE-A) standard specifies a set of pioneer features such as relay nodes and carrier aggregation. At the same time, the Software Defined Networks (SDN) have become an emerging technology which provides centralized control and programmability to modern networks. In the current communication environment, cloud computing could combine the advantages of both technologies in order to create a novel cloud assisted Software Defined LTEA architecture with relay nodes. Moreover, due to the increased requirements of modern services, the optimal resource allocation is a necessity. In such a context, this paper describes a QoS aware cross carrier scheduler for downlink flows, aiming at the optimization of system resources allocation. The proposed scheduler is evaluated against the PF, MLWDF, EXP/PF, EXP RULE, LOG RULE, FLS and FLSA schedulers in a cloud assisted Software Defined LTE-A topology with relay nodes. Simulation results show that the proposed scheduler improves the real time services performance while at the same time maintains an acceptable performance for best effort flows.
This document summarizes a research paper that proposes using a cuckoo search algorithm to optimize routing in mobile ad hoc networks (MANETs). Specifically:
1) It enhances an existing Loyalty Pair Neighbors selection (LPNS) routing protocol using cuckoo search optimization to select stable neighbor nodes.
2) Cuckoo search is applied to select neighbor nodes based on hop count, energy level, and queue length to find optimal routes.
3) The proposed Enhanced LPNS with Cuckoo Search (ELPNS_Cuckoo) protocol is evaluated in simulations and shown to improve performance metrics like packet delivery ratio, throughput, and delay compared to the original LPNS protocol.
The document discusses a proposed congestion control method called ELFIQM for wireless networks. ELFIQM is inspired by the Engset loss formula queue model and aims to distribute network load evenly across multiple routes. It does this by estimating key parameters like minimum queue length, blocking probability, and congestion rate. Simulation results showed ELFIQM improved packet delivery ratio, throughput, and reduced network overhead by up to 25% compared to other queue-based load balancing techniques.
This document summarizes a research paper that proposes using a hybrid of simulated annealing algorithm and fuzzy rule base system (SA-FRBS) for adaptive coding, modulation, and power allocation in orthogonal frequency-division multiplexing (OFDM) systems. The paper first discusses related work on using evolutionary algorithms like genetic algorithms for adaptive resource allocation in OFDM. It then describes the system model and analyzes the performance of different modulation and coding schemes. Next, it formulates the rate optimization problem and describes the design of the FRBS for selecting the optimal modulation-coding pairs. Finally, it compares the performance of the proposed SA-FRBS approach through simulations.
This document summarizes a study on analyzing link weight performance in intra-domain networks. It discusses measuring network topology and traffic, modeling path selection based on IGP configuration, and controlling the network by reconfiguring IGP link weights. The goal is to optimize routing within existing protocols like OSPF to improve traffic flow based on measured conditions. Link weights are adjusted to balance loads and steer traffic onto preferable paths between routers within an autonomous system or domain.
JPJ1433 Cost-Effective Resource Allocation of Overlay Routing Relay Nodeschennaijp
This document proposes an algorithmic framework to efficiently allocate resources for overlay routing. It formulates the overlay routing resource allocation problem to find the minimum number of overlay nodes needed to satisfy certain routing properties. The problem is shown to be NP-hard, and an approximation algorithm is presented. In experiments, the approach finds near-optimal placements of less than 100 nodes to enable shortest path routing between autonomous systems, reducing average path lengths by 40%. It can also improve TCP performance and reduce delays for voice applications.
Optimal resource allocation in networked control systems using viterbi algorithmjournalBEEI
This paper presents an optimal bandwidth allocation method for a networked control system (NCS) which includes time-driven sensor, event-driven controller and random channels. A hidden markov model (HMM) with a discretized state space is formulated for the random traffic to predict the network states using a suitable data window. Network bandwidth is allocated based on the predicted traffic state subject to bounds on the deterministic traffic that guarantee acceptable NCS performance and do not exceed hardware limitations. Bandwidth allocation uses minimization of unmet bandwidth demand. A stability condition is derived for a variable but bounded sampling period interval. Computer simulation results show the effect of varying the number of discrete states for the HMM and the window width on bandwidth allocation. The results compare favorably with a published approach based on fuzzy logic.
RESPONSE SURFACE METHODOLOGY FOR PERFORMANCE ANALYSIS AND MODELING OF MANET R...IJCNCJournal
Numerous studies have analyzed the performances of routing protocols in mobile Ad-hoc networks (MANETs); most of these studies vary at most one or two parameters in experiments and do not study the interactions among these parameters. Furthermore, efficient mathematical modeling of the performances has not been investigated; such models can be useful for performance analysis, optimization, and prediction. This study aims to show the effectiveness of the response surface methodology (RSM) on the performance analysis of routing protocols in MANETs and establish a relationship between the influential parameters and these performances through mathematical modeling. Given that routing performances usually do not follow a linear pattern according to the parameters; mathematical models of factorial designs are not suitable for establishing a valid and reliable relationship between performances and parameters. Therefore, a Box–Behnken design, which is an RSM technique and provides quadratic mathematical models, is used in this study to establish a relationship. The obtained models are statistically analyzed; the models show that the studied performances accurately follow a quadratic evolution. These models provide invaluable information and can be useful in analyzing, optimizing, and predicting performances for mobile Ad-hoc routing protocols.
GA Based Optimization in LTE for Different Data with Different LoadsIRJET Journal
This document proposes using a genetic algorithm for cross-layer resource allocation in an LTE downlink multi-user OFDM system with heterogeneous traffic. The genetic algorithm is used to maximize the weighted sum capacity of multiple traffic queues by optimizing physical layer resource allocation like subcarrier and power allocation. Simulation results show the genetic algorithm approach significantly outperforms existing algorithms in terms of system bandwidth efficiency and delay for best effort and quality of service traffic.
Application of N jobs M machine Job Sequencing Technique for MPLS Traffic Eng...CSCJournals
This paper discusses Traffic Engineering with Multi-Protocol Label Switching (MPLS) in an Internet Service Provider’s (ISP) network. In this paper, we first briefly describe MPLS, Constraint-based Routing, MPLS-TE, N jobs M machine Job sequencing technique and how to implement the job sequencing technique for Multi-Protocol Label Switching Traffic Engineering. And also improve the quality of service of the network, using this technique firstly reduce the congestion for traffic engineering; minimize the packet loss in complex MPLS domain. In small network packet loss is negligible. We used NS2 discrete event simulator for simulate the above work. Keywords: Traffic Engineering, Multi-Protocol Label Switching, Constraint based routing, N jobs M machine Job Sequencing Technique, Qos, MPLS-TE.
Vlsi design process for low power design methodology using reconfigurable fpgaeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
Performance evaluation of MANET routing protocols based on QoS and energy p...IJECEIAES
Routing selection and supporting Quality of Service (QoS) are fundamental problems in Mobile Ad Hoc Network (MANET). Many different protocols have been proposed in the literature and some performance simulations are made to address this challenging task. This paper discusses the performance evaluation and comparison of two typical routing protocols; Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced DistanceVector (DSDV) based on measuring the power consumption in network with varing of the QoS parameters. In this paper, we have studied and analyzed the impact of variations in QoS parameter combined with the choice of routing protocol, on network performance. The network performance is measured in terms of average throughput, packet delivery ratio (PDR), average jitter and energy consumption. The simulations are carried out in NS-3. The simulation results show that DSDV and AODV routing protocols are less energy efficient. The main aim of this paper is to highlight the directions for the future design of routing protocol which would be better than the existing ones in terms of energy utilization and delivery ratio.
This document summarizes research on distributed path computation algorithms that aim to prevent routing loops. It introduces the Distributed Path Computation with Intermediate Variables (DIV) algorithm, which can operate with any routing algorithm to guarantee loop-freedom. DIV generalizes previous loop-free algorithms and provably outperforms them by reducing synchronous updates and helping maintain paths during network changes. The document also reviews link-state routing, distance-vector routing, and existing loop-prevention techniques like the Diffusing Update Algorithm and Loop Free Invariance algorithms.
Analysis of Triwheeler for Handicapped PersonIJERA Editor
1. The document describes a solar-powered triwheeler designed to assist handicapped persons. It discusses the key components of the triwheeler, including solar panels, batteries, a brushless DC motor, motor controller, and throttle.
2. The triwheeler aims to provide independent transportation for handicapped individuals on college campuses in a cost-effective and environmentally-friendly manner. It is powered by a solar array that charges batteries to power an electric motor.
3. The document reviews the components in detail, including how the motor controller regulates power from the batteries to the motor based on input from the throttle and hall sensors. It also discusses advantages of solar power such as generating no pollution and providing a
Management of Drilling Cuttings in Term of Volume and Economics in Oil FieldIJERA Editor
The process of drilling oil and gas wells generates large volumes of drill cuttings and spent muds. The American Petroleum Institute estimated that about 150 million barrels of drilling waste was generated yearly from onshore wells in the United States alone. Of the total drilling waste, approximately 50% is solid drilling waste. The biggest contributors of drilling wastes are drilling cuttings and mud. Reducing the drilling fluids not only it reduces the waste volume, but it also reduces the environmental effects associated with it. The main purpose of drilling waste management is to find to ways by which the generation of waste can be controlled to minimize or eliminate its negative impact on the environment. Minimizing waste is always the priority, however, it not always the most cost-effective solution. The objective of this report is to provide study in, the economics of management of drilling cuttings is explored in a case from West Kuwait.
Effect of Nano-Tio2addition on Mechanical Properties of Concrete and Corrosio...IJERA Editor
Concrete science is a multidisciplinary area of research where nanotechnology potentially offers the opportunity to enhance the understanding of concrete behavior, to engineer its properties and to lower production and ecological cost of construction materials. The main objective of this research was to evaluate the effect of nanoTiO2on compressive strength,bond strength and corrosion behavior of reinforcement bars. It has been found that the compressive strength, bond strength and corrosion resistance was increased with increasing nano-TiO2to 1.5wt. % as replacement of cement. Beyond this value, these properties decrease.
Cement Industry Overview and Market Price Forecasting In Azerbaijan IJERA Editor
Global economic situation and energy resources’ prices influence local economic trends, investment of capital, status of financial institutions and cement industry in Azerbaijan in whole. These trends influence demand and activities of cement business communities which start to optimize expenses and find new priority decisions in business. Moreover some independent economic analysts refer to forecasts that since 2016 yearly demand will increase 4-5% in Azerbaijan. Objectives are to forecast cement price in the market using Fuzzy c-means (together with Fuzzy Inference System) and ANFIS which are entered MATLAB mathematical packet and to compare the results of these methods.Taking into consideration the results of research and applied forecast models the cement price can show the stable slow increasing in the market even there is probability of some periodic fluctuations and regulating actions by the state authorities. Therefore it is high probability that the cement price will increase next 1-2 years
Energy of Bandwidth and Storage Routing Protocol for Opportunistic NetworksEswar Publications
Opportunistic Networks is communication environment which has no stable path. Therefore, in this environment, the routing algorithms are partitioned into two main classes which are metric-based and contact-based. Essentially, contact based algorithms target for a high routing performance and small delay at the same time. However; these protocols consume high resources in terms of Energy, Bandwidth and Storage. Practically, opportunistic nodes such as smart phones and tablets suffer from the limitation of the energy and physical
memory. In addition, the environment connectivity instability leads to low bandwidth links. This work proposes a resource concentrate routing protocol for opportunistic networks, named Energy of Bandwidth and Storage Routing Protocol (EBSRP). The energy is considered as a main factor calculated as a function of bandwidth and storage. The proposed EBSRP has its queuing policy calculated as a function of energy ratio. The Simulation results are used to analyze the performance of EBSRP and it is compared with Epidemic using different
replication and dropping policies based on energy, bandwidth, and storage. The results show that the proposed protocol has better performance than Epidemic in terms of delivery ratio, delay, and overhead.
Comparison of routing protocols with performance parameters for different num...ijctet
This document compares the performance of three reactive routing protocols (Bellman-Ford, DSR, and WRP) in mobile ad hoc networks under different numbers of nodes. It analyzes the protocols based on four performance metrics: end-to-end delay, packet delivery ratio, drop ratio, and normalized routing load. The document finds that Bellman-Ford and WRP have lower delay than DSR, DSR has a higher delivery ratio and lower drop ratio than the other protocols, and DSR and Bellman-Ford have lower routing overhead than WRP. Increasing the number of nodes generally causes delay and routing overhead to increase, and the packet delivery ratio to decrease.
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
An Offline Hybrid IGP/MPLS Traffic Engineering Approach under LSP ConstraintsEM Legacy
This document proposes a novel hybrid IGP/MPLS traffic engineering method based on genetic algorithms to handle long or medium-term traffic variations. The method treats the maximum number of hops an LSP may take and the number of LSPs applied solely to improve routing as constraints. Results comparing this hybrid approach to pure IGP routing and full mesh MPLS with and without flow splitting on the German scientific network and other networks are presented.
The 3GPP Long Term Evolution Advanced (LTE-A) standard specifies a set of pioneer features such as relay nodes and carrier aggregation. At the same time, the Software Defined Networks (SDN) have become an emerging technology which provides centralized control and programmability to modern networks. In the current communication environment, cloud computing could combine the advantages of both technologies in order to create a novel cloud assisted Software Defined LTEA architecture with relay nodes. Moreover, due to the increased requirements of modern services, the optimal resource allocation is a necessity. In such a context, this paper describes a QoS aware cross carrier scheduler for downlink flows, aiming at the optimization of system resources allocation. The proposed scheduler is evaluated against the PF, MLWDF, EXP/PF, EXP RULE, LOG RULE, FLS and FLSA schedulers in a cloud assisted Software Defined LTE-A topology with relay nodes. Simulation results show that the proposed scheduler improves the real time services performance while at the same time maintains an acceptable performance for best effort flows.
This document summarizes a research paper that proposes using a cuckoo search algorithm to optimize routing in mobile ad hoc networks (MANETs). Specifically:
1) It enhances an existing Loyalty Pair Neighbors selection (LPNS) routing protocol using cuckoo search optimization to select stable neighbor nodes.
2) Cuckoo search is applied to select neighbor nodes based on hop count, energy level, and queue length to find optimal routes.
3) The proposed Enhanced LPNS with Cuckoo Search (ELPNS_Cuckoo) protocol is evaluated in simulations and shown to improve performance metrics like packet delivery ratio, throughput, and delay compared to the original LPNS protocol.
The document discusses a proposed congestion control method called ELFIQM for wireless networks. ELFIQM is inspired by the Engset loss formula queue model and aims to distribute network load evenly across multiple routes. It does this by estimating key parameters like minimum queue length, blocking probability, and congestion rate. Simulation results showed ELFIQM improved packet delivery ratio, throughput, and reduced network overhead by up to 25% compared to other queue-based load balancing techniques.
This document summarizes a research paper that proposes using a hybrid of simulated annealing algorithm and fuzzy rule base system (SA-FRBS) for adaptive coding, modulation, and power allocation in orthogonal frequency-division multiplexing (OFDM) systems. The paper first discusses related work on using evolutionary algorithms like genetic algorithms for adaptive resource allocation in OFDM. It then describes the system model and analyzes the performance of different modulation and coding schemes. Next, it formulates the rate optimization problem and describes the design of the FRBS for selecting the optimal modulation-coding pairs. Finally, it compares the performance of the proposed SA-FRBS approach through simulations.
This document summarizes a study on analyzing link weight performance in intra-domain networks. It discusses measuring network topology and traffic, modeling path selection based on IGP configuration, and controlling the network by reconfiguring IGP link weights. The goal is to optimize routing within existing protocols like OSPF to improve traffic flow based on measured conditions. Link weights are adjusted to balance loads and steer traffic onto preferable paths between routers within an autonomous system or domain.
JPJ1433 Cost-Effective Resource Allocation of Overlay Routing Relay Nodeschennaijp
This document proposes an algorithmic framework to efficiently allocate resources for overlay routing. It formulates the overlay routing resource allocation problem to find the minimum number of overlay nodes needed to satisfy certain routing properties. The problem is shown to be NP-hard, and an approximation algorithm is presented. In experiments, the approach finds near-optimal placements of less than 100 nodes to enable shortest path routing between autonomous systems, reducing average path lengths by 40%. It can also improve TCP performance and reduce delays for voice applications.
Optimal resource allocation in networked control systems using viterbi algorithmjournalBEEI
This paper presents an optimal bandwidth allocation method for a networked control system (NCS) which includes time-driven sensor, event-driven controller and random channels. A hidden markov model (HMM) with a discretized state space is formulated for the random traffic to predict the network states using a suitable data window. Network bandwidth is allocated based on the predicted traffic state subject to bounds on the deterministic traffic that guarantee acceptable NCS performance and do not exceed hardware limitations. Bandwidth allocation uses minimization of unmet bandwidth demand. A stability condition is derived for a variable but bounded sampling period interval. Computer simulation results show the effect of varying the number of discrete states for the HMM and the window width on bandwidth allocation. The results compare favorably with a published approach based on fuzzy logic.
RESPONSE SURFACE METHODOLOGY FOR PERFORMANCE ANALYSIS AND MODELING OF MANET R...IJCNCJournal
Numerous studies have analyzed the performances of routing protocols in mobile Ad-hoc networks (MANETs); most of these studies vary at most one or two parameters in experiments and do not study the interactions among these parameters. Furthermore, efficient mathematical modeling of the performances has not been investigated; such models can be useful for performance analysis, optimization, and prediction. This study aims to show the effectiveness of the response surface methodology (RSM) on the performance analysis of routing protocols in MANETs and establish a relationship between the influential parameters and these performances through mathematical modeling. Given that routing performances usually do not follow a linear pattern according to the parameters; mathematical models of factorial designs are not suitable for establishing a valid and reliable relationship between performances and parameters. Therefore, a Box–Behnken design, which is an RSM technique and provides quadratic mathematical models, is used in this study to establish a relationship. The obtained models are statistically analyzed; the models show that the studied performances accurately follow a quadratic evolution. These models provide invaluable information and can be useful in analyzing, optimizing, and predicting performances for mobile Ad-hoc routing protocols.
GA Based Optimization in LTE for Different Data with Different LoadsIRJET Journal
This document proposes using a genetic algorithm for cross-layer resource allocation in an LTE downlink multi-user OFDM system with heterogeneous traffic. The genetic algorithm is used to maximize the weighted sum capacity of multiple traffic queues by optimizing physical layer resource allocation like subcarrier and power allocation. Simulation results show the genetic algorithm approach significantly outperforms existing algorithms in terms of system bandwidth efficiency and delay for best effort and quality of service traffic.
Application of N jobs M machine Job Sequencing Technique for MPLS Traffic Eng...CSCJournals
This paper discusses Traffic Engineering with Multi-Protocol Label Switching (MPLS) in an Internet Service Provider’s (ISP) network. In this paper, we first briefly describe MPLS, Constraint-based Routing, MPLS-TE, N jobs M machine Job sequencing technique and how to implement the job sequencing technique for Multi-Protocol Label Switching Traffic Engineering. And also improve the quality of service of the network, using this technique firstly reduce the congestion for traffic engineering; minimize the packet loss in complex MPLS domain. In small network packet loss is negligible. We used NS2 discrete event simulator for simulate the above work. Keywords: Traffic Engineering, Multi-Protocol Label Switching, Constraint based routing, N jobs M machine Job Sequencing Technique, Qos, MPLS-TE.
Vlsi design process for low power design methodology using reconfigurable fpgaeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
Performance evaluation of MANET routing protocols based on QoS and energy p...IJECEIAES
Routing selection and supporting Quality of Service (QoS) are fundamental problems in Mobile Ad Hoc Network (MANET). Many different protocols have been proposed in the literature and some performance simulations are made to address this challenging task. This paper discusses the performance evaluation and comparison of two typical routing protocols; Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced DistanceVector (DSDV) based on measuring the power consumption in network with varing of the QoS parameters. In this paper, we have studied and analyzed the impact of variations in QoS parameter combined with the choice of routing protocol, on network performance. The network performance is measured in terms of average throughput, packet delivery ratio (PDR), average jitter and energy consumption. The simulations are carried out in NS-3. The simulation results show that DSDV and AODV routing protocols are less energy efficient. The main aim of this paper is to highlight the directions for the future design of routing protocol which would be better than the existing ones in terms of energy utilization and delivery ratio.
This document summarizes research on distributed path computation algorithms that aim to prevent routing loops. It introduces the Distributed Path Computation with Intermediate Variables (DIV) algorithm, which can operate with any routing algorithm to guarantee loop-freedom. DIV generalizes previous loop-free algorithms and provably outperforms them by reducing synchronous updates and helping maintain paths during network changes. The document also reviews link-state routing, distance-vector routing, and existing loop-prevention techniques like the Diffusing Update Algorithm and Loop Free Invariance algorithms.
Analysis of Triwheeler for Handicapped PersonIJERA Editor
1. The document describes a solar-powered triwheeler designed to assist handicapped persons. It discusses the key components of the triwheeler, including solar panels, batteries, a brushless DC motor, motor controller, and throttle.
2. The triwheeler aims to provide independent transportation for handicapped individuals on college campuses in a cost-effective and environmentally-friendly manner. It is powered by a solar array that charges batteries to power an electric motor.
3. The document reviews the components in detail, including how the motor controller regulates power from the batteries to the motor based on input from the throttle and hall sensors. It also discusses advantages of solar power such as generating no pollution and providing a
Management of Drilling Cuttings in Term of Volume and Economics in Oil FieldIJERA Editor
The process of drilling oil and gas wells generates large volumes of drill cuttings and spent muds. The American Petroleum Institute estimated that about 150 million barrels of drilling waste was generated yearly from onshore wells in the United States alone. Of the total drilling waste, approximately 50% is solid drilling waste. The biggest contributors of drilling wastes are drilling cuttings and mud. Reducing the drilling fluids not only it reduces the waste volume, but it also reduces the environmental effects associated with it. The main purpose of drilling waste management is to find to ways by which the generation of waste can be controlled to minimize or eliminate its negative impact on the environment. Minimizing waste is always the priority, however, it not always the most cost-effective solution. The objective of this report is to provide study in, the economics of management of drilling cuttings is explored in a case from West Kuwait.
Effect of Nano-Tio2addition on Mechanical Properties of Concrete and Corrosio...IJERA Editor
Concrete science is a multidisciplinary area of research where nanotechnology potentially offers the opportunity to enhance the understanding of concrete behavior, to engineer its properties and to lower production and ecological cost of construction materials. The main objective of this research was to evaluate the effect of nanoTiO2on compressive strength,bond strength and corrosion behavior of reinforcement bars. It has been found that the compressive strength, bond strength and corrosion resistance was increased with increasing nano-TiO2to 1.5wt. % as replacement of cement. Beyond this value, these properties decrease.
Cement Industry Overview and Market Price Forecasting In Azerbaijan IJERA Editor
Global economic situation and energy resources’ prices influence local economic trends, investment of capital, status of financial institutions and cement industry in Azerbaijan in whole. These trends influence demand and activities of cement business communities which start to optimize expenses and find new priority decisions in business. Moreover some independent economic analysts refer to forecasts that since 2016 yearly demand will increase 4-5% in Azerbaijan. Objectives are to forecast cement price in the market using Fuzzy c-means (together with Fuzzy Inference System) and ANFIS which are entered MATLAB mathematical packet and to compare the results of these methods.Taking into consideration the results of research and applied forecast models the cement price can show the stable slow increasing in the market even there is probability of some periodic fluctuations and regulating actions by the state authorities. Therefore it is high probability that the cement price will increase next 1-2 years
Influence of Ruthenium doping on Structural and Morphological Properties of M...IJERA Editor
The present work examines the effect of Ru doping on MoO3 thin films on steel substrate deposited by Sol-gel spin coat method. The annealing temperature was 6000C for pure MoO3 and 8000C for Ru doped thin films. The doping concentration of Ru was varied from 10 to 50wt%. The influence of Ru doping on structural and morphological properties of MoO3 thin films were studied. The XRD revealed that all films are highly crystalline in nature with monoclinic phase for molybdenum peaks. In the doped XRD pattern some new peaks were observed and are matched with ruthenium orthorhombic phase indicating an incorporation of dopant in pure molybdenum oxide. The same is confirmed with the compositional analysis by EDAX. The SEM images of the MoO3 resemble a rod like surface with porous morphology. Incorporation of Ru ions in molybdenum oxide decreases the length of the rods and vanishes after 40wt%. Tetragonal grain size increases from 20wt% of Ru and becomes maximum at 50wt% of Ru doped thin films
Dielectric properties of Ni-Al nano ferrites synthesized by citrate gel methodIJERA Editor
Ni–Al ferrite with composition of NiAlxFe2-xO4 (x=0.2, 0.4 0.6, and 0.8, ) were prepared by citrate gel method. The Dielectric Properties for all the samples were investigated at room temperature as a function of frequency. The Dielectric constant shows dispersion in the lower frequency region and remains almost constant at higher frequencies. The frequency dependence of dielectric loss tangent (tanδ) is found to be abnormal, giving a peak at certain frequency for mixed Ni-Al ferrites. A qualitative explanation is given for the composition and frequency dependence of the dielectric loss tangent.
Design of Industrial Electro-Hydraulic Valves, New ApproachIJERA Editor
A fully flexible valve actuation systems are being under consideration as an enabling technology for advanced internal combustion engine concepts. Electro-hydraulic valve actuator systems are being considered as a dominating variable valve technology. Compared to the servo control system, the system using a proportional valve has the advantages of low price, high anti-pollution ability and high reliability. Unlike existing electromechanical or servo actuated electro-hydraulic valve actuation systems, precise valve motion control is achieved with an internal feedback mechanism. This feedback mechanism can be turned on or off in real-time using simple two state valves which helps reduce the system cost and enables mass production.
Thermoelectric Power Studies Cu-Cd Nano FerritesIJERA Editor
Thermoelectric Power Studies of Cadmium Substituted Copper nano Ferrites of various compositions were investigated from room temperature to well beyond the curie temperature by differential method. The Seebeck coefficient is negative for all compositions showing that these ferrites behave as n-type semi conductors. Plots of Seebeck coefficient verses temperature shows maximum at Curie temperature. On the basis of these results an explanation for the conduction mechanism in Cu-Cd mixed ferrites is suggested
Frequent Item set Mining of Big Data for Social MediaIJERA Editor
Big data is a term for massive data sets having large, more varied and complex structure with the difficulties of storing, analyzing and visualizing for further processes or results. Bigdata includes data from email, documents, pictures, audio, video files, and other sources that do not fit into a relational database. This unstructured data brings enormous challenges to Bigdata.The process of research into massive amounts of data to reveal hidden patterns and secret correlations named as big data analytics. Therefore, big data implementations need to be analyzed and executed as accurately as possible. The proposed model structures the unstructured data from social media in a structured form so that data can be queried efficiently by using Hadoop MapReduce framework. The Bigdata mining is essential in order to extract value from massive amount of data. MapReduce is efficient method to deal with Big data than traditional techniques.The proposed Linguistic string matching Knuth-Morris-Pratt algorithm and K-Means clustering algorithm gives proper platform to extract value from massive amount of data and recommendation for user.Linguistic matching techniques such as Knuth–Morris–Pratt string matching algorithm are very useful in giving proper matching output to user query. The K-Means algorithm is one which works on clustering data using vector space model. It can be an appropriate method to produce recommendation for user.
Effects of Zno on electrical properties of Polyaniline CompositesIJERA Editor
In the present investigation, Polyaniline / Zinc oxide with various weight percentage of Zinc oxide (10%, 20%, 30, 40% and 50%) were synthesized by in-situ polymerization method. The prepared composites were characterized by X-Ray diffraction (XRD), Scanning Electron Microscopy (SEM) and Fourier Infrared Spectroscopy (FTIR). The dc conductivity of the samples was measured as a function of temperature in the range 30-180oC and it was found that increasing the concentration of ZnO particles increases the conductivity. Ac conductivity of the composites was studied with respect to frequency.
Behaviour of Single Pile in Reinforced Slope Subjected to Inclined LoadIJERA Editor
Deep foundations, including driven piles, are used to support vertical loads of structures and lateral forces. Typical structures subjected to lateral loads include bridge abutments, transmission tower, sand offshore platforms. Traffic, wind, wave, and seismic forces are common types of lateral loads subjected to pile foundations. The present work is focused on understanding the lateral load capacity of vertical piles located near crest of the slope and subjected to the lateral and inclined loads. The experimental investigation was carried out to study the effect of reinforcing an earth slope on the inclined loading behavior of a single vertical pile located near the slope. Layers of geogrid were used to reinforce a sandy slope of 1V:2H. The parametric studies were performed by varying the length of pile(L), angle of inclination of load (θ), number of geogrid reinforcement (Nr) and crest distance. It was observed that the lateral load capacity of pile depends upon these parameters. The lateral load capacity of pile increases with increase in inclination of load, length of pile(L), number of geogrid reinforcement (Nr) and crest distance
Effect of Weaknesses of the Internal Control Systems And NonCompliance With S...IJERA Editor
The purpose of this study was to see whether there is an influence of Weaknesses of the Internal Control System and Non-compliance With Statutory Provisions on the audit opinion of the audit board. The weakness of the internal control system measured by the audit findings Audit Board consisting of weaknesses of the accounting control system and reporting, and weaknesses of the budget implementation control system and weaknesses of the internal control structure. While non-compliance with statutory provisions are measured based on the audit findings Audit Board consisting of local loss, the potential loss of local , lack of receipt, administration, waste, inefficiency and ineffectiveness. This study is a survey of the region of the provincial government of DKI Jakarta and Banten for 2010 to 2014. Samples in this study were all the Local Government Unit that generate financial reports of local governments totaling nine units, so this study is census research, in the sense that the entire population sampled. Data analysis method used is the ordinal logistic regression because the dependent variable is the rank (category) and the data is not normal. From the results of the data analysis and discussion, it can be concluded that the weaknesses of the internal control system and non-compliance with statutory provisions affect the audit opinion of the audit board either jointly or partially.
A Review of Strategies to Promote Road Safety in Rich Developing Countries: t...IJERA Editor
Road safety policies, strategies and action plans, along with trends in road traffic injuries (RTIs) in the oil-rich Gulf Cooperative Council (GCC) countries were examined to appraise their road safety work with an overall objective of identifying key measures and initiatives that would reduce RTA and their resulting consequences in these countries. Data on RTIs was obtained from police and from vital statistics and was analyzed. Research papers, policy documents, and strategies, obtained from relevant stakeholders in the six GCC countries, were reviewed and discussed. Traffic Safety Programs and action plans, which were the most fundamental documents in the development of the GCC countries’ road safety policies and strategies, were reviewed. Policy documents on road safety and traffic related issues were searched on the websites of related authorities. Published research on road safety in GCC countries was searched using available databases. Analysis of accident data shows that the fatality rates in all the GCC countries are much higher than developed countries with good safety records. The six administrations started the fundamental traffic safety programs to combat the increase in RTIs, with some succeeding in reducing RTI rates by implementing vast road safety improvements. However, RTIs increased again mainly because of increasing traffic volume and high-risk driving behavior. Developing and implementing national road safety strategies in some GCC countries was successful in reducing the RTI rates. The road safety situation in the six GCC countries was assessed showing high crash and fatality rates compared to developed countries. Most GCC countries still suffer from sustainable increase in traffic crashes despite the efforts to reduce their magnitude and severity. Some of these countries have developed and implemented national road safety strategies, while countries like Oman still need to develop such a long-term strategy. Following the review of the current progress in road safety initiatives developed or implemented, it is apparent that there is still considerable room for improvement. In view of the fact that the oil-rich GCC countries have similar economic, social, and political background, a number of specific areas of action common to all countries were identified to achieve a safer road environment in the studied countries.
In the field of touchy processing, many people would access the touchy phones, keypads etc. where the disadvantage of touchy system is all about touch screen. So, to overcome this problem, we are going to develop a project based on touch less device which is used to access and process our data with minimum time complexity for optimization of the sourcing data. Our project contain marker to highlight required key term. Touch less detects both the size and location of “Marker’s Gestures” for writing purposes. Whereas the camera played a key role to select our object that is an image for it’s processing. In this, we are giving command on camera to identify the gestures by Touch less SDK and reducing manual efforts.
Performance Study of Wind Friction Reduction Attachments for Van Using Comput...IJERA Editor
Road transport is the key factor as it is the major method to connect places through land. Along with wide use of internal combustion engines for this purpose comes the massive consumption of fossil fuels by vehicles. Most of the research today is toward making efficient machines. This paper mainly deals with providing attachments to existing models of vehicle to make it more efficient. An assessment of the impact of aerodynamic drag and its relationship to energy consumption presented. A few models are designed and analysed for reducing drag with the help of Attachments. Solid works is used to model and ANSYS Fluent is used for CFD analysis. The results of Cd of various configuration is analysed, 0.427 being the Cd for conventional Van is reduced to 0.234 for van with front and rear attachment
Performance Improvement Of Bengali Text Compression Using Transliteration And...IJERA Editor
In this paper, we propose a new compression technique based on transliteration of Bengali text to English. Compared to Bengali, English is a less symbolic language. Thus transliteration of Bengali text to English reduces the number of characters to be coded. Huffman coding is well known for producing optimal compression. When Huffman principal is applied on transliterated text significant performance improvement is achieved in terms of decoding speed and space requirement compared to Unicode compression.
Este documento presenta una breve introducción a las células, incluyendo sus principales características y organelos como el aparato de Golgi, retículo endoplasmático, lisosomas, mitocondrias y cloroplastos. También distingue entre células animales y vegetales.
Este documento resume las características básicas de las células animales y vegetales, incluyendo sus organelos y estructuras. También describe los diferentes tipos de células como procariotas, eucariotas, unicelulares y pluricelulares. Finalmente, menciona que las células fueron descubiertas por el científico inglés Robert Hooke en 1665 usando un microscopio.
Comparison of Total Actual Cost for Different Types of Lighting Bulbs Used In...IJERA Editor
This paper presents a comparison of actual cost for three different lighting bulbs typically used in houses. They are Incandescent light, Compact Florescent Light CFL and Light Emitted Diode Light LED. The comparison takes in respect how much each lighting bulb consumes actual power and how much it costs in respect of Kuwait’s regulation. Thus, the cost efficiency of each type is calculated. The study deals with typical houses in Kuwait taking in respect the regulation of the distribution and installation rules (R6), [1] of the ministry of water and electricity in Kuwait for the year 2014
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive functioning. Exercise causes chemical changes in the brain that may help alleviate symptoms of mental illness and boost overall mental well-being.
A HIGH SPEED LOW POWER CAM AND TCAM WITH A PARITY BIT AND POWER GATED ML SENSINGpharmaindexing
The document describes a proposed improvement to content addressable memory (CAM) to reduce power consumption and increase search speed. It introduces using a parity bit that requires less than 1% additional area and power overhead but can reduce sensing delay by 39% by making the 1-mismatch case stronger. It also proposes a power gated sense amplifier that can auto-turn off power to unused comparison elements and reduce average power consumption by 64%. The design can operate down to 0.5V supply voltage.
This document presents a new technique to reduce power consumption and increase speed in Content Addressable Memory (CAM) using memory partition and clock gating. The proposed CAM design partitions the memory into segments based on the most significant bits to check for matches. Since most words fail to match in their segments, the search can be discontinued for those segments, reducing power and increasing speed. Clock gating is also used to power gate unused portions of the CAM, further reducing static and dynamic power. Simulation and analysis using Quartus II and ModelSim show the proposed design reduces total power dissipation from 369.9mW to 46.3mW compared to an existing design.
A high speed low power cam with a parity bit andvaalgin
This summarizes a technical document about improving content addressable memory (CAM) designs.
1) It introduces a parity bit that reduces sensing delay by 39% with less than 1% overhead, by making the 1-mismatch case look like 2 mismatches.
2) It proposes a power gating technique that reduces peak and average power by automatically turning off power to unused comparison elements, lowering average power consumption by 64%.
3) The techniques aim to improve speed, power, and robustness of CAM designs against process variations while allowing operation down to 0.5V supply voltage.
This document describes research on an efficient reconfigurable content addressable memory (CAM). CAM is a type of memory that can perform high-speed searches. It introduces a cache-CAM (C-CAM) that adds a small cache memory to reduce the high power consumption of CAMs. Simulation and test chip results show the C-CAM can save 40-80% power compared to a conventional CAM by caching frequently accessed data and avoiding searches of the larger CAM in many cases. C-CAM performance depends on the cache size and hit rate, with the maximum power savings achieved with a cache size of around 4K bits and a hit rate of 90%.
Investigations on Implementation of Ternary Content Addressable Memory Archit...IRJET Journal
This document discusses investigations on implementing a ternary content addressable memory (TCAM) architecture called Z-TCAM in a Spartan 3E field programmable gate array (FPGA). The Z-TCAM architecture was implemented and achieved a hardware utilization of 12.26%, latency of 3110.55 nanoseconds, and power consumption of 45.16 milliwatts. Previous TCAM implementations and architectures are also reviewed, including issues with TCAM density, speed, and power consumption compared to static random access memory (SRAM) technologies. The document focuses on optimizing TCAM architectures for factors like area, power, latency, and capacity.
REDUCTION OF BUS TRANSITION FOR COMPRESSED CODE SYSTEMSVLSICS Design
Low power VLSI circuit design is one of the most important issues in present day technology. One of the ways of reducing power is to reduce the number of transitions on the bus. The main focus here is to present a method for reducing the power consumption of compressed-code systems by inverting the bits that are transmitted on the bus. Compression will generally increase bit-toggling, as it removes redundancies from the code transmitted on the bus. Arithmetic coding technique is used for compression /decompression and bit-toggling reduction is done by using shift invert coding technique. Therefore, there is also an additional challenge, to find the right balance between compression ratio and the bit-toggling reduction. This technique requires only 2 extra bits for the low Power coding, irrespective of the bit-width of the bus for compressed data.
PERFORMANCE EVALUATION OF LOW POWER CARRY SAVE ADDER FOR VLSI APPLICATIONSVLSICS Design
This document discusses the performance evaluation of a low power carry save adder (CSA) for VLSI applications. It begins with an abstract that examines subthreshold leakage in CSA circuits and how reducing threshold voltage can lower power consumption. The document then reviews previous work on CSA design. It presents the architecture of a proposed 4-bit CSA designed using gate diffusion input cells to reduce area and power. Simulation results show the CSA has total average power of 4.93μW, propagation delay of 16.3ns, and 37% reduced area due to using GDI cells. The CSA operates as intended in subthreshold regions with low static leakage current.
PERFORMANCE EVALUATION OF LOW POWER CARRY SAVE ADDER FOR VLSI APPLICATIONSVLSICS Design
This report examines the subject of sub threshold leakage on carry save adder. When the gate to source voltage reduces to the threshold voltage at that place is yet some amount of current flow in the circuit and that is undesired. As the process technology advancing much rapidly the threshold voltage of MOS devices reduces very drastically, and it must be applied in lower power devices since it contributes to low amount of leakage current which confine increases the power consumption of the devices. Adders are the basic building blocks for any digital circuit design and used in almost all arithmetic’s. The CSA proves efficient adders due to its quick and precise computations. Hence this paper performs sub threshold analysis on CSA and the scrutinize results that the total average power is around 4.93µW, the propagation delay for complete operation is 16.3ns and since this design uses GDI cell so there is a reduction in area with 37%.
PERFORMANCE EVALUATION OF LOW POWER CARRY SAVE ADDER FOR VLSI APPLICATIONSVLSICS Design
This report examines the subject of sub threshold leakage on carry save adder. When the gate to source voltage reduces to the threshold voltage at that place is yet some amount of current flow in the circuit and that is undesired. As the process technology advancing much rapidly the threshold voltage of MOS devices reduces very drastically, and it must be applied in lower power devices since it contributes to low amount
of leakage current which confine increases the power consumption of the devices. Adders are the basic
building blocks for any digital circuit design and used in almost all arithmetic’s. The CSA proves efficient adders due to its quick and precise computations. Hence this paper performs sub threshold analysis on CSA and the scrutinize results that the total average power is around 4.93µW, the propagation delay for complete operation is 16.3ns and since this design uses GDI cell so there is a reduction in area with 37%.
This document discusses adaptive communication techniques using soft computing methods. It proposes using Ant Colony Optimization (ACO) combined with a Fuzzy Rule Base System (FRBS) for adaptive coding, modulation, and power allocation in an Orthogonal Frequency Division Multiplexing (OFDM) system. It compares the proposed approach to other techniques like Simulated Annealing and FRBS, and to a fixed power scheme. The key contributions of the paper are applying ACO and FRBS together for adaptive parameter selection in OFDM to maximize capacity while meeting power and bit error rate constraints.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9791938249
Telephone: 0413-2211159.
Design and Implementation of Efficient Ternary Content Addressable Memory ijcisjournal
A CAM is used for store and search data and using comparison logic circuitry implements the table
lookupfunction in a single clock cycle. CAMs are main application of packet forwarding and packet
classification in Network routers. A Ternary content addressable memory(TCAM) has three type of states
‘0’,’1’ and ‘X’(don’t care) and which is like as binary CAM and has extra feature of searching and storing.
The ‘X’ option may be used as ‘0’ and ‘1’. TCAM performs high-speed search operation in a deterministic
time. In this work a TCAM circuit is designed by using current race sensing scheme and butterfly matchline
(ML) scheme. The speed and power measures of both the TCAM designs are analysed separately. A Novel
technique is developed which is obtained by combining these two techniques which results in significant
power and speed efficiencies.
M-EPAR to Improve the Quality of the MANETsIJERA Editor
In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose modified efficient power aware routing (M-EPAR), a new power aware routing protocol that increases the network lifetime of MANET. Designing a power aware routing algorithm or technique is one of the most important point considered in Mobile Ad Hoc Networks. These nodes are driven by reactive protocols where broadcasting is mandatory to form a path between two nodes. So in case of death of the node resulting out of less battery calls for re-routing. Since many existing techniques focuses on energy aware routing this paper presents combination of energy aware routing merged with link quality determined by packet drop rate. The proposed scheme has outperformed the existing technique in terms of packet delivery ratio, throughput and energy consumption.
JOINT-DESIGN OF LINK-ADAPTIVE MODULATION AND CODING WITH ADAPTIVE ARQ FOR COO...IJCNCJournal
This paper analyzes the efficiency of a joint-design of an adaptive modulation and coding (AMC) at the
physical (PHY) layer with an adaptive Rmax-truncated selective-repeat automatic repeat request (ARQ)
protocol at the medium access control (MAC) layer to maximize the throughput of cooperative nonregenerative
relay networks under prescribed delay and/or error performance constraints. Particularly, we
generalize the existing design model/results for cross-layer combining of AMC along with truncated ARQ
in non-cooperative diversity networks in three-folds: (i) extension of the cross-layer PHY/MAC design or
optimization to cooperative diversity systems; (ii) generalization/unification of analytical expressions for
various network performance metrics to generalized block fading channels with independent but nonidentically
distributed (i.n.d) fading statistics among the spatially distributed nodes; (iii) analysis of the
effectiveness of joint-adaptation of the maximum retransmission limit Rmax of ARQ protocol and
cooperative diversity order N for delay-insensitive applications. Our insightful numerical results reveal
that the average throughput can be increased significantly by judiciously combining two additional degrees
of freedom (N and Rmax) that are available in cooperative amplify-and-forward (CAF) relay networks
besides employing AMC at the PHY layer, especially in the most challenging low signal-to-noise ratio
(SNR) regime.
Implementation and Design of High Speed FPGA-based Content Addressable Memoryijsrd.com
CAM stands for content addressable memory. It is a special type of computer memory used in very high speed searching application. A CAM is a memory that implements the high speed lookup-table function in a single clock cycle using dedicated comparison circuitry. It is also known as associative memory or associative array although the last term used for a programming data structure. Unlike standard computer memory (RAM) in which user supplies the memory address and the RAM returns the data word stored in that memory address, CAM is designed in such a way that user supplies data word and CAM searches its entire memory to see if that data word stored anywhere in it. If the data word is found, the CAM returns a list of one or more storage address where the word was found. This design coding, simulation, logic synthesis and implementation will be done using various EDA tools.
The document proposes an interference-oriented topology control algorithm for delay-constrained mobile ad-hoc networks (MANETs). It aims to jointly consider delay and interference to control topology while minimizing interference. The algorithm takes into account transmission delay, contention delay, queuing delay, and interference constraints. Simulation results show the algorithm effectively reduces delay and improves performance for delay-constrained MANETs by controlling topology to meet interference constraints and increasing transmit range to meet delay requirements. Node mobility impact on the algorithm is also investigated.
Dominant block guided optimal cache size estimation to maximize ipc of embedd...ijesajournal
Embedded system software is highly constrained from performance, memory footprint, energy consumption and implementing cost view point. It is always desirable to obtain better Instructions per Cycle (IPC). Instruction cache has major contribution in improving IPC. Cache memories are realized on the same chip where the processor is running. This considerably increases the system cost as well. Hence, it is required to maintain a trade-off between cache sizes and performance improvement offered. Determining the number of cache lines and size of cache line are important parameters for cache designing. The design space for cache is quite large. It is time taking to execute the given application with different cache sizes on an instruction set simulator (ISS) to figure out the optimal cache size. In this paper, a technique is proposed to identify a number of cache lines and cache line size for the L1 instruction cache that will offer best or nearly best IPC. Cache size is derived, at a higher abstraction level, from basic block analysis in the Low Level Virtual Machine (LLVM) environment. The cache size estimated from the LLVM environment is cross validated by simulating the set of benchmark applications with different cache sizes in SimpleScalar’s out-of-order simulator. The proposed method seems to be superior in terms of estimation accuracy and/or estimation time as compared to the existing methods for estimation of optimal cache size parameters (cache line size, number of cache lines).
Dominant block guided optimal cache size estimation to maximize ipc of embedd...ijesajournal
Embedded system software is highly constrained from performance, memory footprint, energy consumption
and implementing cost view point. It is always desirable to obtain better Instructions per Cycle (IPC).
Instruction cache has major contribu
tion in improving IPC. Cache memories are realized on the same chip
where the processor is running. This considerably increases the system cost as well. Hence, it is required to
maintain a trade
-
off between cache sizes and performance improvement offered.
Determining the number
of cache lines and size of cache line are important parameters for cache designing. The design space for
cache is quite large. It is time taking to execute the given application with different cache sizes on an
instruction set simula
tor (ISS) to figure out the optimal cache size. In this paper, a technique is proposed to
identify a number of cache lines and cache line size for the L1 instruction cache that will offer best or
nearly best IPC. Cache size is derived, at a higher abstract
ion level, from basic block analysis in the Low
Level Virtual Machine (LLVM) environment. The cache size estimated from the LLVM environment is cross
validated by simulating the set of benchmark applications with different cache sizes in SimpleScalar’s out
-
of
-
order simulator. The proposed method seems to be superior in terms of estimation accuracy and/or
estimation time as compared to the existing methods for estimation of optimal cache size parameters (cache
line size, number of cache lines).
A CAM is a device that used for search and store data and using comparison logic circuitry
implements the table lookup function in a single clock cycle. CAMs are main application of packet forwarding
and packet classification in Network routers [10]. A Ternary content addressable memory(TCAM) has three
type of states ‘0’,’1’ and ‘X’(don’t care) and which is like as binary CAM and has extra feature of searching
and storing. The ‘X’ option may be used as ‘0’ and ‘1’. TCAM performs high-speed search operation in a
deterministic time. This type of devices power and speed are the important. So, in this work a TCAM circuit is
designed by using butterfly match line (ML) Technique. The speed and power measures of the TCAM design and
the experimental results show that outflow power may be reduced compared with the traditional TCAM design.
Similar to High- Throughput CAM Based On Search and Shift Mechanism (20)
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...shadow0702a
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTjpsjournal1
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
The CBC machine is a common diagnostic tool used by doctors to measure a patient's red blood cell count, white blood cell count and platelet count. The machine uses a small sample of the patient's blood, which is then placed into special tubes and analyzed. The results of the analysis are then displayed on a screen for the doctor to review. The CBC machine is an important tool for diagnosing various conditions, such as anemia, infection and leukemia. It can also help to monitor a patient's response to treatment.
UNLOCKING HEALTHCARE 4.0: NAVIGATING CRITICAL SUCCESS FACTORS FOR EFFECTIVE I...amsjournal
The Fourth Industrial Revolution is transforming industries, including healthcare, by integrating digital,
physical, and biological technologies. This study examines the integration of 4.0 technologies into
healthcare, identifying success factors and challenges through interviews with 70 stakeholders from 33
countries. Healthcare is evolving significantly, with varied objectives across nations aiming to improve
population health. The study explores stakeholders' perceptions on critical success factors, identifying
challenges such as insufficiently trained personnel, organizational silos, and structural barriers to data
exchange. Facilitators for integration include cost reduction initiatives and interoperability policies.
Technologies like IoT, Big Data, AI, Machine Learning, and robotics enhance diagnostics, treatment
precision, and real-time monitoring, reducing errors and optimizing resource utilization. Automation
improves employee satisfaction and patient care, while Blockchain and telemedicine drive cost reductions.
Successful integration requires skilled professionals and supportive policies, promising efficient resource
use, lower error rates, and accelerated processes, leading to optimized global healthcare outcomes.
Comparative analysis between traditional aquaponics and reconstructed aquapon...bijceesjournal
The aquaponic system of planting is a method that does not require soil usage. It is a method that only needs water, fish, lava rocks (a substitute for soil), and plants. Aquaponic systems are sustainable and environmentally friendly. Its use not only helps to plant in small spaces but also helps reduce artificial chemical use and minimizes excess water use, as aquaponics consumes 90% less water than soil-based gardening. The study applied a descriptive and experimental design to assess and compare conventional and reconstructed aquaponic methods for reproducing tomatoes. The researchers created an observation checklist to determine the significant factors of the study. The study aims to determine the significant difference between traditional aquaponics and reconstructed aquaponics systems propagating tomatoes in terms of height, weight, girth, and number of fruits. The reconstructed aquaponics system’s higher growth yield results in a much more nourished crop than the traditional aquaponics system. It is superior in its number of fruits, height, weight, and girth measurement. Moreover, the reconstructed aquaponics system is proven to eliminate all the hindrances present in the traditional aquaponics system, which are overcrowding of fish, algae growth, pest problems, contaminated water, and dead fish.
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
High- Throughput CAM Based On Search and Shift Mechanism
1. Anagha Krishna N.V. Int. Journal of Engineering Research and Application www.ijera.com
ISSN : 2248-9622, Vol. 6, Issue 10, ( Part -1) October 2016, pp.53-57
www.ijera.com 53|P a g e
High- Throughput CAM Based On Search and Shift Mechanism
Anagha Krishna N.V1
, Aparna K.C2
1
M. Tech Student, Electronics and Communication Department
2
Assistant Professor, Electronics and Communication Department
ABSTRACT
This paper introduces a search and shift mechanism for high throughput content-addressable memory(CAM). A
CAM is a memory unit that process single clock cycle content matching instead of addresses using well
dedicated comparison circuitry. Most mismatches can be found by searching a few bits of a search word. The
most critical design challenge in CAM is to reduce power consumption associated with reduced area and
increased speed. To lower power dissipation, a word circuit is often divided into two sections that are
sequentially searched or even pipelined. Because of this process, most of match lines in the second section are
unused. Since searching the last few bits is very fast compared to searching the rest of the bits, throughput can
be increased by asynchronously initiating second-stage searches on the unused match lines as soon as a first-
stage search is complete. A reordered overlapped search mechanism for high throughput low energy content
addressable memories (CAMs) is the existing method. By this method the latency and throughput does not
shows a better improvement.
Here a method of search and shift mechanism for cam is proposed to improve the latency and throughput. This
method also reduces power consumption. Here a cache memory is using to store the compared result. This will
reduce the number of registers used for output bits. A 32x16 bit CAM is implemented and evaluated using
Xilinx simulation. Thus the proposed method improves the latency by k+1 cycles and throughput by K cycles
and reduces the power consumption also.
Index Terms: Asynchronous, CAM, Latency, Throughput
I. INTRODUCTION
Content-addressable memory (CAM) is a
special type of computer memory used in certain
very-high-speed searching applications. It is also
known as associative memory and executes a look
up-table function in parallel. CAM compares input
search data against a table of stored data, and
returns the address of the matching data. CAMs
have a single clock cycle throughput making them
faster than other hardware- and software-based
search systems. An input search word is compared
with a table of stored words and the matching word
is obtained at high speed through a parallel equality
search. CAMs can be used in a wide variety of
applications requiring high search speeds. CAMs
are used for many applications, such as parametric
curve extraction, Hough transformation, Lempel-
Ziv compression, a human body communication
controller, a periodic event generator, cache
memory, a virus-detection processor, and packet
forwarding and packet classification in network
routers.[1] The primary commercial application of
CAMs today is to classify and forward Internet
protocol (IP) packets in network routers. In
networks like the Internet, a message such an as e-
mail or a Web page is transferred by first breaking
up the message into small data packets of a few
hundred bytes, and, then, sending each data packet
individually through the network. These packets are
routed from the source, through the intermediate
nodes of the network (called routers), and
reassembled at the destination to reproduce the
original message. The function of a router is to
compare the destination address of a packet to all
possible routes, in order to choose the appropriate
one.[2]
A CAM is a good choice for implementing
this lookup operation due to its fast search
capability. However, the speed of a CAM comes at
the cost of increased silicon area and power
consumption, two design parameters that designers
strive to reduce. As CAM applications grow,
demanding larger CAM sizes, the power problem is
further exacerbated. Reducing power consumption,
without sacrificing speed or area, is the main thread
of recent research in large-capacity CAMs. CAMs
often contain a few hundred to 32 K entries for
network routers, where each entry or word circuit
contains several dozens of CAM cells. Each input-
search bit is compared with its CAM-cell bit and
the comparison result determines whether a pass
transistor in the CAM cell attached to the match
line (ML) of a word circuit is in on or off states.
In CAM each word circuit contains several
dozens of CAM cells. Each input-search bit is
compared with its CAM-cell bit and if the
comparison matches then the pass transistor in the
CAM cell attached to the match line (ML) of a
word circuit is in on state, else it will be in off state.
CAM cells are classified into two types: NOR and
RESEARCH ARTICLE OPEN ACCESS
2. Anagha Krishna N.V. Int. Journal of Engineering Research and Application www.ijera.com
ISSN : 2248-9622, Vol. 6, Issue 10, ( Part -1) October 2016, pp.53-57
www.ijera.com 54|P a g e
NAND NOR and NAND. A NOR-type word circuit
operates at high speed because pass transistors are
connected between a ML to a ground line in
parallel; however it consumes large power
dissipation.[1]
It is because mismatched word circuits
discharge their ML capacitances to the ground line,
where most of the word circuits tend to be
mismatched in a CAM. In contrast, a NAND-type
word circuit operates at medium speed because
pass transistors are connected serially between a
ML to a ground line. Because very few matched
word circuits discharge their ML capacitances, a
NAND-type word circuit reduces the power
dissipation of MLs compared to the NOR-type
word circuit. A pipelined approach is a general
solution to improve the throughput. In pipelined
approach the match-lines are divided into two
pipeline segments, each segment with its own
MLSA to decide if there is a match and its own
pipeline flip-flop to store the outcome of the match
operation for the segment. Segmenting the match-
lines saves power because most words will miss in
the first segment, eliminating the need to activate
the subsequent segments. To save search-line
power, one would ideally use low-swing signalling
on the SLs. In the existing system we have a
reordered overlapped search mechanism for a high-
throughput low-energy CAM. It includes two new
approaches: a reordered word-overlapped search
(RWOS) at the scheduling level and phase-
overlapped processing (POP) at the circuit level.
In a CAM, most mismatches can be found
by searching a few bits of a search word. In the
proposed CAM, a NAND-type word circuit is
partitioned into two segments of different sizes that
sequentially operate. Only when an input sub-word
matches a stored sub-word that is the last few bits
of a stored word in the smaller first segment, does
the larger subsequent segment operate using its
subsequent sub-word. Because of this process, most
of the subsequent segments are unused. An input
word is assigned to word circuits at a rate based on
the short delay of the first segment instead of the
long delay of the whole word circuit.[1]
In the proposed method a new architecture
is used to improve the efficiency of the CAM block
by adding cache memory. As long as consecutive
input words match in unused different word
circuits, the CAM properly operates at a rate based
on the short delay. A pre-computation block checks
the last few bits of consecutive input words. If they
are found to be the same, then the next search is
only initiated once the current search has completed
in both segments. For applications that would store
random patterns in the last few bits of stored words,
such as caches, the probability of the usage of the
same first segment is very small. Moreover, input
words are reordered to reduce the probability when
the last few bits of consecutive input words are the
same. Hence, CAM can operate at high speed based
on the short delay because the long delay rarely
affects the throughput. At the circuit level, the POP
scheme can take full advantage of the RWOS
scheme for further through put.
In a traditional synchronous CAM, all
word circuits are controlled by a global clock signal
and hence they periodically operate using two
phases. In contrast, in the proposed POP scheme,
each word circuit is designed using asynchronous
circuits. As each word circuit is independently
controlled using its local control signal, unused
word circuits are on the evaluate phase, while the
others are on the precharge phase. In combination
with the RWOS scheme, input search words match
in unused different word circuits whose MLs have
already been pre-charged. Therefore, new search
words are immediately processed without wasting
the precharge time.[1] Along with these existing
techniques the proposed method adds the cache
memory which further improves the throughput.
Hence the proposed method we can increase the
efficiency of searching mechanism using cache
memory by little increase in latency during worst
path.
The rest of this paper is organized as
follows. Section II describes about the existing
method. Section III describes about the proposed
method and section IV describes about the
evaluation and performance comparison
II. REORDERED WORD
OVERLAPPED SEARCH
This existing method is an extension of
word overlapped search method. In the word
overlapped search the input bits are divided into k
bits and n-k bits. This scheme reduces the
probability of slow mode to improve the
throughput. Here the last bits of a current search
word are compared with the last bits of m
consecutive search words and an extra search word
followed by the current search word. If the m
consecutive sub-search words are different from the
current sub-search word, the CAM operates at the
fast mode. Otherwise, one of the m sub-search
words that is the same as the current sub-search
word is replaced by the extra sub-search word. In
this case, the extra sub-search word has to be
different from the current sub-search word.
3. Anagha Krishna N.V. Int. Journal of Engineering Research and Application www.ijera.com
ISSN : 2248-9622, Vol. 6, Issue 10, ( Part -1) October 2016, pp.53-57
www.ijera.com 55|P a g e
Fig1. Reorderd word overlapped search mechanism
In the example shown in Figure.1 the
current sub-search word is “L,” while the input
buffer has “M,” “L,” and “O.” In this case, as the
second sub-search word “L” is replaced by the
extra sub-search word “P,” the current sub-search
word “L” is different from all m consecutive sub-
search words in the input buffer. Therefore, the
CAM keeps operating at the fast mode. This
method of reordering with a dummy word will take
a longer time for the operation. This method
doesnot show a better throughput and latency. Here
throughput is equal to n cycles. The number of
registers using is high. Power consumption is also
high.
III. SEARCH AND SHIFT
MECHANISM
In this section we propose a search and
shift mechanism to improve the throughput and
latency. In the proposed method, the total number
of available bits is divided into k bits and n-k bits.
Considering a 32 bit word we can divide them by
setting k as 10 bits and n-k bits as remaining 22
bits. Proposed method is based on a search and shift
mechanism and it uses a cache memory for storing
the matched data.
The working of the system starts only
when the cam enable signal goes high. Then only
the input value is taken and then holds it throughout
the operation. Firstly the k bits are searched by
search and shift mechanism. Comparing each bit of
input and memory by shifting the bits .Here only
one register is using for this purpose. Each bit is
shifted to one register and compared. Thus the
name shift and search.
On comparing the data input and memory
value using an exnor operation an enable signal will
be generated if bits match. This signal is fed back
to the shifters for shifting the next bit. This will
depend upon the value of enable signal At the
time when k bit search is initiated then a down
counter is enabled. The n-k bit parallel search is
delayed using this counter so that timing issue is
removed. It will wait for the k bit search to
complete. When the counter value reaches a 1 an
internal enable signal is generating. This is for
solving the timing issues of the system. This signal
will inform the system about when we need to
capture the values, outputs e.t.c. The comparison of
n-k bits takes place parallely. Each input value is
compared against the memory value by exor
operation. This will generate another enable signal.
These three enable signals are fed to an and gate
which will produce a high enable signal. This in
turn fed to a cache memory. From there the output
address of the matched word is obtained.
The address is represented as one hot
address. This will reduce the dynamic power. One
hot address representation has got many
advantages. High speed, lesser dynamic power,
decoding complexity is less e.t.c. Priority encoder
is used here in order to solve the problem of
multiple match location. Overall design of the
system will improve the throughput, latency, power
consumption and area used. Here the method is
based on a shift and search mechanism. If any one
of the enable signal is 0 then whole operation will
stop.
Figure 2. Diagram showing k bit search
In this mechanism K bit searching requires
only one register for comparing the values.. First
the LSB bit of input is compared against the LSB
bit of memory. This is done using exor operation. If
the comparison result is a true value then the enable
signal is fed back to the shifter, then next bit is
shifted and compared. The same shifting is
occurring in memory also. These k bit and stored
bits in the memory are searched for a match. If a
match is found then enable signal will be active.
n-k bit parallel comparing
Fig3. Working diagram of the proposed
architecture
4. Anagha Krishna N.V. Int. Journal of Engineering Research and Application www.ijera.com
ISSN : 2248-9622, Vol. 6, Issue 10, ( Part -1) October 2016, pp.53-57
www.ijera.com 56|P a g e
The enable signals (en) generate
depending on the comparison results. Three enable
signals are generating. One from k bit search, one
from n-k bit search and the other one is an internal
enable signal. This signal is for capturing outputs at
the correct time.
These three enable signals are fed to a
bitwise and operation to produce a single enable
signal. If these three enable signals are high then
only the AND operation gives a true value. If this
signal is high then cache memory is activated for
storing the data. This will avoid the frequent
updating of cache memory. Thereby reducing the
power consumption. Data stored in cache memory
can be used for further needs. The output address
of matching location is obtained as one hot address.
This will also reduces power consumption because
of the avoidance of toggling bits. The usage of
priority encoder will resolve the issue of matching
of multiple location. Each location will be assigned
with a priority value. Throughput and latency
shows a better improvement in this method.
Latency is the time interval between the arrival of
input and output whereas throughput is the time
interval between the arrivals of consecutive inputs.
Here throughput is K cycle and latency is K+1
cycles
Fig 4. Flow chart showing the working of CAM
using search and shift mechanism
Here in this proposed method, the
throughput depends on K value whereas in
overlapping mechanism it depends on the n bit
value. Here Latency is K+1.This is a better
improvement than the existing method. Cache
memory is using for storing the data value. It is just
like storing in an internal memory. We can take the
data values for further requirements.
IV. EVALUATION
A 32X16 bit CAM is implemented for
high throughput applications. Here the K value for
proposed system is chosen as 10. Therefore the first
segment is a 10 bit word and the remaining bits will
form the second segment. These CAMs are
implemented and evaluated by Xilinx simulation.
This proposed CAM is implemented using Virtex 5
FPGA kit.
A.Performance Comparison
The proposed method when compared
with the result of existing method shows that there
is a better improvement in throughput and latency.
Throughput of the proposed method is equal to the
k cycles .Here K is set to 10. So throughput is 10
clock cycles. This result is far better than the
existing system. Latency of proposed system shows
a better improvement than the existing system. The
existing method has a higher latency which is equal
to the n cycles ie 64 clock cycles. In search and
shift mechanism it is equal to the k+1 cycle.
Here latency is equal to K+1.ie 11. In the
existing system exor operation is using always. But
in the proposed method bit by bit analysis make an
exor operation only if the comparison of previous
bits is true. Here in this method the LSB of k bit is
compared against the LSB of value stored in
memory. If that comparison yields to a true value
then next bit is shifted and comparison takes place.
In reordered overlapped search if a bit is compared
truly then it is replaced .Then a dummy value is
placed to that position and compared. This will take
a longer time than the existing method. Proposed
method has a special flop with multicycle path. It is
a type of hold+latch. This means the input value is
holding throughout the process. A cache memory is
added in the proposed method. Here the compared
value is stored when it shows a match. This is
working on the basis of 3 enable signals coming
from the comparison operations. By using this
cache memory 32 bit data value can be stored and
can be used whenever needed.
Existing method uses registers for storing
each of these bits in the output. But here by using
this cache memory we are reducing the number of
registers.
B.Analysis Of Power
In the proposed method power is reducing
considerably. Here there is a cache memory for
storing the matched result. Here the complete value
is storing only when the comparison of entire data
shows a match. So there is no need of updating the
cache frequently. This will reduce the dynamic
power which is a major source of power
consumption. In the existing method each and
every time the comparison result is registering. So
this will lead to power consumption.
5. Anagha Krishna N.V. Int. Journal of Engineering Research and Application www.ijera.com
ISSN : 2248-9622, Vol. 6, Issue 10, ( Part -1) October 2016, pp.53-57
www.ijera.com 57|P a g e
In search and shift mechanism address of
matched location is represented using one hot
address. So this has got many advantages. High
speed, lesser dynamic power, decoding complexity
is less e.t.c. Here in this representation bit toggling
is not taking place. This will also result in lesser
power consumption.
Analysis of Latency and Throughput
Latency is the time interval between the
arrival of input and output whereas throughput is
the time interval between the arrivals of
consecutive inputs.
Latency of proposed system shows a better
improvement than the existing system. The existing
method has a higher latency which is equal to the
number of bits n that is 64 clock cycles. In search
and shift mechanism it is equal to the k+1. Here
latency is equal to K+1.ie 11. Throughput of the
proposed method is equal to the k bits whereas in
existing method it is equal to n cycles. Here K is set
to 10.So throughput is 10 cycles. This result is far
better than the existing system.
Table I Performance Comparison
V. CONCLUSION
This paper focuses on the design of a cam
memory based on search and shift mechanism for
improving the throughput and latency of the
system. In this method the total number of input
bits is divided into two sections as k bits and n-k
bits. K bits are searched using shift and search
mechanism and the remaining bits are compared
parallely. The timing issue between these two
comparison methods is solved using a counter. The
counter value is set to k bits .The comparison
results either shows a matching condition or
mismatching condition. The comparison result
yields to enable signals.
During the time of a matching condition
the address of matched location is obtained and also
the matched data is being stored in a cache
memory. Cache memory is enabled using 3 enable
signals coming from the comparison results.
Therefore frequent updating of cache memory is
not required thereby reducing the power
consumption. The flops used here are of a
particular type. Here we use a hold+latch method
for the flop. This will hold the input value
throughout the operation.
Here this shifting and searching operation
takes places faster and thereby improving the
throughput and latency. Throughput and latency
shows a better improvement than previous designs.
Usage of cache memory and one hot address
representation reduces the power consumption also.
The throughput of this method is K cycles and
latency is equal to K+1 cycles.
REFERENCES
[1]. N onizawa, member, ieee, shoun
matsunaga, member, ieee “high-
throughput low- energy self-timed cam
based on reordered overlapped search
mechanism” ieee transactions on circuits
and systems: regular papers, vol. 61, no. 3,
march 2014
[2]. K. Pagiamtzis and A. Sheikholeslami,
“Content-addressable memory (CAM)
circuits and architectures:Atutorial and
survey,” IEEE J. Solid- State Circuits, vol.
41, no. 3, pp. 712–727, Mar. 2006.
[3]. K. Pagiamtzis and A. Sheikholeslami, “A
low-power content-addressable memory
(CAM) using pipelined hierarchical search
scheme,” IEEE J. Solid-State Circuits, vol.
39, no. 9, pp. 1512–1519, Sep. 2004.
[4]. N. Onizawa, S. Matsunaga, V. C. Gaudet,
and T. Hanyu, “Highthroughput low-
energy content-addressable memory based
on self-timed overlapped search
mechanism,” in Proc. 18th Int. Symp.
Asynchronous Circuits Syst., May 2012,
pp. 41–48.
[5]. N. Onizawa, S. Matsunaga, V. C. Gaudet,
W. J. Gross, and T. Hanyu, “High-
throughput CAM based on a synchronous
overlapped search scheme,” IEICE
Electron. Exp. (ELEX), vol. 10, no. 7, p.
20130148, 2013
[6]. S. Baeg, “Low-power ternary content-
addressable memory design using a
segmented match line,” IEEE Trans.
Circuits Syst. I, Reg. Papers, vol. 55, no.
6, pp. 1485–1494, Jul. 2008.
[7]. Scott Beamer, Mehmet Akgul” Design of
a Low Power Content Addressable
Memory (CAM)”
[8]. Jerrin Paul M1, Hazel Elsa John2 “ Low
Power Self-Timed TCAM Based on
Overlapped Search Mechanism with IP
Filter Implementation”