Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 10

Scalability Related Abstracts

10 RSU Aggregated Message Delivery for VANET

Authors: Auxeeliya Jesudoss, Ashraph Sulaiman, Ratnakar Kotnana

Abstract:

V2V communication brings up several questions of scalability issues although message sharing in vehicular ad-hoc networks comprises of both Vehicle-to-Vehicle communications (V2V) and Vehicle to Infrastructure communication (V2I). It is not an easy task for a vehicle to verify all signatures of the messages sent by its neighboring vehicles in a timely manner, without resulting in message loss. Moreover, the communication overhead of a vehicle to authenticate another vehicle would increase together with the security of the system. Another issue to be addressed is the continuous mobility of vehicles which requires at least some information on the node’s own position to be revealed to the neighboring vehicles. This may facilitate the attacker to congregate information on a node’s position or its mobility patterns. In order to tackle these issues, this paper introduces a RSU aggregated message deliverance scheme called RAMeD. With RAMeD, roadside units (RSUs) are responsible for verifying the identity of the vehicles entering in its range, collect messages from genuine vehicles and to aggregate similar messages into groups before sending them to all the vehicles in its communication range. This aggregation will tremendously improve the rate of message delivery and reduce the message lose ratio by avoiding similar messages being sent to the vehicles redundantly. The proposed protocol is analyzed extensively to evaluate its merits and efficiency for vehicular communication.

Keywords: Scalability, Vehicular Ad-Hoc Networks, V2V, V2I, VANET communication, message aggregation

Procedia PDF Downloads 274
9 SC-LSH: An Efficient Indexing Method for Approximate Similarity Search in High Dimensional Space

Authors: Sanaa Chafik, Mounim A. El Yacoubi, Hamid El Ouardi, Imane Daoudi

Abstract:

Locality Sensitive Hashing (LSH) is one of the most promising techniques for solving nearest neighbour search problem in high dimensional space. Euclidean LSH is the most popular variation of LSH that has been successfully applied in many multimedia applications. However, the Euclidean LSH presents limitations that affect structure and query performances. The main limitation of the Euclidean LSH is the large memory consumption. In order to achieve a good accuracy, a large number of hash tables is required. In this paper, we propose a new hashing algorithm to overcome the storage space problem and improve query time, while keeping a good accuracy as similar to that achieved by the original Euclidean LSH. The Experimental results on a real large-scale dataset show that the proposed approach achieves good performances and consumes less memory than the Euclidean LSH.

Keywords: Scalability, Content Based Image Retrieval (CBIR), approximate nearest neighbor search, curse of dimensionality, locality sensitive hashing, multidimensional indexing

Procedia PDF Downloads 205
8 Performance Analysis of Scalable Secure Multicasting in Social Networking

Authors: A. Sabari, R. Venkatesan

Abstract:

Developments of social networking internet scenario are recommended for the requirements of scalable, authentic, secure group communication model like multicasting. Multicasting is an inter network service that offers efficient delivery of data from a source to multiple destinations. Even though multicast has been very successful at providing an efficient and best-effort data delivery service for huge groups, it verified complex process to expand other features to multicast in a scalable way. Separately, the requirement for secure electronic information had become gradually more apparent. Since multicast applications are deployed for mainstream purpose the need to secure multicast communications will become significant.

Keywords: Security, Social Network, Scalability, Multicasting

Procedia PDF Downloads 128
7 Simulation of the FDA Centrifugal Blood Pump Using High Performance Computing

Authors: Mehdi Behbahani, Sebastian Rible, Charles Moulinec, Yvan Fournier, Mike Nicolai, Paolo Crosetto

Abstract:

Computational Fluid Dynamics blood-flow simulations are increasingly used to develop and validate blood-contacting medical devices. This study shows that numerical simulations can provide additional and accurate estimates of relevant hemodynamic indicators (e.g., recirculation zones or wall shear stresses), which may be difficult and expensive to obtain from in-vivo or in-vitro experiments. The most recent FDA (Food and Drug Administration) benchmark consisted of a simplified centrifugal blood pump model that contains fluid flow features as they are commonly found in these devices with a clear focus on highly turbulent phenomena. The FDA centrifugal blood pump study is composed of six test cases with different volumetric flow rates ranging from 2.5 to 7.0 liters per minute, pump speeds, and Reynolds numbers ranging from 210,000 to 293,000. Within the frame of this study different turbulence models were tested including RANS models, e.g. k-omega, k-epsilon and a Reynolds Stress Model (RSM) and, LES. The partitioners Hilbert, METIS, ParMETIS and SCOTCH were used to create an unstructured mesh of 76 million elements and compared in their efficiency. Computations were performed on the JUQUEEN BG/Q architecture applying the highly parallel flow solver Code SATURNE and typically using 32768 or more processors in parallel. Visualisations were performed by means of PARAVIEW. Different turbulence models including all six flow situations could be successfully analysed and validated against analytical considerations and from comparison to other data-bases. It showed that an RSM represents an appropriate choice with respect to modeling high-Reynolds number flow cases. Especially, the Rij-SSG (Speziale, Sarkar, Gatzki) variant turned out to be a good approach. Visualisation of complex flow features could be obtained and the flow situation inside the pump could be characterized.

