Abstract | ||
---|---|---|
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficient management of a network of media servers. This network of servers can be implemented on top of a closely connected network of workstations as well as on a wide area network of media servers. The problem studied here addresses the management of media assets on such a network, i.e. the placement/replication of media assets on a net- work of media servers taking the user requests, storage capacity and bandwidth limitations of the server network into account. The algorithms presented for the solution of the S-MAMP problem make efficient use of the ability of audio/ video encoding standards such as MPEG to encode one stream in different bitrates providing scalable service quality to the user in this way. |
Year | DOI | Venue |
---|---|---|
1999 | 10.1109/IPPS.1999.760519 | IPPS/SPDP |
Keywords | Field | DocType |
server network,s-mamp problem,media asset,user request,efficient use,efficient management,wide area network,bandwidth limitation,new combinatorial optimization problem,mapping media streams,media server,replication,combinatorial optimization,computer networks,mathematics,information systems,concurrent computing,placement,parallel processing,computer science,distributed computing | Computer science,Server,Network simulation,Computer network,Workstation,Concurrent computing,Wide area network,Distributed computing,Network management station,Intelligent computer network,Scalability | Conference |
ISSN | ISBN | Citations |
1063-7133 | 0-7695-0143-5 | 0 |
PageRank | References | Authors |
0.34 | 7 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Reinhard Lüling | 1 | 313 | 35.55 |