Optimalisasi Kualitas Jaringan Internet Dengan Metode Peer Conection Classifier Pada Layanan Web Autentification

Along with the increasing need to used existing resources in the development of computer network technology has led to the emergence of the network itself. Availability of resources will be inversely proportional to the level of need are now demanding networking technologies floated a new technique that can resolve the issue. Load balancing is a technique that can harness routing multiple resources tobe used simultaneously. However, there are various methods that can also be used, including methods of NTH, PCC load balancing and Fail Over. This study discusses the PCC Load Balancing Methods In Autentification are accessing the web, which is considered as needed. The implementation of load balancing so that resources are used optimally

OPTIMALISASI KUALITAS JARINGAN INTERNET DENGAN METODE PEER CONECTION CLASSIFIER PADA LAYANAN WEB AUTENTIFICATION

Along with the increasing need to used existing resources in the development of computer network technology has led to the emergence of the network itself. Availability of resources will be inversely proportional to the level of need are now demanding networking technologies floated a new technique that can resolve the issue. Load balancing is a technique that can harness routing multiple resources to be used simultaneously. However, there are various methods that can also be used, including methods of NTH, PCC load balancing and Fail Over. This study discusses the PCC Load Balancing Methods In Autentification are accessing the web, which is considered as needed. The implementation of load balancing so that resources are used optimally

Load balance algorithms for anycast

Increasingly, replicated anycast servers are being used to deliver network applications and service ever increasing user requests. Therefore, the strategies used to guarantee network bandwidth prerequisites and perform load balancing across the nodes of an anycast group are critical to the performance of online applications. In this paper, we model user requests, network congestion and latency, and server load using a combination of hydro-dynamics and queuing theory to develop an efficient job distribution strategy. Current, anycast research does not explicitly consider the system load of nodes within an anycast groups when distributing requests. Therefore, the performance of a heavily loaded anycast system can quickly become congested and uneven as jobs are routed to closely linked nodes which are already saturated with requests. In comparison, the nodes of further away systems remain relatively unused because of other issues such as network bandwidth and latency during these times. Our system redirects requests from busy systems to the idle, remotely linked nodes, to process requests faster in spite of slower network access. Using an empirical study, we show this technique can improve request performance, and throughput with minimal network probing overhead.<br /

Efficient load balancing in interconnected LANs using group communication

This paper investigates the use of group communication to improve the efficiency of load balancing in interconnected LANs. Conventional load balancing techniques usually assume point-to-point connections among the computers and typically work on a single LAN only. This may waste network bandwidth and lengthen the load balancing time in LANs that support group communication such as the Ethernet. To tackle this problem a two-level algorithm is proposed in this paper. At the LAN level, all computers in a LAN maintain loading information in the entire LAN using a globally ordered group channel. The workload in the different LANs is balanced by moving load from the overloaded LANs to the underloaded ones. It is proved that the proposed algorithm converges to the state of global balance geometrically. Experimental results show that the algorithm reduces load balancing time and network utilization significantly compared to the single level algorithm without group communication

Anycast services and its applications

Anycast in next generation Internet Protocol is a hot topic in the research of computer networks. It has promising potentials and also many challenges, such as architecture, routing, Quality-of-Service, anycast in ad hoc networks, application-layer anycast, etc. In this thesis, we tackle some important topics among them. The thesis at first presents an introduction about anycast, followed by the related work. Then, as our major contributions, a number of challenging issues are addressed in the following chapters. We tackled the anycast routing problem by proposing a requirement based probing algorithm at application layer for anycast routing. Compared with the existing periodical based probing routing algorithm, the proposed routing algorithm improves the performance in terms of delay. We addressed the reliable service problem by the design of a twin server model for the anycast servers, providing a transparent and reliable service for all anycast queries. We addressed the load balance problem of anycast servers by proposing new job deviation strategies, to provide a similar Quality-of-Service to all clients of anycast servers. We applied the mesh routing methodology in the anycast routing in ad hoc networking environment, which provides a reliable routing service and uses much less network resources. We combined the anycast protocol and the multicast protocol to provide a bidirectional service, and applied the service to Web-based database applications, achieving a better query efficiency and data synchronization. Finally, we proposed a new Internet based service, minicast, as the combination of the anycast and multicast protocols. Such a service has potential applications in information retrieval, parallel computing, cache queries, etc. We show that the minicast service consumes less network resources while providing the same services. The last chapter of the thesis presents the conclusions and discusses the future work