How Optima Saver works?

Optima Saver uses a couple of techniques to deliver better quality of voice while consuming much lower bandwidth. Our voice enabled network can handle almost 5 times more VoIP calls than a normal voice network with the same bandwidth.

The basic idea is simple. A simple voice call has a lot of redundant and unnecessary data overhead which are not required for good quality VOIP call. Optima saver performs a careful examination of voice and data packet in the network and strips out anything that is not essential and thus keeps only the necessary packets required to deliver good performance. it also changes the priority of voice packets over all other kinds of data packets in the network to ensure better performance.

Compression of RTP Header: Voice data, transmitted over the IP network, carries significant amount of invisible overhead in the header. It is possible to strip some of those overheads without compromising the quality and performance of the call. It is also possible to compress some parts of the overhead data without damaging voice quality. Optima Saver implemented this RTP header compression technique in an efficient way so that it can deliver around 5 times more calls in the same network without any compromise in the performance and quality of the calls. In fact, most of the times the quality and performance improve as the required bandwidth is lower than the available bandwidth.
Improved QoS Mechanism for Voice Traffic: general QoS mechanism treats voice traffic same as normal data traffic. Normally voice traffic and data traffic can co-exit in the IP network. Optima Saver QoS mechanism ensures the delivery of voice traffic with higher priority while treating data traffic with lower priority. As a result much more voice traffic can be sent as voice traffic will enjoy higher share of bandwidth than normal data traffic. The smart QoS management system makes it all possible with the same bandwidth.

Leave a Reply

Your email address will not be published. Required fields are marked *