Conference PaperPDF Available

Performance Analysis of Routing in Resource Management for Distributed System

September 2011

Conference: 2nd International Conf. on Communication, Computation, Management & Nanotechnology (ICN-2011), Bhalki, Karnataka
At: Bhalki, Karnataka

Authors:

Swati Sunil Sherekar

Sant Gadge Baba Amravati University

Rajiv Vasantrao Dharaskar

Director, IIIT Kottayam, Kerala, India Institute of National Importance

In many applications, the demand of the real time network services has been mounting fast. It needs guaranteed delivery of real time messages before their deadline. In that case, the key concept is routing, that route the message from each source to its destination. It is the leading issue on the Internet and mobile Network. In this paper, the focal point is on routing in distributed systems and resource management. The complete study and the performance analysis of the different routing techniques are presented in this paper, with the cram of resource management. Such as dynamic routing with security, service-centric multicast routing, virtual force-based geometric routing and bandwidth allocation in routers.

Content uploaded by Rajiv Vasantrao Dharaskar

Content may be subject to copyright.

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Data

Full-text available

A NOVEL MOVEABLE 3D SEE-THROUGH MIXED REALITY SYSTEM WITH MARKER LESS OBJECT TRACKING

March 2005

This paper presents a novel mixed reality system that combines free-viewing spatial visualisation and marker less object tracking. Core of the system is a free-viewing (autostereoscopic) 3D display based on the Variable Accommodation Architecture and a pair of stereo cameras fixed to the display. The system is mounted on the end effector of a passive kinematics chain with revolving joints which ... [Show full abstract] remains " at position " when no force is applied by the user. The user can freely move the system within a large work envelope and observe the target object from different vantage points. He/She can accommodate the two stereoscopic images generated from the free-viewing 3D display and perceives the real space optically merged with the synthesized 3D scene elements. Video and model-based object tracking based on geometric primitives of the scene is applied to accurately recover metric information approximately in real time and to update the virtual elements. Preliminary results show that the system can be efficiently used for mixed reality applications with comfortable contact-free spatial visualisation.

Article

Hybrid group key management architecture for multicast applications

March 2016

In the global scenario, with the rampant strides in wireless as well as mobile networks, Secure Group Key Management, play a vital role for wireless group oriented applications. To name a few, share broking, software distribution, and internet pay sites. In large and dynamic multicast groups, the sender and the group members use a common secure group key to encrypt and decrypt the data that are ... [Show full abstract] being exchanged. The tree-based centralized architecture is commonly used so as to lower the rekeying cost in terms of storage, transmission and computation. But it usually leads to additional overhead for balancing the tree. In the proposed hybrid group key management architecture, the members are divided into various clusters and cluster head selection for each one is based on each node's distance and energy. The proposed architecture will enhance the group performance in terms of computation as well as communication complexity.

Article

Mirror_SPACE project: system of real time events and installation

January 2005

Brigitta Zics

Interactive networked installation, which projects a personal, virtual mirror-image onto the screen, with the aid of the combination of the face of the visitor and data collected simultaneously from the Internet. This image behaves like the physical presence of a real mirror-image: it changes its position, dimensions and features according to the movement of the viewer. The common ... [Show full abstract] mirror-representations of individual visitors also interact with each other, and their audiovisual representation is perceivable as within the "mirror-space". The "mirror-image" is active and alterable as long as the visitor remains in the data-space of the installation. When the visitor departs, the image, as her/his "impression", remains and continues to move together with other representations. The mirror-images of the previous viewers disappear finally when the images of new visitors appear on the screen.Mirror_SPACE is a virtual mirror where users can experience their image transformed - not according to the rules of geometric optics, but filtered by a "real time scanning apparatus". This generates the visitor's "mirror image" corresponding to the information supplied via its data network.

Article

Capacity of distributed content delivery in large-scale wireless ad hoc networks

March 2012 · Proceedings - IEEE INFOCOM

In most existing wireless networks, end users obtain data content from the wired network, typically, the Internet. In this manner, virtually all of their traffic must go through a few access points, which implies that the capacity of wireless network is limited by the aggregated transmission data rate of these access points. To fully exploit the capability of wireless network, we envision that ... [Show full abstract] future wireless networks shall be able to provide data content within themselves. In this paper, we address the behavior of such networks from a theoretical perspective. Specifically, we consider that multicast is used for distributed content delivery, and we investigate the asymptotic upper bound of the throughput capacity for distributed content delivery in large-scale wireless ad hoc networks (DCD-WANET). Our analysis shows how the upper bound of throughput capacity is affected by the geometric size of the network, the number of data items, the popularity of the data content, and the number of storage nodes that contain those data items. In particular, our theoretical results show that, if the number of storage nodes exceed a critical threshold, the upper bound grows with the number of storage nodes, according to a power-law where the scaling exponent depends on the popularity of data items. We also provide the data item placement strategy to achieve the upper bound of throughput capacity for DCD-WANET.