In this paper, we describe scalable optimal methods for delivering archived and live multi-media content from servers to multi-media client players endowed with substantial RAM or disk-based buffers. These methods result from the application of linearoptimization theory (linear programming) to the problem of how best to modulate the flow rate of constant-bit-rate (CBR) content for all sessions linking a server to its clients, in which session flow rates are subject to upper and lower bound constraints, and aggregate flow cannot exceed a specified maximum. An efficient O(n) algorithm to maximize aggregate flow is described. We propose a tunable minimum constraint on session flows that is shown to result in a rapid and sustained accumulation of reserve content within a player's buffer. An associated Call Admission Control (CAC) algorithm is also described. The benefits of the methods described include improved server efficiency, enhanced end-user experience (QOS), cost effective end to-end content delivery, directly from origin servers to clients without need of intervening edge-caching technology.

Statecharts are extended to deal with events when no applicable transition is available, and to resolve conflicts relative to event scheduling and response that can arise whenever multiple states can be active simultaneously. Event closure and event scheduling are achieved without having to clutter up a basic statechart. The extensions are effected by means of declarative event disposition rules. These rules, together with the statechart topology, determine the contents of one or more disposition matrices. These matrices are combined with the statechart state to determine the response of the event dispatcher to incoming events. The operation of the event dispatcher is also described. A detailed example illustrates these concepts, which are further characterized, for the benefit of working programmers, in the form of a behavioral design pattern. A tool called StateCraft embodies these notions.