Keywords: High Performance Computing, Turbulence, Scalability, blood flow, centrifugal blood pump

Procedia PDF Downloads 219
6 A Cloud Computing System Using Virtual Hyperbolic Coordinates for Services Distribution

Authors: Telesphore Tiendrebeogo, Oumarou Sié

Abstract:

Cloud computing technologies have attracted considerable interest in recent years. Thus, these latters have become more important for many existing database applications. It provides a new mode of use and of offer of IT resources in general. Such resources can be used “on demand” by anybody who has access to the internet. Particularly, the Cloud platform provides an ease to use interface between providers and users, allow providers to develop and provide software and databases for users over locations. Currently, there are many Cloud platform providers support large scale database services. However, most of these only support simple keyword-based queries and can’t response complex query efficiently due to lack of efficient in multi-attribute index techniques. Existing Cloud platform providers seek to improve performance of indexing techniques for complex queries. In this paper, we define a new cloud computing architecture based on a Distributed Hash Table (DHT) and design a prototype system. Next, we perform and evaluate our cloud computing indexing structure based on a hyperbolic tree using virtual coordinates taken in the hyperbolic plane. We show through our experimental results that we compare with others clouds systems to show our solution ensures consistence and scalability for Cloud platform.

Keywords: Cloud, Scalability, Storage, Consistency, virtual coordinates, hyperbolic plane

Procedia PDF Downloads 305
5 Schools of Thought in the Field of Social Entrepreneurship

Authors: Cris Bravo

Abstract:

Social entrepreneurship is a new and exciting topic that holds a great promise in helping alleviate the social problems of the world. As a new subject, the meaning of the term is too broad and this is counterproductive in trying to build understanding around the concept. The purpose of this study is to identify and compare the elements of social entrepreneurship as defined by seven international organizations leading social entrepreneurship projects: Ashoka Foundation, Skoll Foundation, Schwab Foundation and Yunus Center; as well as from three other institutions fostering social entrepreneurship: Global Social Benefit Institute, BRAC University, and Socialab. The study used document analysis from Skoll Foundation, Schwab Foundation, Yunus Center and Ashoka Foundation; and open ended interview to experts from the Global Social Benefit Institute at Santa Clara University in United States, BRAC University from Bangladesh, and Socialab from Argentina. The study identified three clearly differentiated schools of thought, based on their views on revenue, scalability, replicability and geographic location. While this study is by no means exhaustive, it provides an indication of the patterns of ideas fostered by important players in the field. By clearly identifying the similarities and differences in the concept of social entrepreneurship, research and practitioners are better equipped to build on the subject, and to promote more adequate and accurate social policies to foster the development of social entrepreneurship.

Keywords: Scalability, social entrepreneurship, Schools of thought, revenue, replicability

Procedia PDF Downloads 196
4 Performance Evaluation of Hierarchical Location-Based Services Coupled to the Greedy Perimeter Stateless Routing Protocol for Wireless Sensor Networks

Authors: Mohammed Erritali, Rania Khadim, Abdelhakim Maaden

Abstract:

Nowadays Wireless Sensor Networks have attracted worldwide research and industrial interest, because they can be applied in various areas. Geographic routing protocols are very suitable to those networks because they use location information when they need to route packets. Obviously, location information is maintained by Location-Based Services provided by network nodes in a distributed way. In this paper we choose to evaluate the performance of two hierarchical rendezvous location based-services, GLS (Grid Location Service) and HLS (Hierarchical Location Service) coupled to the GPSR routing protocol (Greedy Perimeter Stateless Routing) for Wireless Sensor Network. The simulations were performed using NS2 simulator to evaluate the performance and power of the two services in term of location overhead, the request travel time (RTT) and the query Success ratio (QSR). This work presents also a new scalability performance study of both GLS and HLS, specifically, what happens if the number of nodes N increases. The study will focus on three qualitative metrics: The location maintenance cost, the location query cost and the storage cost.

Keywords: Scalability, Routing Protocols, Wireless Sensor Networks, location based-services

