Abstract:
Real-time delivery of multimedia content puts extreme demand on both computational and network resources. Many a times, the requirement is to handle multiple such delivery requirements and as a consequence, the overall delivery efficiency gets affected. Another dimension of complexity is that (a) the multimedia content to be delivered may not always be highly reliable, and (b) the network may also be not highly reliable. In such a situation, it becomes even more difficult to satisfy the quality of service requirements. When content to be delivered to multiple destinations is available at multiple sources, there is an opportunity to overcome the above mentioned complexity. The system and method for efficient delivery in a multi-source multi-destination network involves pulling of data from the multiple sources by measuring quality of service and reliability parameters, and efficiently loading the systems and the network in a cooperative manner.

Description:
FIELD OF THE INVENTION 
       [0001]    The present invention relates to multimedia delivery in general and more particularly, efficient multimedia delivery through a network. Still more particularly, the present invention is related to a system and method for efficient delivery of multimedia across a not so highly reliable network with multiple sources also being not so highly reliable. 
       BACKGROUND OF THE INVENTION 
       [0002]    Real-time delivery of multimedia requires extensive support from both systems and networks. The non-stop delivery, coupled with real-time constraints, needs consistent availability of both computational and network resources. However, one of the major problems to meet this expectation is the associated occasional unreliability. This unreliability leads not only to inefficient delivery of multimedia but also to the under utilization of resources. 
         [0003]    Consider an enterprise scenario of delivering a multimedia content from multiple sources to multiple destinations across a network. In this scenario, the multiple sources possessing the same multimedia content is by virtue of being part of the same content generation/sourcing activity, and the multiple destinations requiring the same multimedia content is due to the need to deliver the same to multiple branch offices of the enterprise. Note that it is not realistic to expect a perfect delivery system with unfailing content sourcing, unfailing systems, and unfailing network. More importantly, the multimedia delivery system needs to be designed keeping this constraint in mind: delivering multiple multimedia contents from multiple sources to multiple destinations across a not so highly reliable network with not so highly reliable multimedia content sourcing. 
         [0004]    One of the ways to overcome this constraint is to exploit redundancy: in fact, very highly reliable systems have high redundancy factor as well. This exploitation while improving reliability leads to reduced throughput from per unit resource consumption point of view. Hence, there is a need for balancing between under utilization of resources and over doing to meet higher reliability expectations. This poses a question of how to achieve on the fly reliability management coupled with load balancing. The degree of under utilization of resources could vary as failure is a random phenomenon: Not so highly reliable means that there is very good chance of successful completion but with occasional failures. This calls for a system design to guard against these occasional failures. In other words, redundancy needs to be exploited as a consequence of failure wherever it is appropriate. Such a design strives for utilizing redundancy for enhancing throughput as well as for addressing occasional failures. 
       DESCRIPTION OF RELATED ART 
       [0005]    U.S. Pat. No. 7,313,596 to Tani; Seiichiro (Atsugi, JP), Miyazaki; Toshiaki (Yokohama, JP), Takahashi; Noriyuki (Yokosuka, JP), Murooka; Takahiro (Atsugi, JP), Ishihara; Shinya (Tokyo, JP), Inoue; Takeru (Yokohama, JP) for “Multicast data communication method, multicast data communication system, repeater, repeating method, and medium for storing repeating” (issued on Dec. 25, 2007 and assigned to Nippon Telegraph &amp; Telephone Corporation (Tokyo, JP)) describes a multicast data communication system that has high security and prevents problems, such as attack by a malicious user, wherein clients regularly transmit request packets towards a server and the server delivers packets to clients based on request packet arrival times. 
         [0006]    U.S. Pat. No. 7,305,486 to Ghose; Kanad (Vestal, N.Y.), Sulatycke; Peter (Vestal, N.Y.) for “System and method for fast, reliable byte stream transport” (issued on Dec. 4, 2007) describes a protocol using credits for flow control and negative acknowledgements for reliable delivery. 
         [0007]    U.S. Pat. No. 7,274,661 to Harrell; Chandlee (Cupertino, Calif.), Ratner; Edward R. (Sunnyvale, Calif.), Miller; Thomas D. (Alamo, Calif.), Prakash; Adityo (Redwood Shores, Calif.), So; Hon Hing (San Jose, Calif.) for “Flow control method for quality streaming of audio/video/media over packet networks” (issued on Sep. 25, 2007 and assigned to Harrell; Chandlee (Cupertino, Calif.), Ratner; Edward R. (Sunnyvale, Calif.), Miller; Thomas D. (Alamo, Calif.), Prakash; Adityo (Redwood Shores, Calif.), So; Hon Hing (San Jose, Calif.)) describes a method and apparatus for client-side detection of network congestion in a best-effort packet network comprising streaming media traffic wherein a client media buffer detects at least one level of congestion and signals a server to enact at least one error mechanism. 
         [0008]    U.S. Pat. No. 7,164,680 to Loguinov; Dmitri (Wappingers Falls, N.Y.) for “Scheme for supporting real-time packetization and retransmission in rate-based streaming applications” (issued on Jan. 16, 2007 and assigned to Koninklijke Philips Electronics N.V. (Eindhoven, NL)) describes a system and method for supporting real-time packetization of multimedia information and retransmission of lost multimedia packets over a packet network. 
         [0009]    U.S. Pat. No. 7,133,925 to Mukherjee; Debargha (San Jose, Calif.), Said; Amir (Cupertino, Calif.) for “System, method, and format thereof for scalable encoded media delivery” (issued on Nov. 7, 2006 and assigned to Hewlett-Packard Development Company, L.P. (Houston, Tex.)) describes a system, method, and bit-stream format for delivery, wherein the media data is transcoded prior to delivery based on the receiving attributes of the media destination. 
         [0010]    U.S. Pat. No. 7,062,567 to Benitez; Manuel Enrique (Cupertino, Calif.), Holler; Anne Marie (Santa Clara, Calif.), Shah; Lacky Vasant (Fremont, Calif.), Arai; Daniel Takeo (Sunnyvale, Calif.), Panwar; Sameer (Fremont, Calif.) for “Intelligent network streaming and execution system for conventionally coded applications” (issued on Jun. 13, 2006 and assigned to Endeavors Technology, Inc.) describes an intelligent network streaming and execution system for conventionally coded application to partition an application program into page segments, and streaming these page segments into a client as the application program executes on the client, wherein the client prefetches page segments or the application server pushes the additional page segments. 
         [0011]    U.S. Pat. No. 5,768,527 to Zhu; Qin-Fan (Mansfield, Mass.), Sridhar; Manickam R. (Holliston, Mass.), Eyuboglu; M. Vedat (Concord, Mass.) for “Device, system and method of real-time multimedia streaming” (issued on Jun. 16, 1998 and assigned to Motorola, Inc. (Schaumburg, Ill.)) describes a system and method for real-time streaming of a multimedia file stored in a remote server over a packet network to a multimedia client connected to the same network via a low-speed access link such as an analog telephone line, wherein the invention operates to provide significantly improved quality of service with respect to both quality and delay. 
         [0012]    U.S. Pat. No. 5,603,058 to Belknap; William R. (San Jose, Calif.), Fitchett; Larry W. (Morgan Hill, Calif.), Stansbury; Buddy F. (San Jose, Calif.) for “Video optimized media streamer having communication nodes received digital data from storage node and transmitted said data to adapters for generating isochronous digital data streams” (issued on Feb. 11, 1997 and assigned to International Business Machines Corporation (Armonk, N.Y.)) describes a media streamer with at least one control node, at least one storage node, a plurality of communication nodes, and an adapter for receiving a sequence of data bursts and for converting the received sequence of data bursts to a substantially isochronous data stream that represents a video presentation. 
         [0013]    U.S. Pat. Application No. 2006/0253599 by Monteiro; Antonio M.; (New York, N.Y.); Butterworth; James F.; (New York, N.Y.) titled “System for delivering media” (published on Nov. 9, 2006) describes a system that delivers a continuous sequence of individual pierces of media information over a communication network to a group of users, wherein, the system includes a user interface screen that displays program guide and the system also maintains an audit log. 
         [0014]    U.S. Pat. Application No. 2004/0117427 by Allen, Geoff; (Sterling, Va.); Ramsey, Timothy; (Chantilly, Va.); Geyer, Steve; (Herndon, Va.); Gardner, Alan; (Potomac, Md.); McElrath, Rod; (Fairfax, Va.) titled “System and method for distributing streaming media” (published on Jun. 17, 2004) describes a high-performance, adaptive, and scalable system for distributing streaming media, in which processing into a plurality of output formats is controlled in a real-time distributed manner, and which further incorporates processing improvements relating to workflow management, video acquisition and video preprocessing. 
         [0015]    “Resilience in live peer-to-peer streaming” by Fodor, V. and Dan, G. (appeared in IEEE Communications Magazine, Vol. 45, No. 6, June 2007) provides a survey of the media distribution methods and overlay structures, and in particular discusses the trade-offs between resilience and overhead. 
         [0016]    “Push-to-Pull Peer-to-Peer Live Streaming” by Locher, T., Meier, R., Schmid, S. and Wattenhofer, R. (appeared in Lecture Notes in Computer Science, Vol. 4731/2007, Springer Berlin/Heidelberg, 2007) describes an approach that combines low-latency push operations along a structured overlay with the flexibility of pull operations. 
         [0017]    “An analytical study of low delay multi-tree-based overlay multicast” by Dán, G. and Fodor, V. (appeared in the Proceedings of the 2007 workshop on Peer-to-peer streaming and IP-TV, Kyoto, Japan, Pages 352-357, 2007) proposes an analytical model for characterizing end-to-end loss for live multicast streaming and considers push-based architectures combined with retransmissions and forward error correction. 
         [0018]    “Design, analysis, and implementation of an agent driven pull-based distributed video-on-demand system” by Veeravalli, B. Chen, L., Kwoon, H., Whee, G., Lai, S. Hian, L., and Chow, H. (appeared in Multimedia Tools and Applications, Vol. 28, No. 1, Springer Netherlands, February, 2006) addresses the problem of employing multiple servers to serve a pool of clients on a network based multimedia and addresses the issues related to behavior of network infrastructure, client management, and resource management. 
         [0019]    The known systems do not address the various issues related to the simultaneous handling of load balancing and occasional failures in the context of multimedia delivery in the context of multiple sources and multiple destinations. The present invention provides a system and method for addressing these issues in order to efficiently utilize system and network resources at the same time meeting quality of service requirements. 
       SUMMARY OF THE INVENTION 
       [0020]    The primary objective of the invention is to efficiently deliver multimedia content from multiple sources to multiple destinations across a not so highly reliable network with content sources also being not so highly reliable. 
         [0021]    One aspect of the invention is to measure parameters related to quality of service and delivery reliability. 
         [0022]    Another aspect of the invention is to compute priority and load measures related to multiple sources and destinations. 
         [0023]    Yet another aspect of the invention is to perform round-robin pull of a multimedia content from multiple sources. 
         [0024]    Another aspect of the invention is to compute the amount of multimedia content to be pulled from each of the multiple sources. 
         [0025]    Yet another aspect of the invention is to perform targeted pull of a multimedia content from a selected reliable source. 
         [0026]    Another aspect of the invention is to perform prioritization of a plurality of pull requests at a source. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0027]      FIG. 1  depicts an illustrative application of Multi-Source Multi-Destination Delivery System (MSMDDS). 
           [0028]      FIG. 2  depicts an illustrative System Architecture of MSMDDS. 
           [0029]      FIG. 3  depicts an illustrative Network Architecture of MSMDDS. 
           [0030]      FIG. 4  provides a brief description of MSMDDS. 
           [0031]      FIG. 5  provides an illustrative sequence diagram. 
           [0032]      FIG. 6  provides a brief description of Pull Distribution Algorithm. 
       
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
       [0033]    Multi-source multi-destination multimedia content delivery involves providing of content from many of the sources to all of the destinations. In this scenario, each system is generically called as a host (as any such system could be a source for multimedia content) and these hosts are connected with each other through a network. Typically, different portions of the network get loaded differently, and different host systems also get loaded differently. This provides an opportunity to determine the best possible hosts for pulling the multimedia content. In order to deal with real-time multimedia content, the pulls happen at regular intervals and the availability of high speed systems and high speed networks indicate these intervals need not have to be very short. Given that multiple sources hosted on faster systems connected via a faster network deliver real-time multimedia content to multiple destination systems, the Multi-Source Multi-Destination Delivery System (MSMDDS) that is part of each host system ensures the efficient delivery of multimedia content from multiple sources to multiple destinations across the network. The main objective of the MSMDDS is to account for error and delay in delivery due to network and system conditions. This is achieved by on the fly measurements of quality of service and reliability parameters, number of users distributed across multiple local area networks requesting for real-time content, and number of such content deliveries that are under progress. 
         [0034]      FIG. 1  depicts an illustrative application of MSMDDS. Multiple sources and destinations are connected via a cooperative overlay network (CON) ( 100 ). Host systems ( 110 ,  120 , 130 , and  140 ) that are part of the CON source multimedia content. For example, the host system ( 110 ) sources content C 1 , the host system ( 120 ) sources contents C 1  and C 2 , the host system ( 130 ) sources content C 1 , and the host system ( 140 ) sources content C 2 . The host system ( 140 ) delivers content to the various users via a local area network ( 150 ). That is, the user ( 160 ) requiring content C 1  receives the same through the local area network, and this content C 1  is available at multiple sources ( 110 ,  120 , and  130 ). In order to pull a multimedia content from multiple sources, the multimedia content is split into multiple segments and each segment has an associated flow during the pulling of a segment from a source. These multiple flows are logically related to a session that is associated with the receiving of the multimedia content in real-time. Hence, MSMDDS part of the host system ( 140 ) pulls the content C 1  in session X 1  as follows: S 11  through F 11  from  130 , S 12  through F 12  from  110 , S 13  through F 13  from  120 , S 14  through F 14  from  130 , and finally S 15  through F 15  from  110 . Notice that the content C 1  is split into segments S 11 , S 12 , S 13 , S 14 , and S 15  for pulling purposes and this segmentation is dependent on the various measures such as QoS, reliability, and load. Similarly, MSMDDS part of the host system ( 110 ) pulls the content C 2  in session X 2  to deliver to the same the user ( 180 ) through a local area network ( 170 ) as follows: S 21  through F 21  from  140 , S 22  through F 22  from  120 , S 23  through F 23  from  140 , and finally S 24  through F 24  from  120 . The overall content (C 2 ) segmentation and delivering the segments through flows (F 21 -F 24 ) of a session (Session  2 ) is depicted in  190 . 
         [0035]      FIG. 2  depicts an illustrative System Architecture of MSMDDS. The system comprises of three layers: Communication layer ( 200 ), Scheduling layer ( 210 ), and Delivery layer ( 220 ). Communication layer further comprises of two subsystems: (a) Command Analysis and Processing subsystem to process the various commands received from other host systems through CON; and (b) QoS Measure subsystem to support in on the fly measurement of quality of service parameters such as delay and error rate with respect to the various flows through CON. Scheduling layer further comprises of two subsystems: (c) Round-Robin Pull subsystem to initiate pull requests to various hosts in order to obtain a multimedia content to be delivered to the users connected via a local area network; (d) Priority Assignment subsystem to help assign priorities for segment requests both at source and at destination systems; (e) Load Balancing subsystem to support the overall enhancement of system throughput. Delivery layer further comprises of three subsystems: (f) Reliability Measure subsystem at destination systems to help in on the fly reliability measurement of the various flows through CON; (g) Targeted Pull subsystem to enhance the quality of service; and (h) Content Delivery Optimization subsystem to enhance the overall deliver efficiency. 
         [0036]      FIG. 3  depicts an illustrative Network Architecture of MSMDDS. MSMDDS is a part of both source and destination systems. Source and destination systems are collectively called as hosts ( 300 ). Multiple such hosts are interconnected via an overlay network called as Cooperative Overlay Network (CON) ( 310 ). Each host supports multiple users via a local area network ( 320 ). The main objective of MSMDDS is to achieve content delivery efficiency and this is achieved by segmenting and pulling the segments of a multimedia content from multiple sources. This pulling is based on the overall weight of a particular flow, between a source and a destination, associated with a segment and this weight is computed at a destination system and used also in source systems. Hence, these weights need to be valid across CON demanding cooperation among the host systems. 
         [0037]      FIG. 4  provides a brief description of MSMDDS. Command Analysis and Processing subsystem handles the following three commands (also referred as messages): The command GetContentHosts obtains the list of multiple hosts that are part of CON. Each content host (that host in a CON that has the required content) returns the command positive response and also provides information about the host system load based on the number sessions being handled. The command GetSegmentsData obtains data related to multiple segments related to one or more sessions from a host. Finally, GetTargetedData obtains the missing data from a particular more reliable source. 
         [0038]    The QoS Measure subsystem monitors flows and measures the following two parameters: Delay—with respect to each flow (corresponding to the segment data pull) related to a host system, compute and update average delay with respect to that host; Error rate—with respect to each flow (corresponding to the segment data pull) related to a host system, compute and update average error rate with respect to that host. 
         [0039]    The Round-Robin Pull subsystem helps in efficiently obtaining content that is available at multiple sources. For a content C and the corresponding session X under consideration, 
         [0040]    Based on last obtained data and current time, obtain the amount Ai of data that needs to be pulled; 
         [0041]    Obtain multiple sources for C; 
         [0042]    For each source, obtain quality of service measure, reliability measure, session elapsed time measure, session priority measure, user load measure, and session load measure, and compute a weight (between 0 and 1) based on these measures; 
         [0043]    Apportion the amount Ai based on the respective weights of the sources; 
         [0044]    And, initiate pull for the apportioned amount from the obtained multiple sources. 
         [0045]    The Priority Assignment subsystem is to help revise a pull request priority at a source. 
         [0046]    Obtain Session priority of a session associated with a pull request; 
         [0047]    Obtain Session elapsed time of the session, and update Session priority based on the inverse normal distribution of elapsed time (that is, assign higher priority for initial and final stages of a session); 
         [0048]    Obtain the amount of data requested related to the pull request, normalize the same across amounts related to other pull requests, and assign higher priority if higher is the requested data; 
         [0049]    Obtain the amount of data that has been accumulated for delivery for the pull request, normalize the same across amounts accumulated with respect to other pull requests; 
         [0050]    Based on all of the above, assign a priority for the pull request. 
         [0051]    Note that the above priority assignment is at a source to prioritize the multiple GetSegmentsData requests from multiple hosts (destinations). 
         [0052]    The Load Balancing subsystem analyzes a round-robin pull request and ensures that no single host is inappropriately loaded. 
         [0053]    The Reliability Measure subsystem monitors the flows and measures the flow reliability with respect to a source based on number of packets lost. 
         [0054]    The Targeted Pull subsystem enhances the quality of service by determining the missed packet and pulling the packet from a different source that is more reliable. Determine a missed packet and determine the source of the missed packet; Determine the reliability measure of the source; Determine a second source such that the reliability measure of the second source is greater than or equal to the reliability measure of the source; and initiate the pull of the packet from the second source. 
         [0055]    The Content Delivery Optimization subsystem, on need basis, combines multiple session requests into one pull request to achieve higher delivery efficiency. 
         [0056]      FIG. 5  provides an illustrative sequence diagram. 
         [0057]    Note that, in the following, message and command are used interchangeably. 
         [0058]    System H 3  (S 1 ) hosts content C 1 , System H 2  (S 2 ) hosts contents C 1  and C 2 , and System H 1  (S 3 ) hosts contents C 1 , C 2 , and C 3 ; And, System H 4  (D 1 ) needs content C 1  and pulls C 1  through session X 1 , System H 5  (D 2 ) needs contents C 2  and C 3 , and pulls C 2  through session X 2  and C 3  through session X 3 ; System H 6  (D 3 ) needs contents C 1  and C 3 , and pulls C 1  through session X 4  and C 3  through session X 5 ; 
         [0059]    The elaboration of the sequence diagram is as follows: 
         [0000]    
       
         
               
               
             
           
               
                   
               
               
                 Message 
                   
               
               
                 ID 
                 Description 
               
               
                   
               
             
             
               
                 1 
                 D1 sends GetContentHosts message to S1 for content C1; 
               
               
                 2 
                 D1 sends GetContentHosts message to S2 for content C1; 
               
               
                 3 
                 D1 sends GetContentHosts message to S3 for content C1; 
               
               
                 4 
                 D2 sends GetContentHosts message to S1 for contents C2 
               
               
                   
                 and C3; 
               
               
                 5 
                 D2 sends GetContentHosts message to S2 for contents C2 
               
               
                   
                 and C3; 
               
               
                 6 
                 D2 sends GetContentHosts message to S3 for contents C2 
               
               
                   
                 and C3; 
               
               
                 7 
                 D1 sends GetSegmentsData message to S1 through X1 for 
               
               
                   
                 amount AA/2 
               
               
                 8 
                 D1 sends GetSegmentsData message to S2 through X1 for 
               
               
                   
                 amount AA/3 
               
               
                 9 
                 D1 sends GetSegmentsData message to S3 through X1 for 
               
               
                   
                 amount AA/6 
               
               
                 A 
                 D2 sends GetSegmentsData message to S2 through X2 for 
               
               
                   
                 amount 3AB/4 
               
               
                 B 
                 D2 sends GetSegmentsData message to S2 through X2 for 
               
               
                   
                 amount AB/4 
               
               
                   
                 and through X3 for amount AC 
               
               
                 C 
                 S1 sends response to message 7 (Flow F11) 
               
               
                 D 
                 S2 sends response to message A (Flow F21) 
               
               
                 E 
                 S2 sends response to message 8 (Flow F12) 
               
               
                 F 
                 S3 sends response to message B (Flow F22) 
               
               
                 G 
                 S3 sends response to message 9 (Flow F13) 
               
               
                 H 
                 D1 sends GetTargetedData message to S2 
               
               
                 I 
                 S2 sends response to message H (Flow 14) 
               
               
                   
               
             
          
         
       
     
         [0060]      FIG. 6  provides a brief description of Pull Distribution Algorithm. 
         [0061]    The Pull Distribution algorithm is part of a destination system that receives multimedia content from multiple sources. This algorithm plays a crucial role in ensuring efficient delivery of multimedia content to the destination system. The algorithm is to distribute Pull Requests for a Session related to a multimedia Content. 
         [0062]    Distribution in a given Destination System Hd is based on the following parameters: 
         [0000]    
       
         
               
             
           
               
                   
               
             
             
               
                 Session specific: Priority, Start Time, End Time, Amount, Number of Users, and Hosts; 
               
               
                 Here, Hosts is the number of hosts that contain the multimedia Content. 
               
               
                 Host specific: Delay, Error, Loss, Number of Sessions; 
               
               
                 For a given session X related to content C, Let Hosts = {H1, H2, ..., Hy} wherein each 
               
               
                 Hi hosts C; Here, a host is a source for session X; 
               
               
                 Given above, distribute the required amount, A, at D, across Y hosts in Hosts as {A1, A2, 
               
               
                 ..., Ay} wherein, Ai is the amount (segment) to be pulled from host Hi such that A = 
               
               
                 Sum (Ai) with 1 &lt;= I &lt;= Y); 
               
               
                 For each host Hi in Hosts, 
               
               
                 { 
               
               
                 Delay: Let Di be delay associated with host Hi; Normalized Delay Di’ = (Di − Dmn) / 
               
               
                 (Dmx − Dmn) wherein Dmn and Dmx are minimum and maximum delays associated 
               
               
                 with hosts in Hosts; 
               
               
                 Error Rate: Let Ei be Error Rate associated with host Hi; Normalized Error Rate Ei’ = (Ei − 
               
               
                 Emn) / (Emx − Emn) wherein Emn and Emx are minimum and maximum error factors 
               
               
                 associated with hosts in Hosts; 
               
               
                 Loss: Let Li be packet loss associated with host Hi; Normalized Loss Li’ = (Li − Lmn) / 
               
               
                 (Lmx − Lmn) wherein Lmn and Lmx are minimum and maximum error factors 
               
               
                 associated with hosts in Hosts; 
               
               
                 Session Priority: Let P be the priority associated with session X; Normalized Session 
               
               
                 Priority Pi’ is a value between 0 and 1; Higher the priority, the value is closer to 1; 
               
               
                 Elapsed Time: Let Tp be the elapsed time of session X; Normalized Elapsed Time, T’, is 
               
               
                 based on inverse normal distribution of Tp wherein Tp = (Tc − Ts) / (Te − Ts) with Ts 
               
               
                 being session start time, Te being session end time, and Tc being current time; That is, 
               
               
                 close to 0 and close to 1 values of Tp map onto higher values of T’; 
               
               
                 User Loading: Let Un be the number of users for X with respect to D; Normalized User 
               
               
                 Loading, U’ = Un / Umx if Un &lt; Umx else is equal to 1 wherein Umx is the expected 
               
               
                 maximum number of users at any destination system; 
               
               
                 Session Loading: Let Xi be the number sessions being processed by Hi; Normalized 
               
               
                 Session Loading, Xi’ = (Xi − Xmn) / (Xmx − Xmn) wherein Xmx and Xmn are the 
               
               
                 maximum and minimum session loading with respect to hosts in Hosts; 
               
               
                 } 
               
               
                 For each host Hi, 
               
               
                    Compute Hi’ as ((1 − Di’) + (1 − Ei’) + (1 − Li’) + Pi’ + T’ + U’ + (1 − Xi’)) / 7; 
               
               
                 For each host Hi, compute Wi’ = Hi’ / (Sum (over 1 &lt;= I &lt;= Y) Hi’); 
               
               
                 Compute Ai as A * Wi’; 
               
               
                   
               
             
          
         
       
     
         [0063]    Thus, a system and method for efficient delivery in a multi-source, multi-destination network is disclosed. Although the present invention has been described particularly with reference to the figures, it will be apparent to one of the ordinary skill in the art that the present invention may appear in any number of systems that exploit redundancy to enhance multimedia content delivery. It is further contemplated that many changes and modifications may be made by one of ordinary skill in the art without departing from the spirit and scope of the present invention.