At the present scenario of the internet, there exist many optimization techniques to improve the Web speed but almost expensive in terms of bandwidth. So after a long investigation on different techniques to compress the data without any loss, a new algorithm is proposed based on LZ77 family which selectively models the references with backward movement and encodes the longest matches through greedy parsing with the shortest path technique to compresses the data with high density. This idea seems to be useful since the single Web Page contains many repetitive words which create havoc in consuming space, so let it removes such unnecessary redundancies with 70% efficiency and compress the pages with 23. 75 - 35% compression ratio. This also helps in reducing the latencies over Web while transmitting the large data of MB's in seconds over the 10 MBps connection. The proposed method has also been compared with other gzip compatible compressors on the three different compression corpora such as Calgary, Canterbury and enwik8 that proves the success of the work.

Shortest path technique iterative compression longest matching greedy parsing backward references Web compression HTTP