Notice Board :

Call for Paper
Vol. 5 Issue 5

Submission Start Date:
May 01, 2018

Acceptence Notification Start:
May 10, 2018

Submission End:
May 15, 2018

Final MenuScript Due:
May 30, 2018

Publication Date:
June 04, 2018
                         Notice Board: Call for PaperVol. 5 Issue 5      Submission Start Date: May 01, 2018      Acceptence Notification Start: May 10, 2018      Submission End: May 15, 2018      Final MenuScript Due: May 30, 2018      Publication Date: June 04, 2018




Volume II Issue V

Author Name
Rehan Khan, Mr. Jitendra Dangra
Year Of Publication
2015
Volume and Issue
Volume 2 Issue 5
Abstract
Increasing popularity of the net over the past few years has obligatory a serious traffic burden upon the net. the internet is additionally thought of to be an oversized distributed info systems providing access to shared information. A mass analysis has done to reinforce the latency of internet primarily based system as a result of the data is distributed over a geographical location. Web caching and pre-fetching are 2 necessary approaches accustomed scale back the noticeable latency perceived by users. During this paper we tend to study and analysis the varied previous researches & techniques supported web Pre-Fetching.
PaperID
2015/IJTRM/5/2015/5143

Author Name
Miss. Sneha Satpute, Prof. Shruti Dixit
Year Of Publication
2015
Volume and Issue
Volume 2 Issue 5
Abstract
The rapid growth of computer network takes the concentration of researchers in the era of wireless network. There is a need of improving the performance of RTS/CTS mechanism. An increase in performance using RTS/CTS is the net result of introducing overhead .If network doesn't have any hidden nodes; the use of RTS/CTS will only increase the amount of overhead, which may reduce throughput. In this case, the additional RTS/CTS frames cost more in terms of overhead than what we gain by reducing retransmissions. Moreover, usage of RTS/CTS is helpful especially when data frame is much longer than RTS frame. In this dissertation, the focus is on the problem with RTS/CTS protocol. Here we studied that the performance of RTS/CTS handshaking mechanism degrade if system having few number of hidden node. To overcome this problem proposed methodology tends to maintain hidden table by each node of network that contain the information about hidden node of its neighbor node.
PaperID
2015/IJTRM/5/2015/5147

Author Name
Diptanshu Pandya, Dr. M.K. Rawat, Jitendra Dangra
Year Of Publication
2015
Volume and Issue
Volume 2 Issue 5
Abstract
In modern days cloud computing is one of the greatest platform which provides storage of data in very lower cost and available for all time over the internet. But the cloud computing has more critical issue like security, load balancing and fault tolerance ability. In this paper we are focusing on Load Balancing approach. The Load balancing is the process of distributing load over the different nodes which provides good resource utilization when nodes are overloaded with job. Load balancing is required to handle the load when one node is overloaded. When the node is overloaded at that time load is distributed over the other ideal nodes. Many load balancing algorithms are available for load balancing like Static load balancing and Dynamic load balancing.
PaperID
2015/IJTRM/5/2015/5165

Author Name
Anushree Pandya, Jitendra Dangra, Dr. M.K. Rawat
Year Of Publication
2015
Volume and Issue
Volume 2 Issue 5
Abstract
Cloud Computing is becoming the heart or the central theme for all sort of computing. Cloud is a remote place, at which user can upload data, can download data, can do processing of data, etc. Cloud provides space, computing power, platform and many more services on rent. This paper presents a brief introduction to the concept of clouds & its services. This paper also presents the issues related to the security of data in cloud environment. A few modern attribute based encryption models for the data security have been discussed.
PaperID
2015/IJTRM/5/2015/5166