Procedia PDF Downloads 220
3 Effectiveness with Respect to Time-To-Market and the Impacts of Late-Stage Design Changes in Rapid Development Life Cycles

Authors: Parth Shah

Abstract:

The author examines the recent trend where business organizations are significantly reducing their developmental cycle times to stay competitive in today’s global marketspace. The author proposes a rapid systems engineering framework to address late design changes and allow for flexibility (i.e. to react to unexpected or late changes and its impacts) during the product development cycle using a Systems Engineering approach. A System Engineering approach is crucial in today’s product development to deliver complex products into the marketplace. Design changes can occur due to shortened timelines and also based on initial consumer feedback once a product or service is in the marketplace. The ability to react to change and address customer expectations in a responsive and cost-efficient manner is crucial for any organization to succeed. Past literature, research, and methods such as concurrent development, simultaneous engineering, knowledge management, component sharing, rapid product integration, tailored systems engineering processes, and studies on reducing product development cycles all suggest a research gap exist in specifically addressing late design changes due to the shortening of life cycle environments in increasingly competitive markets. The author’s research suggests that 1) product development cycles time scales are now measured in months instead of years, 2) more and more products have interdepended systems and environments that are fast-paced and resource critical, 3) product obsolesce is higher and more organizations are releasing products and services frequently, and 4) increasingly competitive markets are leading to customization based on consumer feedback. The author will quantify effectiveness with respect to success factors such as time-to-market, return-of-investment, life cycle time and flexibility in late design changes by complexity of product or service, number of late changes and ability to react and reduce late design changes.

Keywords: Systems Engineering, Product Development, Scalability, Systems Integration, rapid systems engineering, systems life cycle

Procedia PDF Downloads 99
2 Attribute Based Comparison and Selection of Modular Self-Reconfigurable Robot Using Multiple Attribute Decision Making Approach

Authors: Manpreet Singh, V. P. Agrawal, Gurmanjot Singh Bhatti

Abstract:

From the last decades, there is a significant technological advancement in the field of robotics, and a number of modular self-reconfigurable robots were introduced that can help in space exploration, bucket to stuff, search, and rescue operation during earthquake, etc. As there are numbers of self-reconfigurable robots, choosing the optimum one is always a concern for robot user since there is an increase in available features, facilities, complexity, etc. The objective of this research work is to present a multiple attribute decision making based methodology for coding, evaluation, comparison ranking and selection of modular self-reconfigurable robots using a technique for order preferences by similarity to ideal solution approach. However, 86 attributes that affect the structure and performance are identified. A database for modular self-reconfigurable robot on the basis of different pertinent attribute is generated. This database is very useful for the user, for selecting a robot that suits their operational needs. Two visual methods namely linear graph and spider chart are proposed for ranking of modular self-reconfigurable robots. Using five robots (Atron, Smores, Polybot, M-Tran 3, Superbot), an example is illustrated, and raking of the robots is successfully done, which shows that Smores is the best robot for the operational need illustrated, and this methodology is found to be very effective and simple to use.

Keywords: Morphogenesis, Scalability, TOPSIS, self-reconfigurable robots, MADM

Procedia PDF Downloads 47
1 Evaluation of Security and Performance of Master Node Protocol in the Bitcoin Peer-To-Peer Network

Authors: Mo Adda, Muntadher Sallal, Gareth Owenson, Safa Shubbar

Abstract:

Bitcoin is a digital currency based on a peer-to-peer network to propagate and verify transactions. Bitcoin is gaining wider adoption than any previous crypto-currency. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical topology can cause a delay overhead in information propagation, which makes the system vulnerable to double-spend attacks. Aiming at alleviating the propagation delay problem, this paper introduces proximity-aware extensions to the current Bitcoin protocol, named Master Node Based Clustering (MNBC). The ultimate purpose of the proposed protocol, that are based on how clusters are formulated and how nodes can define their membership, is to improve the information propagation delay in the Bitcoin network. In MNBC protocol, physical internet connectivity increases, as well as the number of hops between nodes, decreases through assigning nodes to be responsible for maintaining clusters based on physical internet proximity. We show, through simulations, that the proposed protocol defines better clustering structures that optimize the performance of the transaction propagation over the Bitcoin protocol. The evaluation of partition attacks in the MNBC protocol, as well as the Bitcoin network, was done in this paper. Evaluation results prove that even though the Bitcoin network is more resistant against the partitioning attack than the MNBC protocol, more resources are needed to be spent to split the network in the MNBC protocol, especially with a higher number of nodes.

Keywords: Clustering, Scalability, propagation delay, Bitcoin network

Procedia PDF Downloads 1