International Journal of Computer Trends and Technology (IJCTT) - volume4Issue4 April 2013

Managing Latency Equalization Through Restored Routers

D.Nithya
PG Student M.Tech, CSE Dr.M.G.R Educational and Research Institute University, Chennai.

Asst prof.G.Kalpana
Department of Computer Science Dr.M.G.R Educational and Research Institute University Chennai.

Abstract We propose a Latency Equalization (LEQ) service, which equalizes the supposed latency for all clients participate in an interactive network application. To successfully apply the proposed LEQ service, network support is necessary. Our network-based LEQ service provides equalized-latency paths between the clients and servers by redirecting interactive application traffic from different clients along paths that minimize their delay difference. The LEQ architecture uses a few routers in the network as hubs to transmit packets of interactive applications along paths with similar end-toend delay. We first formulate the hub selection difficulty, prove its NP-hardness, and provide a greedy algorithm to solve it. Through extensive simulations, we show that our LEQ architecture extensively reduce delay difference under different optimization criteria that allow or do not allow compromising the per-user end-to-end delay. Our LEQ service is incrementally deployable in todays networks, requiring just software modifications to edge routers. Keyword: path congestion,,path failure,path

delay and delay difference among participants. will enable more real-time interactivity For example ,In online gaming, the delay difference experienced by gamers significantly impacts game quality .

2. Scenario Creation Compute the paths between the clients and

Compute the propagation delay of the networks based on the geographical distances between any two nodes. Analyze the shortest Minimizing the delay difference among participants path using the shortest path algorithm which will consider the weight of the links

as the distance between the nodes.

3. Latency Calculation: It can be achieved by using few routers in the network as hubs, and interactive application packets from different clients LEQ service provides equalizedlatency paths between the clients and servers are redirected through these hubs to the servers. The response time from source to destination and vice versa is same and equalized. .Today, consumers use the

latency,routing methodology,shortest path. 1. Introduction Depending on the number of participants involved, interactive applications are sensitive to both end-to-end

network as an interactive medium for multimedia

ISSN: 2231-2803

http://www.ijcttjournal.org

Page 816

International Journal of Computer Trends and Technology (IJCTT) - volume4Issue4 April 2013
communications and entertainment .In the entertainment arena, new applications involve multiple users participating in a single interactive session, for example, online gaming and online music. The commercial sector has defined interactive services such as bidding in e-commerce and tele presence .Depending on the number of participants involved, interactive applications are sensitive to both end-to-end delay and delay difference among .We achieve LEQ routing by selecting a few routers as hubs and direct in interactive application traffic through these hubs..Using a small number of hubs in the individual musicians located at different geographic locations experience perceptible sound impairments introduced by latency differences among the musicians Client side solutions are hard to implement because they require that all clients exchange latency network to redirect application packets, we equalize the delays for interactive applications. client traffic from an interactive application enters the provider network through edge routers R1 andR2. The server for the interactive application is connected to the network through edge routerR10 . .Using the LEQ routing architecture,R6andR7 are chosen as hubs for R1, and R7andR8 are chosen as hubs for R2 . Using redirection through hubs,R1 has two paths to the server edge router :R10:R1->R6->R10 andR1->R7->R10 , both of which have a delay of 10 ms.R2also has two paths: R2->R7>R10andR2->R8->R10 ,whose delay is also 10 ms. of players with varying delays to the application servers. We achieve equalized-latency paths by using a few routers in the network as hubs .application packets from different clients are redirected through these hubs to the servers. To achieve LEQ routing, we formulate the hub selection problem, which decides which routers in the network can be used as hubs and the assignment of hubs to different client edge routers to minimize delay difference. We prove that this hub selection problem is NP-hard and in approximable. Therefore, we propose a greedy algorithm that achieves equalizedlatency 4. Equalization Method: .No Significant Impediments to Deployment: The architecture only requires minimal functions on the edge router such as application packet identification and end-to-end path monitoring Handling Network Failure and Congestion: assigns multiple hubs for each client edge router so that the client edge routers can 6.Benefits 7.Thus, LEQ is achieved by optimized hub selection and assignment.2 Each client edge router is assigned to more than one hub, so it has the flexibility to select among its assigned hubs to avoid congestion 5. Latency Equalization Architecture The LEQ service manager serves as a centralized server to decide hub selection and assignment. The offline hub selection algorithm is chosen and the inputs to the algorithm are the server edge router locations, network topology, and the propagation delay. An online hub selection algorithm would require significant

participants .In distributed live music concerts

information to all other clients..network-based Latency Equalization (LEQ), which is a service that Internet service providers (ISPs) can provide for various interactive network applications..ISPs can better

support latency equalization routing for a large number

ISSN: 2231-2803

http://www.ijcttjournal.org

Page 817

International Journal of Computer Trends and Technology (IJCTT) - volume4Issue4 April 2013
select hubs to get around network failure and congestion [7] M. Mitzenmacher, The power of two choices in randomized load balancing, IEEE Trans. Parallel Distrib. Syst., vol. 12, no. 10, pp. 10941104, Oct. 2001. [8] A. Shaikh, S. Sahu, M. Rosu, M. Shea, and D. Saha, Implementation of a service platform for online games, in Proc. NetGames, 2004, pp.106110. [9] D. Saha, S. Sahu, and A. Shaikh, A service platform for on-line games, in Proc. Net Games, 2003, pp. 180 184. [10] M.Yu, M. Thottan, and L. Li, Latency equalization 8. Reference [1]M.Yu, equalization: M. A Thottan, and L. Li, routing Latency service [11] S. Agarwal and J. R. Lorch, Matchmaking for online games and other latency-sensitive P2P :A programmable routing service primitive, in Proc. ACM PRESTO, 2008, pp. 3944. programmable

7. conclusion The LEQ routing architecture provides a pathway for scalable and robust multiparty interactive applications. Supports different optimization policies that can achieve overall application performance in terms of latency equalization there by enhances the quality of multiparty interactive applications.

primitive, in Proc. ACM PRESTO, 2008, pp. 3944. [2] J. Nichols and M. Claypool, The effects of latency on online Madden NFL football, in Proc. NOSSDAV, 2004, pp. 146151. [3] B. Fortz and M. Thorup, Internet traffic engineering by optimizing OSPF weights, in Proc. IEEE INFOCOM, 2000, vol. 2, pp. 519528 [4] N. Spring, R. Mahajan, and D. Wetherall, Measuring ISP topologieswith Rocketfuel, IEEE/ACM Trans. Netw., vol. 12, no. 1, pp. 216,Feb. 2004. [5] R. Prasad, C. Dovrolis, andM. Thottan, Router buffer sizing revisited:The role of the output/input capacity ratio, in Proc. ACM CoNEXT,2007, Article no. 15. [6] Indiana University Global Research Network Operations Center weather maps, Global Research Network Operations IN Center, Indiana [Online]. University, Available:

systems, in Proc. ACM SIGCOMM, 2009, pp.315326. [12] A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi, and B. Yener, Provisioning a virtual private network: A network design problem for multi commodityflow, in Proc. ACM STOC, 2001, pp. 389398. [13] M. Cha, S. Moon, C. D. Park, and A. Shaikh, Placing relay nodes for intra-domain path diversity, in Proc. IEEE INFOCOM, 2006, pp.

Indianapolis,

http://weathermap.grnoc.iu.edu/

ISSN: 2231-2803

http://www.ijcttjournal.org

Page 818