Improving Performance Among Client-Server For Continuous Distributed Interactive Applications
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2015, Vol 4, Issue 9
Abstract
In today’s situation consumers mainly use the network as an interactive medium for multimedia entertainment and communication purpose. In the entertainment arena, new applications involve multiple users participating in a single interactive session, for example, online gaming. In distributed server architecture, the interactivity performance depends on not only client-to-server network latencies but also interserver network latencies. All of these factors are directly affected by how the clients are assigned to the servers. We propose a Latency EQualization (LEQ) service, which equalizes the perceived latency for all clients participating in an interactive network application. We achieve equalized-latency paths by using a few routers in the network as hubs, and interactive application packets from different clients are redirected through these hubs to the servers. We formulate the hub placement problem, and provide the greedy algorithm and the optimal algorithm to solve this problem. Through extensive simulations, we show that our LEQ hub routing architecture significantly reduces delay difference in large network topologies. The LEQ architecture is incrementally deployable in today’s networks, requiring only a few nodes to be modified to perform the LEQ service.
Authors and Affiliations
Ms Shahenaz, Syed Shabana
Keywords
Related Articles
- EP ID EP28266
- DOI -
- Views 320
- Downloads 2
Functioning Estimation of Tcp Variants and Directing Etiquettes in Flexible Ad-Hoc Set of Connections
Mobile Ad-hoc Network (MANET) is an accumulation of cell phones rapidly shaping a correspondence system with no brought together control and prior system foundation. Because of the vicinity of versatility in the MANE...
Secure Group Communication by Establishing a Novel Trust Relationship Model and Detecting Malicious nodes in Peer to Peer Systems
Trust administration in P2P framework is utilized to distinguish vindictive practices and to advance legitimate and agreeable communications. The fundamental objective of the prior P2P frameworks is the capacity of c...
Embedding of Data in Motion Vectors by Using Steganography Concept
This paper applies steganography algorithm in videos. In the proposed method, we take GOP techniques which are nothing but video algorithms so we use advantage of prediction types of MPEG bit streams to embed waterma...
Distributed Hash Table (DHT) Based Clone Detection In WSN’s
Distributed Hash Table (DHT) by which a completely decentralized, key-based caching and checking system is created to catch cloned nodes efficiently. The protocol arrangement on competent storage utilization and emin...
Detection Of Connected But A Cut Occurred Somewhere (Ccos) In Wireless Sensor Networks
A wireless sensor network is able to obtain detached into several connected components owing of the crash of some of its intersection, which is entitle such as “cut”. Herein, we deem the problem of detecting cuts as...