text:
|Publication number
|Publication type
|Application number
|Publication date
|Mar 22, 2005
|Filing date
|Mar 18, 2003
|Priority date
|Dec 18, 1998
|Fee status
|Also published as
|Publication number
|Raymond J. Kloth, Thomas J. Edsall, Michael Fine, Dinesh G. Dutt
|Original Assignee
|Cisco Technology, Inc.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (53), Non-Patent Citations (5), Referenced by (60), Classifications (23), Legal Events (3)
|External Links: USPTO, USPTO Assignment, Espacenet
This application is a continuation application based on U.S. patent application Ser. No. 09/213,105, filed on Dec. 18, 1998 now U.S. Pat. No. 6,643,260.
1. Field of the Invention
This invention relates to the field of data communications networks. More particularly, this invention relates to a method and apparatus for implementing a quality of service (QoS) policy in a data communications network so as to thereby prioritize network traffic into a plurality of service levels and provide preferential treatment of different classes of data traffic on the data communications network. A number of priority levels may be implemented in accordance with the invention.
2. Background
This invention relates to switched packet data communications networks. There are a number of different packet types which are used in modern switched packet data communications networks.
One special case of Layer 2 encapsulation is the IEEE 802.1q frame shown schematically in FIG. 1B. The IEEE 802.1q frame (or packet) 20 has a MAC Destination Address ("DA") 10, a MAC Source Address ("SA") 12, a Data Portion 14, and a CRC 16. In addition, within block 18 is the IEEE 802.1q "tag" 22 which includes, among other items, a block of three priority ("PRI") bits 24. These three bits are also known as a "Class of Service" or "CoS" field.
As the use of data communications networks increases worldwide, congestion of those networks has become a problem. A given data communications network, a given node on a data communications network, or a given link connecting two nodes has a certain capacity to pass data packets and that capacity cannot be exceeded. When data traffic on the data communications network becomes heavy enough that one can anticipate congestion problems, it is desirable to implement a "Quality of Service" or QoS policy so as to give priority to certain types of traffic and restrict the flow of other types of traffic, thus assuring that critical communications are able to pass through the data communications network, albeit at the expense of less critical communications.
One of the problems that network devices face in implementing quality of service solutions is in identifying and grouping transmissions to be given preferential treatment or to be restricted, that is, to prioritize the traffic in accordance with the Quality of Service policy established for the network. This becomes especially critical as bandwidth increases substantially over certain links while other links remain relatively slow resulting in traffic speed mismatches which, in turn, cause bottlenecks to data traffic over the relatively slow links. Such groupings must be consistently applied to traffic and must be applied at the rate that the traffic is passing without introducing additional delays or bottlenecks. Such groupings may be, for example, by protocol type, by destination IP address, by source IP address, by destination/source IP address pair, by source port and/or destination port (Layer 4), and the like.
Routers have, in the past, kept packet counts and rate limited packets in software, but router software has not scaled to the level of being able to process millions of packets per second through a node, providing the basic routing functions that they are required to provide and being able to also provide the rate limitation function.
One approach to identifying and grouping transmissions is for the host to categorize packets by use of the L2 CoS field, L3 ToS field, or both. The primary disadvantage of this approach is that it removes control from the system administrator and requires one to trust the end stations to the communication to properly implement the QoS policy. In some cases this trust cannot be justified. In addition, an end station only sees its own packets and therefore is unaware of the overall resource requirements within the data communications network and cannot make allowances for these requirements.
Accordingly, a Quality of Service policy controlled by a network system administrator is needed together with a mechanism for applying it at the full data rate of the data communications network.
In a first aspect of the invention, a content addressable memory (CAM or L3 Table) contains flow information for each active flow of packets passing through a given node of a data communications network. The CAM has associated with each entry (corresponding to each active flow) a packet counter, a number of bytes seen counter, a token bucket, and a contract value or committed access rate. Each flow is assigned one of a plurality of output queues and optionally at least one output queue threshold value. A token bucket algorithm is employed on each flow to determine whether packets from that flow exceed a committed access rate. Such packets may be dropped or optionally modified to reflect an alternate output queue and/or alternate output queue threshold value before being sent to the selected output queue for transmission from the node.
In a second aspect of the invention an access control list CAM (ACLCAM) contains masked flow information such as, for example, all or portions of IP source and/or destination addresses, protocol types, and the like. The ACLCAM provides single clock cycle accesses when performing lookups for each packet. The ACLCAM provides an N-bit index value in response to QoS lookups based upon the best match for the current packet.
The best match is order dependent for the entry in the ACLCAM and may represent any field in the packet upon which the administrator of the data communications network wishes to base traffic rate limiting and prioritizing decisions. A plurality of ACLCAM entries can yield the same N-bit index value. The N-bit ACLCAM index selects one of 2N internal counters and associated preconfigured contract values, which become affected by the packet statistics. A token bucket algorithm is employed on these counters as discussed above.
The ACLCAM may also be used to determine the QoS parameters for new entries in the L3 Table as they are created. In addition, it is used to select an entry in the aggregate flow table described below.
In a third aspect of the invention, an aggregate flow table contains information specifying plural flows—for example all traffic between x and y regardless of type, all traffic to x of a certain type, all traffic from anyone of a certain type, and the like. These specifications may specify more than one flow. This is possible because each entry has a corresponding flow mask. This is different from the L3 Table which may identify certain specific flows only, i.e., all traffic of protocol type HTTP from x to y. Since the entire L3 Table operates with a single flow mask, each entry will have identical specificity, thus, there could be multiple entries for traffic from x to y if such traffic includes multiple protocol types and the flow mask does not mask the protocol type, for example.
In a fourth aspect of the invention, the CAM, an aggregate flow table, and the ACLCAM are combined in one system and used to produce, in parallel, a pair of traffic rate limiting and prioritizing decisions for each packet. The two results are then resolved (if in conflict) to yield a single result which is acted upon. The result is to modify or not modify the packet's CoS and/or ToS (or other) fields and to drop or pass the packet onto the next node of the data communications network.
Those of ordinary skill in the art will realize that the following description of the present invention is illustrative only and not intended to be in any way limiting. Other embodiments of the invention will readily suggest themselves to such skilled persons from an examination of the within disclosure.
In accordance with a presently preferred embodiment of the present invention, the components, process steps, and/or data structures are implemented using ASIC technology. This implementation is not intended to be limiting in any way. Different implementations may be used and may include various types of operating systems, computing platforms, and/or computer programs. In addition, those of ordinary skill in the art will readily recognize that devices of a more general purpose nature, such as hardwired devices, devices relying on FPGA technology, and the like, may also be used without departing from the scope and spirit of the inventive concepts disclosed herewith.
Unless data communications networks are provisioned with large excess bandwidth, there may be times when the offered load at a given link will be greater than the capacity of that link. This results in greater than average packet delay or even dropping packets in excess of the link capacity. While this may be acceptable to many applications, it can effectively result in loss of service for others. Furthermore, user policies may dictate that some traffic is more important than other traffic and should, therefore, be given preferential treatment in these congestion situations. Even in non-congested conditions, it may be desirable to give preferential treatment to traffic with more stringent real time requirements (such as voice and video) so as to avoid the delay incurred waiting for the transmission of long packets with less stringent real time requirements.
Providing preferential forwarding treatment to some traffic, perhaps at the expense of other traffic, is referred to by the general term Quality of Service (QoS). QoS comprises four distinct functions. These are (1) Classification; (2) Rate Limitation; (3) Packet Rewrite; and (4) Scheduling.
Classification is the process by which a QoS label is assigned to a packet. The QoS label is represented by a codepoint used internally by the device which determines how the packet is treated as it flows through the device. A codepoint is an integer or other representation representing the QoS classification that the device assigned the packet to. The codepoint also determines the value written into the packet's CoS (for 802.1q packets) and ToS (for IP packets) fields.
CoS means Class of Service. This is the name given to three bits in the Layer 2 header (CoS 24 in
ToS means Type of Service. It is a preferably 0 byte (8-bit) field in the IP header (ToS 26 in
Input to the classification function includes user policies that map ACEs to codepoints. ACE means access control entry. It is a filter that is used to identify flows with certain characteristics. It includes fields such as device input and/or output ports, input and/or output VLANS, Layer 2 addresses, Layer 3 addresses, TCP/UDP (Layer 4) port numbers, and the like.
A committed access rate (CAR) is the bandwidth that a specific flow or group of flows will be limited to. The CAR can be enforced by rate limitation (dropping out-of-profile packets under certain levels of congestion in accordance with a selected algorithm) or by shaping.
The result of classification is a codepoint assigned (internal to the device) to the packet. (Depending on the user policies, it may simply be set to the CoS or ToS or other field initially taken from the packet).
There are three ways that user policy can control the classification of a packet.
In accordance with a presently preferred embodiment of the present invention, the algorithm for determining the codepoint of a packet consists of three distinct steps.
First, the packet is classified on the basis of the input port. If the port is a trunk port (carrying traffic from multiple VLANs) and the packet has an ISL or 802.1q header then the to classification of the packet is the CoS of the packet. If the port is a trunk port and the packet does not have an ISL or 802.1 q header, or the port is an access port (carrying traffic for a single VLAN), then the classification of the packet is set to the CoS value configured on that port. Each port is configured with a single CoS value.
Second, a check is made to see if a CoS has been explicitly configured for the packet's MAC destination address. If it has, then the packet is assigned the CoS configured for that address replacing the previously assigned CoS.
Third, a check is made to see if it matches any of the configured ACEs. If the packet matches a configured ACE, then the packet is assigned the CoS corresponding to that ACE, replacing the previously assigned value. Once a matching ACE is found, no others are checked. Thus, the order of the checking of the ACEs matters or a mechanism is required to resolve multiple matches.
Rate limitation or traffic restriction is the process by which the switch limits the bandwidth consumed by an individual flow or a group of flows counted together as an "aggregate". Rate limitation consists of two stages. The first stage determines if a given packet is in profile or out of profile. That is, whether or not the packet causes the flow (or aggregation of flows) to exceed its allotted bandwidth (CAR) or not. An "in profile" packet is a packet that does not cause the CAR of the packet's flow to be exceeded. An "out of profile" packet is the converse. The second stage of rate limitation assigns an action to apply to packets that are out of profile. This action may be either to reassign the packet a new codepoint or to drop the packet. Input to the rate limitation function includes: (1) user policies in terms of ACEs and QoS parameters; (2) device input port (or subnet or VLAN); (3) the codepoint the switch assigned to the packet; and (4) the packet flow including layers 2, 3, and 4. The output is a new codepoint, which may be either the original one or the new one, and a Boolean value to indicate whether or not to drop the packet. If the packet is dropped the new codepoint is irrelevant.
Packet rewrite is the process by which the device writes a new CoS 24 (for all IEEE 802.1q packets) and/or ToS 26 (for IP packets only) into the packet. These values are derived from the codepoint, preferably through a conventional mapping function. Input to the rewrite function is the packet's codepoint, the codepoint to CoS mapping, and the codepoint to ToS mapping. Other types of packets may employ packet rewrite such as ISL encapsulated packets and the like.
Depending on how the packet is classified, the rewrite function rewrites either the packet CoS 24 or both the CoS 24 and the IP ToS 26. If the packet is classified on the basis of an IP ACE, then both the CoS and the ToS are rewritten.
Note that for packets going out an access port or where the packet's VLAN is the native VLAN of a trunk port, the packet may be transmitted without an ISL or 802.1q header. In this case the CoS value is lost once the packet leaves the device. However, the CoS value is still used internally by the device in performing the scheduling function.
Scheduling includes the process by which the device picks an output queue for the packet, the policy for dropping packets when the queue exceeds some threshold (tail drop (dropping packets while the threshold is exceeded), RED (random early detection), etc.) and the algorithm for servicing the various queues (priority queueing, WRR (weighted round robin), etc.). Input to the scheduling function includes user policies that specify queue and scheduling configuration; user policies that map codepoints to queues; and the codepoint that was the output of the rate limitation function, i.e., the packet's current codepoint. The packet is enqueued on the appropriate queue or (perhaps randomly) dropped if the rate exceeds the CAR for this codepoint.
The processing of the packet is diagrammed in FIG. 2. The first operation after arrival of the packet at block 60 is preferably an input queue scheduling process 61 where packets can be dropped (at reference numeral 62) at the input to the device under congestion conditions if an input threshold based upon the codepoint is exceeded. The next operation is preferably input classification 63 since it is not generally possible to do any of the other functions before the packet has been classified. In classification, the codepoint (from which may be derived the ToS and/or CoS) of the packet is determined. The codepoint is determined for all packets even if they are not packets which normally include ToS and/or CoS fields and these ToS/CoS values are used internally to the device.
Immediately after input classification is input rate limitation 64 where at block 65 the packet may be dropped or its codepoint altered based upon stored policies configurable by an administrator of the system. For example, if an out-of-profile packet arrives, then it may be dropped or its codepoint may be altered to make it more likely to be dropped down the line.
Following input rate limitation 64 is a forwarding decision 66. The forwarding decision 66 is not a part of the QoS, but it determines the output port of the device to use which, in this general model, is a parameter to the output queue scheduling process 70 discussed below.
Following this is the Packet Rewrite operation 68 where the CoS and/or ToS or other field of the packet is rewritten if appropriate and desirable.
Next, output queue scheduling 70 is performed and the packet is directed to an appropriate queue of the previously selected output port based upon the codepoint determined for the packet in the classification operation or the packet's subsequently altered codepoint. The threshold for the output queue is also selected here.
Finally, at 72 the packet is sent to the next node in the data communications network.
In an alternative embodiment, the device output port (or subnet or VLAN) could be a parameter to the classification function and, thus, a second classification function and a second rate limitation operation could be applied after the forwarding decision.
Output scheduling depends upon the capabilities of the output port. Most prior art ports are FIFO (first in, first out) ports. Such ports are not capable of output scheduling in accordance with all aspects of the present invention. In accordance with one presently preferred embodiment of the present invention, an output port having two queues each with two configurable WRED (weighted random early detection) classes is used. WRED is well known to those of ordinary skill in the art. Each CoS is mapped as desired to one of those WRED classes. For each class there is preferably a low threshold Th1 and a high threshold Th2. The low value Th1 specifies the average depth of the queue below which packets that map to that threshold's class will not be dropped. The high value Th2 specifies the average queue depth above which packets will be dropped with probability 1. For average queue depths between the low and high values, packets are randomly dropped. This is shown in
In accordance with another presently preferred embodiment of the invention, packets are queued for transmission in one of a plurality of output queues. For example, two queues could be used, for example, a high priority queue and a low priority queue, or a voice queue and a data queue. Many queues could also be used to give more range to the priority processing of packets.
In accordance with a presently preferred embodiment of the invention, each queue has a fixed depth or memory capacity. Variable depth queues could be used as will be recognized by those of ordinary skill in the art. Each queue also has associated with it at least one threshold, the value of which is programmable.
As presently preferred, a WRED (weighted random early detection) algorithm may be used to determine the probability of dropping a packet based upon the state of fullness of its queue. For example, in a queue having two thresholds Th1, and Th2 (see
By selecting a relatively low value for Th1 for the low priority queue, the low priority traffic in the low priority queue will be dropped well before high congestion is experienced on the data communications network. On the other hand, a much higher value for Th1 is appropriate for mission critical frames—for example: do not drop until the queue is 100% full.
In effect, this system allows for certain high priority traffic to get through at the expense of other traffic in a device having multiple output queues and/or multiple thresholds rather than being subjected to a pure FIFO processing modality.
The output queue select (OPQSEL) value derived from the codepoint determines the queue selected for a multiple queue environment. For example, one might want to assign a relatively high priority to frames carrying voice information such as in IP telephony. This would minimize dropouts and pauses and make the conversation appear to be occurring essentially in real time without significant delays. Similarly, IP video frames might be handled in the same or a similar way. Alternatively, one might assign the high priority queue to users paying an additional fee to obtain the use of the high priority queue. Those of ordinary skill in the art will realize that many possibilities are capable of being implemented with the present invention.
Detailed Implementation
Content addressable memories ("CAMs") are well known to those of ordinary skill in the art. Such memories are typically a fixed number of bits wide and a fixed number of addresses long. For example, a CAM might be 80 bits wide by 8K (8192) addresses long. A binary CAM would include at each bit position a capability of comparing a data vector, say 80 bits long, against a programmed content of the particular address. In a binary CAM, the data vector would simply be compared binary bit for binary bit to the binary contents of the given address and a determination would be rendered as to whether a match existed or not. A ternary CAM or "TCAM" adds a capability of comparing its contents not only to a data vector having a 0 or a 1 at each bit position but also to a bit position having a wild card or "don't care" condition usually represented by an "x". Thus if a TCAM entry having a data vector {0, x} representing 0 in the left bit position and "don't care" in the right bit position is compared to an input data vector having the value {0,1} there will be a match. There will also be a match if the input data vector has the value {0,0}. However, the values {1,0} and {1,1} for the input data vector would both yield a no match condition. In certain types of addressing schemes, certain bits are more meaningful than other bits, thus this ability to have a "don't care" selection (in effect, to mask certain bits) can be very useful.
A method of using a TCAM (or CAM) is to take a data vector and test it sequentially against each address of the TCAM until a match is found, then to use the address of the match to index to a location in memory containing an appropriate response to the match condition. Another method is to apply the data vector essentially simultaneously to all addresses in the TCAM or CAM and to index off of a match, if any are found. In case of multiple matches, a method of resolving the multiple match is required. Preferably, the first match is used and the rest of the entries are ignored to provide priority to the first match. A match is always guaranteed in accordance with a presently preferred embodiment of the present invention by providing a default match for instance where no other match is found.
Every frame passing through the device is preferably checked simultaneously against two tables:
The netflow switching CAM has associated with each entry (corresponding to each active flow) a packet counter, a number of bytes seen counter, a token bucket count, and a contract value in terms of rate and bucket size. A token bucket algorithm is employed on each flow to determine whether packets are in or out of profile and/or what threshold (OPQTH) to assign. All updates to the CAM are preferably done in hardware. The default OPQTH value can be overridden for solicited bandwidth reservations (e.g., RSVP flows) only.
The Access Control List CAM (ACL CAM) preferably provides single clock cycle accesses when performing a match check for each packet. This leaves plenty of bandwidth to perform an additional QoS lookup based upon the best match for the current packet. The best match is order dependent for the entry in the ACL CAM, and may represent any field in the packet upon which the administrator wishes to base rate limitation decisions. More than one CAM entry can produce the same n-bit CAM index. The n-bit CAM index selects one of 2n internal hardware counters and associated preconfigured contract levels, which become affected by the packet statistics. The same or a similar token bucket algorithm applied in the netflow CAM counters is applied on these counters, allowing aggregation of traffic to be processed in parallel. The processing results from the netflow CAM and the aggregate counters are combined to produce a final new codepoint or drop decision for the current packet. Because this QoS approach is applied at the hardware level, it can run at the line rate of the system and avoid any effect on the overall switching performance of the system.
Potentially a match will be found in both tables (the L3 table and the aggregate table) based upon two independent match criteria. As pointed out above, the aggregate table will always produce a match with at least a default mask. Both tables maintain a last-seen timestamp and a token bucket. When a match occurs, the two independent bucket counts are examined to determine the frame's output queue (OPQSEL) and output queue threshold (OPQTH). If either bucket count exceeds a corresponding contract value, then two independent rate limitation decisions are made. Either of these decisions may result in dropping or changing the packet. Finally the two independent rate limitation decisions are resolved to produce the final rate limitation decision for the frame.
Token bucket algorithms are well known to those of ordinary skill in the art. The basic idea is to provide a method of averaging a value which may come in spurts, such as a data transmission. In accordance with a presently preferred embodiment of the present invention, a token bucket algorithm is implemented with a counter for each table entry in the aggregate table and the L3 table. The counter is incremented for each in-profile byte associated with the flow passing through the system. A minimum byte increment may be enforced for short packets. The counter is decremented by a fixed number (the "leak rate") associated with the passage of a given amount of time. The leak rate corresponds to a contract value. This has the effect that the value stored in the counter will not grow over time as long as the leak rate exceeds or equals the data throughput rate for the flow. However, where the data throughput rate exceeds the leak rate for a significant period of time, the counter value will grow.
In a presently preferred embodiment of the present invention, the actual computation of the value of the bucket count is made only when a flow hit occurs. Then the bucket count is decremented by the difference between the current time and the last seen time in time units multiplied by the leak rate (per time unit) and incremented by the number of bytes in the frame that had the flow bit.
Turning now to
The packet is also routed from line 73 to a pair of TCAM lookup operations. The first type of TCAM lookup 80 is an aggregate table lookup which provides an index to the Aggregate Table 84 and returns a two-bit priority code on line 86 for combining the two ToS values. For example, the 2-bit priority code can indicate how to handle conflicts, e.g., "use the lowest threshold of the two ToS values", or another scheme could be used as will now be clear to those of ordinary skill in the art.
The second type of TCAM lookup 82 is an L3 Table lookup. For each frame a TCAM L3 table lookup 82 is performed and provides the contract value and token bucket counter indirectly through an index that in a preferred embodiment selects 1 of 64 choices. When hardware creates an entry in the L3 table 76, it writes these parameters into the L3 table 76 over line 89. Later when a frame matches the entry, there are 2 sets of parameters provided:
The CAM or TCAM 88 will be logically separated into a Layer 3 Table QoS policy area and an Aggregate QoS policy area.
The data from the TCAM L3 Table lookup 82 is applied as an input to MUX 90 on line 91 as is the current data from the L3 table 76 on line 92.
A selection value on line 94 from the L3 Table 76 selects whether to use the parameters from the TCAM L3 Table lookup 82 or the parameters from the L3 table on line 92.
By default, the parameters coming from the TCAM L3 Table lookup 82 are used. The system can be told with software to use the parameters stored in the L3 Table 76 instead. This approach is desirable when the parameters have been modified by software intervention. The L3 Table parameters may be initially set by software prior to flow existence or overridden by software. The L3 Table 76 initially learns its parameters by performing TCAM L3 Table lookup into the TCAM 88.
The selected information include the contract value and is applied over line 96 to the L3 table rate limitation block 98. A token bucket is operated as discussed above over line 100 with the L3 table 76. The outputs of L3 table rate limitation block 98 include "L3TOS", an 8-bit representation of the calculated ToS for the packet, "L3DROP", a value indicating whether or not to drop the packet based upon it being out of profile or not, and "L3 ALTER", a one-bit value indicating whether or not to alter the codepoint of the packet.
The aggregate table side operates similarly. The bank of aggregate counters used for token bucket analysis is pre-configured with the codepoint and the token bucket parameters to use. The priority is not stored, allowing different policies to map to the same aggregate counter (several matches may map to the same aggregate counter index, with different priorities for resolving which ToS to use, depending upon the actual flow).
The TCAM aggregate table lookup 80 into TCAM 88 provides an index on line 101 used to access the Aggregate Table 84. The contract value and token bucket counter are used in aggregate table rate limitation 102 to produce "AGTOS", the ToS based upon the aggregate table processing branch 220 of
The packet processing described herein is based upon the DS/ToS definition. If a valid ToS/CoS is not available, e.g., for a non-802.1 q and non-IP packet, a working value is derived from other sources for internal use as discussed above. For legacy ToS definitions (i.e., the present ToS definition), the precedence bits from the ToS are mapped into DS/ToS values with a conventional mapping. For frames that are not IP, the 3-bit CoS field is mapped into an 8 bit ToS field with a conventional mapping. This approach is also applied if the DS/ToS field of an incoming IP frame is assumed to be invalid for some reason.
The ToS remap takes any input ToS and maps it to a final AGTOS or L3TOS. It is configured by software. The meaning of the various possible values of the 8-bit ToS may be set by software as desired.
Turning now to
Turning now to
TOSL3AG, L3ALTER, AGALTER, and the two-bit priority value are applied to a programmable 5:1 decoder 106. Using a selected mechanism to resolve the various inputs (it would be as simple as "always choose L3TOS"), a bit on select line 108 to MUX 110 chooses L3TOS or AGTOS which is then provided on line 112. Optionally certain bits of the original ToS ("ORIGTOS") may be passed through and used to override the value on line 112 using bit mask 114 and MUX 116. The output of this process on line 118 is applied to 8:3 CoS Mapping 120 which results in a 3-bit output on line 122. This is in turn, optionally applied to MUX 124 where, if the "DO NOT CHANGE" signal 126 is asserted, the original CoS value "ORIGCOS" on line 128 is passed as CoSF on line 130, otherwise the value of CoS on line 122 is passed as CoSF on line 130.
Similarly, the calculated ToS on line 118 is applied to MUX 132 where, if the "DO NOT CHANGE" signal 126 is asserted, the original ToS value "ORIGTOS" on line 134 is passed as ToSF on line 136, otherwise the value of ToS on line 118 is passed as ToSF on line 136.
Finally, L3DROP and AGDROP are combined and resolved as follows. The two-bit priority value, L3DROP, and AGDROP are applied to a 4:1 programmable decoder 138 to obtain a dropping decision in accordance with a programmable policy. Preferably the priority value is used to select L3DROP or AGDROP. Other policies could also be programmed, such as, for example, "always use L3 DROP." The result is output on line 140. A device such as a to programmable 2:1 encoder 142 combines the signal on line 140 with a "DO NOT CHANGE" signal on line 126 to yield a signal DROPF on line 144 which follows the signal on line 140 unless "DO NOT CHANGE" is asserted, whereupon the value of the signal on line 144 is set to "DO NOT DROP."
If the packet is not from a trusted source or if bypassing is not implemented, then control is passed to reference numeral 216 in FIG. 5A. At reference numeral 216 the packet is parsed for its micro flow. In this process, the pertinent part of the flow is extracted for use in accessing the CAMs associated with the Layer 3 Table and/or the Aggregate Table.
Now, in accordance with a presently preferred embodiment of the present invention, control passes in parallel along branches 218 and 220 proceeding from reference numeral 216. Branch 218 processes information using the Layer 3 Table approach discussed above. Branch 220 processes information using the ACL CAM/Aggregate Table approach discussed above. While it is preferred to do both in parallel, either can be used exclusively and is still within the inventive concepts disclosed herein.
Following branch 218, the micro flow is compared to the entries in the Layer 3 Table at reference number 222. The closest match will result in obtaining either directly, or through a pointer, the OPQSEL (output queue select) and OPQTH (output queue threshold) values for the micro flow (assuming that the micro flow has been seen recently and is therefore contained in the Layer 3 Table). In accordance with a presently preferred embodiment of the invention, the OPQSEL can be either 0 or 1 representing two output queues and the OPQTH can be 0, 1, 2, or 3 representing four levels of threshold. The three-bit CoS value is simply the OPQSEL bit and the two OPQTH bits. This value is sent to the port to control output queue selection and threshold. Control is then transferred at 224 to reference numeral 214 of FIG. 5B.
Similarly, following branch 220, the micro flow is masked at reference numeral 226 and compared to the entries in the ACLCAM/Aggregate Table. Preferably, the first match is reported and an OPQSEL and OPQTH value derived there from. At reference numeral 228, control is transferred to reference numeral 214 of FIG. 5B.
The process starting at reference numeral 214 is performed for both branch 218 and branch 220 separately.
If the policy is so set that rate limiting is in effect, then at reference numeral 230, control transfers to the token bucket process starting at reference numeral 232. Otherwise, at reference numeral 234, control is transferred to reference numeral 236 of FIG. 5D.
The token bucket works as follows. At reference numeral 232 a byte count denoted "BYTECOUNT 1" is read from the data store associated with the L3 table or the aggregate table. "BYTECOUNT 2" is set to BYTECOUNT 1+MAX (MINBYTES, PKTBYTES), that is to say that the byte counter is set to be incremented by the larger of the number of bytes in the present packet or some minimum number of bytes which will be attributed to small packets. This is done to take into account the fact that small packets have a larger real overhead to the communications network than their respective byte counts would tend to indicate, thus they are treated as if they have an artificially larger number of bytes. This process is optional. "BYTECOUNT 3" is set to the original value of BYTECOUNT 1 to hold it for future use detailed below.
Once the byte count is determined at reference numeral 232, control transfers to reference numeral 238. At reference numeral 238, a determination is made as to whether the minimum time stamp interval has elapsed since the last packet was processed which matches the characteristics of the micro flow being processed. If not, then reference numeral 240 is skipped. If the minimum interval has elapsed, then reference numeral 240 decrements BYTECOUNT 2 by the leak rate ("LEAKRATE") multiplied by the elapsed time (# INTERVALS). Hence that value is the leak rate per unit interval multiplied by the number of intervals elapsed based upon the last seen timestamp and current time stamp values. The last seen time stamp is preferably stored in the pertinent table with the pertinent micro flow information. After reference numeral 240, control passes to node D, 242 and then to reference numeral 244 of FIG. 5C.
At reference numeral 244 BYTECOUNT 2 is compared to the contract value for the flow read from the appropriate data store. If BYTECOUNT 2 exceeds the contract value then the packet is out of profile and control passes to reference numeral 246. if not, then the packet is in profile and control passes to reference numeral 248.
At reference numeral 248 BYTECOUNT 1 in the data store associated with the table is updated to the value of BYTECOUNT 2. Control then passes to node C, 236 of
Turning now to
Although illustrative presently preferred embodiments and applications of this invention are shown and described herein, many variations and modifications are possible which remain within the concept, scope, and spirit of the invention, and these variations would become clear to those of skill in the art after perusal of this application. The invention, therefore, is not to be limited except in the spirit of the appended claims.
|Cited Patent
|Filing date
|Publication date
|Aug 13, 1982
|Feb 12, 1985
|At&T Bell Laboratories
|Multiplexed first-in, first-out queues
|Dec 31, 1986
|Sep 6, 1988
|American Telephone And Telegraph Company, At&T Bell Laboratories
|Packet switching system arranged for congestion control through bandwidth management
|Dec 31, 1986
|Sep 6, 1988
|American Telephone And Telegraph Company, At&T Bell Laboratories
|Packet switching system arranged for congestion control
|May 17, 1991
|Jun 29, 1993
|Stratacom, Inc.
|Circuitry and method for fair queuing and servicing cell traffic using hopcounts and traffic classes
|Jan 8, 1992
|Oct 12, 1993
|Nec Corporation
|Switching system with time-stamped packet distribution input stage and packet sequencing output stage
|Feb 3, 1993
|Jan 18, 1994
|At&T Bell Laboratories
|Bandwidth and congestion management in accessing broadband ISDN networks
|Jul 31, 1992
|Apr 12, 1994
|International Business Machines Corporation
|Frame relay system capable of handling both voice and data frames
|Apr 1, 1992
|May 17, 1994
|Stratacom, Inc.
|Congestion control for cell networks
|Jun 4, 1992
|May 17, 1994
|Bell Communications Research, Inc.
|B-ISDN sequencer chip device
|May 7, 1993
|May 31, 1994
|Stratacom, Inc.
|Method and apparatus for routing cell messages using delay
|Jun 25, 1993
|Oct 25, 1994
|Stratacom, Inc.
|Bandwidth and congestion control for queue channels in a cell switching communication controller
|Sep 20, 1993
|Apr 18, 1995
|Motorola, Inc.
|Device and method for cell processing in cell relay nodes
|Jan 28, 1994
|Jan 16, 1996
|Cabletron Systems, Inc.
|Network having secure fast packet switching and guaranteed quality of service
|Feb 16, 1995
|Mar 5, 1996
|Northern Telecom Limited
|Digital telecommunication link for efficiently transporting mixed classes of packets
|Apr 14, 1994
|Mar 26, 1996
|Nokia Telecommunications Oy
|Method and system for sending shorter service number in place of all but first packet, in place of longer destination address, for increasing user data content of packet data transfer
|Jun 30, 1994
|May 7, 1996
|Digital Equipment Corporation
|Traffic shaping system with transmit latency feedback for asynchronous transfer mode networks
|Mar 20, 1995
|Oct 29, 1996
|Stratacom, Inc.
|Method and apparatus for implementing communication service contract using cell arrival information
|Jul 6, 1994
|Oct 29, 1996
|Fujitsu Limited
|Apparatus and a method for supervising and controlling ATM traffic
|Aug 6, 1993
|Jan 28, 1997
|Cisco Sytems, Inc.
|Variable latency cut through bridge for forwarding packets in response to user's manual adjustment of variable latency threshold point while the bridge is operating
|Sep 11, 1995
|Feb 11, 1997
|International Business Machines Corporation
|Method and an apparatus for shaping the output traffic in a fixed length cell switching network node
|Aug 17, 1995
|Mar 11, 1997
|Northern Telecom Limited
|Access to telecommunications networks in multi-service environment
|Nov 7, 1994
|Jul 15, 1997
|Ben-Nun; Michael
|Traffic shaping system with virtual circuit table time stamps for asynchronous transfer mode networks
|Oct 25, 1995
|Sep 9, 1997
|International Business Machines Corporation
|ATM cell forwarding and label swapping method and apparatus
|Mar 22, 1995
|Dec 16, 1997
|Hitachi, Ltd.
|Communication system and communication method
|Nov 30, 1995
|Jan 27, 1998
|Alcatel Cit
|Method of routing cells in an asynchronous time-division multiplex switching network and corresponding network input switch and application
|Aug 2, 1994
|Mar 31, 1998
|Fujitsu Limited
|Frame relay switching apparatus and router
|Oct 2, 1996
|Apr 7, 1998
|Cisco Technology, Inc.
|Variable latency cut through bridge having variable latency threshold point being configured dynamically for forwarding packets while the bridge is operating
|Jan 11, 1996
|Jun 9, 1998
|Cisco Technology, Inc.
|Per channel frame queuing and servicing in the egress direction of a communications network
|Nov 7, 1995
|Jul 7, 1998
|At&T Corp.
|Usage management system
|Dec 29, 1994
|Aug 11, 1998
|Cisco Technology, Inc.
|System for routing packets by separating packets in to broadcast packets and non-broadcast packets and allocating a selected communication bandwidth to the broadcast packets
|Oct 23, 1996
|Sep 8, 1998
|Cisco Systems, Inc.
|System and method for communicating packetized data over a channel bank
|Apr 26, 1996
|Oct 27, 1998
|Cascade Communications Corp.
|Quality of service priority subclasses
|Mar 27, 1997
|Nov 10, 1998
|Cisco Technology, Inc.
|Multi-level rate scheduler
|Dec 9, 1996
|Nov 10, 1998
|Sun Microsystems, Inc.
|Method and apparatus for controlling access to services within a computer network
|Mar 13, 1995
|Nov 17, 1998
|Selsius Systems Inc.
|Distributed interactive multimedia system architecture
|Aug 13, 1996
|Nov 24, 1998
|Motorola, Inc.
|Ternary CAM memory architecture and methodology
|May 14, 1997
|Jul 13, 1999
|Ncr Corporation
|System and method for traffic management in a network management system
|Jan 31, 1997
|Jul 20, 1999
|Bay Networks
|Method and apparatus for servicing multiple queues
|Mar 12, 1996
|Sep 28, 1999
|Bay Networks, Inc.
|VLAN frame format
|Jul 15, 1996
|Oct 19, 1999
|Bellsouth Intellectual Property Management Corporation
|Method and system for allocating costs in a distributed computing network
|Jun 16, 1997
|Mar 7, 2000
|International Business Machines Corporation
|System and method of multiparty billing for Web access
|Mar 20, 1997
|Apr 4, 2000
|Nokia Telecommunications, Oy
|Accounting system and method for a nominal bit rate network service
|Jun 30, 1997
|Jul 25, 2000
|Sun Microsystems, Inc.
|System and method for a quality of service in a multi-layer network element
|Feb 3, 1998
|Aug 15, 2000
|Extreme Networks
|Policy based quality of service
|Oct 13, 1998
|Sep 12, 2000
|Cisco Technology, Inc.
|Multiple-level internet protocol accounting
|Jun 20, 1997
|Sep 19, 2000
|Hitachi, Ltd.
|Packet switching device and cell transfer control method
|Feb 12, 1996
|Dec 5, 2000
|Fujitsu Limited
|Congestion control system for controlling congestion in switching cells
|Sep 5, 1997
|Dec 19, 2000
|Carr; David Walter
|Virtual path shaping
|Oct 26, 1998
|Dec 26, 2000
|Cisco Technology, Inc.
|Method and apparatus for defining and implementing high-level quality of service policies in computer networks
|May 15, 1998
|Aug 14, 2001
|Hitachi, Ltd.
|Packet switching system, packet switching network and packet switching method
|Jun 30, 1999
|Jan 1, 2002
|Broadcom Corporation
|High performance self balancing low cost network switching architecture based on distributed hierarchical shared memory
|Dec 18, 1998
|Nov 4, 2003
|Cisco Technology, Inc.
|Method and apparatus for implementing a quality of service policy in a data communications network
|Apr 14, 1999
|Oct 21, 1999
|Juno Online Services Inc
|Method and apparatus to control a client in a communications network
|"Cisco Delivers New Advanced Capabilities to the Lightstream 1010 Multiservice ATM Switch", Jan. 27, 1997. newsroom.cisco.com/dlls/prod_012797.html.
|Cisco Delivers New Advanced Capabilities to the Lightstream 1010 Multiservice ATM Switch, Jan. 27, 1997. newsroom.cisco.com/dlls/prod_012797.html.*
|Cisco news release, "Cisco Delivers New Advanced Capabilities to the LightStream 1010 Multiservice ATM Switch", Jan. 2, 1997. newsroom.cisco.com/dlls/prod_012797.html.*
|Office Action dated Dec. 23, 2003, Application No. 10/391,683.
|Zhang, et al., "Rate-Controlled Static-Priority Queueing", 1993, IEEE, pp. 227-236.
|Citing Patent
|Filing date
|Publication date
|Jan 31, 2005
|Oct 9, 2007
|Netlogic Microsystems, Inc.
|Method and device for virtualization of multiple data sets on same associative memory
|Jun 24, 2004
|Sep 2, 2008
|Hitachi, Ltd.
|Bandwidth policing method and packet transfer apparatus with bandwidth policing function
|Jun 17, 2002
|Nov 4, 2008
|Intel Corporation
|Guaranteed service in a data network
|Sep 30, 2003
|Dec 16, 2008
|Nokia Inc.
|TCP-friendly markers and methods using token buckets
|Aug 17, 2004
|Feb 17, 2009
|Telefonaktiebolaget L M Ericsson (Publ)
|Arrangement and a method in a switched telecommunication system
|Dec 28, 2005
|Oct 13, 2009
|Cisco Technology, Inc.
|Using ternary and binary content addressable memory stages to classify information such as packets
|May 20, 2005
|Dec 22, 2009
|Cisco Technology, Inc.
|Avoiding unnecessary RSVP-based preemptions
|Sep 29, 2005
|Jul 6, 2010
|Cisco Technology, Inc.
|Technique for policy conflict resolution using priority with variance
|May 2, 2006
|Jul 13, 2010
|Harris Corporation
|Systems and methods for close queuing to support quality of service
|Jun 21, 2006
|Aug 3, 2010
|Harris Corporation
|Systems and methods for adaptive throughput management for event-driven message-based data
|Apr 26, 2005
|Aug 10, 2010
|Cisco Technology, Inc.
|Combined interface and non-interface specific associative memory lookup operations for processing of packets
|Jul 31, 2008
|Sep 7, 2010
|Hitachi, Ltd.
|Bandwidth policing method and packet transfer apparatus with bandwidth policing function
|Aug 12, 2002
|Sep 21, 2010
|Matsushita Electric Industrial Co., Ltd.
|Quality of service management in network gateways
|Jun 1, 2004
|Oct 26, 2010
|Verizon Business Global Llc
|System and method for controlling communication flow rates
|Jun 15, 2006
|Nov 23, 2010
|Marvell International Ltd.
|Packet aggregation
|Jun 16, 2006
|Dec 21, 2010
|Harris Corporation
|System and methods for generic data transparent rules to support quality of service
|Jun 1, 2004
|Jan 11, 2011
|Verizon Business Global Llc
|Method and apparatus for processing labeled flows in a communication access network
|Aug 23, 2006
|Feb 8, 2011
|Nokia Siemens Networks Gmbh & Co. Kg
|Method for augmenting a network
|May 18, 2006
|Feb 22, 2011
|Harris Corporation
|Method and system for functional redundancy based quality of service
|Jun 19, 2006
|Mar 29, 2011
|Harris Corporation
|Method and system for fault-tolerant quality of service
|Jun 16, 2006
|Aug 2, 2011
|Harris Corporation
|Method and system for rule-based sequencing for QoS
|Sep 12, 2005
|Oct 25, 2011
|Cisco Technology, Inc.
|Multimedia data flow dropping
|Jun 16, 2006
|Nov 22, 2011
|Harris Corporation
|Method and system for inbound content-based QoS
|Nov 21, 2007
|Dec 6, 2011
|Cypress Semiconductor Corporation
|Method and apparatus for configuring signal lines according to idle codes
|Dec 2, 2005
|Dec 13, 2011
|Cisco Technology, Inc.
|Multimedia data flow dropping with notification
|May 5, 2010
|Jun 12, 2012
|Lsi Corporation
|Systems and methods for processing access control lists (ACLS) in network switches using regular expression matching logic
|Jun 1, 2004
|Jul 10, 2012
|Verizon Business Global Llc
|Apparatus and method for terminating service emulation instances
|Jun 1, 2004
|Aug 21, 2012
|Verizon Business Global Llc
|System method for a communications access network
|Jun 3, 2004
|Oct 16, 2012
|Verizon Business Global Llc
|System and method for indicating classification of a communications flow
|Jul 31, 2006
|Oct 30, 2012
|Harris Corporation
|Systems and methods for assured communications with quality of service
|May 31, 2005
|Dec 25, 2012
|Verizon Business Global Llc
|Apparatus and method for providing a network termination point
|Nov 16, 2009
|Apr 30, 2013
|Cisco Technology, Inc.
|Avoiding unnecessary RSVP-based preemptions
|Nov 19, 2010
|Jul 30, 2013
|Marvell International Ltd.
|Packet aggregation
|Jun 28, 2010
|Aug 6, 2013
|Cisco Technology, Inc.
|Technique for policy conflict resolution using priority with variance
|Jun 16, 2006
|Aug 20, 2013
|Harris Corporation
|Method and system for network-independent QoS
|Oct 20, 2009
|Mar 25, 2014
|Verizon Business Global Llc
|System and method for controlling communication
|Jun 20, 2006
|May 20, 2014
|Harris Corporation
|Method and system for compression based quality of service
|Jun 5, 2012
|Dec 16, 2014
|Verizon Patent And Licensing Inc.
|System and method for a communications access network
|Dec 7, 2010
|Dec 16, 2014
|Verizon Patent And Licensing Inc.
|Method and apparatus for processing labeled flows in a communications access network
|Jun 3, 2004
|Feb 3, 2015
|Verizon Patent And Licensing Inc.
|System and method for transporting time-division multiplexed communications through a packet-switched access network
|Oct 10, 2012
|Mar 10, 2015
|Verizon Patent And Licensing Inc.
|System and method for indicating classification of a communications flow
|Aug 8, 2011
|May 5, 2015
|Verizon Patent And Licensing Inc.
|Apparatus and method for providing a network termination point
|Apr 10, 2012
|Aug 18, 2015
|Microsoft Technology Licensing, Llc
|Selectively enabled quality of service policy
|Aug 17, 2004
|Feb 3, 2005
|Telefonaktiebolaget Lm Ericsson (Publ)
|Arrangement and a method in a switched telecommunication system
|Jun 24, 2004
|Feb 3, 2005
|Hitachi, Ltd.
|Bandwidth policing method and packet transfer apparatus with bandwidth policing function
|Sep 30, 2003
|Apr 14, 2005
|Nokia Inc.
|TCP-friendly markers and methods using token buckets
|Jun 1, 2004
|Oct 6, 2005
|Mci, Inc.
|System and method for controlling communication flow rates
|Jun 1, 2004
|Oct 6, 2005
|Delregno Dick
|System and method for providing a multiple-protocol crossconnect
|Jun 3, 2004
|Oct 6, 2005
|Mci, Inc.
|System and method for indicating classification of a communications flow
|Jun 1, 2004
|Oct 6, 2005
|Mci, Inc.
|System and method for a communications access network
|Jun 1, 2004
|Oct 13, 2005
|Delregno Nick
|Apparatus and method for terminating service emulation instances
|May 31, 2005
|Oct 27, 2005
|Delregno Christopher N
|Apparatus and method for providing a network termination point
|Aug 30, 2004
|Mar 2, 2006
|Ken Madison
|Device and method for managing oversubsription in a network
|Dec 28, 2005
|May 18, 2006
|Cisco Technology, Inc., A California Corporation
|Using ternary and binary content addressable memory stages to classify information such as packets
|May 20, 2005
|Dec 7, 2006
|Satyam Tyagi
|Avoiding unnecessary RSVP-based preemptions
|Sep 12, 2005
|Apr 5, 2007
|Mark Litwack
|Multimedia data flow dropping
|Oct 6, 2009
|Apr 7, 2011
|Sonus Networks, Inc.
|Methods and Apparatuses for Policing and Prioritizing of Data Services
|Apr 10, 2012
|Sep 27, 2012
|Microsoft Corporation
|Selectively enabled quality of service policy
|Dec 6, 2012
|Verizon Business Global Llc
|System and method for a communications access network
|Sep 20, 2006
|Aug 13, 2008
|Data bank system and method for controlling data bank data
|U.S. Classification
|370/235, 370/412, 370/395.42
|International Classification
|Cooperative Classification
|European Classification
|Jan 15, 2008
|Certificate of correction
|Aug 19, 2008
|Fee payment
Year of fee payment: 4
|Sep 24, 2012
|Fee payment
Year of fee payment: 8


text:
About this listing
Read the rules before booking
Space where guests can cook their own meals
Central heating or a heater in the listing
In the building, free or for a fee
Space where guests can cook their own meals
Towels, bed sheets, soap, and toilet paper
Central heating or a heater in the listing
In the building, free or for a fee
In the building, free or for a fee
Continuous access in the listing
Breakfast is provided.
The listing can accommodate a gathering of 25 or more attendees
Easy access to the building and listing for guests in wheelchairs
Private or Shared
Free, in the building or nearby
The Space
Penthouse with spectacular panoramic terrace in the historical centre of Ariccia (Roma). Elegantly furnished to provide guests every comfort. Relaxation and tranquility in a festive and lively village. For a vacation of art, culture, nature and vine-gastronomy.
Relaxation and tranquility in a festive and lively village.
Welcome you in a swite intimate and romantic with one double bed and three single beds chairs, kitchen with nice breakfast snack table.
In winter, comfortably seated in front of the fireplace you can immerse yourself in the green countryside sloping to the sea through the panoramic windows.
In summer you can relax on deck chair on the terrace, or dine on the outside table protected white umbrella. You can enjoy in silence, relax out of time; or if you choose to cross the door, you'll be in the heart of the old village, which is always animated by a cheerful vivacity, with typical shops, music and cultural events.
...a terrace on nature, history, art and..... on the roman cooking's fragrance.
Ariccia, a place to live again the emotions that have ispired the poets and painters of the
" Grand Tour d'Italie
Avremo il piacere di ospitarvi con le stesse comodità cui siete abituati e con una particolare attenzione alle vostre esigenze , in un contesto "vacanziero"
Sarete ospiti di una casa vacanze con cucina e non di un B&B
7 Reviews
Très bel appartement confortable et plein de charme. Nous avons passé un excellent séjour à Ariccia
The images do not do justice to views from this apartment and it's location. Travelling with two children the surroundings were brilliant since the old town has limited access by car. All necessities are within walking distance - even a "water station" where you can purchase fizzy water for 5 snt / litre (under the monumental bridge next to the free parking place).
We were greeted by Ana Maria who was very friendly but did not speak English. Everything went fine anyway.
We found the apartment to be a studio with one sleeping area devided by a curtain. Fortunately this was not a big issue since we spent our evening time on the patio with the lovely view.
We must also compliment the air conditioner which worked like a charm (outside temperature being as high as 40'C).
Lake Albano was within a 15 minute ride by car and it was a perfect place to swim and play with our children. (Giorgio's beach has the best bottom.)
We were very happy with our stay!
We were two couples staying in Francesca's place. Arriccia was a lovely little town, just what we were looking for from our holiday! Francesca was kind to reply to all our questions before the arrival, most of which had nothing to do with the apartment.
From time to time there was bit of lack of privacy, because it is a studio apartment. The flat seems to be used as a holiday apartment as well, so AirBnB is just one of the marketing channels. Neighbours had renovation going on while we were there.
The terrace is lovely and the surrounding community as well!
The flat was exactly as described, tastefully furnished and very clean. It had all the necessary equipment. A free public car park is around 5 minutes walk away. Unfortunately we could not speak to Francesca or anybody else who spoke English when we called Francesca's number on arrival, there was only someone who did not speak any English and hung up the phone quite abruptly. After involving some friendly people on the piazza we found someone who spoke English and phoned the number again and 10 minutes later Francesca's friendly husband arrived and showed us everything. This took us more than one and a half hour and at some point we were quite helpless and desperate.
One other thing about the place you might want to know: as the town is near Rome and only about 15 kilometres away from a park and ride for Rome we thought it would be a comfortable way to go there by car and use the underground to get into central Rome. Unfortunately, the traffic was extreme (forget everything that you know about traffic rules - it is more like a lesson in how the brutal survival of the fittest works) and it always took us more than one hour to get to the underground (and another hour back).
I'm glad you've found the house comfortable and cozy.
I am very sorry for the problems we had on arrival.
I have not received the first phone call, maybe there was an error calling.
As regards the traffic is unpredictable and depends on the day of the week and time of day.
Thank you very much for the review this will help us better treat the reception of guests. Sincerely Francesca
Una settimana e volata ,
l'attico con terazzo e magnifico tenuto benissimo ,quello che serve per un buon soggiorno, confortato da servizi adiacenti di ogni genere ottimo il parcheggio dove trovi sempre posto,per scarico e carico delle cose il permesso dei vigili e stato immediato e cortese,se non vuoi cenare in casa,un sacco di osterie soddisfa il tuo palato e passi una serata fuori del normale, simpatici i romani molto disponibili.
Annamaria molto gentile e servizievole per ogni problema.
non ho conosciuto la Sig. Francesca,ma ne avrò occasione la prossima volta,e mi godrò il camino magari in stagione più fredda Grazie . (la ciliegina sarebbe avere l'internet )
We had a great stay at Francesca's apartment. The place is really well equipped, has a nice view and Arricia is a very authentic village.
During our stay we had a small maintenance request, which was followed up within a day.
I would recommend this place when you're looking for an authentic, relaxed stay, not too far from Rome.
Dear Kasper we are happy to announce you we just published your commentary on our site (website hidden)
We are so glad and thankful for such good words you spent. We are sure your description will be useful to next customers and we are happy you had a nice stay.
Best wishes Francesca Semerano
We enjoyed the stay at Francesca's place. The apartment is actually amazing, with an incredible view over the valley and a fireplace that works.
The apartment was very well kept and clean. Definitively an enjoyable experience.
About the Host, Francesca
Mi presento: sono un'insegnante in pensione e pochè amo le cose belle mi sono innamorata di questo appartamentino con terrazzo nel centro di Ariccia, per l'aria che si respira, per i colori, le luci, il profumo di legna dai camini accesi d'inverno, la vivacità del borgo e al tempo stesso la quiete, fuori dal tempo, sul sagrato della chiesetta del Bernini oggi divenuta teatro. Insomma questo luogo mi ha affascinato e siccome ho il culto dell'ospitalità ho deciso di ristrutturarlo con un'architetto e ne ho fatto una Casa Vacanze.
La mia più grande gratificazione è quando un'ospite mi dice che si è trovato bene e che desidera ritornare.
Di me? La cosa più importante per me è la famiglia: mio marito, già compagno di scuola, due figli grandi, mia mamma , che vive con noi ed ha 102 anni e i nostri due magnifici gatti.
Ho tanti interessi: la natura e il giardinaggio, le arti figurative e la fotografia, il cinema, leggere, cucinare, cucire, viaggiare...e sicuramente ho dimenticato qualcosa

subset: commoncrawl


text:
McCabe is a staff reporter at Globe North. She joined the staff in 2002, after working as a Globe correspondent. She writes on a variety of subjects, including local government, community development, religion, and small businesses.
Latest stories
Route 1 in Saugus losing landmarks
By Kathy McCabe , Globe Staff
Weylu's and the Hilltop Steak House are gone, with the miniature golf course guarded by the orange dinosaur next to be demolished.
Praying for a revival at Asbury Grove
By Kathy McCabe , Globe Staff
The 19th century Methodist camp meeting ground in Hamilton hopes to sell long-abandoned cottages that have fallen into disrepair.
Another Route 1 icon may go extinct as course closes
By Kathy McCabe , Globe Staff
The iconic miniature golf course in Saugus where it stands is closing after 57 years of business.
FBI investigating cruise ship death off Cape Ann
By Kathy McCabe , Globe Staff
A 59-year-old woman died when she fell overboard from a cruise ship Friday night.


text:
It's pretty wild to have seen the iControlPad go from idea to concept to production, and here's the final step straight from Engadget: video of the device working just as planned. ZodTTD is playing quake4iphone on it, and while the naysayers will probably still have some nays to say, I'm convinced. If Apple is as serious as it seems about turning the iPhone and the iPod touch into serious gaming devices, it would be worth selling something like this as an official accessory. It's fine and good to say that the multitouch screen works even for traditional controls, but so far, we haven't seen a developer that's been able to put "buttons" on the screen and still be able to make worthwhile use of screen space.
As Engadget says, there's still no price or release date on the iControlPad, and given that it's working on jailbroken games right now, there's no sign yet that we'll have any official App Store support. But it's an idea for which the time, in my humble opinion, has come.
Apple iPhone 6
Buy from $50 *
- Key specs
- Reviews • 45
- Prices
- Discussions
- Type Smartphone
- Operating system iOS (8)
- Screen size 4.7 inches
- Internal memory 16 GB
- Camera 8 megapixels
- Dimensions 5.44 x 2.64 x 0.27 in
- Weight 4.55 oz
- Released 2014-09-19
Apple iPod touch 6th-gen


text:
Vegetable Scramble
Students get moving while learning about a variety of vegetablesTags: nutrition activities, middle school, dinner
Don't miss out on your chance to race a unique 5K through Manhattan. Sign up for the near-capacity NYRR Dash to the Finish Line 5K now!
A fun physical activity that teaches students about how their bodies react to different dinner foods
Tags: nutrition activities, middle school, dinner
|Students move or freeze depending on whether a healthy or unhealthy dinner food is named.
|Students will distinguish between "go" (healthy) and "slow" (less healthy) dinner foods.
Although all foods can fit into a healthy eating plan in moderation, it is important to reinforce that healthier foods give the body more energy to play and grow. "Junk foods," (processed foods high in fat and added sugar), contain a significant amount of calories but add very little nutrition to kids' diets.
It is important to connect kids with their food and get them thinking about food less in terms of "good" and "gross" and more in terms of "healthy" and "less healthy" (or "go" and "slow").
Healthy ("Go") Dinner Foods and Drinks:
Less Healthy ("Slow") Dinner Foods and Drinks:
Further information about the national standards can be found here.


text:
Your sex-positive ranking is the ### percentile of all takers!
Their Analysis (Vertical line = Average)
They scored 80% on sexpositive, higher than 99% of your peers.
All possible test results
Your friends might consider you prudish - or maybe you only hang out with friends as poorly informed and aware their sexual capacity. Go buy a copy of "Sex for Dummies" by Dr. Ruth and start learnin... Read more
You "sex positiveness" is lower than 60% of all other OK Cupid test takers. You might want to think about reading VoracityBeat.com or grabing Galenorn's "Sexual Ecstasy & the Divine." Really. There is... Read more
Love Child
You are a product of the sexual revolution of the 1960's but it is possible to have even better sex and enjoy your body more than you are now - like the 40% of test takers who scored higher than you. ... Read more
Yee hah! You are a fine stud (or studette)! You are in tune with your body and the pleasure of your partner(s). Keep up the great work and spread the word! Maybe you could contribute to a site like Vo... Read more
Sex Master/Goddess
You, my friend, are in the top of sex-positive, sex-aware test takers. You are an inspiration to our species and to the Internet. Share the wealth! You should write your own tests, have a web site tel... Read more
Recent Results
Jillthefirst48 / f / Bisexual
meinfp61 / m / Straight
notebefriedigend28 / m / Straight
SteelRider4U63 / m / Bisexual
Arghhhnes34 / f / Bisexual
Tests others are taking
nopeppepon24 / f / Bisexual
How much of a Loser are you? (Subs)
gotalittleone18 / m / Straight
CDBailey0318 / m / Straight
The What kind of Socialist are you Test
guitrees22 / f / Bisexual
kopoboi8529 / m / Gay
More tests we think you'll like
Taken 5568 times.
The MeTest
now do you really know me?
Taken 87202 times.
The Are you gay bi or straight? Test
This is the ultimate and most accurate test one could ever take in this area. This test is for boys, but if you're a girl and you feel you REALLY want...
Taken 4145 times.
The Useless Trivia As Determined By the Author Test
Hi! And welcome to my Useless Trivia As Determined By the Author Test. I'll be using advanced logic and my useless knowledge amassed over years of veg...
Taken 11534 times.
The What Kind of Diaper Are You Test
Hi! And welcome to my What Kind of Diaper Are You Test. I'll be using advanced logic and knowledge to determine your true nature.
Taken 515 times.
The Bob and George Test
Hey internet fiends! Hopefully, most people taking this test are familiar with the popular online comic Bob and George, if not, check it out at http:...
Taken 7726 times.
The Waht type of car person are ya Test
Hi! I'll be asking questions regarding the automotive cultural set u fit into. Also whether you are more speed/power oriented or more appearnce orien...
Taken 1523 times.
The Does 300 MYA Matter To Me Test
Hi! And welcome to my Does 300 MYA Matter To Me Test. MYA means Millions of Years Ago, so if you don't care, don't know, or don't want to humiliate yo...
Taken 983 times.
O teste das facções
Find out witch of Divergent faction you belong.
Taken 8185 times.
Famous Movie Quotes Test
What is your knowledge of Famous Movie Quotes?
Taken 2014 times.
The Horse Racing Test
Hi! And welcome to my Horse Racing Test.
Connect your existing OkCupid account
Sign in
Welcome Back!
Restore your account to continue
meeting new people.
Reset your password
We'll email you a link to reset it.
Email sent!
An email is on its way to .
If you don't see it, try checking
your Spam folder.


text:
Multicultural Sing-along with Jose-Luis Orozco
Bay Area Discovery Museum
José-Luis Orozco is a renowned bilingual musician, educator and children's author. Join him for an interactive journey through Latin American culture and music. Sing and dance along to original and traditional songs in Spanish and English and learn the words in Spanish to such classics as "Old MacDonald." www.joseluisorozco.com
- Venue: Bay Area Discovery Museum
- Date: Sat December 8, 2012 11:00am
- City: Sausalito
- Price Range: Members $5; General $14 (includes Museum admission)
Sat November 30, 2013 11:00am
Bay Area Discovery Museum


text:
Members from Dr. Phillips' group presented at the International Conference on Frailty and Sarcopenia Research (ICFSR). The ICFSR was held in Boston, MA, USA from April 23-25, 2015.
Jason Au, PhD candidate in the Vascular Dynamics Lab, presented at the 4th Joint Annual International Spinal Cord Society (ISCoS) and American Spinal Cord Association (ASIA) conference held in Montreal, Canada.
Jason's presentation was titled, " Assessing Different Methods of Determining Anaerobic Threshold in Individuals with Motor-Complete Spinal Cord Injury " with
Members of the Vascular Dynamics Laboratory attend the 3rd Annual North American Artery (NAA) Society Meeting in Chicago, IL, September 6-7 2013.
From left to right: Johnny Choi, Ninette Shenouda, Julia Totosy de Zepetnek, Jason Au, Lisa Cotie, Nicole Proudfoot and Patrick McPhee.
"Throughout my first three years of my undergraduate degree I became interested in doing research, especially in the area of cardiovascular physiology. However, having no research experience prior to completing my undergraduate thesis project, I wasn't completely sure what to expect. Not only was the experience thoroughly enjoyable for me,
Congratulations to Drs. Gibala, MacDonald and Phillips for being recognized in the Journal of Physiology's Top 10 articles from 2014.
Four of the top ten articles have authors from McMaster Kinesiology.
The link below is to the Journal of Physiology's most recent annual report which includes a list of the
The Exercise Metabolism Research Group's presence was clerly felt at this year's National Undergraduate Research Conference (NURC), which was held at the University of Toronto.
Jem Cheng, Daria Shkredova, and Stacey Priest, undergraduate students supervised by Dr. MacDonald, as well as Chris Wavell, Micaela Gregory and Nicole Mazara, undergraduate students
EMRG lab members Katharine Currie and Mike De Lisio were finalists for the CSEP Graduate Student Award in Regina, Saskatchewan - October 2012.
Dr. Mike De Lisio was the winner of the award.
EMRG lab members at the CSEP annual meeting in Toronto, Ontario - October 2013.
EMRG lab members attend the Ontario Exercise Physiology (OEP) annual meeting in Barrie, ON - February, 2015
Members of Dr. Phillips' and Dr. Gibala's labs presented at the 6th Annual MHAD held on May 22, 2015 at York University. The MHAD is hosted by the Muscle Health Research Centre, bringing together researchers and students who study muscle health in a multitude of experimental paradigms.
The MHAD event
Remember Me


text:
1 - 0 of 0
Did you mean?Try your search again
Hi there,
I would like to know if anyone of you has already been at the Cerro Castor ski resort in Ushuaya?
I am thinking to go snowboarding in the beginning of july...and also is it worth it this resort?
Sponsored Listings
It seems to be illegal, so you better skip it ! IF you do it at all, I would recommend that you try to talk to the... more
I'm guessing you mean U.S. dollars. Most banks will exchange money, even US dollars. Some exchange rates may vary so... more
My vote is for the Martial Glacier too! During our 4 days in Ushuaia, we went to the Glacier twice! Grab a taxi up to... more
Sponsored Links
VirtualTourist®© 1994-2015 VirtualTourist.com, Inc. All Rights Reserved.Back to Top
|All reports are strictly confidential. Please explain why you are reporting this:


text:
Summer Shipping Details
During the warmer months we will NOT ship orders so that they are in transit over the weekend. This means orders may not be ship on Thursdays and Fridays. All orders are shipped from NYC. During the Summer, Standard Shipping is ONLY available to states in the Northeast for which the Transit Time is 2 Days or less. These States include Connecticut, District of Columbia, Delaware, Maine, Maryland, Massachusetts, New Hampshire, New Jersey, New York, Pennsylvania, Rhode Island and Vermont. For States outside this area, Expedited Rates are only available.


text:
- Entire Home
- Listings where you have the whole place to yourself.
- Private Room
- Listings where you have your own room but share some common spaces.
- Shared Room
- Listings where you'll share your room or your room may be a common space.
Book without waiting for your reservation to be accepted
- Room Type
- Price
- Size
- Social Connections
- Employee host
- Instant Book
- Superhost
- Neighborhoods
- Amenities
- Property Type
- Host Language
300+ Rentals · Alajuela
300+ Rentals · Alajuela
The Tree House Is charming, new and handcrafted at our 35 acre Bio Thermales rainforest reserve with natural hot and cool springs pools in the north-central Costa Rican heartland. This is authentic Costa Rica: clean, comfortable and close to nature. Learn More
Please message us if we will be your first or last destination in Costa Rica. We highly recommend booking on weekdays for more privacy and tranquility, as we have more day visitors from 9 am to 6 pm to our hot springs on the weekends, especially Sundays. If your reservation includes a Sunday, we highly recommend planning a day outing to the many wonderful nearby activities. We are three hours north of San Jose (airport), 45 minutes east of Fortuna and Volcano Arenal, and the many activitie...
The environment is 100% natural, The villas are entirely of wood each one with private barhroom,three beds,a corridor,these don't have kitchen Rustic style, guests can enjoy of a trial around one kilometer a long of río celeste also a Área of recreation where guests can walk, swim in The refreshing water of río celeste and will also have the enjoyment of exellent service family The downtown name is katira.katira is a place of farmers and friendly people There are restaurants but in villa...
Situado a 3 kilometros del pueblo de La Fortuna, Balcon con Vista al Majestuoso Volcán Arenal , y a los jardines, Piscina, Wifi, Aire Acondicionado, Sala de Television, Sala Comedor, Baño Privado con agua caliente, 2 camas Individuales. Ubicada en medio de la montaña, rodeada de la catarata, el cerro chato y el volcan arenal, un lugar magico , tranquilo donde disfrutas de paz . 3 kilometros del Pueblo de La Fortuna 3oo metros de distancia de La Catarata de La Fortuna 500 metros de distancia...
La Fortuna
Described as a Little Paradise in Monteverde. Secluded yet accessible The house is made of local wood and glass, light and spacious, with a wrap-around deck perfect for bird watching and listening to the sounds of the toucans and howler monkeys. Learn More
Your own private home right in the Cloud forest open concept with private spaces perfect for a couple self sufficient and within walking distance of restaurants and stores, half way between Monteverde and Santa Elena Described as, "feels like a retreat, a little paradise." light, bright, cozy. A unique home away from home I bedroom, 2 bathrooms shower and tub full kitchen washing machine outdoor fireplace WE don't interact with our guest because we are in Canada but you will...
Monte Verde
If you are a nature lover who is also interested in a cultural experience, this is for you! Casa Libelula is our studio apartment, hand-crafted with care and creativity, nestled against the forest above the creek. We hope that you enjoy the tranquility of our tiny neighborhood just outside of town and revel in its rich natural and cultural diversity. Your closest neighbors will include mostly the furred and feathered type. Right from bed, you can be dazzled by the presence of frequent ...
Four well appointed suites located in the city central of La Fortuna. Each suite comfortably fits two. Enjoy custom designed furniture in the living space, luxury bedding in the bedroom, & a kitchenette (sink, fridge, & microwave, no cook top). Learn More
La Fortuna Suites is located just off the main streets of downtown La Fortuna, Costa Rica. A small town bustling with fun, and said to be the adventure capital of the world! At La Fortuna Suites you'll find the most comfortable Memory Foam beds in Costa Rica, 400 thread count Egyptian Cotton linens, custom designed furniture, stylish accommodations, 40' T.Vs, Netflix, WiFI, your own kitchenette, and a friendly concierge. We also serve a complimentary breakfast each morning. We have four f...
San Carlos, Fortuna
Fully equipped kitchen, stove, cooking utensils, microwave, coffeemaker, refrigerator • Laundry facilities • TV set • Comfortable Queen Size bed • Private bathroom with shower and hot water • WiFi available in the whole property • Breathtaking views to the Poas Volcano • Spacious balcony overlooking our Forest View • Pool area available • Also seize our brand new state-of-the-art Yoga Loft and Acupuncture Center • Brand new Fitness center Ours is a 9000 sq. meters property surrounded by lu...
Peacefull and romantic, ideal place to enjoy nature, extraordinary views and privacy. Access to activities in the area; hiking, horseback riding, canopy , hanging bridges, rafting, rappel, kayaks, bike tours, etc. Learn More
Peacefull and romantic, ideal place to enjoy nature, extraordinary views and privacy. Access to activities in the area; hiking, horseback riding, canopy , hanging bridges, etc. * Breakfast Free. * Parking Free. * Laundry Service. * Tours Desk. * Transport w/ pay. * Shuttle w/ pay. * Trails in the property. * Great area for bird watching. Always Peacefull and views. By Shuttle every hour from 7:00am to 5:00pm or by taxi. We also have other types of rooms. Honeymoon Suite. Its posible an...
El Castillo
Five minutes from the lovely town of San Ramón, our modern, teak and concrete B&B is nestled in the coffee plantations, overlooking the mountains to the east. We offer our guests fresh, Costa Rican-style breakfasts with our home-grown organic coffee. Learn More
Welcome to Casa Amanecer! A full-service Bed and Breakfast in the lovely little town of San Ramon, Alajuela, Costa Rica.We invite the Costa Rican traveler into our teak and concrete abode, nestled in the beautiful coffee-planted mountains just ten minutes north of San Ramon. The name "Casa Amanecer" means "Sunrise House". The rustic modern structure (published in architecture magazine Su Casa, March 2009) faces east, where amazing sunrises may be taken in, along with the breath-takin...
San Ramon
"Wohnen unterm Mangobaum", 9 ha pure Natur mit Mango-, Litschi- und Orangenbäumen zum Entspannen und Entdecken. 2 Bäche befinden sich auf dem Grundstück welches durch den Rio Platanar imposant begrenzt wird. 50m² großes Apartment inkl. großzügiger Terrasse mit Schaukelstühlen und Hängematte. Eine exklusive Außendusche, Parkplatz, und ein gemeinschaftlicher Grillplatz sowie ein Waschraum inkl. Waschmaschine steht ebenfalls zur Verfügung. Auf der Finca wohnen Anna und Thomas und stehen den ...
Enjoy our guest room with excellent queen bed, lovely en suite bath and guest closet. About 45 minutes from SJO airport, we offer homemade biscotti or breads and Greek yogurt as well as tropical fruit with breakfast. Dine indoors or on covered patio. Learn More
Within the coffee plantation/finca you can walk stream-side pathways through exotic flora and fauna. Often we see 'Jesus' lizards scurrying to water and walking on the surface. Our birding is wonderful. Even near the house we enjoy motmots, rainbow (Keel billed) toucans, oropéndola and squirrel cuckoos among many other birds and wildlife. Gated, secure property with plenty of parking; Guests are welcome to use the main parlor and the covered patio. Coffee, teas and baked items are availabl...
Mountain house with amazing view and a lot of nature Come to visit us! About 30 minutes from Juan Santamaría airport near Volcàn Poàs(in Sabana Redonda de Poàs). Open 24h. Breakfast not included. Parking and Restaurant. Learn More
This is a mountain house with independent entrance, parking and amazing view. Away from chaotic trafic of the city it is a good place to rest and visit turistic places as Volcán Poás. Restaurant, Supermarket very closed, bus stop A lot of Nature thanks to fresh and wet climate typical of Volcan Poas area. It is closed to Airport and Poàs Volcano Bus stop to Poasito and to San Pedro de Poás is closed to the main entrance of the hotel. The house has 4 rooms with 2 queen bed, 2 twin bed,...
San Pedro de Poás
The perfect place in Nuevo Arenal for a couple or 1 person. Wonderful setting in gated community amidst the rain forest. Wake up, look out your window and see the howler monkeys and toucans pass by! Learn More
Very quiet area. Ideal for nature lovers, birders, hikers and outdoor adventure seekers. You will be surrounded by all kinds of animals, numerous birds, orchids, etc. There are some beautiful walking trails through the rainforest on the community property. Longer hiking trails are within a 3-minute distance. This is a great area for mountainbiking. It is also a water sports paradise: windsurfing/kitesurfing at a 15 minute distance, wakeboarding and waterskiing at 30 minutes, kayaking and ...
Nuevo Arenal
Taxi to and from SJO Juan Santamaria Airport is generally around $8. Alajuela is the closest town to the airport . San Jose is 30 to 40 minutes from the airport. We are perfect for first and last night especially for late arrivals and early departures. The price for Month dozen' Included free In Every Room: 2 Bedrooms A/C, One Bath, Fully equipped Kitchen, Family Room, Ceramic floor, wash and dry laundry service, Cable TV, Wireless Internet, Secure Parking. All taxes are included in room pri...
Mystica is a beautiful lodge and retreat centre right over-looking Arenal lake and volcano. We have a main building with 6 private rooms (each with their own bathroom) perfect for single, double, or triple occupancy, a private villa (with queen bed,bathroom, kitchenette, fireplace, terrace, and pull-out sofa),and a 2-bedroom house (two rooms each with their own queen bed, a large open kitchen, living room, fireplace, outdoor shower, hot tub, two bathrooms, and terraces). We are also proud...
Cabin in a tropical atmosphere, very close to everything. The cabin is part of a complex of 3 guest cabins and a main house (where the Hilda residence) and a balcony facing the river. Very quiet, facing the main river in the north of Costa Rica. Learn More
Boca Arenal
Newly built vacation house 7 min from Juan santanatia intl airport 2 story house 2 bedrooms 2 bathrooms fully equipped big swimming pool huge garden 2 BBQ spots river and a waterfall! All this in a private property! We also offer a big party building that fits 100 people! Learn More
San José
Casitas Tenorio is a unique B and B located on the slopes of Volcan Tenorio near the enchanting Rio Celeste. We have two private cottages set amongst lush tropical gardens. There is lots of birds and animal life. We offer you a personalised service. Learn More
We are an Australia/Costa Rican couple who are passionate about nature, organic farming and authentic tourism experiences. Casitas Tenorio is located on the slopes of Volcano Tenorio is set on land with remnant rainforest and also open farming land. We have extensive tropcial gardens which are home to a wide variety of birdlife. It's easy to spot a toucan or monkey here. We have a peaceful walking trail and views of the Volcano Tenorio and Volcano Miravalles Guests have access to walk arou...
Instant Book
Book without waiting for your reservation to be accepted


text:
New and increased fines have taken effect for motorists who commit distracted-driving violations such as texting.
Ontario County Sheriff Philip Povero said he hopes new and increased fines will deter more drivers from dangerous driving habits that he said are "growing at an alarming rate."
But, he said, the hazards distracted driving causes for drivers, their passengers and those in other vehicles on the road should be enough to sway them from engaging in behaviors that include texting or using an electronic handheld device while driving.
"The problem is extremely severe," Povero said. "The state government and the state Legislature have heard from law enforcement over the years. Collectively, we need to do more to decrease this type of activity."
New and increased fines for distracted driving violations were passed as part of the 2013-14 state budget and took effect Friday. The minimum fine is $50 for all offenses, and the maximum fine increases to $150 for a first offense, $200 for a second offense committed within 18 months and $400 for a third or subsequent offense committed within 18 months.
"Distracted driving has become a frightening epidemic on our roadways, and fines are an important tool to punish and prevent this reckless behavior," Gov. Andrew Cuomo said. "Combined with stronger penalties on your license and increased enforcement, these increased fines will send a tough message to all drivers that distracted driving is a serious problem with serious consequences."
According to Cuomo, the number of cellphone-related car crashes in New York state increased by 143 percent between 2005 and 2011.
Nationally, 3,331 people were killed in crashes involving a distracted driver in 2011, compared to 3,267 in 2010, according to the National Highway Traffic Safety Administration. An additional 387,000 people were injured in crashes involving a distracted driver, compared to 416,000 injured in 2010.
The new and increased fines are part of ongoing efforts by Cuomo to combat distracted driving.
Earlier this year, Cuomo directed the state Department of Motor Vehicles to implement tougher penalties for distracted driving. On June 1, the DMV increased the number of points earned against an individual's driving record upon conviction for texting-while-driving and cellphone-related infractions from three to five points.
Cuomo also signed legislation July 1 that imposes the same penalties on drivers with probationary and junior licenses for texting while driving and using a handheld cellphone that had already been received for speeding and reckless driving: 60-day suspensions for first convictions, and revocations of 60 days for junior licenses or six months for probationary licenses for subsequent convictions within six months of the time a license is restored after suspension.
This summer, at Cuomo's direction, New York state police are undertaking a major crackdown on distracted driving that includes increased enforcement and patrols.
Comments are currently unavailable on this article
Location, ST | website.com


text: Mashup: Pubwalk Comments Share via FacebookShare via TwitterShare via LinkedinShare via Google+Share via RedditShare via Mail Citysearch and Google Maps and Dodgeball and Yahoo Mobile Maps equals Mashup to plan bar-hopping routes, late-night food. With sharing and mobile integration. Track this Mashup Submit a mashup Summary Comments Followers Summary Comments Followers Comments (0) Comment * Leave this field blank Post Comment


text:
Originally posted on Fox Sports Ohio | Last updated 3/18/13
OPENING TIP Anyone wondering whether the Cavaliers would continue to play hard in their third straight non-playoff season only needed to see Saturdays loss at San Antonio. The Cavs played with energy, determination and even a little sizzle in falling to the Wests top-ranked team. Meanwhile, the Pacers are in the playoffs, and have plenty for which to play. Like the Cavs, theyve lost two straight. For the Pacers, that actually means something. Theyll desperately scratch and claw to end that skid tonight. Venue: Quicken Loans Arena, Cleveland. TVRadio: 6:30 p.m. EST, FOX Sports OhioWTAM All-Time Series: Pacers lead, 85-82. PROJECTED STARTERS INDIANA PACERS (40-26) C Roy Hibbert PF David West SF Paul George SG Lance Stephenson PG George Hill CLEVELAND CAVALIERS (22-44) C Tyler Zeller PF Tristan Thompson SF Alonzo Gee SG Dion Waiters PG Shaun Livingston Pregame notes: FOX Sports Ohio analyst Campy Russell says to watch out for Stephenson, and Russell is right. Stephenson is an...
NBA News
Delivered to your inbox
You'll also receive Yardbarker's daily Top 10, featuring the best sports stories from around the web. Customize your newsletter to get articles on your favorite sports and teams. And the best part? It's free!
Follow us on Twitter
|Best of Yardbarker
|NFL News
|MLB News
Today's Best Stuff
For Publishers
Company Info
Follow Yardbarker
|© 2015 Yardbarker, Inc. All rights reserved. Use of this website (including any and all parts and components) constitutes your acceptance of these Terms of Use and Privacy Policy. (What's New?)