EP0464283A2 - Dispositif de réservation et d'allocation d'une pluralité de demandes concurrentes dans un bus de réseau de communication ordonné - Google Patents

Dispositif de réservation et d'allocation d'une pluralité de demandes concurrentes dans un bus de réseau de communication ordonné Download PDF

Info

Publication number
EP0464283A2
EP0464283A2 EP90313761A EP90313761A EP0464283A2 EP 0464283 A2 EP0464283 A2 EP 0464283A2 EP 90313761 A EP90313761 A EP 90313761A EP 90313761 A EP90313761 A EP 90313761A EP 0464283 A2 EP0464283 A2 EP 0464283A2
Authority
EP
European Patent Office
Prior art keywords
time
endpoints
customer
demand
conference
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP90313761A
Other languages
German (de)
English (en)
Other versions
EP0464283A3 (en
Inventor
Eric B. Muehrcke
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
AT&T Corp
Original Assignee
American Telephone and Telegraph Co Inc
AT&T Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by American Telephone and Telegraph Co Inc, AT&T Corp filed Critical American Telephone and Telegraph Co Inc
Publication of EP0464283A2 publication Critical patent/EP0464283A2/fr
Publication of EP0464283A3 publication Critical patent/EP0464283A3/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/14—Handling requests for interconnection or transfer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1813—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast for computer conferences, e.g. chat rooms

Definitions

  • This invention relates to resource allocation and, more particularly, to allocating a constrained common resource among a plurality of demands for the resource.
  • resource allocation applies to that class of problems, which has as a common characteristic the need to physically allocate a restricted or constrained common resource among a plurality of demands for that resource. For example, in a communications system, it is common to allocate network resources such as trunks for video conferencing on a manual first come, first served basis. Obviously, it would be desirable to automate the allocation process.
  • Dynamic storage allocation problems are well known in the art.
  • the term "dynamic storage allocation” applies to that class of problems, which relates to reserving contiguous space in some storage medium for some period of time in order to satisfy the demands a customer may have for the storage medium.
  • known dynamic storage allocations algorithms tend to be NP-complete, i.e. they are not generally solvable in reasonably short periods of time. More specifics can be found in any standard text such as the text by Michael R. Garey and David S. Johnson entitled “Computers and Intractability - A Guide to the Theory of NP-Completeness", New York: W. H. Freeman and Company (1979).
  • the network which includes a plurality of customer sites, each customer site including one or more endpoints, each endpoint being connectable to a switching system, the switching system being connectable to another switching system, comprises means for connecting a first endpoint through one or more switching systems to a second endpoint.
  • the allocation arrangement receives demands from a customer site for allocating the network for a communication among a plurality of customer sites and stratifies the received demands in response to a grouping of endpoints to be conferenced at the customer sites.
  • the arrangement can then allocate the network resources to connect the endpoints to be conferenced in response to the stratified demand including generating setup and terminate times for each endpoint to be connected in a conference; reserving the endpoints to be connected in the conference; and generating a plurality of binding for signalling the network and the source as to success of connecting the endpoints to be conferenced over an ordered bus network.
  • the arrangement also stratifies a customer's demand into sets of strategies for groupings of like endpoints; allocates network resources responsive to characteristics of the different groupings of like endpoints; for each strategy, generates the setup_times and terminate_times for each endpoint and reserves the endpoints for a reservation and generates bindings.
  • the arrangement also, for a first grouping of like endpoints such as codecs, alternate accesses, and offnets, extends a conference signal through a multiplexer or concentrator at a customer site over an access line to a homing DACS; while, for a second grouping of like endpoints such as audio bridges, extends a conference signal from a customer site to a central bridging DACS; while, for a third grouping of like endpoints such as VCCs, extends a conference signal from a customer site to the network; means for generating a DMB sequence number for the reservation.
  • like endpoints such as codecs, alternate accesses, and offnets
  • each of a plurality of customer sites 110-1 through 110-N is coupled over a respective access line 120-1 through 120-N (note that, although N is shown to be eight in FIG. 1, same is for purposes of illustration and not by way of limitation since N can be a design parameter, which can be any integer greater than one) to a respective digital access and cross-connect system (DACS) such as DACS 130-1 through DACS 130-M (note that, although M is shown to be four in FIG. 1, same is for purposes of illustration and not by way of limitation since M can be a design parameter, which can be any integer greater than zero).
  • DACS equipment such as the publicly used Digital Access and Cross-Connect System is commercially available from American Telephone and Brass Company.
  • DMB Digital Multipoint Bridge
  • Optical Fiber Link Interface are also commercially available and in public use.
  • customer site 110-1 is coupled to DACS 130-1 by way of access line 120-1; customer sites 110-2 and 110-3 are coupled to DACS 130-2 by way of access lines 120-2 and 120-3, respectively; customer sites 110-4, 110-5, and 110-6 are coupled to DACS 130-3 by way of access lines 120-4, 120-5, and 120-6, respectively; and customer sites 110-7 and 110-8 are coupled to DACS 130-4 by way of access lines 120-7 and 120-8, respectively.
  • the respective DACS are coupled to each other by way of an ordered bus communications network arrangement.
  • DACS 130-1 is coupled to DACS 130-2 by way of first internodal link 140-1 and DACS 130-2 is coupled to DACS 130-3 by way of second internodal link 140-2 and DACS 130-3 is coupled to DACS 130-4 by way of third internodal link 140-3.
  • Each access line 120-i and each internodal link 140-j can include one or more communications paths and each communications path has some predetermined bandwidth and the bandwidth of one communications path may be, but need not be, the same as the bandwidth of another communications path and each communications path can be a transmission facility, (a) which may directly connect, for example, a customer site 110-i and a DACS 130-k or may directly connect one DACS with another DACS, for example, DACS 130-1 with DACS 130-2 or (b) which may indirectly connect, for example, a customer site 110-i and a DACS 130-k or may indirectly connect one DACS with another DACS, for example, DACS 130-1 with DACS 130-3 through interposed equipment or facilities, which interposed equipment or facilities could include even another DACS like DACS 130-2 interposed between DACS 130-1 and DACS 130-3.
  • internodal link refers to the connection between two DACS, e.g., in FIG. 1, internodal links 140-j, which may directly connect, for example, one DACS 130-k with another DACS 130-m or which may indirectly connect, for example, the two DACS through interposed equipment or facilities like another DACS.
  • bus refers to an ordered set of internodal links, which connects a set of DACS in a specific ordered configuration like that shown in FIG. 1.
  • Each DACS 130-k can be connected to one or more other DACSs like DACS 130-m by a respective internodal link 140-j. Further, when all the DACS in the network are completely interconnected, it is clear that there could be many ordered sets of internodal links. Each ordered set of internodal links that satisfies a predetermined criteria is called a bus. I have shown only one bus arrangement in FIG. 1, i.e.
  • internodal links 140-1, 140-2, 140-3
  • the resources of a network be allocated in some timely manner such that equipment at one customer site can communicate with one or more units of equipment at one or more other customer sites.
  • broadcasting is often applied to an arrangement wherein equipment at one customer site communicates in a substantially simultaneous manner with one or more units of equipment at one or more other customer sites.
  • broadcasting is concerned as to the signal source.
  • conferencing is applied to an arrangement, which, without regard to signal source, involves communication among two or more units of equipment whereby a set of customer sites communicate among each other.
  • an allocation methodology is set forth by way of which it is possible to allocate the limited or constrained resources of a network such as the bandwidth of a communications path in the network among a plurality of customer demands for that bandwidth and, importantly, to do the allocation in a manner such that the expectations of the customer are satisfied.
  • a customer or source of a demand at customer site 110-3 places a demand on a network that a video conferencing connection be set up between customer site 110-3 and all of the other customer sites 110-i shown in FIG. 1.
  • the customer typically would have several other demands.
  • the customer may demand that the conference begin at a specific time of a day, called a start_time-date, and that the conference terminate at a specific time of the same, or of a different, day, called a stop_time-date.
  • the customer may demand that the communication paths, which are to be allocated, have some minimum bandwidth, which may be subject to a constraint such as the constraint that the network will not allocate bandwidth beyond some predetermined maximum bandwidth.
  • the customer may, before the conference begins or during the time interval of the conference, demand the flexibility to have certain customer sites dynamically added to, or terminated from, the conference during the time interval of the conference and, still even further, these added or terminated demands may be made with relatively short lead-time and may be made either before or during a conference call.
  • the customer may further demand that the time to start or stop the conference be changed or that the minimum bandwidth of the conference be changed.
  • binding refers to the concept represented by a four-tuple of the form (X1, X2, X3, X4) where X1 is a first specific position within the bandwidth of a communications path; X2, which for our description is assumed to be larger than X1, is a second specific position within the bandwidth of the communications path; X3 is the time-date that the customer wants the conference to be setup; and X4 is the time-date that the customer wants the conference to terminate. Note that the difference between X2 and X1, i.e. X2 - X1, corresponds to the minimum bandwidth that the the customer demands, which itself is subject to the constraint that the minimum bandwidth demanded may not exceed the maximum bandwidth of the communications path, which serves the reservation.
  • first position X1 and one meaning of second position X2 consider a well known digital transmission network, which includes channelized bandwidth.
  • a digital network may include 24 channels (called DS0 channels, each DS0 channel operating nominally at about 64 kilobits per second) in a single multichannel communications path (called a DS1 channel, which operates nominally at about 1.544 megabits per second).
  • a DS1 channel which operates nominally at about 1.544 megabits per second
  • 28 DS1 channels may be included in a single multichannel communications path (called a DS3 channel, which operates nominally at about 44.7 megabits per second), etc.
  • first position X1 may be a specific one of the 24 DS0 channels while second position X2, which is larger than X1, may be a specific other one of the 24 DS0 channels.
  • setup-time-date X3 and the terminate-time-date X4 could be respectively some time-date before and some time-date after the actual start-time and actual stop_time demanded by the customer, e.g., the value of X3 in the four-tuple could be less than the actual start-time-date demanded by the customer so as to allow the network adequate time to set up a connection, hence X3 is also called the setup_time-date, and may be shortened to setup_time. Accordingly, setup_time X3 is a time-date such that the conference connection, if its connection commences before the start_time, will satisfy the expectations of the customer.
  • the difference between the setup_time-date and the start_time-date is now described.
  • the time to allow the network to setup a conference connection is called the “res_setup_time_delta.” While the time to allow the network to add an endpoint to an in-progress conference is called the “room_setup_time_delta.”
  • the res_setup_time_delta and room_setup_time_delta may have different values depending on the constraints of the network, but are assumed to be zero or greater.
  • terminate_time X4 is a time-date such that the conference connection, if disconnected no later that time X4 but certainly no sooner than the actual stop_time-date demanded by the customer, will satisfy the expectations of the customer. The difference between the terminate_time-date and the stop_time-date is now described.
  • the time to allow the network to terminate a conference connection is called the “res_teardown_time_delta.” While the time to allow the network to terminate an endpoint in an in-progress conference is called the “room_terminate_time_delta.”
  • the res_teardown_time_delta and room_terminate_time_delta may have different values depending on the constraints of the network, but are assumed to be zero or greater.
  • binding means the one or more binding that satisfies the customer's demand.
  • a customer site 110-i typically includes one or more units of equipment. Each unit of equipment at a customer site is called an endpoint. Further, there may be various kinds of endpoints, e.g. endpoints of a first kind, endpoints of a second kind, etc. To exemplify this concept, the ensuing description will consider five kinds of endpoints, called respectively, a codec (for coder/decoder) endpoint, an audio bridge endpoint, a video control console (VCC) endpoint, an alternate access endpoint, and an offnet (for off network) endpoint.
  • VCC video control console
  • offnet for off network
  • An audio bridge like audio bridge 220 in FIG. 2 is a unit of equipment on a customer's site, one form of which could be an arrangement, which mixes audio signals from a plurality of sources into a single signal that is to be extended to one or more other audio bridges.
  • a VCC like VCC 240 in FIG. 2 is an example of yet another specific unit of equipment, or endpoint, located on a customer's site, one form of which could include capabilities that permit a customer site to originate a video conference, to communicate with a plurality of other customer sites, e.g.
  • an alternate access like alternate access 260 in FIG. 2 is the term to describe any unit of equipment, other than a codec, audio bridge or VCC, which functions as an endpoint and is located on a customer's site.
  • an offnet like offnet 280 in FIG. 2 although not necessarily a unit of equipment, can be thought of as a quasi-unit of equipment, and, as will be made more clear, is considered as a unit of equipment for our purposes. Indeed, an offnet could be a service rather than a product.
  • an offnet could be a member of the Accunet (R) family of digital services, which is a commercially available service. More generally, an offnet, which is a short-hand form of the words off network, refers to a signal processing arrangement, a signal transport arrangement, or any other arrangement, which may or may not be on the customer's site but which extends a signal to the instant network for purposes such as interconnecting the offnet provided signal to one or more endpoints within the instant network.
  • a distinction between an offnet and an alternate access is that an alternate access would be a unit of equipment (other than a codec, audio bridge or VCC) on a customer's site while an offnet would be any arrangement other than a unit of equipment on the customer's site.
  • each endpoint will require some minimum bandwidth to communicate with another endpoint and that each endpoint is adapted to extend a signal through a network to one or more "like" endpoints and that the network has no need to "understand", e.g. no need to decode, the information content of the extended signal.
  • three of those kinds of endpoints i.e. codecs, audio bridges and VCCs, are examples of "unlike" endpoints since, for example, a codec would typically not understand the information content of a signal extended from an audio bridge.
  • Like endpoints are endpoints, which would understand signals transmitted therebetween.
  • two endpoints having the same kind of equipment like two codecs, or two audio bridges, or two VCCs would be examples of like endpoints.
  • a customer could demand that a signal be extended from a codec at one customer site to an alternate access or to an offnet at another customer site.
  • the codec and the alternate access or the codec and the offnet could be like endpoints. This example assumes that some arrangement would he included in the alternate access or the offnet, which arrangement could understand the information content of the extended signal.
  • endpoints are endpoints, which would typically not understand signals transmitted therebetween.
  • a codec at one customer site would be an unlike endpoint with respect to an audio bridge or a VCC at another customer site.
  • sample customer site 110-i is coupled over access line 120-i to DACS 130-k.
  • Customer site 110-i can include a plurality of endpoints, each endpoint coupled over a respective communications path through a multiplexer or concentrator 295 thence coupled over access line 120-i to DACS 130-k.
  • the endpoints include codec 200, audio bridge 220, video control console (VCC) 240, alternate access 260, and offnet 280 coupled through multiplexer or concentrator device 295 respectively by way of communications paths 210, 230, 250, 270 and 290 onto access line 120-i.
  • FIG. 1 sample customer site 110-i is coupled over access line 120-i to DACS 130-k.
  • Customer site 110-i can include a plurality of endpoints, each endpoint coupled over a respective communications path through a multiplexer or concentrator 295 thence coupled over access line 120-i to DACS 130-k.
  • the endpoints include codec 200, audio bridge 220, video control console (VCC)
  • a customer site may include other combinations of the shown endpoints, may include other kinds of equipment as endpoints, may include some but not all of the shown kinds of endpoints, et cetera.
  • a customer may request or demand that a connection be established, i.e. that there be "connectivity", between two customer sites, which is herein referred to as a two point reservation.
  • a twopoint reservation may reflect a customer's demand for connectivity in order to allow a single signal to be communicated between the two customer sites.
  • a customer may request or demand connectivity between more than two customer sites, which is herein referred to as a multipoint reservation.
  • a multipoint reservation may reflect a customer's demand for connectivity in order to allow a single signal to be shared among a plurality of like endpoints such as (a) connectivity to bridge a plurality of the audio bridges like audio bridge 220 located at different ones of customer sites 110-i so as to allow a first signal to be commonly shared, or broadcast, or conferenced among the connected audio bridges and/or (b) connectivity to connect a plurality of video control consoles like VCC 240 located at different ones of customer sites 110-i so as to allow a second signal to be commonly shared, or broadcast, or conferenced among the connected VCCs and/or (c) connectivity to connect a plurality of codec, alternate access, and offnet endpoints like codec 200, alternate access 260 and offnet 280 located at different ones of customer sites 110-i so as to allow a third signal to be commonly shared, or broadcast, or conferenced among the connected endpoints.
  • a plurality of like endpoints such as (a) connectivity to bridge a plurality of the audio bridges
  • a multipoint reservation may specify the desired connectivity among two or more endpoints or contemplate a predetermined default set of connectivities.
  • the customer may demand either (a) that certain codecs be connected AND that certain audio bridges be connected AND that certain VCCs be connected or (b) that certain codecs AND that certain alternate accesses AND that certain offnets be connected AND that a predetermined set of audio bridges and VCCs be connected, which predetermined set is a function of the specific codecs, alternate accesses and offnets that were demanded to be connected by the customer.
  • One example of alternative (b) above is an embodiment having a codec 200 at a customer site 110-i involved in a conference in which case the predetermined set could include at least one audio bridge 220 AND at least one VCC 240 at the customer site 110-i and further result in the audio bridge 220 and the VCC 240 remaining connected to the conference for so long as the codec 200 remains connected to the conference.
  • connectivity would remain among codec 200 and the endpoints (e.g. audio bridge 220 and VCC 240) in the predetermined set even though a connection among other codecs or other alternate accesses or other offnets at customer site 110-i has been disconnected.
  • the connectivity among codec 200 and the endpoints in the predetermined set would remain for so long as a conference remains for codec 200 at the customer site 110-i.
  • the endpoints in a first predetermined set for first codec 200 could also be endpoints in a second predetermined set for a second codec or other endpoint at customer site 110-i, in which case, even if the first codec 200 is disconnected from the conference, the common endpoints in the first and the second predetermined sets could remain connected by virtue of the second codec remaining or being (e.g. being added to the conference) in the conference.
  • my methodology stratifies (500) customer demand (400) by like endpoints into a plurality of sets of customer demands and then allocates (600, 700, 800) the resources of the network for each set of customer demands with like endpoints and makes the allocation information available (900) to the network for use thereby and also feedbacks back (510) the allocation results to the customer.
  • the allocation information is stored and control by way of memory and controller 900 for making the information available to both the network and the customer.
  • the controller 910 provides the data requested by allocators 600, 700, and 800 to them and if all allocators are successful in allocating the reservation, the controller removes all tuples in memory associated with this reservation and places the new set of tuples associated with this reservation into the appropriate memories.
  • the controller 910 If the allocators were successful in allocating the reservation, the controller 910 notifies 510 the customer demand 400 and the network of the success of the methodology and the new tuples. If the allocators were not successful in allocating the reservation, the controller 910 notifies 510 the customer demand 400.
  • endpoints of a first grouping e.g. codecs 200, alternate accesses 260, and offnets 280
  • endpoints of a second grouping e.g. audio bridges 220
  • endpoints of a third grouping e.g. VCCs 240
  • endpoints of a third strategy 800 are allocated according to a third strategy 800; etc.
  • Each grouping of endpoints includes only like endpoints and no one grouping includes both like endpoints and unlike endpoints.
  • each strategy Common among each strategy are the processes of generating (610 in FIG. 6, 710 in FIG. 7, and 810 in FIG. 8), setup_times X3 and terminate_times X4 for the endpoints reserving (620 in FIG. 6, 720 in FIG. 7, and 820 in FIG. 8), the endpoints and generating (630 in FIG. 6, 730 in FIG. 7, and 830 in FIG. 8). bindings (X1, X2, X3 and X4)
  • an example of a process of allocating bandwidth to a conference on an access line or on an internodal link is provided through the example shown in FIG. 3.
  • the example is chosen so as to also focus on a process of generating bindings.
  • a plurality of customer demands gives rise to a corresponding plurality of bindings, which are labelled in summary form in FIG. 3 as 310-1, 310-2 and 310-3.
  • the customer demands may be allocated to two communication paths 320-1 and 320-2 of an access line 120-i or an internodal link 140-k.
  • the paths are part of internodal link 140-k.
  • Customer demand 310-1 gives rise to a four-tuple binding on communications path 320-1 of internodal link 140-k.
  • the four-tuple includes a first specific position X1 within the bandwidth of communications path 320-1 of C1; a second specific position X2 within the bandwidth of communications path 320-1 of C6; a setup_time X3 of t1; and a terminate_time X4 of t5.
  • Customer demand 310-2 gives rise to a four-tuple binding on communications path 320-1 of internodal link 140-k.
  • the four-tuple includes a first specific position X1 within the bandwidth of communications path 320-1 of C7; a second specific position X2 within the bandwidth of communications path 320-1 of C12 where for this example p equals 12; a setup_time X3 of t2; and a terminate_time X4 of t4.
  • Customer demand 310-3 gives rise to a four-tuple on communications path 320-2 of internodal link 140-k.
  • the four-tuple includes a first specific position X1 within the bandwidth of communications path 320-2 of C1; a second specific position X2 within the bandwidth of communications path 320-2 of C5; setup_time X3 of t2; and a terminate_time X4 of t4.
  • the bindings are stored in a binding memory 930 shown in FIG. 9.
  • Unavailability memory 970 contains sets of two-tuples (X3, X4) where X3 and X4 have the same time definitions as for a binding.
  • the two-tuples are stored in unavailability memory 970 and serve a function of indicating that no communication path was located as being available from the time-date beginning at setup_time X3 to and including terminate_time X4.
  • New demand 330-1 can be satisfied by a binding 310-4.
  • new demand 330-1 can be satisfied as demand 310-4, which is served on communications path 320-2, which gives rise to a four-tuple binding on communications path 320-2 of internodal link 140-k.
  • the four-tuple includes a first specific position X1 within the bandwidth of communications path 320-2 of C6; a second specific position X2 within the bandwidth of communications path 320-2 of C11; setup_time X3 of t3; and a terminate_time X4 of t6.
  • each respective grouping of like endpoints has its respective strategy for allocating the network resources for conferencing purposes.
  • my methodology includes an arrangement 600 for allocating network resources for conferencing a first grouping of like endpoints such as codecs, alternate accesses, and offnets.
  • Codecs, alternate accesses, and offnets can be connected in a conference by extending a conference signal from a unit of equipment (like 220, 260 or 280) through a multiplexer or concentrator 295 over an access line 120-i to a homing DACS 130-k.
  • the endpoints are connected to their respective homing DACS and, further, the respective homing DACSs are connectable among themselves.
  • each unit of equipment which has its conference signal extended over its access line to its homing DACS and whose homing DACS is so connected, is able to participate in the conference.
  • the signal to be conferenced will be referred to as the "conference signal”.
  • the methodology also includes the process of extending the conference signal from each endpoint in customer site 110-i, which endpoint is an endpoint for the conference being demanded by the customer, through multiplexer or concentrator 295 to an access line 120-i. That access line 120-i is called a conference signal access line and the connectivity, which is being established, is called the "conference signal access line connectivity”.
  • DACS 130-k to which the conference signal is transmitted over the conference signal access line 120-i is called the "homing DACS" for each specific endpoint in customer site 110-i, which is a participant in the conference.
  • my methodology includes a process of generating 610 setup_times X3 and terminate_times X4 in response to the customer demanded start_time and stop_time for each endpoint in the first grouping of like endpoints.
  • the process of generating the setup_times and terminate_times for the endpoints is a two step process.
  • the setup_time, X3 is generated on an endpoint by endpoint basis.
  • the res_setup_time_delta may be larger than the room_setup_time_delta to allow for additional time for such actions as the time necessary for the network to verify the connectivity is correct and correctly setup for this reservation.
  • the terminate_time, X4 is generated on an endpoint by endpoint basis.
  • the res_terminate_time_delta may be larger than the room_terminate_time_delta to allow for additional time for such actions, for example, as the time necessary to verify the network has disconnected the conference and preventative maintenance has occurred.
  • the endpoints are then reserved 620 for the conference and the bindings may be concurrently generated 630 in a manner similar to that described for the example in FIG. 3.
  • the process of reserving endpoints uses the endpoint availability memory 980.
  • the endpoint availability memory 980 stores a two-tuple (X3, X4) where X3 and X4 have the same definitions as in bindings, for an endpoint which indicates that the endpoint is not available for the time period beginning at X3 and terminating at X4.
  • my methodology Given a setup_time and terminate_time of the endpoint which would satisfy the customers demand, my methodology searches the endpoint availability memory for any two-tuple (X3-i,X4-i) where the following conditions (a) X3-i is less than X4 (b) X3 is less than X4-i are true. If any two-tuple is found that matches the above conditions, the endpoint is considered unavailable (e.g., because it is involved in another conference) and the customer demand can not be satisfied. If no two-tuple is found, my methodology generates, but does not store, a two-tuple (X3,X4) for the endpoint into the endpoint availability memory 980.
  • the bindings are generated 630 in a manner similar to that described for the example in FIG. 3.
  • the binding arrangement assumes an ordered bus configuration that allows one to find a signal to be conferenced from among the customer's demands.
  • My methodology then iterates the above to find the connectivity required to connect all of the endpoints in the first grouping of like endpoints, which are at each of the other customer sites 110-j, which are to be participants in the conference, to their respective homing DACS 130-m so as to meet the customer's demand.
  • My methodology thereafter generates the identity of all of the homing DACSs and, responsive to a predefined set of buses, generates a set of buses, which interconnect all of the homing DACSs. Responsive to the set of generated homing DACS buses, my methodology generates a set of bindings to interconnect the homing DACSs during the time interval (a) that each respective homing DACS has at least one endpoint participating in the conference or (b) that each respective homing DACS, independent of having an endpoint participating in the conference for the entirety of the conference (i.e., note that a DACS can be a homing DACS until all endpoints at all customer sites for which it is the homing DACS are disconnected from the conference.
  • conference signal internodal connectivity Based on the location of the endpoints needing connectivity in a reservation, conference signal internodal connectivity may or may not be required.
  • My methodology then operates in response to whether the reservation type 640 is a two point reservation or a multipoint reservation. For a two point reservation, it is necessary to generate cross connects (650) in response to which the conference signal access line connectivity of one endpoint may be cross connected to both the conference signal internodal connectivity (if any) and the conference signal access line connectivity of the other endpoint.
  • my methodology searches the set of generated bindings and matches those bindings that have communications paths that are coupled to the same unit of equipment.
  • a communications path on access line 120-1 and a communications path on internodal link 140-2 terminate on the same unit of equipment and are involved in the conference for the same period of time.
  • my methodology For those bindings that have communications paths that terminate on the same unit of equipment, my methodology generates a six-tuple (X1-1, X2-1, X1-2, X2-2, X3, X4) where (X1-1) and (X2-1) are respectively the X1 and X2 of one binding, X1-2 and X2-2 are respectively, the X1 and X2 of another binding, X3 and X4 are the X3 and X4 of one of the two bindings (since they have the same X3 and X4), which will be stores in cross connect memory 940.
  • each binding on an access line will be involved in generating one DACS cross connect and a binding on an internodal link will be involved in generating two DACS cross connects, one for each DACS that it is connected to it. It should also be noted that if the set of generated bindings does not use an internodal link, that the bindings on the two communications paths on the access lines will be cross connected.
  • my methodology includes an arrangement 700 for allocating network resources for conferencing a second grouping of like endpoints such as for conferencing audio bridges.
  • Audio bridges can be connected in a conference by extending the conference signal from an audio bridge 220 to a central bridging DACS.
  • the conference signals from all the audio bridges and like endpoints participating in the conference can be connected through a DMB located at the central bridging DACS.
  • the DMB provides a mixing function of all audio signals connected to a DMB sequence number so that each audio signal extended to the DMB sequence number is able to receive the mixed audio signal from all the other extended audio signals that are connected to the DMB sequence number and, hence to the conference.
  • channel-group refers to the concept represented by a two tuple of the form (X1, X2) where X1 and X2 have the same bandwidth definitions as for a binding. Therefore, a channel_group represents a subset of the bandwidth of a communications path.
  • a "circuit" is then a set of channel_groups that define one connectivity arrangement between two units of equipment where the units of equipment could be endpoints or other than endpoints, for example, the units of equipment could be DACS switches or, for that matter, any units of equipment and where the units of equipment could have other units of equipment interposed therebetween.
  • schedulable circuit refers to a circuit, which has the characteristic that it (i.e., the circuit) is available to be reserved for use to meet a specific customer demand for a specific conference.
  • a schedulable circuit could be marked with a flag to indicate that it is reserved for a specific conference and it is unavailable for a different conference during the time interval of the specific conference and, of some significance, it is included in a set of bindings, which would meet the customer's demand.
  • a schedulable circuit When a schedulable circuit is included in a set of bindings, the schedulable circuit is said to be "reserved" for the time interval defined in the bindings, i.e., from setup_time X3 to terminate_time X4, using the set of channel-groups (X1,X2) defined in the circuit.
  • a schedulable circuit is an audio private line circuit between an audio bridge 220 at a customer site 110-i and a central bridging DACS.
  • central bridging DACS refers to any of the DACS 130-k in the network, which DACS includes a standard digital multipoint bridge (DMB) for merging or mixing a plurality of audio signals whereby each audio bridge 220 at each customer site 110-i, which is participating in the conference, has coupled to it the plurality of audio signals. It should also be noted that there may be more than one central bridging DACS in the network.
  • DMB digital multipoint bridge
  • the audio bridge signal which is also the conference signal, from each audio bridge like endpoint can be extended to the central bridging DACS via one of two mechanisms.
  • the first mechanism allows allocator methodology 700 to generate 730 a set of bindings over the access line and internodal links to provide a connection to the central bridging DACS.
  • the second mechanism uses a "schedulable" audio private line.
  • My allocator methodology provides the flexibility to allow the customer demand to be satisfied using either mechanism.
  • my methodology includes a binding arrangement for generating bindings, which assumes an ordered bus configuration that allows one to find a signal to be conferenced from among the customer's demands.
  • the methodology includes the process of extending the conference signal from each endpoint at customer site 110-i, which endpoint is an endpoint like an audio bridge endpoint for the conference being demanded by the customer, through multiplexer or concentrator 295 over an access line 120-i to its homing DACS.
  • my methodology includes a binding arrangement for reserving the audio bridge's audio private line circuit.
  • the methodology includes the process of extending the conference signal from each endpoint at customer site 110-i which endpoint is an audio bridge like endpoint for the conference being demanded by the customer to the central bridging DACS. This process reserves the audio private line circuit, which is retrieved from the audio private line circuit memory 950 and which provides connectivity from the endpoint at customer site 110-i to the central bridging DACS for the period of time the endpoint is involved in the conference.
  • My methodology iterates the above for each endpoint, which endpoint is an audio bridge like endpoint for the conference being demanded by the customer, based on the mechanism each endpoint utilizes to connect to the central bridging DACS, to find the connectivity required to connect all of the audio bridge like endpoints in each of the other customer sites 110-j, which are to be participants in the conference, to their respective central bridging DACS so as to meet the customer's demand.
  • This process includes scheduling the schedulable circuits, scheduling or reserving 760 a DMB sequence number, and generating 750 the required DACS cross connects.
  • the circuit may or may not be a communications path on the access line or through the bus configuration.
  • My methodology also reserves a DMB sequence number 760 for the conference.
  • the DMB sequence number to be used is determined by cycling through all possible DMB sequence numbers available on each DMB.
  • My methodology generates a four-tuple (X3, X4, X5, X6), where X3 and X4 are the same as defined for a binding, where X5 is the identity of the specific DMB, which contains the DMB sequence number to be used, and where and X6 is the DMB sequence number to be used for reserving the DMB sequence number used by the audio bridges in a reservation.
  • a DMB sequence number X5 can be used to serve one reservation but cannot be used to serve two reservations at the same time.
  • the methodology attempts to find the DMB sequence number using two sets of times. If the first set of times to be used is not able to reserve a DMB sequence number, the second set of times is used.
  • the first set of times places an incremental time called buffer_time around the demanded setup time X3 and terminate_time X4 to allow possible customer demands such as a demand for an extension of the reservation once it is up.
  • the second set of times uses the setup_time X3 and terminate_time X4 without the buffer_time included.
  • the first set of times used are the setup_time and terminate_time with a buffer of res_buffer_time subtracted or added to each time.
  • the second set of times used are the actual setup_time and terminate_time.
  • the methodology determines a DMB sequence number for a reservation. Determining the DMB sequence number to be reserved can be done using any of several alternatives. For example and not by way of limitation, the methodology could use the first DMB sequence number which has not previously been used OR the methodology could use the DMB sequence number which has the greatest time interval between other conferences that will be served by the DMB sequence number OR the methodology could cycle through the set of DMB sequence numbers for each reservation ignoring any DMB sequence numbers which are serving other conferences during the time of the reservation OR the methodology could cycle through the set of DMB sequence numbers on a daily basis for each reservation in that day ignoring any DMB sequence numbers which are serving other conferences during the time of the reservation.
  • a DMB sequence number can be reserved.
  • the methodology of reserving a DMB sequence number will use the last DMB sequence number memory 990 in which is stored three-tuple (X8, X9, X10) where X8 is the DMB that contains DMB sequence number X9 is the last DMB sequence number cycled through for the day specified by X10, and X10 is the date imbedded in the setup_time X3 of the reservations which will use this three-tuple.
  • the methodology retrieves the set of three-tuples from the last DMB sequence number memory where the X10 is the day of the setup_time of the reservation. Chosing the first tuple, the methodology increments the X9 by one. The process of incrementing X9 by one may cause the value of X9 to be reset to the first DMB sequence number available in DMB X8 if X9 is greater than the number of DMB sequence numbers maintained by the DMB X8.
  • the methodology If no tuples are retrieved from memory, the methodology generates a four-tuple (X3, X4, X8, X9) and replaces the tuple retrieved from the last_DMB_sequence_number memory 990 with the three-tuple (X8, X9, X10) where the value of X9 contains the newly incremented value of X9.
  • the DMB that this DMB sequence number is associated with may have a maximum number of audio bridges that may be connected to the DMB. If this is the case, the methodology would also need to search the endpoint memory to determine all the audio bridges which are using the DMB at each given moment of time and whether or not this maximum number of audio bridges limit has been reached.
  • the methodology would not generate a tuple and would continue. Further, if the maximum number of audio bridges being served by the network are are less than this limit, the methodology does not need to perform this additional check. The methodology continues to iterate the above until either a tuple is generated or the value of X9 is equal to the old value of X9 which was retrieved from the last DMB sequence number memory 990. If a tuple was generated the methodology is finished reserving a DMB sequence number for the reservation. If the tuple was not generated, the methodology continues.
  • the methodology must search the DMB sequence number for tuples even if the value of X9 has not be cycled (reset to the first DMB sequence number available on the DMB) because the DMB sequence number may be serving another conference that has a setup_time earlier than the day of the setup_time of the reservation currently being reserved.
  • the methodology iterates the above by selecting the next three-tuple (X8, X9, X10) from the set of tuples retrieved from last DMB sequence number memory. If no tuple was generated, the methodology repeats the above process with the change that the buffer_time is set to zero for purposes of the search.
  • my methodology includes an arrangement for conferencing like endpoints such as a third grouping of like endpoints including VCCs.
  • VCCs can be conferenced by a first mechanism of extending a conference signal to the network by direct distance dialing (DDD) or by a second mechanism of extending the conference signal through the multiplexer or concentrator over the access line to the homing DACS.
  • DDD direct distance dialing
  • My binding methodology provides the flexibility to allow the customer demand to be satisfied using either mechanism.
  • my methodology includes an arrangement which assumes a public switched network (PSN) to find a signal to be conferenced from among the customer's demands.
  • PSN public switched network
  • the connectivity for a VCC 240 in a customer site 110-i with another VCC requires that each VCC be available during the time that it is needed for the conferencing.
  • the direct distance dialing will use a public switched network which is assumed to always allow the VCCs to connect to the network unless the direct distance dialing is not available, for example, due to a failure of its network.
  • my methodology includes a binding arrangement 830 for conferencing the VCCs.
  • the binding methodology includes the process of extending the conference signal from each endpoint in customer site 110-i, which endpoint is an endpoint for the conference being demanded by the customer, through multiplexer or concentrator 295 to an access line 120-i.
  • the connectivity from the endpoint over the access line to the homing DACS satisfies the customer's demand.
  • the methodology could be constrained to place the VCC signal on a specific bandwidth position within the communications path.
  • My binding methodology iterates the above for each endpoint, which endpoint is a VCC like endpoint for the conference being demanded by the customer, based on the mechanism each endpoint utilizes to connect to the network, to find the connectivity required to connect all of the VCC like endpoints in each of the other customer sites 110-j, which are to be participants in the conference to the network so as to meet the customer's demands.
  • bindings for a future conference call may result in a new set of bindings in which all the elements Xi may change. This is true because all the old bindings have a setup_time X3 greater than (i.e. in a temporal sense later than) the current_time.
  • bindings for an in-progress conference call are generated using bindings, which are retrieved from the bindings memory. This is because all active bindings of an in-progress conference must maintain the same X1 and X2 and X3 elements during the conference, i.e. only the terminate_time X4 may change.
  • setup_time X3 is less than (i.e. in a temporal sense earlier than) the current_time whereas terminate_time X4 of both the active bindings and the new bindings is greater than the current_time.
  • some changes to an in-progress conference may result in a new set of bindings in which all elements Xi may change. This is true for those old bindings having a setup_time X3 greater than the current_time. Also, this is because the new set of bindings will have a setup_time X3, which is greater than the current_time, meaning that the changes to an existing conference will occur in the future.
  • the binding methodology does not allow the new demand to be accepted. This is because the new demand attempts to alter a binding which no longer serves the conference. Since the binding no longer serves the conference, the binding can not be used to generate a set of new bindings, which will occur in the future for this conference.
  • the previously stored set of bindings can be deleted from the bindings memory and the new set of bindings is substituted therefor in the bindings memory.
  • the conference signal which is in need of a binding, may be of a type, which can be classified as a "service_type."
  • a service_type is a classification for use by the network resources when satisfying customer demands.
  • the network resources may be dedicated resources for that type of service, shared resources for that type of service and one or more other types of services, or may be of a special quality to meet the needs of the demands of that service_type.
  • the methodology for finding a binding allows for a set of predetermined parameters to be used as a function of the type of link being used (access line or internodal link), as a function of the type of like endpoints being demanded by the customer, and as a function of the network constraints.
  • the parameters can be represented as elements of a six-tuple of the form (starting_channel, stopping_channel, direction, service_type, buffer_time, minimum_bandwidth) where the starting_channel is the lowest channel within the bandwidth of the communications path that may be used in a binding, stopping_channel is the highest channel within the bandwidth of the communications path that may be used in a binding, direction is the manner the methodology should look within the starting_channel and stopping_channel to find available bandwidth, service_type indicates that only those communications paths that support the specified service_type should be considered, buffer_time is the minimum time before X3 and after X4 to use when searching for an available binding, and minimum_bandwidth is the minimum bandwidth demanded by the customer.
  • the procedure could perform the following actions to generate a binding.
  • the procedure searches each communications path on internodal link 140-k in the communications path memory 920 which allows a service to be placed on it of the type "a codec like endpoint signal.”
  • the set of communications paths retrieved from the communications path memory may be ordered by the binding methodology to increase the time that a communications path is unused between the setup-time and terminate_time of bindings and can therefore increase the likelihood of satisfying future changes to previously satisfied customer demands.
  • the ordering of communication paths might be such that the first communications path has the greatest time interval between when the new reservation demand is requested and when the next and previous demands on the communications path occur, the second communications path has the second greatest time interval, etc. for all the communication paths retrieved from the communications path memory.
  • My methodology iterates through each communications path in the above ordered list until a binding is generated.
  • the order generated by the binding methodology of iterating through the communications paths is first path 320-1 and second path 320-2.
  • the procedure For each communication path in the ordered list, the procedure searches for an available minimum bandwidth between the starting_channel and the stopping_channel. The procedure searches this range of starting_channel and stopping_channel in the manner indicated by the direction element of the six-tuple. If the direction is upward, the procedure searches the range by starting at the starting_channel and stopping at the stopping_channel to find the minimum bandwidth requested. If the direction is downward, the procedure searches the range by starting at the stopping_channel and stopping at the starting_channel to find the minimum bandwidth requested. In the example and based on the direction element in the six-tuple, the procedure will search each communications path in the ordered list starting at channel C0 and stopping at channel Cp.
  • the procedure For each channel within the range to be searched, the procedure defines a channel_range (X1, X2), where X2 - X1 corresponds to the minimum_bandwidth element of the six-tuple such that X2 is not greater than the stopping_channel element in the six-tuple.
  • the procedure searches the binding memory 930 for collisions of the defined channel_range with other customer demands.
  • a "collision” is defined to occur when an existing binding in binding memory defined by the four-tuple (X1-1, X2-1, X3-1, X4-1) and a channel-group (X1, X2) and the desired setup_time X3 and desired terminate_time X4 of that channel-group have the following conditions (a) X1 is less than X2-1, (b) X1-1 is less than X2, (c) X3 - buffer_time is less than X4-1, and (d) X3-1 is less than X4 + buffer_time are all true.
  • the procedure continues to iterate through the range of channels in the direction indicated by the direction elment in the six-tuple. If all the channels within the specified range for a communications path have been searched, the procedure iterates through the remaining communications paths in the ordered list.
  • demand 310-1 causes a collision for channel_ranges searched (1,6), (2,7), (3,8), (4,9), (5,10), and (6,11).
  • Demand 310-2 causes a collision for channel_ranges searched (2,7), (3,8), (4,9), (5,10), (6,11), and (7,12).
  • the procedure has exhausted all possible channel_ranges on communications path 320-1 and begins to attempt to generate a binding of communications path 320-2.
  • demand 320-3 causes a collision for channel_ranges searched (1,6), (2,7), (3,8), (4,9), and (5,10).
  • the first channel_range to not cause a collision is channel_range (6,11).
  • My binding methodology iterates the above actions first with a buffer_time equal to the buffer_time element specified in the six-tuple and if unable to generate a binding, performs the same iterations again, but with the buffer_time set equal to zero, which attempts to check for collisions with the exact times desired in the binding.
  • a first signal which is being transmitted on a communication path for a specified time, uses a set of contiguous channels.
  • Other signals may use other channels on that communication path at the same time provided they do not overlap channels of the first signal.
  • the communication path must also be available during the time requested.
  • the binding methodology searches a unavailability memory 970 (which can be suitably generated and stored in software), to determine if the communication path is not available during the desired time beginning at time-date X3 and terminating at time-date X4.
  • Binding signals on the access line communication paths can be limited by the binding methodology to a particular range of channels to be searched and a direction of the search which is different from the limitations on the range of channels to be searched and the direction of the search for internodal link, or for that manner, access lines which connect a DACS 140-k to a set of offnet endpoints, to find the necessary bindings.
  • the communication paths on an access line 120-i may be limited by the binding methodology to searching channels from Cm to Cp-n in the downward direction, where Cm is some predetermined channel on that access line and n is some predetermined integer value equal to or greater than zero.
  • the communication paths on an internodal link 140-j may be limited by the binding methodology to searching channel from C0 to Cp in the upward direction.
  • the X1, X2, X3 and X4 elements of the five-tuple are the same elements as the binding for this conference signal on the access line, which is called the conference signal access line connectivity.
  • My binding methodology generates the five-tuple after the access line binding has been generated and the resulting five-tuple is stored in the cross connect memory 940.
  • the procedure which uses my methodology, to extend the signal of an endpoint to the homing DACS.
  • the procedure finds a binding for the endpoint on the access line using the predetermined parameters for that access line.
  • the procedure then generates the cross connect for the multiplexer or concentrator 295 at customer site 110-i.
  • a circuit may be reserved, similar to the manner a schedulable circuit may be reserved using network resources.
  • the distinction between a reserved circuit and a reserved schedulable circuit is that a reserved schedulable circuit reserves the circuit for a specific conference, whereas the reserved circuit does not.
  • the reserved circuit is typically used for reserving additional circuits in the network not associated with a reservation, however, may satisfy some other customer demand not associated with any customer demand.
  • An example of a reserved circuit that utilizes the network resources on the instant network is called a static circuit signal. When static circuit signals are allocated, these will be allocated starting at channel C0 and move up to Cm-1 in the upward direction, where Cm is the same predetermined channel on an access line as described above.
  • the value Cm can be predetermined for each access line, or communications path on the access line, and can be suitable stored in the communications path memory 920.
  • the methodology uses the bindings currently in the binding memory for the customer demand (if they exist) and determines the necessary changes to those bindings to generate new bindings. If a required binding did not change from the one in binding memory, where the two endpoints of the communications path is the same, the desired minimum bandwidth is the same, and the setup_time and terminate_time are the same, the binding methodology uses the existing binding in binding memory. If an old binding is no longer required, it is not maintained in the new set of bindings for the customer demand. If the required binding does not exist, the methodology finds a set of bindings to satisfy the customer demand and adds the new set of bindings into the set of bindings required to satisfy the reservation.
  • the methodology handles these requests differently. If the change occurs for an in-progress binding (i.e., when setup_time X3 is less than current_time), the same channel_groups are used with the new times X3 and X4 as specified in the new customer demand. If the change occurs for a future binding (i.e., when setup_time X3 is greater than current_time), the old binding may be removed from the existing set of bindings to satisfy the reservation and a new binding can be determined. If, however, the old binding is not changed, the old binding would be added to the set of bindings which satisfy the reservation.
  • an in-progress binding i.e., when setup_time X3 is less than current_time
  • the old binding may be removed from the existing set of bindings to satisfy the reservation and a new binding can be determined. If, however, the old binding is not changed, the old binding would be added to the set of bindings which satisfy the reservation.
  • the binding methodology will use the old bindings except that the new demand's X4 will replace the old binding's X4 and the binding methodology will not check for collisions.
  • a reservation setup_time, start_time, and stop_time will be provided with the reservation specification. If a setup_time is provided, the generated setup_times and terminate_times for end points (610, 710, 810) will use this time instead of the generated reservation setup_time.
  • the methodology attempts to find network bindings and the DMB sequence number using two sets of times.
  • the first set of times places a buffer of time around the request to allow possible extensions of the reservation once it is up.
  • the second set of times uses the network actual times
  • the first set of times used are the setup_time and terminate_time with a buffer of res_buffer_time minutes subtracted/added to each time.
  • the second set of times used are the actual setup_time and terminate_time.
  • Endpoints are scheduled to ensure that they are available. This is done by checking that the endpoint has not been allocated for the time period that the endpoint is in the reservation. No time buffering occurs when scheduling the endpoints. Each endpoint in the reservation is also checked to see if it has been placed in unavailability memory 970. If the endpoint is a codec, the codec, the customer site 110-i where the codec is located, and the multiplexer or concentrator 295 at customer site 110-i are checked if they have been placed in unavailability memory 970.
  • a valid binding is determined by searching all the communication paths between the two desired locations. For each communication path, methodology determines what services is traveling on that communication path during the period necessary. The records found indicate channel ranges that are not usable for the desired time period. The available channel ranges are generated. The available channel ranges are then checked to satisfy the request. The channel ranges are checked based on the boundaries defined (lower and upper channel ranges) and the direction. A request is satisfied if the desired bandwidth falls within the boundary and the entire bandwidth is available.
  • a customer reservation may demand (i) a minimum bandwidth through the network of 12 contiguous channels of bandwidth; (ii) a conference start_time-date of 1:00 pm June 15, 1990; (iii) a conference terminate_time-date of 5:00 pm June 15, 1990; and (iv) a conference where the audio bridges and VCCs at the customer sites for the codecs, alternate access, or offnet endpoints exist.
  • a conference start_time-date of 1:00 pm June 15, 1990
  • a conference terminate_time-date of 5:00 pm June 15, 1990 a conference where the audio bridges and VCCs at the customer sites for the codecs, alternate access, or offnet endpoints exist.
  • FIG. 4 recites to a set of customer demands.
  • This set of customer demands can be stratified according to a first strategy of a set of like endpoints such as:
  • This set of customer demands can be stratified according to a second strategy of a set of like endpoints such as
  • While the example of customer demand shown in FIG. 4 does not show two codecs or like endpoints participating in the same conference at one customer site, my methodology allows such a customer demand. Further and by way of example, if codec 200 at customer site 110-2 is to participate in a conference with a setup_time-date of 1:00pm June 15, 1990 and terminate_time-date of 5:00pm June 15, 1990 and alternate access 260 at customer site 110-2 is to participate in the same conference with a setup_time-date of 5:00 pm June 15, 1990 and terminate_time-date of 10:00pm June 15, 1990 and audio bridge 220 at customer site 110-2 is a common unit of equipment in the predetermined set, the audio bridge 220 at customer site 110-2 will participate in the conference for the setup_time-date of 1:00 pm June 15, 1990 and terminate_time-date of 10:00pm June 15, 1990.
  • the setup_time-date X3 and terminate_time-date X4 are generated for audio bridge 220 at customer site 110-2 by using the earliest setup_time-date and the latest terminate_time-date of the set of codec like endpoints at customer site 110-2 involved in the conference such that at least one of the set of codec like endpoints is involved in the conference at any time from the earliest setup_time-date to the latest terminate time-date.
  • at least one of the set of codec, alternate access, and offnet at customer site 110-2 is involved in the conference from 1:00pm June 15, 1990 until 10:00pm June 10, 1990. It may be the case that an endpoint can be involved in a conference multiple times and that the endpoints of the predetermined set for that endpoint may also be involved in a conference multiple times.
  • VCC connectivity will be done using DDD as the manner of extending the VCC signal to the network.
EP19900313761 1990-07-02 1990-12-17 Arrangement for reserving and allocating a plurality of competing demands for an ordered bus communications network Withdrawn EP0464283A3 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US546954 1990-07-02
US07/546,954 US5136581A (en) 1990-07-02 1990-07-02 Arrangement for reserving and allocating a plurality of competing demands for an ordered bus communication network

Publications (2)

Publication Number Publication Date
EP0464283A2 true EP0464283A2 (fr) 1992-01-08
EP0464283A3 EP0464283A3 (en) 1993-02-24

Family

ID=24182700

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19900313761 Withdrawn EP0464283A3 (en) 1990-07-02 1990-12-17 Arrangement for reserving and allocating a plurality of competing demands for an ordered bus communications network

Country Status (5)

Country Link
US (1) US5136581A (fr)
EP (1) EP0464283A3 (fr)
JP (1) JPH04233849A (fr)
KR (1) KR920003168A (fr)
CA (1) CA2032617C (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0554615A2 (fr) * 1991-11-22 1993-08-11 International Business Machines Corporation Appareil de séquencement pour resources multimédia
WO1996034482A1 (fr) * 1995-04-26 1996-10-31 Telefonaktiebolaget Lm Ericsson (Publ) Infrastructure dynamique
US5936951A (en) * 1995-04-26 1999-08-10 Telefonaktiebolaget Lm Ericsoon Dynamic infrastructure
WO2000005864A1 (fr) * 1998-07-22 2000-02-03 Nokia Networks Oy Procede et dispositif de mesure du trafic dans un reseau de telecommunications
EP1021006A2 (fr) * 1999-01-15 2000-07-19 Alcatel Réseau de télécommunication

Families Citing this family (72)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5323445A (en) * 1991-03-07 1994-06-21 Mitsubishi Denki Kabushiki Kaisha Multi-location television conference system
KR930001080A (ko) * 1991-06-24 1993-01-16 정용문 직렬 입출력 접속 장치를 이용한 마스터 시스템과 다중 슬레이브 시스템간 데이타 통신 방법
US5282195A (en) * 1991-09-05 1994-01-25 Raynet Corporation DSO cross-connect for floating virtual tributaries
JP3457338B2 (ja) * 1992-03-30 2003-10-14 株式会社日立製作所 テレビ電話・テレビ会議装置
US5528677A (en) * 1992-05-01 1996-06-18 Sprint Communications Company L.P. System for providing communications services in a telecommunications network
US5821984A (en) * 1992-09-09 1998-10-13 Canon Kabushiki Kaisha Communication conference system with storage of conference information including proceedings data
US5430716A (en) * 1993-01-15 1995-07-04 At&T Corp. Path hunt for efficient broadcast and multicast connections in multi-stage switching fabrics
US20030185356A1 (en) 1993-03-12 2003-10-02 Telebuyer, Llc Commercial product telephonic routing system with mobile wireless and video vending capability
US5495284A (en) 1993-03-12 1996-02-27 Katz; Ronald A. Scheduling and processing system for telephone video communication
US6323894B1 (en) 1993-03-12 2001-11-27 Telebuyer, Llc Commercial product routing system with video vending capability
US5704042A (en) * 1993-03-19 1997-12-30 Ncr Corporation Accelerated replication of multiple computer displays
DE69330371T2 (de) * 1993-04-19 2002-05-02 Ibm System zur netzwerkweiten Bandbreitenzuordnung
US20050114906A1 (en) * 1993-05-03 2005-05-26 Ictv, Inc. System for interactive television
US6738357B1 (en) * 1993-06-09 2004-05-18 Btg International Inc. Method and apparatus for multiple media digital communication system
US5581703A (en) * 1993-06-29 1996-12-03 International Business Machines Corporation Method and apparatus for reserving system resources to assure quality of service
US5530472A (en) * 1993-06-29 1996-06-25 Sprint Communications Company L.P. Video conference system including a non-reserved video conference capability
EP0658025A1 (fr) * 1993-12-08 1995-06-14 International Business Machines Corporation Système à haute disponibilité d'allocation de bande passante synchrone sur FDDI
US5481537A (en) * 1994-03-31 1996-01-02 Crisler; Kenneth J. Transmission signalling technique for a reservation request
US5483587A (en) * 1994-06-08 1996-01-09 Linkusa Corporation System and method for call conferencing
EP0689321A1 (fr) * 1994-06-23 1995-12-27 International Business Machines Corporation Système d'allocation de bande passante pour l'intégralité d'un réseau à haute disponibilité
US5625407A (en) * 1994-07-08 1997-04-29 Lucent Technologies Inc. Seamless multimedia conferencing system using an enhanced multipoint control unit and enhanced endpoint devices
CA2150060C (fr) * 1994-07-08 2000-01-11 John T. Biggs Systeme de conference multimedia transparent utilisant des dispositifs terminaux ameliores
US5555017A (en) * 1994-07-08 1996-09-10 Lucent Technologies Inc. Seamless multimedia conferencing system using an enhanced multipoint control unit
US5594727A (en) * 1994-09-19 1997-01-14 Summa Four, Inc. Telephone switch providing dynamic allocation of time division multiplex resources
US5821986A (en) * 1994-11-03 1998-10-13 Picturetel Corporation Method and apparatus for visual communications in a scalable network environment
US5483588A (en) * 1994-12-23 1996-01-09 Latitute Communications Voice processing interface for a teleconference system
US7362775B1 (en) 1996-07-02 2008-04-22 Wistaria Trading, Inc. Exchange mechanisms for digital information packages with bandwidth securitization, multichannel digital watermarks, and key management
US5973724A (en) * 1995-02-24 1999-10-26 Apple Computer, Inc. Merging multiple teleconferences
US5854898A (en) 1995-02-24 1998-12-29 Apple Computer, Inc. System for automatically adding additional data stream to existing media connection between two end points upon exchange of notifying and confirmation messages therebetween
US5572582A (en) * 1995-02-24 1996-11-05 Apple Computer, Inc. Method and apparatus for establishing communication between two teleconferencing endpoints
US5559877A (en) * 1995-03-21 1996-09-24 At&T Automatic provisioning of trunking and routing parameters in a telecommunications network
AU5741596A (en) * 1995-05-12 1996-11-29 Protel, Inc. Automated audio teleconferencing having reconfiguration feat ures
US5828743A (en) * 1995-05-12 1998-10-27 Protel, Inc. Apparatus and method for automated audio teleconferencing having enhanced access and security features
US5719928A (en) * 1995-05-12 1998-02-17 Protel, Inc. Apparatus and method for automated audio teleconferencing having enhanced billing and reservation features
US5613004A (en) 1995-06-07 1997-03-18 The Dice Company Steganographic method and device
US5657142A (en) * 1995-07-25 1997-08-12 Mci Communications Corporation Optimal allocation of multiplexing equipment and distribution of load in a fiber optic network
US5619555A (en) * 1995-07-28 1997-04-08 Latitude Communications Graphical computer interface for an audio conferencing system
US5559875A (en) * 1995-07-31 1996-09-24 Latitude Communications Method and apparatus for recording and retrieval of audio conferences
KR100216348B1 (ko) * 1995-12-23 1999-08-16 윤종용 교환시스템에서 호처리 자원 관리 방법 및 장치
US7664263B2 (en) 1998-03-24 2010-02-16 Moskowitz Scott A Method for combining transfer functions with predetermined key creation
US6205249B1 (en) 1998-04-02 2001-03-20 Scott A. Moskowitz Multiple transform utilization and applications for secure digital watermarking
US5781624A (en) * 1996-02-16 1998-07-14 Lucent Technologies Inc. Method for sharing network resources by virtual partitioning
US5784561A (en) * 1996-07-01 1998-07-21 At&T Corp. On-demand video conference method and apparatus
US7177429B2 (en) 2000-12-07 2007-02-13 Blue Spike, Inc. System and methods for permitting open access to data objects and for securing data within the data objects
US7346472B1 (en) 2000-09-07 2008-03-18 Blue Spike, Inc. Method and device for monitoring and analyzing signals
US7159116B2 (en) 1999-12-07 2007-01-02 Blue Spike, Inc. Systems, methods and devices for trusted transactions
US7457962B2 (en) 1996-07-02 2008-11-25 Wistaria Trading, Inc Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data
US5889868A (en) 1996-07-02 1999-03-30 The Dice Company Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data
US7095874B2 (en) 1996-07-02 2006-08-22 Wistaria Trading, Inc. Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data
US5872841A (en) * 1996-11-14 1999-02-16 Siemens Information And Comunication Newtworks, Inc. Apparatus and method for scheduling a telephone call
US7730317B2 (en) * 1996-12-20 2010-06-01 Wistaria Trading, Inc. Linear predictive coding implementation of digital watermarks
US5978463A (en) * 1997-04-18 1999-11-02 Mci Worldcom, Inc. Reservation scheduling system for audio conferencing resources
US5951637A (en) * 1997-05-07 1999-09-14 Intel Corporation Bandwidth reservation system
US6272214B1 (en) 1997-11-24 2001-08-07 Telefonaktiebolaget Lm Ericsson (Publ) Automatic control of participation in telemeetings
US6148336A (en) * 1998-03-13 2000-11-14 Deterministic Networks, Inc. Ordering of multiple plugin applications using extensible layered service provider with network traffic filtering
US6141686A (en) * 1998-03-13 2000-10-31 Deterministic Networks, Inc. Client-side application-classifier gathering network-traffic statistics and application and user names using extensible-service provider plugin for policy-based network control
US6937597B1 (en) * 1999-02-26 2005-08-30 Lucent Technologies Inc. Signaling method for internet telephony
US7664264B2 (en) 1999-03-24 2010-02-16 Blue Spike, Inc. Utilizing data reduction in steganographic and cryptographic systems
US7475246B1 (en) 1999-08-04 2009-01-06 Blue Spike, Inc. Secure personal content server
US6798747B1 (en) * 1999-12-22 2004-09-28 Worldcom, Inc. System and method for time slot assignment in a fiber optic network simulation plan
US6654354B1 (en) * 1999-12-22 2003-11-25 Worldcom, Inc. System and method for planning multiple MUX levels in a fiber optic network simulation plan
US6300973B1 (en) * 2000-01-13 2001-10-09 Meir Feder Method and system for multimedia communication control
US7542068B2 (en) * 2000-01-13 2009-06-02 Polycom, Inc. Method and system for controlling multimedia video communication
US6810422B1 (en) 2000-01-14 2004-10-26 Lockheed Martin Tactical Defense Systems System and method for probabilistic quality of communication service determination
WO2002003673A1 (fr) 2000-07-05 2002-01-10 Telefonaktiebolaget Lm Ericsson (Publ) Telesysteme equipe d'un dispositif de couplage et procede connecte a celui-ci
US7127615B2 (en) 2000-09-20 2006-10-24 Blue Spike, Inc. Security based on subliminal and supraliminal channels for data objects
NZ527660A (en) * 2001-01-26 2005-03-24 Bridicum Security Group As System for providing services and virtual programming interface
MXPA04005817A (es) * 2001-12-15 2004-09-10 Thomson Licensing Sa Mecanismo de seleccion de anchura de banda de videoconferecia.
US7287275B2 (en) 2002-04-17 2007-10-23 Moskowitz Scott A Methods, systems and devices for packet watermarking and efficient provisioning of bandwidth
US8561076B1 (en) 2004-06-30 2013-10-15 Emc Corporation Prioritization and queuing of media requests
US20070276945A1 (en) * 2006-05-23 2007-11-29 Microsoft Corporation Fault-Tolerant Resource Committal
US20080259824A1 (en) 2007-04-23 2008-10-23 Frankel David P Identity-based conferencing systems and methods

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4710917A (en) * 1985-04-08 1987-12-01 Datapoint Corporation Video conferencing network
JPS6218155A (ja) * 1985-07-17 1987-01-27 Nec Corp 回線／パケツト統合交換方式
JPS63180246A (ja) * 1987-01-22 1988-07-25 Nippon Telegr & Teleph Corp <Ntt> 共通チヤネル型ユ−ザインタフエ−ス制御方式
US4937856A (en) * 1987-06-01 1990-06-26 Natarajan T Raj Digital voice conferencing bridge
US4796293A (en) * 1987-12-18 1989-01-03 Communications Network Enhancement Inc. Enhanced dedicated teleconferencing system
JPH02145052A (ja) * 1988-11-28 1990-06-04 Toshiba Corp マルチメディア交換システムにおける回線設定方式

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
IEEE COMMUNICATIONS MAGAZINE vol. 23, no. 3, March 1985, PISCATAWAY, NJ US pages 7 - 14 H. OHNISHI ET AL. 'Protocols for NTT High-Speed and Multiplexed Switched Service by the CS-2 Satellite' *
JAPAN TELECOMMUNICATION REVIEW vol. 29, no. 3, July 1987, TOKYO JP M.YOSHIKAWA 'NTT's Improved Video Conferencing System' *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0554615A2 (fr) * 1991-11-22 1993-08-11 International Business Machines Corporation Appareil de séquencement pour resources multimédia
EP0554615A3 (en) * 1991-11-22 1993-10-20 Ibm Scheduling apparatus for multimedia resources
US5644715A (en) * 1991-11-22 1997-07-01 International Business Machines Corporation System for scheduling multimedia sessions among a plurality of endpoint systems wherein endpoint systems negotiate connection requests with modification parameters
WO1996034482A1 (fr) * 1995-04-26 1996-10-31 Telefonaktiebolaget Lm Ericsson (Publ) Infrastructure dynamique
US5936951A (en) * 1995-04-26 1999-08-10 Telefonaktiebolaget Lm Ericsoon Dynamic infrastructure
WO2000005864A1 (fr) * 1998-07-22 2000-02-03 Nokia Networks Oy Procede et dispositif de mesure du trafic dans un reseau de telecommunications
US6674847B2 (en) 1998-07-22 2004-01-06 Nôkia Corporation Method and apparatus for performing a traffic measurement in a telecommunication network
EP1021006A2 (fr) * 1999-01-15 2000-07-19 Alcatel Réseau de télécommunication
EP1021006A3 (fr) * 1999-01-15 2005-09-21 Alcatel Réseau de télécommunication

Also Published As

Publication number Publication date
EP0464283A3 (en) 1993-02-24
KR920003168A (ko) 1992-02-29
JPH04233849A (ja) 1992-08-21
CA2032617A1 (fr) 1992-01-03
CA2032617C (fr) 1994-09-27
US5136581A (en) 1992-08-04

Similar Documents

Publication Publication Date Title
US5136581A (en) Arrangement for reserving and allocating a plurality of competing demands for an ordered bus communication network
US5838921A (en) Distributed connection management system with replication
US9143618B2 (en) Distributed audio conferencing architecture with optimum resource utilization and seamless scalability
US7328264B2 (en) System and method for fractional resource scheduling for video teleconferencing resources
CN100496117C (zh) 一种视频会议中资源调配的方法
US8149262B2 (en) Network management server for managing multiple operating modes of a conferencing network with different sets of policies
US8923313B2 (en) Efficient transmission of data to multiple network nodes
WO1997024846A1 (fr) Procede et structure de gestion des ressources d&#39;un reseau
US7457239B2 (en) Method and apparatus for providing a quality of service path through networks
CN109495593A (zh) 地址分配方法及系统
CN109391794A (zh) 视频会议多点控制方法、装置、存储介质和计算机设备
US4530092A (en) Distributed switching system having multiple time slot interchanger nodes
EP0889629A2 (fr) Systéme de connection de conférence du type multipoint
CN107438098B (zh) 一种动态内容分发方法及其系统
US5936951A (en) Dynamic infrastructure
CN103765859A (zh) 一种多路辅流控制的方法、控制设备、节点和系统
CN111045804B (zh) 一种任务分配方法、装置、介质及电子设备
JPH07111648A (ja) Ａｖ信号配信システム
CN1097372C (zh) 一种建立多信道连接的方法及其相关设备
KR100608639B1 (ko) 화상 회의 시스템의 다지점 회의 연결 장치
CN115361361B (zh) 视频会议迁会流控方法及其系统
KR100880346B1 (ko) 비동기식 전송 모드 망에서 단대다중점 예약 서비스를위한 망 관리 방법 및 시스템
EP0693856A2 (fr) Système et méthode pour fournir des services audiovisuels multimédia interactifs et distributifs aux utilisateurs résidents
US10212391B2 (en) Method and system for providing large-scale group communications
CN1206525A (zh) 动态同步传输模式网络中的碎片整理方法和装置

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH DE GB LI NL

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE CH DE GB LI NL

17P Request for examination filed

Effective date: 19930811

RAP3 Party data changed (applicant data changed or rights of an application transferred)

Owner name: AT&T CORP.

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN

18W Application withdrawn

Withdrawal date: 19950515