The delivery of large files toin)((P2fi( users, such as videoon deman orapplication programs to theenM9((92fi nenM9 computers is expected byman to be on of themain tasks ofbroadban communfi(((9 nommun This requires highban2BPP) capacity as well as fastan den2 storage servers. This motivates multimedia service providers to optimize the delivery nlivery as well as the electronfi conctr allocation A hierarchical architecture for thedistribution of multimediacontim was in((P-M2fi by Nussbaumer, Patel, Scha#a, an Sterben (INFOCOM 94). They addressed the trade-o#between baneen2 an storagerequiremenN that results from theplacemen of theconNMP serversin the hierarchy tree. Theypresen)N acenPW2fiP-W algorithm to compute the best level of the hierarchy for the serverlocation tominMP-9 thecombin( cost ofcommun2fiP)-- an storage. In this work, we solve agen-qq case where serverscan be placed atdi#eren levels of the hierarchy. We develop a distributed optimallocation algorithm that requires small nall memory capacityan computationpower. Previous results for related problems forcachin systemdesign are of higher complexity. Previous results for related classic operation research problems are limited tocenBW-2fiPP algorithms, basedon lind2 programminfi that are ne easy to conMB) in distributed algorithms.Ingorit toobtain our results, we observed that the use ofdynq)P programmin nprogram leno itself to a distributedimplemened2NW( For the specific problem athan9 we alsoman2PN to fin anPWMBB funMBB2 (agenBB-2fiNBNq) of the problem) that simplifies the combin2fiNW operation usedin thedesign of adyn9P( program.

This RFC introduces a new transport mechanism for TCP based upon partial ordering. The aim is to present the concepts of partial ordering and promote discussions on its usefulness in network communications. Distribution of this memo is unlimited. Introduction A service which allows partial order delivery and partial reliability is one which requires some, but not all objects to be received in the order transmitted while also allowing objects to be transmitted unreliably (i.e., some may be lost). The realization of such a service requires, (1) communication and/or negotiation of what constitutes a valid ordering and/or loss-level, and (2) an algorithm which enables the receiver to ascertain the deliverability of objects as they arrive. These issues are addressed here - both conceptually and formally - summarizing the results of research and initial implementation efforts. Connolly, Amer & Conrad [Page 1] RFC1693 RFC.net Page 2 of 37 RFC 1693 An Extension to TCP: Partial Order...

The delivery of large size les to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of the main requirements of communication networks. This requires...

This paper addresses the problem of allocating resources to set up multimedia multipoint connections, while efficiently using network resources, in a network that includes signal converters to resolve the heterogeneity of customer/network equipments and information mixers for conference services. Specifically, given a connection request and a physical network, we consider the general resource allocation problem where the allocation costs of special resources and links are comparable so that neither can be neglected. The problem is shown to be NP-hard and the performance result of an optimal algorithm, several heuristic algorithms, and a distributed algorithm is presented. Keywords: Resource Allocation, Multimedia, Multiparty Communication, Broadband Networks, Optimal Algorithm, Heuristic Algorithm, Distributed Algorithm. 1. Introduction Rapid advances in switch and transmission technologies have made it possible to provide multimedia multiparty communication services to customers with...

The delivery of multimedia information over networks requires expensive high bandwidth capacity as well as fast and high storage servers. This motivates the multimedia providers to optimize the delivery distances, as well as, to optimize the electronic content allocation. In this paper we propose an algorithm for finding the optimal allocation of electronic content in a tree oriented distributed network (Such as, CATV-Tree). The proposed algorithm finds the optimal location of an electronic content over the distributed network, such that the cost of storage (storing electronic content in servers) plus the communication cost (transferring electronic content over the network to the end-users) is minimized. The algorithm is distributed, and each node requires a limited memory capacity and computation...

This RFC introduces a new transport mechanism for TCP based upon partial ordering. The aim is to present the concepts of partial ordering and promote discussions on its usefulness in network communications. Distribution of this memo is unlimited. Introduction A service which allows partial order delivery and partial reliability is one which requires some, but not all objects to be received in the order transmitted while also allowing objects to be transmitted unreliably (i.e., some may be lost). The realization of such a service requires, (1) communication and/or negotiation of what constitutes a valid ordering and/or loss-level, and (2) an algorithm which enables the receiver to ascertain the deliverability of objects as they arrive. These issues are addressed here - both conceptually and formally - summarizing the results of research and initial implementation efforts. Connolly, Amer & Conrad [Page 1] RFC1693 RFC.net Page 2 of 37 RFC 1693 An Extension to TCP: Partial Order Service N...