text:
|Publication number
|Publication type
|Application number
|Publication date
|Apr 23, 2002
|Filing date
|Jun 11, 1997
|Priority date
|Jun 27, 1996
|Fee status
|Publication number
|J. Bryan Lyles, Christopher J. Kappler, Landis C. Rogers
|Original Assignee
|Xerox Corporation
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (6), Non-Patent Citations (5), Referenced by (129), Classifications (9), Legal Events (6)
|External Links: USPTO, USPTO Assignment, Espacenet
Pursuant to 35 U.S.C.120, the priority of the inventors' earlier filed provisional application filed on Jun. 27, 1996 under Ser. No. 60/020,643 is claimed.
This invention relates to packet switched communication networks and, more particularly, to traffic shaping for causing the time multiplexed packet flows at queuing points within such networks or network elements to conform to specified traffic descriptors.
For other concurrent filings on traffic shaping see application Ser. No. 08/872,327 now U.S. Pat. No. 6,064,677 by Christopher J. Kappler et al., entitled "Multiple Rate Sensitive Priority Queues for Reducing Relative Data Transport Unit Delay Variations in Time Multiplexed Outputs from Output Queued Routing Mechanisms," application Ser. No. 08/872,756 now U.S. Pat. No. 6,064,651 by Landis C. Rogers et al., entitled "Rate Shaping in Per-Flow Output Queued Routing Mechanisms for Statistical Bit Rate Service," U.S. Pat. No. 5,926,459 entitled "Rate Shaping in Per-Flow Queued Routing Mechanisms for Available Bit Rate Service," by Joseph B. Lyles et al., application Ser. No. 08/868,287 now U.S. Pat. No. 6,038,217 entitle "Rate Shaping in Per-Flow Output Queued Routing Mechanisms for Available Bit Rate (ABR) Service in Networks Having Segmented ABR Control Loops," by Joseph B. Lyles, application Ser. No. 08/873,064 now U.S. Pat. No. 6,064,650 entitled "Rate Shaping in Per-Flow Output Queued Routing Mechanisms Having Output Links Servicing Multiple Physical Layers" by Christopher J. Kappler et al.
A. Traffic Contracts/Definitions
Most applications that are currently running on packet switched communication networks can function acceptably with whatever bandwidth they happen to obtain from the network because they have "elastic" bandwidth requirements. The service classes that support these applications is known as "best efforts" service in the Internet community and as "Available Bit Rate" (ABR) in the Broadband ISDN/ATM community.
There is, however, a growing demand for network services that provide bounded jitter or, in other words, bounded packet delay variation (commonly referred to as cell delay variation in an ATM context). For example, this type of service is required for real time applications, such as circuit emulation and video. It is not clear whether and how the Internet community will respond to this demand, but the Broadband ISDN/ATM community has responded by introducing the notion of a user-network negotiated traffic contract.
As is known, a user-network ATM contract is defined by a traffic descriptor which includes traffic parameters, tolerances and quality of service requirements. A conformance definition is specified for each of the relevant traffic parameters. Accordingly, ATM services may make use of these traffic parameters and their corresponding conformance specifications to support different combinations of Quality of Service (QoS) objectives and multiplexing schemes.
Partially overlapping sets of ATM traffic classes have been defined by the Telecommunications Standardization Sector of the International Telecommunications Union (ITU-T) and the ATM Forum. In some instances, traffic classes which have essentially identical attributes have been given different names by these two groups, so the following name translation table identifies the existing equivalent counterparts:
ITU-T Traffic Class
ATM Forum Traffic Class
Deterministic Bit Rate (DBR)
Constant Bit Rate (CBR)
Statistical Bit Rate (SBR)
Variable Bit Rate (VBR)
(No existing counterpart, but
Real time Variable Bit Rate (rt-VBR)
(No existing counterpart, but
Unspecified Bit Rate (UBR)
An ATM service contract for a virtual circuit (VC) connection or a virtual path (VP) connection may include multiple parameters describing the service rate of the connection. This includes the Peak Cell Rate (PCR), the Sustainable Cell Rate (SCR) the Intrinsic Burst Tolerance (IBT), and the Minimum Cell Rate (MCR). Not all of these parameters are relevant for every connection or every service class, but when they are implied or explicitly specified elements of the service contract, they must be respected. VC connections are the primary focus of the following discussion, but it will be understood the VP connections can also be so specified. The data transport unit for an ATM connection usually is referred to as a "cell." In this disclosure, however, the term "packet" is sometimes used to refer to the data transport unit because this more general terminology is consistent with some of the broader aspects of the innovations.
The Generic Cell Rate Algorithm (GCRA), which is specified in ITU-T Recommendation I.371, is well suited for testing a packet or cell flow for conformance with a traffic descriptor. To perform such testing, the GCRA requires the specification of an emission interval (i.e., the reciprocal of a flow rate) and a tolerance, τ. In practice, this tolerance may depend on a variety of factors, including the connection, the connection setup parameters, or the class of service. As will be seen, the GCRA can be employed as a Boolean function, where for a flow of fixed size packets or cells on a connection, the GCRA (emission interval, tolerance) is false if the flow is conforming to a peak rate or true if the flow is conforming to a minimum rate. For example, a source of cells conforms to a PCR if GCRA (1/PCR, τPCR) is false. Likewise, a connection or flow conforms to an MCR if GCRA (1/MCR, τMCR) is false. As will be appreciated the "emission interval" is the reciprocal of the "cell rate."
A DBR traffic contract is appropriate for a source which establishes a connection in the expectation that a static amount of bandwidth will be continuously available to the connection throughout its lifetime. Thus, the bandwidth the network commits to a DBR connection is characterized by a PCR value. Further, the cell or packet flow on such a connection complies with the traffic contract if it conforms to GCRA (1/PCR, τPCR). On the other hand, an SBR traffic contract is suitable for an application which has known traffic characteristics that allow for an informed selection of an SCR and τIBT, as well as a PCR and τPCR. An SBR or rt-SBR flow complies with its traffic contract if the flow not only conforms to GCRA (1/PCR, τPCR), but also to GCRA (1/SCR, τIBT).
As previously indicated, an ABR traffic contract is appropriate for applications that can tolerate the dynamic variations in the information transfer rate that result from the use of unreserved bandwidth. A PCR and an MCR are specified by the source establishing such a connection, and these parameters may be subject to negotiation with the network. Thus, the bandwidth that is available on an ABR connection is the sum of the MCR (which can be 0) and a variable cell rate that results from a sharing of unreserved bandwidth among ABR connections via a defined allocation policy (i.e., the bandwidth a source receives above its specified MCR depends not only on the negotiated PCR, but also on network policy). Feedback from the network enables the source application to dynamically adjust the rate it feeds cells or packets into an ABR connection. An ABR flow always complies with its traffic contract if it conforms to GCRA (1/MCR, τMCR), and is always non-compliant if it does not conform to GCRA (1/PCR, τPCR). Conformance in the region between MCR and PCR is dependent on the ABR feedback and is thus dynamically determined.
A UBR traffic contract is similar to the ABR contract, except that the UBR contract does not accommodate the specification of an MCR and has no dynamic conformance definition. Therefore, a UBR flow complies with its traffic contract if it conforms to GCRA (1/PCR, τPCR).
B. Traffic Shaping
ITU-T Recommendation I.371 addresses the possibility of reshaping traffic at a network element for the purpose of bringing the traffic into conformance with a traffic descriptor in the following terms:
"Traffic shaping is a mechanism that alters the traffic characteristics of a stream of cells on a VCC or a VPC to achieve a desired modification of those traffic characteristics, in order to achieve better network efficiency whilst meeting the QoS objectives or to ensure conformance at a subsequent interface. Traffic shaping must maintain cell sequence integrity on an ATM connection. Shaping modifies traffic characteristics of a cell flow with the consequence of increasing the mean cell transfer delay.
Examples of traffic shaping are peak cell rate reduction, burst length limiting, reduction of CDV by suitably spacing cells in time and queue service schemes.
It is a network operator's choice to determine whether and where traffic shaping is performed. As an example, a network operator may choose to perform traffic shaping in conjunction with suitable UPC/NPC functions.
It is an operator's option to perform traffic shaping on separate or aggregate cell flows.
As a consequence, any ATM connection may be subject to traffic shaping.
The options available to the network operator/service provider are the following:
a. No shaping
Dimension the network in order to accommodate any flow of conforming cells at the network ingress whilst ensuring conformance at the network egress without any shaping function.
b. Shaping
Dimension and operate the network so that any flow of conforming cells at the ingress is conveyed by the network or network segment whilst meeting QoS objectives and apply output shaping the traffic in order to meet conformance tests at the egress.
Shape the traffic at the ingress of the network or network segment and allocate resources according to the traffic characteristics achieved by shaping, whilst meeting QoS objectives and subsequent conformance tests at the network or network segment egress.
Traffic shaping may also be used within the customer equipment or at the source in order to ensure that the cells generated by the source or at the UNI are conforming to the negotiated traffic contract relevant to the ATC that is used (see Section 5.5)." ITU-T Recommendation I.371, Section 6.2.5.
C. Scheduling for Real Time and Non-Real Time Connections/Existing Tools and Techniques
As is known, if bandwidth is not divided "fairly" between applications employing "best efforts" Internet service or ABR ATM service a variety of undesirable phenomena may occur. See Lefelhocz, Lyles, Shenker and Zhang, "Congestion Control for Best-Effort Service: Why we need a new paradigm," IEEE Network, January/February 1996, for further details on mechanisms for best effort/ABR traffic.
Most ATM switches currently are implemented with FIFO queuing. FIFO queuing exhibits pathological behaviors when used for ABR traffic (see "On Traffic Phase Effects in Packet-Switched Gateways", Sally Floyd and Van Jacobson, Internetworking: Research and Experience, Vol. 3, pp. 115-156 (1992), and "Observations on the Dynamics of a Congestion Control Algorithm: The effects of Two-Way Traffic", Lixia Zhang, Scott Shenker, and David Clark, ACM Sigcomm 91 Conference, Sep. 3-6, 1991, Zurich, Switzerland, pp. 133-148.). FIFO also is unable to protect correctly behaving users against misbehaving users (it does not provide isolation). As a result of these deficiencies non-FIFO queuing mechanisms such as weighted fair queuing (see, for example, A. Demers, S. Keshave, and S. Shenker, "Analysis and Simulation of a Fair Queuing Algorithm," Proceedings of ACM SigComm, pages 1-12, September 1989; and A. K. Parekh "A Generalized Processor Sharing Approach to Flow Control in Integrated Service Networks," Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT, 1992.) or approximations to fair queuing such as round-robin (Ellen L. Hahne, "Round-robin Scheduling for Max-Min Fairness in Data Networks," IEEE Journal on Selected Areas in Communications, Vol. 9, pp. 1024-1039, September 1991.) are often suggested.
Service classes which have inelastic bandwidth requirements often require that data be transmitted through the network with bounded jitter (i.e., bounded cell or packet delay variation). As shown by the above referenced Parekh paper, weighted fair queuing can be used to provide bounded jitter for real time streams. Moreover, Parekh's results have recently (Pawan Goyal, Simon S. Lam and Harrick M. Vin, "Determining End-to-End Delay Bounds in Heterogeneous Networks," Proceedings of The 5th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV), Durham, N. H., Apr. 18-22, 1995.) been extended to prove delay bounds for systems using the closely related mechanisms of Virtual Clock (Lixia Zhang, "Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks," Proceedings of ACM SigComm, pages 19-29, August 1990.) and Self-clocked Fair Queuing (S. J. Golestani, "A Self-Clocked Fair Queuing Scheme for High Speed Applications," Proceedings of INFOCOM, pp. 636-646, 1994).
Thus, it is known that both elastic (Best effort/ABR) and inelastic (or real-time) services can benefit from the use of fair queuing and related algorithms.
1. Weighted Fair Queuing and Virtual Clock
Fair queuing and related algorithms (e.g., frame-based fair queuing, deficit round robin, etc.) operate on sequences of packets or other data transport units (e.g., an ATM cell is a packet. For ATM these sequences are identified by either the VCI or the VPI, while in the Internet protocol suite the identification is on the basis of <IP address, protocol, port>triples (IPv4) or flow identifiers (IPv6). In both self-clocked weighted fair queuing and virtual clock, packets are ordered (sorted) by timestamps (schemes such as round-robin provide approximations to ordering of packets by timestamps). These timestamps represent the virtual finishing time (or equivalently the virtual starting time for the packet and are computed by taking a starting time value and adding an offset obtained by multiplying the length of the packet by a weight which represents the particular packet sequence's share of the bandwidth.
More particularly, for virtual clock the virtual finishing time is computed as:
VT(f, j) is the virtual finishing time associated with packet j of flow (virtual circuit) f;
Arrival(f, j) is the arrival time of packet j of flow f; and
Length(f, j) is the length of packet j of flow f.
Self-clocked weighted fair queuing assigns virtual finishing times according to the formula:
SystemVirtualTime is the virtual time associated with the packet being served (being output) at the time packet(f, j+1) arrives.
For ATM the packet length is constant because the cells are of fixed size (i.e., 53 bytes long). Consequently, rightmost term in both Expression (1) and Expression (2) becomes a per flow constant. For virtual clock the simplified expression is:
For self-clocked weighted fair queuing, on the other hand, the simplified expression is:
In other words, an ATM queuing point which implements either virtual clock or self-clocked weighted fair queuing performs the following steps:
1) compute the maximum of (a) the current virtual time for the VC, and (b) either of i) the arrival time of the cell or ii) the system virtual time.
2) add to the results of step 1 above a per-VC constant representing that VC's share of the bandwidth.
3) service cells (transmit them) in order of increasing values of the virtual time stamps assigned by steps 1 and 2.
2. Priority
Giving priority to one traffic class over another means that if the higher priority traffic class has cells ready for transmission, those cells are always transmitted in preference to the cells of the lower priority traffic class.
Priority mechanisms can be either preemptive or non-preemptive. This terminology comes from the operating system literature. A non-preemptive priority mechanism assigns a priority to an object (a process in the operating system world, a VC in the ATM world) at a scheduling time, and the object then retains this priority until it is served. Preemptive priority mechanisms, on the other hand, can change the priority of objects while they are waiting to be served. For example, in a preemptive system one could say "schedule this VC with priority 3 but if it is not served within 200 microseconds then increase its priority up to 2."
3. Work Conserving and Non-work Conserving Queuing
Kleinrock, Queuing Systems, Vol. 2: Computer Applications, John Wiley & Sons, N.Y., N.Y. 1996, p. 113 uses the terminology "work conserving" to denote any queuing system in which work is neither created nor destroyed. In keeping with this terminology a switch which, when given queued cells, always transmits cells on the outgoing link is a "work conserving switch". Switches employing a pure FIFO, weighted fair queuing or virtual clock scheduling algorithm are all work conserving. In contrast, a non-work conserving switch may choose not to send cells, even when cells are queued for transmission. As will be seen, a method of doing this is to program the switch to wait until the current time is equal to or greater than the timestamp associated with a particular cell before transmitting that cell.
Work conserving switches attempt to fully utilize the transmission link, but do not necessarily remove or prevent bursts. In contrast, non-work conserving switches can strategically delay cells so as to re-shape traffic to meet a more stringent conformance test (i.e., a GCRA with a smaller τ). Additionally, a non-work conserving switch in which a given connection is only allocated a specified amount of buffering can perform a policing function (in ITU terms a UPC/NPC) by discarding or tagging cells which overflow the allotted buffer space. An example of a non-work conserving queuing system is the Stalled Virtual Clock (Sugih Jamin, "Stalled Virtual Clock" working note, Department of Computer Science, UCLA, Mar. 21, 1994), which is an adaptation of Lixia Zhang's Virtual Clock algorithm where virtual time is not allowed to run faster (it stalls or goes non-work conserving) than real-time. Also see, work by Scott Shenker that is available by FTP at FTP.PARC.XEROX.com.
4. Calendar Queues
A calendar queue is a time ordered list of actions, each of which is dequeued and executed when real-time is equal to or greater than the time associated with the action. Calendar queues with bounded time intervals can be represented as a linear array which is known as a "time-wheel" or "lime-line." Time-wheels assign events to buckets relative to a pointer, where the bucket index is calculated using arithmetic modulo the wheel size. These data structures are well known in the literature as a queuing mechanism. In a time-wheel, absolute time is represented as an offset relative to the current time ("real time"), and each element in the array is a bucket which contains one or more actions (typically in linked-list form) which are to be executed at the time assigned to the bucket in which they reside. Any of the buckets of such a time-wheel can be empty, i.e., have no events associated with it.
For every time-wheel, there are two times of interest: tearliest and tlatest, which correspond to the head and tail pointers for the active entries in the array; where tearliest is the time of the next entry (e.g., packet or cell) to be serviced, and tlatest is the time associated with the latest (most distant in time) bucket containing a scheduled event. The difference between tearliest and tlatest cannot be greater than the length of the time-wheel, b, minus 1. This can be ensured by viewing the time as being kept modulo b, and by then ensuring that no offset (the packet length multiplied by either the rate or the weight in virtual clock or weighted fair queuing respectively) is greater than b−1. For an ATM link running at OC-3 speeds (149.76 mbps—the SONET payload rate) there are approximately 353208 cells/sec on the link. Accordingly, if 64 Kbps (voice telephony rates) flows (approximately 174 cells/sec when AAL type 1 is used) are the lowest speed connections that need to be supported, then the ratio of the highest supported rate to the lowest rate is 2029, which rounds up to 211. This ratio is the maximum offset that will get added during the calculation of virtual times. Therefore, a time-wheel of length 2030 (2048 to allow for rounding up to a power of two) is sufficient to encode the virtual times associated with circuits ranging in rates from 64 Kbps to full OC-3 link rate.
The length of a time-wheel array can be decreased by permitting an array element to contain more than one time offset. For example, if the above-described time-wheel is reduced to 256 elements from 2048, then each bucket would have eight time offsets mapped into it. Actions within a single bucket that spans multiple offsets may be performed out of order, but between buckets actions will stay in order. This reduces the amount of memory that needs to be allocated to such a time-wheel at the cost of reducing the precision of the ordering of actions in the calendar queue.
D. Traffic Shaping for Time Multiplexed Flows on Multiple Output Channels
Preferably, any traffic shaping that is needed to bring time multiplexed packet or cell flows into conformance with their traffic contracts is performed after the completion of all switching or routing operations that are required to separate flows for different output channels from each other. This permits the throughput efficiency of the multiplexer to be optimized.
However, prior output queued ATM switches generally have employed FIFO (First In-First Out) output buffers. These buffers are not capable of participating in a controlled reshaping of any of the flows that pass through them. Instead, the per-VC time multiplexed flows that are output by these buffers essentially are time multiplexed composites of the input flows that are loaded into them. Of course, these output flows are time delayed relative to the input flows because of the inherent latency of the buffers. Moreover, the cell delay variation (CDV) of one or more of these output flows may be increased if scheduling conflicts occur among the data transport limits of the different flows because these conflicts cause so-called "transmit collisions."
As will be appreciated, increased CDV is especially troublesome for traffic, such as DBR traffic, which generally has a relatively tight tolerance. Thus, if each hop between a source and a destination includes a simple FIFO output queue of the foregoing type, it may be necessary to limit the number of hops this CDV sensitive traffic is permitted to make in order to ensure compliance within its specified tolerance.
Accordingly, there is a need for more efficient and more effective traffic shaping mechanisms and processes for ATM switches and other routers that route traffic from multiple inputs to multiple outputs for time multiplexed output emission.
This invention provides rate shaping in per-flow output queued routing mechanisms for unspecified bit rate service.
Still further objects and advantages of this invention will be evident when the following details and description is read in conjunction with the attached drawings, in which:
FIG. 1 is a simplified block diagram of an ATM switch in which the present invention may be used to advantage;
FIG. 2 diagrammatically tracks the various shapes an ATM cell may suitably take while traversing the switch shown in FIG. 1;
FIG. 3 is a more detailed block diagram of a representative channel on the output or transmit side of the chip shown in FIG. 1;
FIG. 4 schematically illustrates a stalled virtual clock calendar queue implementation of the present invention;
FIG. 5 schematically illustrates another stalled virtual clock calendar queue implementation of the invention;
FIG. 6 schematically illustrates still another stalled virtual clock calendar queue implementation of this invention;
FIG. 7 schematically illustrates an ABR connection having a source-to-destination control loop; and
FIG. 8 schematically illustrates an ABR connection having a segmented control loop.
While the invention is described in some detail hereinbelow with specific reference to certain embodiments, it is to be understood that there is no intent to limit it to those embodiments. On the contrary, the intent is to cover all modifications, alternatives and equivalents falling within the spirit and scope of the invention as defined by the appended claims.
A. A Representative Environment
Turning now to the drawings, and at this point especially to FIG. 1, the input and output ports of an ATM switch 21 typically are coupled to one or more physical layers via respective Utopia 2 interfaces and to a switch control processor module 22 via a second suitable interface. This enables the switch 21 to exchange data and control cells with any physical layers that are connected to them, and to also exchange control cells with the control processor module 22. In keeping with standard practices, the communication channels are unidirectional, so a pair of channels are required for bi-directional communications.
The switch 21 comprises a switching fabric 24, a fabric control module 25 and a reservation ring 26 for switching data and control cells from input queues to per-VC output queues. The cells in these queues are stored in the data path in data memory 27, and these input and output queues are managed by a queue control module 28. Typically, the data memory 27 is sized to hold up to roughly 12000 cells. Connection records for the data and control cell flows are stored in the control path in control memory 29, together with certain types of control cells which are intercepted by a rate based engine and traffic multiplexer 31 for routing to the control processor module 22. Suitably, the control RAM 29 is capable of accommodating up to about 8200 connection records and 64 k cell records. The interaction of the control processor module 22 with the switch 21 is beyond the scope of the present invention and, therefore, is not described herein. However, persons who are familiar with ATM switch design will understand that the control processor is primarily responsible for performing connection establishment and termination, as well as OAM (Operation and Maintenance) functions.
The data path of the switch 21 is synchronously clocked (by means not shown) at a predetermined rate of, say, 40 MHz. However, in keeping with conventional synchronous pipeline design practices, the phase of this clock signal is delayed (by means also not shown) by differing amounts at different points along the data path to give the data adequate time to settle prior to being transferred from one pipelined stage to the next.
In accordance with standard practices, a source wishing to communicate with a destination initiates negotiations with the ATM network within which the switch 21 resides by sending a SETUP message to the network. This message identifies the destination and explicitly or impliedly specifies all of the relevant traffic parameters for the requested connection. If the network is prepared to commit to the traffic contract which is defined by these traffic parameters (or a modified version of the parameters that the source is willing to accept), the network routes the SETUP message to the destination. Then, if the destination is ready to receive message traffic from the source in accordance with the terms of the traffic contract, the destination returns a CONNECT message to the source. This CONNECT message confirms that a connection has been established on a specified virtual circuit (VC) within a specified virtual path (VP) for a cell flow that conforms to the traffic contract. See ITU-T Recommendation 0.2391 and ATM Forum UNI 4.0 Specification. "Permanent" virtual connections can be established by provisioning, without invoking these signaling protocols.
Data cells begin to flow after a connection is established. As shown in FIG. 2, the form of the cells change as they pass through the switch 21 because of the operations the switch performs. Cells may be replicated within the switch 21 for multicasting, but the following discussion will be limited to unicast operations to avoid unnecessary complexity.
As indicated in FIG. 2 at 41, each inbound cell that the switch 21 receives has a header containing a VP index and a VC index. These indices combine to define a unique address for one hop of the connection. A connection may be composed of multiple hops, so the VP and VC indices for the next hoop are written into the header of the cell as it passes through the switch 21 as indicated in FIG. 2 at 42.
The switch 21 employs the VP and VC indices of the inbound cell (FIG. 2 at 41) to compute the address at which the connection record for the associated flow resides within the control RAM 29. Typically, this connection record includes a bit vector for identifying the output port (i.e., the switch-level "destination") at which the flow exits the switch 21, a priority index for identifying the relative priority of the flow on a granular priority scale, and a circuit index ("Circuit Index") which uniquely identifies the flow internally of the switch 21. As shown in FIG. 2 at 43, these connection parameters are written into the cell header. Then, the cell is written into the data RAM memory 27, while a pointer to the cell is linked into an appropriate one of a plurality of FIFO input queues, where the selection of the queue is based on the priority of the related flow.
The relative priorities of the head of queue cells within these input queues are examined during each cell time, and the head of queue cell having the highest priority is selected for arbitration during the next arbitration session. Furthermore, the priority of any lower priority head of queue cell (i.e., any non-selected head of queue cell) is incrementally increased (by means not shown), thereby increasing the probability of that cell being selected for arbitration during the next arbitration session. Therefore, even though the higher priority input queues have greater throughput per unit time than the lower priority queues, the lower priority queues have bounded delay because the priority of their head of queue cells increases as a function of time.
Each arbitration cycle requires one cell time of the switch 21, so the routing information for the cells that are selected for arbitration is fed into the reservation ring 26 one cell time prior to the release into the switching fabric 24 of the pay loads of the cell or cells that win the arbitration. In other words, as shown in FIG. 2 at 44, the cells that are received by the reservation ring 26 and switching fabric 24 are composed of the headers of the cells for the next arbitration cycle (i.e., the "current cells") followed by the bodies or payloads of the cells successfully arbitrated during the previous arbitration cycle (i.e., the "previous cells"). Thus, when the cell bodies reach the fabric 24, the fabric is already configured by the fabric control 25 to route those cells to their respective output port destination. For additional information on the reservation ring 26 and the arbitration it performs, see Cisneros, A., "Large Packet Switch and Contention Resolution Device," Proceedings of the XIII International Switching Symposium, 1990, paper 14, Vol. III, pp. 77-83 and Lyles U.S. Pat. No. 5,519,698, which issued May 21, 1996.
In the illustrated embodiment, cells are decomposed into four bit wide nibbles for arbitration and routing. Thereafter (with the exception of "idle cells" that may be provided for testing the switching processes) the cells are reassembled and queued in the data path, the control path, or both (a) for time scheduled transfer to the appropriate output ports of the switch 21 and/or (b) for transfer to the control processor module 22. The time scheduled transfer of cells to the output ports of the switch 21 is central to this invention so that subject is discussed in further detail hereinbelow. On the other hand, the decomposition and reassembly of the cells, the testing processes, and the interaction of the control processor 22 with RM (Resource Management) and OAM (Operation and Maintenance) cells are incidental topics which need not be considered in depth.
Referring to FIG. 3, it will be understood that the switch 21 fans out on the output or transmit side of the switching fabric 24. Thus, while one output channel of the switch 21 is shown, it will be understood that this channel is generally representative of the other channels.
As shown, there suitably is a fill cells module 51 for accepting cell bodies and their associated circuit indices from the switching fabric 24. The "effective cell time" on the output side of the switching fabric 24 is determined by the ratio of the nominal cell time to the "k" speed-up factor. Thus, for example, if the nominal cell time is 113 clock cycles/cell, the effective cell time on the output side of the switching fabric 24 is 56.5 cycles/cell if k=2.
When a valid cell is received, the fill cell module 51 typically uses cell structures from a linked and numbered free list 52 of such data structures for writing the cell into the data memory 27. To that end, the fill cell module 51 suitably includes a fetch state machine 53 for fetching cell structures from the top of the free list 52 on demand. This enables the fill cell module 51 to insert the circuit index for the cell and a pointer to the location of the cell in data memory 27 into an "arrival" message that it sends to notify a cell flow control unit 55 of the cell's arrival. The circuit index enables the flow control unit 55 to ascertain the VC or flow to which the cell belongs from the connection record in the control memory 29. This, in turn, enables the cell flow control unit 55 to check the traffic shaping status of the flow. An OAM/RM recognizer 57 advantageously is provided to enable the flow control unit 55 to identify these control cells and to determine whether they are to be queued in the data path, the control path, or both.
The memory pointers for cells of traffic contract compliant flows are queued in per-VC queues in response to "addCell" messages which the cell flow control unit 55 sends to a queue control unit 58. Each addCell message identifies the cell to which it pertains and the circuit index for the associated flow or VC. Moreover, the addCell message also indicates whether the cell is to be queued in the data path, the control path, or both. When the cell has been appropriately queue, the queue control unit 58 returns an "added" message to the cell flow control unit 55 for notifying the flow control unit 55 that the newly queued cell needs to be taken into account during future rate shaping computations on the VC to which it belongs.
Advantageously, the queue control unit 58 monitors the length of the per-VC queues with respect to the depth control limits that are set on the respective queues. This enables the control unit 58 to initiate congestion control action on ABR flows when their per-VC queues become excessively long. It also permits the control unit 58 to identify flows that are exceeding their traffic contract so that an appropriate policing function (not shown) can be invoked to drop or log cells of such non-compliant flows.
An admission controller 61 monitors the "added" messages that are returned by the queue control unit 58 to cause a scheduler 62 to schedule the head of queue cells for the non-empty per-VC queues on a calendar queue 63 for transmission at scheduled times. Suitably, the scheduler 62 employs a per-VC virtual clock to schedule these head of queue cells on the calendar queue 63 in accordance with respective virtual finishing times, VT(f, j+1), that the scheduler 62 computes for them (or, alternatively, "virtual start times"). Please see Section III.C.1 above.
The calendar queue 63 tracks system "real time" or "current time" to prevent any of the scheduled cells from being released for transmission prior to its scheduled time. In other words, the scheduler 62 and the calendar queue 63 implement a stalled virtual clock so that the cells that are scheduled for transmission are released for transmission only when system real time has at least reached their respective scheduled transmission times. As illustrated, connections having cells that have been released for transmission by the calendar queue 63 are linked into a link list of connections that have cells ready for transmission on a transmit list 65.
The calendar queue 63 notifies the flow control unit 55 whenever it releases a cell for transmission on any given connection. The flow control unit 55, in turn, requests the reference to the next cell (i.e., the new head of queue cell), if any, on the per-VC queue for the given connection and notifies the admission controller 61 that it should admit this reference to the scheduler 62 for scheduling. Thus, the admission controller 61 effectively engages in closed loop communications with the calendar queue 63 to ensure that the head of queue cells which it admits for scheduling thereon are admitted to the exclusion of all other cells in the per-VC queues. Thus, the calendar queue 63 may be implemented by employing one or more time bounded time-wheels or "time lines," 66. Please see Section III.C.4 above. The time span of these time-wheels must be at least as long as the period of the lowest frequency flows that the system is designed to support to prevent time wrap induced ambiguities and preferably is twice as long so relative times can be compared using two's complement computations.
B. Shaping Flows of Fixed Bit Length Data Transport Limits to Specified Peak Flow Rates
Referring to FIG. 4, it will be evident that stalled virtual clock transmission control is well suited for shaping time multiplexed flows of fixed bit length data transport units, such as ATM cells, from an output queued routing mechanism to specified peak data unit flow rates, such as PCRs for DBR/CBR ATM service. As previously described, the data transport units of the flows that are routed to a given output port are queued, after being routed, in per-flow queues. The data transport units at the heads of these queues then are admitted by an admission controller 61 (to the exclusion of all other transport units) for scheduling on a time line calendar queue 63 by a scheduler 62. The scheduler 62, in turn, performs per-flow virtual clock computations on these head of queue transport units to schedule them for release from the calendar queue 63 in accordance with their respective theoretical finish times, VT(f, j+1), or their respective theoretical start times. Please see Section III.C.4 above.
Real time advantageously is incremented on the time line 63 at a rate that enables the shaped, time multiplexed output traffic to essentially fill the bandwidth of the output link 71. As will be recalled, the maximum number of resolvable time slots into which the scheduler 62 can map the head of queue members of the respective flows is based on the ratio of the maximum permissible frequency to the minimum permissible frequency of those flows. Thus, the rate at which real time is incremented from bucket-to-bucket is a rationale multiple of the cell rate.
Data transport units residing in time slots which represent times that are earlier than or equal to the current real time of reference for the time line 63 are eligible for transmission and, therefore, are linked into a transport list 65 as previously described. However, those data transport units which reside in time slots that are associated with later time slots of the time line 63 remain in a pending state until system real time advances sufficiently to reach those time slots. To avoid rollover ambiguities, the time line 63 is designed to ensure that all references to earlier scheduled data transport limits are removed from each time slot before any references to later scheduled transport units are inserted therein in anticipation of the next scan.
While the above-described arrangement effectively shapes conforming DBR/CBR ATM flows to the PCRs specified by their traffic contracts, it does not aid in bringing the Cell Delay Variation (CDVs) of those flows into conformity with the τPCR parameters of their traffic contracts.
C. Multiple Priority Levels for Minimizing Relative CDV
In accordance with the present invention, data transport units that are delivered to a multiplexing point, such as an output port of an ATM switch, by flows having different frequencies, are prioritized so that the data transport units of the higher frequency flows are given transmit priority over any data transport units of lower frequency flows with which they happen to collide. As shown in FIG. 3, this transmit priority can be implemented by steering the data transport units that are admitted for scheduling by a stalled virtual clock scheduling mechanism 63 or the like to one or another of a plurality of priority rank ordered time-lines 66 a-66 e or output FIFO queues based on the frequencies of the flows to which those respective data transport units belong. For example, for an ATM switch, it may be advisable to implement on the order of five different frequency dependent/class of service dependent output priorities, including (1) a top priority for cells from flows that have negotiated output rates of at least {fraction (1/16)} of the full rate of the output link (i.e., its aggregate bandwidth), (2) a second priority for cells form flows having negotiated output rates ranging from {fraction (1/16)} to {fraction (1/256)} of the output link rate, and (3) a third priority for cells from flows having negotiated output rates ranging from {fraction (1/256)} to {fraction (1/4096)} of the link rate. The lower two priorities then suitably are established for ABR connections that have non-zero negotiated MCR rates and for UBR connections and ABR connections that have MCR rates of 0, respectively.
As will be appreciated the present invention effectively reduces the CDVs of the higher frequency flows, without materially increasing the CDVs of the lower frequency flows. As a general rule, the CDV that is tolerable is a function of the negotiated rate for a flow. For example, a CDV of 100 cell times is very large with respect to an expected emission interval of one cell every 10 cells, but generally insignificant if the negotiated emission interval is only one cell every 2029 cells.
When a calendar queue mechanism is employed to schedule the data transport units or cells of the different frequency flows for transmission, the high frequency high priority flows need to be resolved to the precision of a single cell time while being scheduled to achieve an acceptably low CDV, but the low frequency/low priority flows can be more coarsely resolved to a precision of, say, 16 cell times. This means that the number of time slots on the calendar queue 63 can be reduced. This enables the amount of memory that is required to implement the calendar queue 63 to be reduced at the cost of losing some typically unneeded precision in the scheduling of the head of queue cells of the lower frequency flows.
It is to be understood that the frequency based prioritization technique which the present invention provides for resolving transmission conflicts at multiplex points among flows of different nominally fixed frequencies may be employed in many different applications for reducing the relative jitter of the flows, including in applications having work conserving per-flow output queues for feeding cells or other data transport units into such a multiplex point.
D. Traffic Shaping to MCR and PCR Parameters for ABR Service in Networks Having Source-to-Destination ABR Control Loops
As will be recalled, the standard ABR traffic contract contemplates explicitly or implicitly specified PCR and MCR parameters, where MCR may equal 0. An ABR flow that conforms to its GCRA (1/MCR, τMCR) is valid and entitled to service, but the network may not be giving the flow the bandwidth to which it is entitled. Contrastingly, a flow which violates its GCRA (1/PCR, τPCR) is non-conforming. Thus, ABR connections or flows that are routed to the output of a network or network element, such as by the ATM switch 21, advantageously are shaped to ensure: (1) that the ABR flows with non-zero MCR guarantees receive adequate output bandwidth to effectively satisfy those guarantees; and (2) that none of the ABR flows violate their PCR commitments at such output. In networks that have multiple multiplex points, it is useful to perform this shaping at each of the multiplex points.
FIG. 4 illustrates one technique for shaping ABR flows or VC connections to conform them to their traffic contracts at an output of a network or network element. As shown, the rates at which the respective flows are requesting output service are monitored; first to determine at 85 whether the flows are or are not GCRA (1/MCR, τMCR) compliant, and then to determine at 86 whether the GCRA (1/MCR, τMCR) non-compliant flows are or are not GCRA (1/PCR, τPCR) compliant. Control signals reflecting the results of these cascaded tests 85 and 86 are fed back to the scheduler 62 and its associated steering logic 87 to permit appropriate rate shaping adjustments to be made to the rates at which the data transport units (e.g., cells) of the respective flows are fed to the output. As will be appreciated, the desired state is for all of the ABR flows to be GCRA (1/MCR, τMCR) non-compliant (or just barely compliant) and GCRA (1/PCR, τPCR) false/compliant because those algorithms test for minimum and maximum acceptable flow rates, respectively.
More particularly, GCRA (1/MCR, τMCR) compliant flows may not be receiving the output bandwidth that they need to satisfy their MCR guarantees. Therefore, when such a flow is identified at 85, the scheduler 62 and its steering logic 87 are set-up to schedule subsequently received references to data transport units (e.g., cells) of that flow on a relatively high priority stalled virtual clock calendar queue 88 for output at a rate somewhat in excess of its guaranteed MCR. For example, these subsequently received cell or packet references suitably are scheduled on the calendar queue 88 for emission at a rate that is determined by multiplying the MCR for the flow by a predetermined speed-up factor. This causes the network to give these additional potentially "lagging" flows the additional output bandwidth that is needed to satisfy their MCR guarantees.
GCRA (1/MCR, τMCR) non-compliant ABR flows are further tested at 86 to determine whether they are demanding output service at acceptably low or unacceptably high GCRA (1/PCR, τPCR) compliant or non-compliant rates, respectively. The results of this test are captured by another control signal which is fed back to the scheduler 62 and its steering logic 87 to set them up for rate sensitive enqueuing of the subsequently received references to these GCRA (1/MCR, τMCR) non-compliant flows on a lower priority queue 89. Specifically, the subsequently received references to a flow that is found to be GCRA (1/PCR, τPCR) compliant at 86 are appended to the tail of the transmit list for the ABR flows with MCR guarantees for it is serviced in round-robin order. Contrastingly, when a flow is found to be GCRA (1/PCR, τPCR) non-compliant at 86, the subsequently received references for that flow are scheduled by the scheduler 62 on a non-work conserving, stalled virtual clock calendar queue 89 in accordance with the PCR for that flow, thereby imposing a PCR limit on the flow.
More generally, it will be evident that the embodiment of FIG. 4 implements the following ABR traffic shaping algorithm:
If GCRA (1/MCR, τMCR) compliant then enqueue in high priority queue at rate MCR*speedup
else if GCRA (1/PCR, τPCR) compliant then enqueue in low-priority work conserving queue
else enqueue in low-priority non-work conserving queue based on PCR emission interval.
However, alternatives that are based on similar and different principles will suggest themselves.
For example, as shown in FIG. 5, one potentially attractive alternative is to enqueue the references to the data transport units or cells of flows that are found to be GCRA (1/MCR, τMCR) non-compliant and GCRA (1/PCR, τPCR) compliant at 85 and 86 (FIG. 4), respectively, in both (1) the high priority calendar queue 88 at a MCR scheduling interval, and (2) the work conserving region of the lower priority queue. This creates a "race" condition because whenever one instance of such a dual queued reference is reached for service in either of the queues, a delinker 90 removes the other instance of that reference from the other queue. This means that a tighter bound may be maintained on the tolerance, τ. The traffic shaping algorithm of this modified embodiment is:
At enqueue:
enqueue in high priority queue with rate MCR;
if GCRA (1/PCR, τPCR) compliant then enqueue in low-priority work conserving queue;
else enqueue in low-priority non-work conserving queue based on PCR emission interval;
At dequeue:
if dequeuing from high priority queue then delink from low priority queue else delink from high priority queue.
FIG. 6 illustrates still another alternative for shaping ABR connections or flows. In this embodiment, the output bandwidth that is provided for each MCR non-compliant ABR flow that has a non-zero MCR guarantee is dynamically adjusted based on the average spacing between ABR cells on the output link (i.e., at the transmit side of a line interface) and the current length of the ABR "ready queue." The current length, Len, of this ABR "ready queue" conveniently is determined by measuring the length of the work conserving queue on the ABR transmit lists 65 e and 65 f as at 93. On the other hand, the average spacing, S, between ABR cells on the calendar queue can be determining at 94 the percent of the link by dividing the bandwidth that is available for ABR flows after allowance is made for any non-ABR flows. The bandwidth required by these non-ABR flows suitably is determined by computing at 94 the aggregate bandwidth needed to service the transmit list 65 entries for the non-ABR flows.
For example, if it is determined at 94 that 50% of the bandwidth of the output link is available for the ABR flows, it follows that the average space, S, between ABR cells or data transport units on the output link then is two cell times. This information, together with the computed length, Len, of the ABR "ready queue," enables the service for the MCR non-compliant ABR flows to be optimized by having the scheduler 62 schedule the incoming references for those flows on the non-work conserving calendar queue 89 at respective emissions intervals Tt of:
R=an estimated round robin ABR service time (R=current time+S*Len);
Pt=the earliest service contract compliant departure for the next cell of flow t (Pt=current time+1/PCR); and
St=the latest service contract compliant departure for the next cell of flow t (St=current time+1/MCR).
E. Traffic Shaping for Segmented ABR Connections
As is known, ABR connections may operate with source-to-destination control loops, such as shown in FIG. 7 at 101, or with segmented control loops, such as shown in FIG. 8 at 102. When segmented control loops are employed, each of the separately controlled segments functions as a virtual source, VS, for the next segment. Thus, each ABR control segment (except the first) is sourced by a virtual source which assumes the behavior of an ABR source endpoint. Backward resource management (RM) cells are removed from the control loop when they are received by a virtual source. However, each source or virtual source can compute an estimate of the available network bandwidth to its destination or virtual destination, VD, based on this feedback which, in turn, can be expressed as an Allowed Cell Rate (ACR) on a per-segment basis. Therefore, ABR traffic shaping advantageously is carried out segment-by-segment for these ABR connections with segmented control loops, using a maximum allowable per-flow data transport unit or cell rate of Max(MCR, Min(ACR, PCR). The embodiments of FIGS. 4-6 can implement such traffic shaping by setting PCR′ equal to Max(MCR, Min(ACR, PCR) and then by using PCR′ in place of PCR in the computations.
F. Traffic Shaping to PCR for UBR Service
The embodiment of FIG. 4 can be simplified to shape traffic to a specified PCR for UBR service. UBR service contemplates an explicitly or implicitly specified PCR, but no MCR. Thus, the provision made to enforce the ABR MCR guarantees may be eliminated, which means that the incoming references to the data transport units or cells of a UBR flow or connection may be enqueued on the queue 89 in accordance with the flowing enqueuing rules:
if GCRA(1/PCR, τPCR) compliant then enqueue in bucket at end of work conserving region
else enqueue in non-work conserving region based on PCR emission interval.
|Cited Patent
|Filing date
|Publication date
|Jun 4, 1992
|Jan 11, 1994
|Bell Communications Research, Inc.
|Method and system for managing queued cells
|Jan 25, 1996
|Apr 28, 1998
|Mitsubishi Electric Information Technology Center America, Inc.
|Traffic shaping and ABR flow control
|Jun 6, 1996
|May 5, 1998
|Siemens Aktiengesellschaft
|Method for scheduling message cells leaving an ATM node
|Mar 14, 1996
|Aug 11, 1998
|Motorola, Inc.
|Event-driven cell scheduler and method for supporting multiple service categories in a communication network
|Apr 4, 1997
|Jan 26, 1999
|At&T Corp/Csi Zeinet(A Cabletron Co.)
|Method for integrated traffic shaping in a packet-switched network
|Jun 11, 1997
|Jul 20, 1999
|Xerox Corporation
|Rate shaping in per-flow queued routing mechanisms for available bit rate service
|Adams, J.L. and Smith, A.J., "The Support of the Available Bit Rate Bearer Capability Using Virtual Source/Destination Concepts," BT Technology Journal, vol. 13, No. 3, Jul. 1995, pp. 67-79.
|Goyal, Pawan and Harrick M. Vin. "Generalized Guaranteed Rate Scheduling Algorithms: A Framework," IEEE/ACM Transactions on Networking, vol. 5, No. 4, Aug. 1997, pp. 561-571.
|Goyle, Pawan and Harrick M. Vin. "Generalized Guaranteed Rate Scheduling Algorithms: A Framework," Technical Report TR-95-30, Department of Computer Sciences, University of Texas at Austin, Sep. 1995, 27 pages.
|Sriram, Kotikalapudi et al. "An Adaptive Mac-Layer Protocol for Multiservice Digital Access Via Tree and Branch Communication Networks," Proceedings of the SPIE, vol. 2609, Oct. 1995, pp. 10-21.
|Zhang, Lixia "VirtualClock: a New Traffic Control Algorithm for Packet-Switched Networks," ACM Transactions on Computer Systems, vol. 9, No. 2, May 1991, pp. 101-124.
|Citing Patent
|Filing date
|Publication date
|Aug 2, 1999
|May 13, 2003
|Genesys Telecommunications Laboratories, Inc.
|Method and apparatus for call distribution and override with priority recognition and fairness timing routines
|Feb 10, 1998
|May 13, 2003
|Enterasys Networks, Inc.
|Method and apparatus for providing work-conserving properties in a non-blocking switch with limited speedup independent of switch size
|Feb 16, 2000
|Sep 9, 2003
|Method for policing data traffic, a data traffic policer realizing such a method and a telecommunication network including such a policer
|Mar 3, 2000
|Mar 9, 2004
|Nokia Intelligent Edge Routers Inc.
|Cell reassembly for packet based networks
|May 19, 1999
|Mar 16, 2004
|Nortel Networks Limited
|Method and apparatus for flexible egress traffic queuing
|Jul 30, 1999
|Apr 27, 2004
|Intel Corporation
|Controlling frame transmission
|Apr 13, 1999
|Jun 15, 2004
|Fujitsu Limited
|Communication control device for providing an ABR service function, and ATM switching system including the same
|Oct 14, 1999
|Jun 29, 2004
|Nokia Inc.
|Method and apparatus for output rate regulation and control associated with a packet pipeline
|Aug 11, 2000
|Jul 6, 2004
|Netro Corporation
|Wireless ATM network with high quality of service scheduling
|Sep 24, 1999
|Aug 10, 2004
|Cisco Technology
|Dynamic weighted resource sharing
|Sep 28, 1999
|Oct 12, 2004
|Advanced Mircro Devices, Inc.
|Method and apparatus for the channelization of cell or packet traffic over standard PC buses
|Oct 10, 2001
|Oct 19, 2004
|Qualcomm Incorporated
|Method and apparatus for scheduling transmissions in a communication system
|Feb 25, 1999
|Mar 8, 2005
|Enterasys Networks, Inc.
|Method and apparatus for providing bandwidth and delay guarantees in combined input-output buffered crossbar switches that implement work-conserving arbitration algorithms
|Oct 19, 2000
|Mar 15, 2005
|Shaping method and related shaper
|Oct 14, 1999
|Apr 19, 2005
|Nokia, Inc.
|Method and apparatus for input rate regulation associated with a packet processing pipeline
|Apr 7, 2000
|May 17, 2005
|Omneon Video Networks
|Method of generating timestamps for isochronous data
|Mar 30, 2001
|Jun 7, 2005
|Nokia, Inc.
|Method and apparatus for improved scheduling technique
|Mar 30, 2001
|Jul 5, 2005
|Nokia, Inc.
|Method and apparatus for improved queuing
|Oct 14, 1999
|Aug 23, 2005
|Nokia, Inc.
|Method and apparatus for an output packet organizer
|May 15, 2000
|Sep 20, 2005
|Marconi Intellectual Property (Ringfence), Inc.
|Protected UBR
|Mar 23, 2000
|Dec 20, 2005
|Cisco Technology, Inc.
|Apparatus and method for rate-based polling of input interface queues in networking devices
|Oct 29, 2001
|Apr 4, 2006
|Alcatel Canada Inc.
|Fair queue servicing using dynamic weights (DWFQ)
|Sep 25, 2001
|May 2, 2006
|Intel Corporation
|Methods and apparatus for retaining packet order in systems utilizing multiple transmit queues
|Aug 6, 2001
|Oct 24, 2006
|Integrated Device Technology, Inc.
|Timer rollover handling mechanism for traffic policing
|Feb 28, 2002
|May 8, 2007
|Agere Systems Inc.
|Processor with software-controlled programmable service levels
|Feb 28, 2002
|May 29, 2007
|Agere Systems Inc.
|Processor with dynamic table-based scheduling using multi-entry table locations for handling transmission request collisions
|Feb 28, 2002
|Jul 17, 2007
|Agere Systems Inc.
|Processor with table-based scheduling using software-controlled interval computation
|May 9, 2002
|Jul 24, 2007
|Intel Corporation
|Method and apparatus for minimizing spinlocks and retaining packet order in systems utilizing multiple transmit queues
|Aug 30, 2002
|Aug 28, 2007
|At&T Corp.
|Network having multiple QoS levels
|Jun 26, 2002
|Sep 18, 2007
|Arris International, Inc.
|Method and apparatus for queuing data flows
|Jan 17, 2001
|Sep 25, 2007
|Sony Corporation
|Method and apparatus for packet transmission and bandwidth guaranteeing method
|Sep 27, 2002
|Oct 23, 2007
|Fujitsu Limited
|Usage parameter control device for asynchronous transfer mode system
|Sep 22, 2000
|Nov 27, 2007
|United States Of America As Represented By The Secretary Of The Navy
|Multiple-buffer queueing of data packets with high throughput rate
|Jan 27, 2003
|Feb 12, 2008
|Lucent Technologies Inc.
|Packet-based traffic shaping
|Jan 24, 2002
|Aug 26, 2008
|Ericsson Ab
|Operation of a multiplicity of time sorted queues with reduced memory
|Feb 28, 2002
|Oct 28, 2008
|Agere Systems Inc.
|Processor with dynamic table-based scheduling using linked transmission elements for handling transmission request collisions
|Dec 2, 2004
|Feb 24, 2009
|Omneon Video Networks
|Method of generating timestamps for isochronous data
|Nov 1, 2005
|Jul 7, 2009
|Cisco Technology, Inc.
|Apparatus and method for rate-based polling of input interface queues in networking devices
|Aug 7, 2003
|Dec 29, 2009
|Cisco Technology, Inc.
|Supplemental queue sampling technique for packet scheduling
|Oct 25, 2007
|Dec 6, 2011
|The United States Of America As Represented By The Secretary Of The Navy
|Multiple-buffer queueing of data packets with high throughput rate
|Aug 14, 2008
|Mar 26, 2013
|Verizon Patent And Licensing Inc.
|System and method for monitoring and analyzing network traffic
|Jul 19, 2011
|Oct 8, 2013
|Huawei Technologies Co., Ltd.
|Bandwith allocation method and routing device
|Nov 19, 2007
|Nov 26, 2013
|AlterWAN Inc.
|Wide area network with high quality of service
|Oct 13, 2006
|Apr 8, 2014
|Qualcomm Incorporated
|Method and apparatus for determining a base station's transmission power budget
|Mar 30, 2011
|Aug 12, 2014
|Fujitsu Limited
|Test method for network system
|Jan 17, 2006
|Aug 19, 2014
|Qualcomm Incorporated
|Methods and apparatus for generating, communicating, and/or using information relating to self-noise
|Sep 14, 2012
|Sep 9, 2014
|Qualcomm Incorporated
|Methods and apparatus for communicating transmission backlog information
|Mar 22, 2011
|Sep 9, 2014
|Marvell Israel (M.I.S.L) Ltd.
|Operations, administration, and maintenance (OAM) processing engine
|Mar 4, 2011
|Feb 24, 2015
|Qualcomm Incorporated
|Locating a wireless local area network associated with a wireless wide area network
|Mar 7, 2006
|Mar 3, 2015
|Alcatel Lucent
|Method for routing transactions between internal and external partners in a communication center
|Oct 13, 2006
|Mar 24, 2015
|Qualcomm Incorporated
|Methods and apparatus for broadcasting loading information corresponding to neighboring base stations
|May 13, 2008
|Apr 7, 2015
|Genesys Telecommunications Laboratories, Inc.
|Method and apparatus for extended management of state and interaction of a remote knowledge worker from a contact center
|Dec 22, 2008
|Apr 14, 2015
|Genesys Telecommunications Laboratories, Inc.
|System and methods for improving interaction routing performance
|Sep 10, 2013
|Apr 21, 2015
|Alterwan, Inc.
|Inter-autonomous networking involving multiple service providers
|Dec 13, 2006
|Aug 25, 2015
|Qualcomm Incorporated
|Methods and apparatus for communicating backlog related information
|Jul 14, 2006
|Sep 1, 2015
|Qualcomm Incorporated
|Methods and apparatus for reporting and/or using control information
|Oct 13, 2006
|Sep 1, 2015
|Qualcomm Incorporated
|Methods and apparatus related to custom control channel reporting formats
|Jul 14, 2006
|Sep 15, 2015
|Qualcomm Incorporated
|Methods and apparatus for communicating control information
|Jan 17, 2006
|Sep 29, 2015
|Qualcomm Incorporated
|Methods and apparatus for flexible reporting of control information
|Oct 17, 2012
|Oct 13, 2015
|Qualcomm Incorporated
|Methods and apparatus for communicating and/or using transmission power information
|Jul 14, 2006
|Nov 17, 2015
|Qualcomm Incorporated
|Methods and apparatus for determining, communicating and using information which can be used for interference control
|Jan 17, 2006
|May 10, 2016
|Qualcomm Incorporated
|Methods and apparatus of implementing and/or using a dedicated control channel
|May 12, 2010
|May 10, 2016
|Qualcomm Incorporated
|Methods and apparatus for communicating transmission backlog information
|Jan 19, 2015
|May 24, 2016
|Alcatel Lucent
|Method for routing transactions between internal and external partners in a communication center
|Jan 17, 2006
|Sep 20, 2016
|Qualcomm Incorporated
|Methods and apparatus relating to generating and transmitting initial and additional control information report sets in a wireless system
|Dec 12, 2006
|Oct 4, 2016
|Qualcomm Incorporated
|Methods and apparatus related to selecting a request group for a request report
|Jul 14, 2006
|Oct 18, 2016
|Qualcomm Incorporated
|Methods and apparatus for communicating information utilizing a plurality of dictionaries
|May 8, 2015
|Dec 6, 2016
|Genesys Telecommunications Laboratories, Inc.
|Personal desktop router
|Feb 2, 2015
|Dec 20, 2016
|Alterwan, Inc.
|Private tunnel usage to create wide area network backbone over the internet
|Aug 25, 2003
|Jan 10, 2017
|Qualcomm Incorporated
|Pilot signals for use in multi-sector cells
|Mar 10, 2011
|Jan 24, 2017
|Genesys Telecommunications Laboratories, Inc.
|Method for implementing and executing communication center routing strategies represented in extensible markup language
|Jul 14, 2006
|Feb 14, 2017
|Qualcomm Incorporated
|Methods and apparatus for communicating transmission backlog information
|Dec 13, 2006
|Feb 21, 2017
|Qualcomm Incorporated
|Methods and apparatus related to selecting reporting alternative in a request report
|May 14, 2007
|Mar 21, 2017
|Qualcomm Incorporated
|Method of transmitting pilot tones in a multi-sector cell, including null pilot tones, for generating channel quality indicators
|Jul 14, 2006
|May 23, 2017
|Qualcomm Incorporated
|Efficient reporting of information in a wireless communication system
|Feb 4, 2015
|May 30, 2017
|Alterwan, Inc.
|VPN usage to create wide area network backbone over the internet
|Sep 8, 2014
|Jun 13, 2017
|Marvell Israel (M.I.S.L.) Ltd.
|Operations, administration, and maintenance (OAM) engine
|Jan 17, 2001
|Oct 18, 2001
|Hiroshi Kyusojin
|Method and apparatus for packet transmission and bandwidth guaranteeing method
|Oct 29, 2001
|Apr 18, 2002
|Natalie Giroux
|Fair queue servicing using dynamic weights (DWFQ)
|Mar 30, 2001
|Oct 3, 2002
|Lalit Merani
|Method and apparatus for improved scheduling technique
|Mar 30, 2001
|Oct 3, 2002
|Lalit Merani
|Method and apparatus for improved queuing
|Sep 27, 2002
|Feb 13, 2003
|Fujitsu Network Communications, Inc., A California Corporation
|Usage parameter control device for asynchronous transfer mode system
|Aug 6, 2001
|Feb 20, 2003
|Yongdong Zhao
|Timer rollover handling mechanism for traffic policing
|Jan 24, 2002
|Mar 6, 2003
|Crescent Networks, Inc.
|Operation of a multiplicity of time sorted queues with reduced memory
|Sep 25, 2001
|Mar 27, 2003
|Connor Patrick L.
|Methods and apparatus for retaining packet order in systems utilizing multiple transmit queues
|May 9, 2002
|Mar 27, 2003
|Linden Minnick
|Method and apparatus for minimizing spinlocks and retaining packet order in systems utilizing multiple transmit queues
|Feb 28, 2002
|Aug 28, 2003
|Kramer David B.
|Processor with dynamic table-based scheduling using linked transmission elements for handling transmission request collisions
|Jan 27, 2003
|Dec 4, 2003
|Sandeep Lodha
|Packet-based traffic shaping
|Jun 26, 2002
|Jan 1, 2004
|Cloonan Thomas J.
|Method and apparatus for queuing data flows
|Aug 25, 2003
|Aug 26, 2004
|Rajiv Laroia
|Pilot signals for use in multi-sector cells
|Jul 18, 2003
|Jan 20, 2005
|Hsuan-Wen Wang
|Flow control hub having scoreboard memory
|Dec 2, 2004
|Apr 14, 2005
|Stallkamp Richard Wissler
|Method of generating timestamps for isochronous data
|Nov 1, 2005
|Mar 23, 2006
|Cisco Technology, Inc., A California Corporation
|Apparatus and method for rate-based polling of input interface queues in networking devices
|Mar 7, 2006
|Jul 13, 2006
|Beck Christopher Clemmett M
|Method for routing transactions between internal and external partners in a communication center
|Jan 26, 2006
|Feb 15, 2007
|Yi-Lung Hsiao
|Controller and method for per-flow rate
|Jul 14, 2006
|Jun 21, 2007
|Rajiv Laroia
|Methods and apparatus for determining, communicating and using information which can be used for interference control
|Jan 17, 2006
|Jun 28, 2007
|Sunddeep Rangan
|Methods and apparatus for generating, communicating, and/or using information relating to self-noise
|Oct 13, 2006
|Jun 28, 2007
|Junyi Li
|Methods and apparatus related to custom control channel reporting formats
|Oct 13, 2006
|Jun 28, 2007
|Junyl Li
|Methods and apparatus related to selecting control channel reporting formats
|Jul 14, 2006
|Jun 28, 2007
|Arnab Das
|Methods and apparatus for communicating information utilizing a plurality of dictionaries
|Jan 17, 2006
|Jun 28, 2007
|Arnab Das
|Communications device control information reporting related methods and apparatus
|Jan 17, 2006
|Jun 28, 2007
|Vladimir Parizhsky
|Methods and apparatus of implementing and/or using a dedicated control channel
|Jul 14, 2006
|Jul 19, 2007
|Arnab Das
|Efficient reporting of information in a wireless communication system
|May 14, 2007
|Sep 13, 2007
|Qualcomm Incorporated
|Method of transmitting pilot tones in a multi-sector cell, including null pilot tones, for generating channel quality indicators
|Mar 26, 2007
|Oct 18, 2007
|Qualcomm Incorporated
|Method and apparatus for locating a wireless local area network associated with a wireless wide area network
|Dec 8, 2006
|Oct 25, 2007
|Arnab Das
|Methods and aparatus related to determining, communicating, and/or using delay information in a wireless communications system
|Oct 13, 2006
|Nov 1, 2007
|Prashanth Hande
|Methods and apparatus for broadcasting loading information corresponding to neighboring base stations
|Dec 8, 2006
|Nov 1, 2007
|Arnab Das
|Methods and apparatus related to determining, communicating, and/or using delay information
|Dec 13, 2006
|Nov 8, 2007
|Arnab Das
|Methods and apparatus for communicating backlog related information
|Oct 25, 2007
|May 1, 2008
|Tam-Anh Chu
|Multiple-Buffer Queueing of Data Packets with High Throughput Rate
|Dec 6, 2006
|Jun 12, 2008
|Applied Micro Circuits Corporation
|Cut-through information scheduler
|Jul 28, 2008
|Feb 5, 2009
|France Telecom
|Apparatus and associated methodology of determining a transmission time per unit of a flow of data packets
|Aug 14, 2008
|Feb 18, 2010
|Verizon Corporate Services Group Inc.
|System and method for monitoring and analyzing network traffic
|Jul 14, 2006
|Aug 19, 2010
|Arnab Das
|Efficient reporting of information in a wireless communication system
|Mar 4, 2011
|Jun 23, 2011
|Qualcomm Incorporated
|Locating a wireless local area network associated with a wireless wide area network
|Mar 30, 2011
|Oct 6, 2011
|Fujitsu Limited
|Test method for network system
|Jul 19, 2011
|Nov 10, 2011
|Yongping Zhang
|Bandwith allocation method and routing device
|Apr 19, 2013
|Jun 23, 2015
|Genesys Telecommunications Laboratories, Inc.
|Method and apparatus for providing enhanced communication capability for mobile devices on a virtual private network
|Mar 7, 2013
|Jul 7, 2015
|Genesys Telecommunications Laboratories, Inc.
|Call and data correspondence in a call-in center employing virtual restructuring for computer telephony integrated functionality
|Dec 9, 2014
|Jul 5, 2016
|Genesys Telecommunications Laboratories, Inc.
|In-band signaling for routing
|Dec 19, 2014
|Sep 20, 2016
|Genesys Telecommunications Laboratories, Inc.
|Method and apparatus enabling voice-based management of state and interaction of a remote knowledge worker in a contact center environment
|Dec 9, 2014
|Dec 20, 2016
|Genesys Telecommunications Laboratories, Inc.
|In-band signaling for routing
|Dec 15, 2014
|May 2, 2017
|Genesys Telecommunications Laboratories, Inc.
|Method and apparatus for extended management of state and interaction of a remote knowledge worker from a contact center
|Dec 15, 2014
|Jun 13, 2017
|Genesys Telecommunications Laboratories, Inc.
|Method and apparatus for data-linking a mobile knowledge worker to home communication-center infrastructure
|Dec 15, 2014
|Jun 27, 2017
|Genesys Telecommunications Laboratories, Inc.
|Method and apparatus for data-linking a mobile knowledge worker to home communication-center infrastructure
|Nov 8, 2005
|May 10, 2006
|Sagem S.A.
|Method for dimensioning data frames of traffic flows on a link between two nodes of a transport network
|Jul 18, 2008
|Feb 11, 2009
|France Telecom
|Method of determining transmission time by the elementary pattern of a data packet flow
|Aug 7, 2009
|Apr 27, 2011
|Verizon Patent and Licensing Inc.
|System and method for monitoring and analyzing network traffic
|Aug 7, 2009
|Jul 18, 2012
|Verizon Patent & Licensing Inc
|System and method for monitoring and analyzing network traffic
|U.S. Classification
|370/412, 370/230.1, 370/468
|International Classification
|Cooperative Classification
|European Classification
|Sep 24, 1998
Owner name: XEROX CORPORATION, CONNECTICUT
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:LYLES, J. BRYAN;REEL/FRAME:009471/0994
Effective date: 19980916
|Jun 28, 2002
Owner name: BANK ONE, NA, AS ADMINISTRATIVE AGENT, ILLINOIS
Free format text: SECURITY INTEREST;ASSIGNOR:XEROX CORPORATION;REEL/FRAME:013153/0001
Effective date: 20020621
|Oct 31, 2003
Owner name: JPMORGAN CHASE BANK, AS COLLATERAL AGENT, TEXAS
Free format text: SECURITY AGREEMENT;ASSIGNOR:XEROX CORPORATION;REEL/FRAME:015134/0476
Effective date: 20030625
Owner name: JPMORGAN CHASE BANK, AS COLLATERAL AGENT,TEXAS
Free format text: SECURITY AGREEMENT;ASSIGNOR:XEROX CORPORATION;REEL/FRAME:015134/0476
Effective date: 20030625
|Aug 5, 2005
|Fee payment
Year of fee payment: 4
|Aug 10, 2009
|Fee payment
Year of fee payment: 8
|Sep 16, 2013
|Fee payment
Year of fee payment: 12


text:
The Novo Nordisk New Jersey Marathon & Half Marathon & 5K would not be possible without the help of our fantastic partners. Visit one of the pages below for more information.
Because racing is better with friends
The Novo Nordisk New Jersey Marathon & Half Marathon is proud to partner with so many great charities that give you the opportunity to race for a cause.
> Charity Partners
Check out the products and services offered in 2016 by our incredible sponsors.
> 2016 Sponsors
Partner News
- March 7, 2017
Doing The Legwork: One Mom Transforms Herself And Family Together TimeLissette Colón is undergoing a personal transformation. She wasn't in a bad place, she just decided that 2017 was going to […]
- February 21, 2017
#NJM2017 Runner's Spotlight: John Ryan Won't Let MS Stop Him From TrainingEditor's Note: John Ryan is a senior server analyst for RWJBarnabas Health, generous sponsor of the 2017 Novo Nordisk New Jersey […]
- February 14, 2017
Dating a Runner? 20 Things to Know About Your PartnerBy Keri Mandell Are you dating a runner? Maybe even married one? Or are you thinking about getting involved with […]

subset: commoncrawl


text:
This website uses cookies to remember your settings, statistics and target ads. This information is shared with third parties. | Close
Browse the list of used Vimek forwarders ads available for sale on Mascus. You may sort the Vimek forwarders ads by price, year of production, or country. Please use the left-hand side navigation to narrow your search, or read more about Vimek forwarders in Brands section.
Forwarders 59 h United Kingdom, BT62 1PL
Forwarders 2011 7,500 h Poland, 42-350 Cynków
Forwarders 2016 Sweden, Erikstad/ Mellerud
Forwarders 2017 Sweden, Floby
Forwarders 2017 Sweden, LIT


text:
I requested a roll up makeup brush holder and she sent me a BEAUTIFUL roll and *bonus* pouch! Here they are:
It has enough pockets, not only for my brushes, but also my liners, mascara and tools! It's so well made, durable and beautiful! I love it!
The zippered pouch is big enough for my to put the brush roll and all of my other products. But why do that when the roll is so pretty?!
mimiw, thank you SO much! I love it!


text:
It is well known that Alia Bhatt is a huge Kareena Kapoor fan. The actress has been vocal about her admiration for Bebo whom she apes.
Alia Bhatt, Shahid Kapoor and Kareena Kapoor
So, buzz from the sets of her film Shandaar is that Alia's mannerisms and talking style reminded her co-star Shahid Kapoor about his ex flame!


text:
Agency: Clemmow H Inge
Client: Britvic Drench
Britvic has launched a new digital and its first ever TV campaign as part of a new £5.5 million push.
The Drench Water work from CHI and Partners builds on its positioning around mental hydration. It features the puppet 'Brains' from Thunderbirds dancing to the 90s dance classic 'Rhythm is a Dancer' by Snap.
While keeping topped up on Drench he performs a unique combination of moves from crumpling to knee slides.
Online support at staydrenched.co.uk builds on the TV experience by giving viewers the opportunity to test their mental performance by making Brains dance using a webcam or keyboard.
3073 showcases match your criteria
Editor's pick - The Sun's campaign
View ad here
50% recommend it
Editor's pick - Morrisons shows off "For Your Christmas" ad
See ad here
Editor's pick - Little Caesars horses around with new ad
See here
Editor's pick - Toyota's new ad makes a break for reality
See ad here
Editor's pick: Paralympics ad, Meet the superhumans
View add here
Editor's pick - Carlsberg plays Steve McQueen in "The Crate Escape"
See ad here
Editor's pick - Go Compare guy gets what's been coming to him
View ad here
Editor's Pick - Phones 4u's "Upgrades 4 u and u"
See it here
Editor's Pick - McDonald's Euro 2012-themed Championship Menu
See the ad here
Editor's Pick - M&M's ad celebrates Queen's Diamond Jubilee
See the ad here
67% recommend it
Previous Next (page 1 of 308)


text:
No airlines/operators meet your search criteria.
An error has occurred
Long Stay is ideal for business and leisure travellers looking to combine convenience and value.
Distance and transfer times
To Enter:
Follow signs to our Long Stay car park. This car park operates an Automatic Number Plate Recognition System (ANPR) so the barrier should rise for you upon arrival. If not please press the call button for assistance. DO NOT insert your Credit Card, you may be charged again.
Once you have parked your vehicle in an open zone, board a courtesy bus which will drop you in front of the terminal building. Please ensure that the bus you board is going to the correct zone.
To Exit:
When you arrive back from your trip, follow in-terminal signs for 'Buses to Long Stay and JetParks car parks'. Courtesy buses are located at the Long Stay and JetParks bus stops in front of the terminal. Please tell the driver where you have parked (i.e. Long Stay, Zone E, Bus stop 3).
Once you've returned to your vehicle, drive up to the exit barrier. Either the barrier will raise or if you were issued with a ticket, insert your ticket. If you have pre-booked DO NOT insert Credit Card at the barrier as you may be charged again. The barrier will open for you to exit. If you experience any difficulties, please press the call button for assistance.
Find us with ease - add the post code into your sat nav:
Postcode: CM24 1SE (Accuracy of satellite navigation systems vary, please follow airport signage)
Directions from London
Exit the M11 at Junction 8a and follow the directions below:
- Take the left hand lane and follow the filter left.
- At Priory Wood Roundabout take the 1st exit onto Round Coppice Road, you will pass the Hilton hotel on your left.
-At the next roundabout take the first exit into the Long Stay car park.
Directions from Cambridge
Exit the M11 at Junction 8 and follow the directions below:
- Take the A120 exit to Stansted Airport.
- At Priory Wood Roundabout take the 2nd exit onto Round Coppice Road. At the next roundabout take the first exit, you will pass the Hilton hotel on your left.
- At the next roundabout take the first exit into the Long Stay car park.
Why not watch our handy directional video to familiarise yourself with the route?
Minimum Stay
Minimum 3 days, if you pre-book.
Turn Up Price
If you choose not to pre-book, the daily turn-up rate can be seen on our Turn-Up and Park page.
Blue Badge holders
Blue Badge Bays are located in Zone Q.
Height Restriction
Maximum height = 3.5 metres
Upgrade to Meet and Greet Parking
*Calls are free from landlines and mobiles.


text:
Pet Sitting & Drop In Visits in Montezuma, KS
Book a pet sitter to stop by your home a few times a day to feed and play with your cat or dog.
Experience exceptional service and a personalized match
From start to finish, we'll handle all the details for you.Learn About Premier
Rover also offers pet setting & drop ins in:
|Cimarron, KS
|Copeland, KS
|Ensign, KS
|Fowler, KS
|Ingalls, KS
|Meade, KS
|Pierceville, KS
|Plains, KS
|Sublette, KS
|Wettick, KS
The next time you head out of town and need someone to take care of your pets — and check in on you home — turn to Rover. It's easy to find a loving Montezuma pet sitter on Rover who'll give your pet one-on-one attention while you're away, and take care of your home. Search from hundreds of trusted pet sitters in Montezuma, KS, read sitter profiles, and reach out to sitters who seem like a good fit for you and your pet(s). We know it can be tough to leave your pet, which is why we encourage every pet parent and sitter to have a Meet & Greet before booking the stay. Then, when you're ready, book and pay for your house and pet sitter all through Rover — it's easy, safe, and cashless. You'll have the peace of mind knowing that your sitter has free premium insurance, a team of safety experts available 24/7, and will send you cute photo updates throughout the stay. Rover is the easiest way to find trustworthy Montezuma pet sitters and avoid the kennel.


text:
|Page (1) of 1 - 04/30/12
|email article
|print page
Lawyers spar over jailing of Ohio Amish suspectsFeds, defense spar over whether Ohio Amish hair-attack suspects deserve to await trial in jail
Page: 1
Related Keywords:Amish Attacks, Religious strife, Legal proceedings, Crime, General news, Christianity, Religion, Social affairs, Law and order
Source:Copyright 2012 The Associated Press. All rights reserved. This material may not be published, broadcast, rewritten or redistributed.. All Rights Reserved


text:
A century of design: design pioneers of the 20th century
Barron's Educational Series, Aug 3, 1998 - Art - 272 pages
The 20th century has been unique in the history of art and design, uniting creative imaginations with hi-tech and mass-production methods. The result has been well designed products available to an unprecedented number of people. Many of these objecs have found their way into the world's finest museums, but even more beneficial has been their presence and common use in households around the world. This volume tells this fascinating story, combining the history of modern design movements with a chronological review of 80 top designers, from Otto Wagner at the end of the 19th century to Jasper Morrison, a young designer making an impact today. In between you'll find profiles of some of the most influential creative minds of the 20th century, including Frank Lloyd Wright, Walter Gropius, Eero Saarinen, and many others. The book is as beautiful to look at as it is exciting to read. It contains more than 580 full-color photos covering a wide range of objects that include furniture, glass, ceramics, metalware, industrial products, and household appliances.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Common terms and phrases
20th century Aalto aesthetic American approach architect and designer architecture armchair Art Nouveau artists Bauhaus became Behrens Britain British career Cassina ceramics chair Charles Eames Christie's Images collaboration colour combined Corbusier craft created culture curved DACS decade decorative arts design movement developed Ettore Sottsass example exhibition frogdesign fumiture functional furniture designs Germany glass Gropius Herman Miller ideas industrial design influence influential innovative inspired interior design light London ltalian design ltaly Lucchi Lucienne Day Magistretti manufactured Marcel Breuer Marco Zanuso mass production materials metal Michele De Lucchi Milan modem modern design Modernist moulded plywood objects Olivetti Paris Pavilion Perriand Philippe Garner Philippe Starck pieces plastic post-war Produces designs projects radical range Richard Sapper Rietveld role Ron Arad seat simple Starck Studio style Swedish textiles traditional TRAINING AND EARLY Triennale tubular steel Vico Magistretti Victoria & Albert visual wood Zanuso


text:
Bupa has opened a new £5 million dementia care home in Thatcham which boasts 60 en-suite bedrooms.
Thatcham Court is a purpose-built care home fitted with themed and signposted corridors, and each floor has been painted with bright shades to minimise confusion.
The home also has a range of memory triggers which help to stimulate residents' recollection, including vibrant colours, themed rooms, pictures and bright floral prints.
Each bedroom also has a memory box fitted outside in which residents can place photographs, certificates and trinkets.
Home manager Sue Smith said: "We are extremely proud of the standard of specialist care we can provide to our residents. We will focus on providing our residents with the individual care that they need."
Ms Smith said that residents will be encouraged to live a full, active life.
She added: "We aim to achieve the ideal balance between providing the support that residents need and helping them to maintain the independence that they desire."
All staff at the new care home have completed a course designed by Bupa Care Homes, the Alzheimer's Society and the Joseph Rowntree Foundation to ensure they provide highly professional care.
Independent advice on private healthcare


text:
Genres Adventure
Adventure Movies
Movie List:
(ordered by release date)
|The Good, The Bad & The Ugly (1966)
For three men the civil war wasn't hell. It was practise!
Rating: 10 /10
|Superman (1978)
You'll Believe a Man Can Fly!
Rating: 8 /10
|E.T. The Extra-Terrestrial (1982)
His adventure on Earth.
Rating: 9 /10
|The NeverEnding Story (1984)
A boy who needs a friend finds a world that needs a hero.
Rating: 8 /10
|The Goonies (1985)
They call themselves "The Goonies." The secret caves. The old lighthouse. The lost map. The treacherous traps. The hidden treasure. And Sloth... Join the adventure.
Rating: 8 /10
|Explorers (1985)
The adventure begins in your own back yard.
Rating: 8 /10
|Big Trouble in Little China (1986)
Jack Burton's in for some serious trouble and you're in for some serious fun.
Rating: 8 /10
|Aliens (1986)
This time it's war.
Rating: 9 /10
|Flight of the Navigator (1986)
Take off on the ultimate fantasy adventure!
Rating: 8 /10
|Stand By Me (1986)
For some, it's the last real taste of innocence, and the first real taste of life. But for everyone, it's the time that memories are made of.
Rating: 8 /10
|Predator (1987)
Soon the hunt will begin.
Rating: 8 /10
|The Abyss (1989)
There's all you've known about adventure. And then, there's The Abyss.
Rating: 8 /10
|Total Recall (1990)
Get ready for the ride of your life.
Rating: 8 /10
|Ace Ventura: When Nature Calls (1995)
New Animals. New Adventures. Same Hair.
Rating: 8 /10
|Armageddon (1998)
Time to kick some asteroid.
Rating: 8 /10
|Gladiator (2000)
A general who became a slave. A slave who became a gladiator. A gladiator who defied an emperor.
Rating: 10 /10
|Kingdom of Heaven (2005)
Rating: 10 /10
Coming Soon
More movies coming soon
There are plenty more movies from the 'Golden Era' that we know need to be added to movieneon.com, and that is the journey we are on. It's going to take time, as we want to give every film the detail and credit it deserves!


text:
Davis Media Access operates KDRT 95.7, Davis Community Television, and Educational Access Channel 17. DMA is a dba of Davis Community Television, a 501(c)(3) non-profit corporation and all donations are tax deductible.
Please join our current donors.
All transactions are processed by iAts Payments. Davis Media Access does not store credit card information and all data is transferred securely using a extended validation SSL certificate.
Women's Small
Women's Medium
Women's Large
Women's X-Large
Women's 2X-Large
Women's Small (Natural)
Women's Medium (Natural)
Women's Large (Natural)
Women's X-Large (Natural)
Women's 2X-Large (Natural)
Women's Small (Stone Blue)
Women's Medium (Stone Blue)
Women's Large (Stone Blue)
Women's X-Large (Stone Blue)
Women's 2X-Large (Stone Blue)
Men's Small
Men's Medium
Men's Large
Men's X-Large
Men's 2X-Large
Men's Small (Natural)
Men's Medium (Natural)
Men's Large (Natural)
Men's X-Large (Natural)
Men's 2X-Large (Natural)
Men's Small (Stone Blue)
Men's Medium (Stone Blue)
Men's Large (Stone Blue)
Men's X-Large (Stone Blue)
Men's 2X-Large (Stone Blue)
The information you provide will NOT be shared with any third party organizations.
Thank you for getting involved in our campaign!
On behalf of all of us at Davis Media Access (DMA), thank you for your support of our programs and services.


text:
No, the new album from Sufjan Stevens is not a concept record about Alaska, Louisiana, Montana or any of the 50 states for that matter. Yet while his ambition of creating a musical-map of our country may have subsided (for the moment), the new full-length album The Age Of Adz is a sonic adventure all to itself.
Kings of Leon were propelled to stardom with the release of their 2008 Grammy nominated album Only By The Night. Their 5th studio album Come Around Sundown, another collection of undeniable rock anthems, comes almost exactly two years after and does little to lessen the argument that the Followill family currently reign as the biggest rock band in America.
While World Cafe is a year away from officially turning 20 years old, Live At The World Cafe Volume 30 is being released today. Another fantastic, fine collection of Cafe recordings, recorded live in the World Cafe Performance Studio at WXPN in Philadelphia.
Wake Up! is a one-of-a-kind collaboration first conceived roughly two years ago amidst the buzz of the Presidential election season. Similar to the minds of many, soul sensation John Legend and hip-hops most versatile players The Roots connected a likeness of the events of 2008 to the socially charged music of the '60s and '70s. Wake Up! is as much a testament to the power of that music as it is a literal 'wake up' call to a new generation.
Which direction Robert Plant turns next is anyone's guess. After his hugely successful collaboration album with Alison Krauss, Raising Sand, the Led Zeppelin frontman decides to turn back the clock on his latest solo effort Band Of Joy. Besides being the title of the new album, Band Of Joy references Plant's pre-Zeppelin blues band with drummer John Bonham. Band Of Joy is a bluesy, Americana collection comprised mostly of covers and supported by an all-star cast of musicians.
Promise and Potential are two words that often bring with them as much excitement as they do disappointment, especially in the case of young musicians. So, you can't blame many of us for holding our breath in anticipation of the full-length debut album from the artist that simply goes by the name Lissie. The twenty something songwriter, originally from Rock Island, Illinois, perked our ears last year with her debut EP Why You Runnin'. And upon the release of Catching A Tiger not only could we exhale but applaud the collection as one of the years truly dynamic debuts.
In a time where most country musicians seem as glitz and glam as their pop music counterparts, it's songwriters like Ryan Bingham who remind us that it's not just the hat you're wearing but the words you're spilling that make you a country artist. Now on his third proper album, Junky Star, Bingham continues to impress as a songwriter offering a collection of songs that stress his talent with wordplay and emotion.
It's a bit hard to believe that God Willin' & The Creek Don't Rise is the fourth album from the soulful singer-songwriter Ray LaMontagne. It doesn't seem so far off from when many of us first stopped us in our tracks upon hearing the song "Trouble" from his debut album. But over the course of his career, Ray has captivated audiences with an emotionally driven songbook, a voice that summons goose bumps and a fascinating aversion to the spotlight he so requires.
For nearly 40 years, Los Lobos has been an inspiring model of consistency in the world of rock and roll. It's difficult (if not impossible) to think of bands over the past four decades that have maintained the same line-up and continue to engage at such a high level as Los Lobos do on their brand new studio album, Tin Can Trust.
For many, Omni, the new album from the Seattle-based band Minus the Bear is an introduction. However, as fans of the experimental rock band already know this is a band and a sound, that for years has escaped mainstream success, yet record after record saw their fan base only grow larger. On stage the music of Minus the Bear is undeniable from small club stages to major festivals. Until Omni however, harnessing their fearlessness for sonic boundary, seductive lyricism and muscular energy never seemed so easy.


text:
Have you just heard about virtualization? In IT, this word is something that you should not missed and if you are interested in getting better result for your data centers or even Cloud Storages of business, this is something you need to learn and understand. If you are someone who is very much interested in making investment for the benefit of your business, then the Microsoft Hyper-V is the best for you.
The Hyper-V is one of the most innovative Virtualization Software available on the market which could is known to be really flexible and efficient for the needs and preferences of the users. This would be able to help you in the maintenance and deployment of your applications and possible help to reduce the price you have to pay by simply consolidating more things to do with the use of fewer servers.
But, if you are having doubts and second thoughts, then there are more things you have to know and understand when it comes to this.
How it Works?
The Microsoft Hyper-V would be able to help you in managing and creating a more virtualized computing system by means of the virtualization technology that is currently found in Windows server. Installing this kind of software would possibly require some components and it is important for you to become familiar and determine if those things are just enough for you to consider on this. On the other hand, you can also expect that there are management tools provided that would help you to easily get the benefits it could offer without problems.
Some of the possible components that you need to have are Hyper-V virtual machine management service, Windows hypervisor, WMI provider and other components that are commonly being used for virtualization. You can do research in order to have a better idea on this. A lot of people would make use of this for a better system to use for business and it is surely a good investment not only for small, but for bigger corporates as well.
With a big competition on the market, making investments on this kind of process would help you to provide a better quality of experience, not only to your consumers on the market but as well as to the different people who are working under you and possibly the one who are making interactions with the server and system that you have.