Enhancement of Video Streaming in Distributed Hybrid Architecture

Algorithm 1

Heuristic Path Search Algorithm, query initiated from the proxy server.

Input:  // The Query emits node

     // The Query sink node

  Initialize

   Buffer1 finite size

   Hop_count (every node) ← (−1) // peers at

                // every level

    Begin

   Query initiated from // Proxy server

    If (.node_id = =. node_id) && found (query massage)

     then

    Hop_count = 0

     Return Hop_count

     Output: chunk present in proxy server

     Exit

     End

    else

for each  single hop node from adjutancy list of

Compute: Query forward to the longest prefix match node using Algorithm 2.

Buffer1 push ()

while (Bufer1 non empty) do

 pop node () from Buffer1

    for each from // select all the

         //single hop neighbor of

     If (Hop_count() == (−1)) // peer node yet

            //not received the query

     then

    Hop_count () = Hop_count () +1;

  If ((node identifier()==node identifier && match (keyword_identifier))

   then // peer node having the query stream

   return Hop_count();

  Output: chunk present

    else // selected belongs to

         // single hop neighbor of

     // heuristic search

     return

    Hop_count () +1;

     // end search

   // end block

  else

  Output: “Search query stream does not exist in this network”.

   // End for each

   // End Pop

   // End While

  End begin

  Stop