Efficient generalized conservative staircase scheme for popular videos

In the advanced generalized conservative staircase (AGCS) method, the video segments are arranged in groups. The first group contains first segment, second group contains next two segments, and pth group (p > 2) contains 3 * 2^p-3 number of segments starting with kth segment S_k, where k = 3 * 2^p-3 + 1. Each segment of pth group (p > 2) is divided into 3 * 2p^-3 * m_p + m_p - 1 subsegments, where m_p determines the number of subsegments of a segment in pth group that are transmitted in a time slot. The subsegments are arranged in m_p disjoint sets. The first set consists of subsegments S_q+i,1, S_q+i,2, ..., S_q+i,q, where q = 3 * 2p^-3, 1 les 1 les q, and zth set (1 < z < m_p) consists of subsegments S_{q+i,q*(z-1)+z-1}, S_{q+i,q*(z-1)+z}, S_{q+i,q*(z-1)+z+1}, ..., S_q+i,q*z+z-1. In the AGCS method, an upper bound on m_p has been derived to provide continuous data. If larger value of m_p than its upper bound is taken, then the method will not provide continuous data. But, increasing the value of m_p decreases the bandwidth requirement, which in turn gives better method. In this paper, we discuss a scheme that removes the bound on m_p and still provides the continuous video data to users.