Greedy Algorithm for Hub Selection in Interactive Network Applications

Abstract

Many multiple users interaction in network applications such as teleconferencing, network gaming and online trading are gaining popularity but these applications require that the delay difference in between multiple clients of the Service. In This Project We proposes a Technique name as Latency Equalization service and equalizes the perceive latency for all clients participating in an interactive network application. The LEQ architecture uses a few routers in the network as hubs to redirect packets of interactive applications along paths with similar end-to-end delay. Finally we shown that our LEQ architecture significantly reduces delay difference among multiple clients in network applications.

Authors and Affiliations

B. Rajesh, K. Eswar

Keywords

Related Articles

An Application of Integrated Interface Schema (IIS) Over Multiple WDBS to Enhance Data Unit Annotation

The data unit’s revisits from the fundamental database are typically programmed into the result pages vigorously for human browsing. For the preset data units to be appliance process capable which is necessary for ma...

Detecting of Disconnected from Source (DOS) and Connected but a Cut Occurred Somewhere (CCOS) in Wireless Sensor Networks

A wireless sensor network can get separated into multiple connected sensors .but some nodes are failure due to mechanical, electrical problems, environmental degradation battery depletion or hostile tampering. which...

Design of Proximity Coupled Patch Antenna for Miniaturization and Directivity Enhancement

A thorough investigation of microstrip patch antenna performance in presence of superstrate layer has been presented in this paper. Superstrate improves directivity and reduces resonant frequencies. The proximity cou...

Integrated Data Mining Approach for Security Alert System

The need for automatic detection of deceptive Emails is increasing due to the rapid usage of Email communication in the Internet world. The proposed “Security Alert System” provides a way to identify the future terro...

Merits and Demerits of Open Source Software

Open source software (OSS) is one of the fastest growing movements towards the less budget and cheaper software. Within the technical development of the world, yet we have seen that OSS will become a viable alternati...

Download PDF file
  • EP ID EP27758
  • DOI -
  • Views 274
  • Downloads 2

How To Cite

B. Rajesh, K. Eswar (2013). Greedy Algorithm for Hub Selection in Interactive Network Applications. International Journal of Research in Computer and Communication Technology, 2(12), -. https://europub.co.uk/articles/-A-27758