text:
|Publication number
|Publication type
|Application number
|Publication date
|Aug 6, 2002
|Filing date
|Sep 4, 1998
|Priority date
|Sep 4, 1998
|Fee status
|Publication number
|David A. Hughes, Madhav Marathe, Chang-Yu Wang
|Original Assignee
|Cisco Technology, Inc.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (25), Non-Patent Citations (4), Referenced by (34), Classifications (20), Legal Events (4)
|External Links: USPTO, USPTO Assignment, Espacenet
The present invention relates to a method and apparatus for simulating delays experienced by information sent through a digital network, more specifically, trunk propagation delays within an ATM network.
Asynchronous Transfer Mode (ATM) or "cell switching" is a method of transmitting digital information wherein the information is broken into equal sized units called cells. The individual cells of information are transmitted from a source node to a destination node through a pathway (or connection) through a digital network. The digital network may be constructed of digital switches coupled together by digital communication links. These links may be trunks, which carry the cells of information between the digital switches along the connection. The digital switches route the cells from incoming communication links to outgoing communication links and finally to the destination node.
Real world networks may transport cells from a large number of switches across many links. Each of these links may have various propagation delays associated with them, some of which may be the result of significant use of the link or links. Designers of digital switches and networks must be cognizant of such factors when developing hardware and software for application in network environments. For example, those who design congestion control algorithms and the like must accurately account for real world propagation delays when developing the control schemes.
Unfortunately, trunk propagation delay simulators for ATM networks are not readily available. The few commercial propagation delay simulation systems which do exist are relatively expensive and most do not provide the capability of simulating links which operate at speeds of OC-3 or higher. In fact, the inventors are not aware of any commercially available simulators, which operate at speeds of OC-12. Thus, it would be desirable to have a delay simulator that can be used at these speeds and which does not require the use of expensive, custom systems.
It is an object of the invention to provide a trunk delay simulator capable of scalable operation.
In one embodiment, a method wherein a cell is delayed by a predetermined time by injecting one or more delay cells ahead of said cell into a queue in a network (e.g., an ATM network). The queue may comprise a cell egress queue at a switch of the ATM network and the delay cells may be generated at the switch using a local processor. If required, additional cells may be generated by replicating the locally generated cells. The delay cells, including the replicated cells, may be stored together with the network cells in the queue; the number of delay cells so stored being controlled by configuring a threshold for the egress queue.
In a further embodiment, trunk delay in a network (e.g., an ATM network) may be simulated by receiving, at a trunk delay simulator, a plurality of cells representing traffic in the network; and delaying each of the cells by a desired period of time. Preferably, delaying each of the cells is accomplished by injecting delay cells ahead of each of the network cells into a traffic flow at the simulator. Viewed another way, delaying each of the network cells is accomplished by servicing each of the cells from a queue, at intervals spaced to correspond to the desired period of time. These delay intervals may be created using delay cells stored in the queue along with the network cells. The number of delay cells stored in the queue may be dynamically controlled by configuring a threshold to limit the number of delay cells admitted to the queue.
In yet another embodiment, a trunk delay simulator which includes a queue configured to output network cells at times corresponding to a desired delay between their receipt and transmission is provided. The queue is also configured to service a number of delay cells prior to each of the network cells, the number of delay cells so serviced being controlled (e.g., using a configurable threshold associated with the queue) so as to allow the network cells to be serviced at the desired times. The trunk delay simulator preferably includes a local processor configured to inject the delay cells into the queue.
The present invention is illustrated by way of example, and not limitation, in the figures of the accompanying drawings in which like reference numerals refer to similar elements and in which:
FIG. 1 illustrates a digital network for which delay on a trunk may be simulated in accordance with the present invention;
FIG. 2 illustrates functional components of a digital switch which may be configured as a trunk delay simulator in accordance with one embodiment of the present invention;
FIG. 3 illustrates functional components of a broadband switching module which may be configured as a trunk delay simulator in accordance with one embodiment of the present invention;
FIG. 4 illustrates functional components of an ATM queuing circuit for use as a trunk delay simulator according to one embodiment of the present invention;
FIG. 5 is a block diagram illustrating the structure of the queuing circuit shown in FIG. 4 according to one embodiment of the present invention;
FIG. 6a illustrates a digital network having a communication link that may be simulated using the methods of the present invention;
FIG. 6b illustrates one embodiment of a trunk delay simulator in accordance with the teachings of the present invention;
FIG. 6c illustrates an alternative embodiment of a trunk delay simulator in accordance with the teachings of the present invention;
FIG. 7 illustrates the operation of a broadband switching module configured as a trunk delay simulator in accordance with one embodiment of the present invention;
FIG. 8 illustrates the use of dynamic threshold scaling to control queue depth in a broadband switching module when used as a trunk delay simulator in accordance with one embodiment of the present invention; and
FIG. 9 illustrates the calibration of queue depth for a trunk delay simulator in accordance with one embodiment of the present invention.
Methods and apparatus for using ATM queues to provide a trunk delay simulator are disclosed. Although discussed with reference to certain illustrated embodiments, upon review of this specification, those skilled in the art will recognize that the present invention may find application in a variety of systems. For example, although discussed with reference to ATM cells, the schemes described herein are equally applicable to networks which use variable length packets, and the term "cell" should be read as including such packets. Where such variable length packets are used, appropriate modifications may be required. For example, the thresholds discussed below may need to be specified in terms of bytes rather than cells. Therefore, in the following description the illustrated embodiments should be regarded as exemplary only and should not be deemed to limit the scope of the present invention.
FIG. 1 illustrates a network simulator configured in accordance with one embodiment of the present invention. Simulator 100 includes two digital switches 102 and 104, coupled together via digital communication link 106. Simulator 100 is configured to represent a portion of a cell switched digital communication network constructed of digital switches that are capable of building virtual circuits for routing cells. For example, switches 102 and 104 may represent a portion of a backbone for a broadband digital Wide Area Network (WAN). Digital communication link 106 may represent any of a variety of broadband communication links, including E3 lines, T3 lines, OC-3 lines and OC-12 lines. In operation, simulator 100 is designed to simulate the propagation delay which may be experienced on a trunk coupling real world switches in a digital network. More particularly, existing components of switches 102 and 104 are modified to achieve the simulated propagation delay, thus eliminating the need for expensive, custom hardware solutions. To appreciate the modifications and the methodologies contemplated by the present invention; some information regarding the operation of switches 102 and 104 is provided.
FIG. 2 illustrates a block diagram of the internal structure of a digital switch 120 (which may be substantially similar to switches 102 and 104). Each digital switch 120 includes a plurality of broadband switching modules (BXMs) 130 and a cross-point switch 140. BXMs 130 and cross-point switch 140 may each comprise one or more cards (e.g., front and back cards) which are housed within switch 120.
Each BXM 130 may include a network interface connected to a digital communication link. Every BXM 130 may also be coupled to a high-speed serial link 150 within the digital switch 120. In general, cells received from one of the digital communication links at one of the BXMs 130 are transferred from that BXM to cross-point switch 140 across a high-speed link 150. Cross-point switch 140 then routes those cells to another BXM 130 across a high-speed link 160. Ultimately, the cells are transmitted out of switch 120 on a digital communication link coupled to the second BXM. The asymmetric design of switch 120 allows two BXMs 130 to transmit cells through cross-point switch 140 to a single BXM 130 simultaneously.
FIG. 3 illustrates an internal block diagram of a BXM 130. The BXM 130 includes an ingress circuit 170, an egress circuit 180, a bus interface circuit 190 and a physical interface circuit 195. The ingress circuit 170 processes incoming cells received from one of the digital communications links through physical interface circuit 195. The egress circuit 180 processes outgoing data cells received from bus interface circuit 190. Ingress circuit 170 and egress circuit 180 may be substantially similar in design. The bus interface circuit 190 is coupled to both the ingress circuit 170 and the egress circuit 180 and distributes data cells to and from the high-speed links 150 and 160 within the digital switch 120. The physical interface circuit 195 is also coupled to the ingress circuit 170 and the egress circuit 180 and distributes cells to and from the digital communication links coupled to the physical interface circuit 195 through one or more ports. In one embodiment, a BXM 130 is capable of receiving cells from high-speed links 160 at a rate of 2�OC-12. That is, bus interface circuit 190 is capable of receiving cells from each of two high-speed links 160 at a rate of OC-12. Cells may be transmitted to a high-speed link 150 or a port at a rate of 1�OC-12.
As will become apparent, as cells are received at switch 120, they are organized into logical queues depending on their associated connections or classes of service. The logical queues may be organized into groups, which (for egress circuit 180) may correspond to virtual interfaces (VIs). Later, the cells are transmitted out of switch 120, generally according to the demands of their associated classes of service. To properly manage the logical queues, a number of accounting records for each interface, connection and class of service are maintained at switch 120. For example, for each interface, records which track the total number of cells stored in memory for that interface are maintained. Such records (along with associated cell maximum thresholds for each interface) allow for control over the number of cells stored in memory per interface, thus preventing a single interface from monopolizing the memory resources of switch 120.
In addition to interface accounting records, records regarding the total number of cells stored for each class of service and each connection may be maintained. These records may be used in order to prevent a single class of service or connection from monopolizing the memory resources of switch 120 (and for limiting cell transfer delay in the case of classes of service). Threshold values including maximum cell counts, CLP (cell loss priority) thresholds, EPD (early packet discard) thresholds, and EFCI (explicit forward congestion indicator) thresholds are maintained for each class of service and connection. These thresholds may be used in the conventional fashion and allow circuitry within switch 120 to make decisions regarding whether or not to accept new cells for a given connection or class of service. In general, cell admission policies may be based on a comparison of the number of cells of a given connection or class of service (or the total number of cells) already stored in memory at switch 120 with a pre-established threshold. Any or all of these thresholds may be dynamically scaled as memory resources become filled in order to prevent congestion. A related U.S. patent application Ser. No. 08/648,556, entitled "Method and Apparatus for Per Traffic Flow Buffer Management", filed May 15, 1996, now U.S. Pat. No. 6,034,945 issued on Mar. 7, 2000, by David A. Hughes and Daniel E. Klausmeier, and a continuation thereof filed as application Ser. No. 09/490,548 filed Jan. 24, 2000, assigned to the Assignee of the present invention discuss such dynamic scaling techniques in detail.
FIG. 4 illustrates the functional components of an ATM queuing circuit 200, which may correspond to an ingress circuit or an egress circuit. Queuing circuit 200 maintains various cell queues, including individual connection (or VC) queues and class of service (or QBin) queues which are organized into groups (QBGs) and are used to sort different traffic types. The QBGs may correspond to different physical or virtual interfaces as described in application Ser. No. 08/885,400, entitled "Multi-Stage Queuing Discipline", filed Jun. 30, 1997, by Daniel E. Klausmeier, Kevin Wong, Quang Nguyen, Cherng-Ren Sue and David A. Hughes, and assigned to the Assignee of the present invention. Although in one embodiment queuing circuit 200 is implemented at a digital switch in an ATM network, such a queuing structure may find application in other nodes of a digital network.
ATM cells arrive and are placed into a queue in a cell memory until the cell is serviced. In one embodiment incoming cells are stored in separate dynamic random access memory (DRAM) and the various queues are implemented through the use of linked lists. The manner in which such linked list queues may be implemented and controlled is discussed in detail in application Ser. No. 08/884999, entitled "Method and Apparatus for Maximizing Memory Throughput", filed Jun. 30, 1997, by Daniel E. Klausmeier and Kevin Wong, and assigned to the Assignee of the present invention. Briefly, as cells are received at queuing circuit 200, they are temporarily stored in a cell memory prior to transmission on an outgoing communication link. A linked list database is used to keep track of the location and sequence of the cells in the cell memory. That is, a series of "next entry" pointers are established such that each sequence of entries is linked together. Each connection and class of service has a corresponding linked list queue (VC queue or QBin queue, respectively) and a queue manager maintains the links in each of the queues so that the entries (i.e., pointers) in the linked lists are updated to reflect cell arrivals (to the tail of a VC queue or a QBin queue), cell moves (from the head of a VC queue to the tail of a QBin queue) and cell departures (from the head of a QBin queue).
As indicated above, some cells are enqueued in connection (VC) queues 202 prior to being moved to QBins 204 for servicing. A service controller determines when cells will be moved from a VC queue 202 to a QBin 204. Cells are then transmitted out of the QBins 204 according to the instructions of a queue controller which selects the next eligible QBin group (QBG) 206 and QBin 204 for service based on service eligibility and service priorities.
In addition to traffic received from the digital communication links, some of the cells received at queuing circuit 200 may be generated by a local processor (i.e., a processor included within switch 120). Frames of data from the local processor may be segmented into ATM cells before they are injected into queuing circuit 200. The manner in which such operations are performed using the two tier queue structure already provided for other ATM traffic is discussed in co-pending application Ser. No. 08/884,705, entitled "Method and Apparatus for Using ATM Queues for Segmentation and Reassembly of Data Frames", filed Jun. 30, 1997, now U.S. Pat. No. 6,201,813 B1, issued on Mar. 13, 2001, by Daniel E. Klausmeier, Kevin Wong and David A. Hughes, and a continuation thereof filed as application Ser. No. 09/774,335 on Jan. 30, 2001, assigned to the Assignee of the present invention.
FIG. 5 illustrates a block diagram of the structure of queuing circuit 200 according to one embodiment of the present invention. Queuing circuit 200 is described in detail in related application Ser. No. 08/885400, filed Jun. 30, 1997, entitled "Multi-Stage Queuing Discipline". In summary, a queue controller 210 controls the storage of cells in cell memory 212 through cell memory controller 214 and keeps track of the location and sequence of the cells so stored through the use of linked lists. Cell input engine (CIE) 216 receives incoming cells and stores the received cells in a receive queue. After CIE 216 receives a cell, it extracts the cell's connection, source and other information, and presents the information to queue controller 210 for processing.
Upon receipt of the cell information provided by CIE 216, queue controller 210 checks the relevant cell count thresholds to determine whether the newly arriving cell can be accommodated in the cell memory 212. Assuming that the cell is accepted, queue controller 210 increments the appropriate statistics and cell counts for the arriving cell and determines where to store the cell in cell memory 212. This storage location is linked to the tail of the appropriate queue (VC queue 202 or QBin queue 204) and the cell is stored to cell memory 212 from CIE 216 under the control of cell memory controller 214.
The cell departure process involves the use of cell output engine (COE) 218. Cells depart from QBins 204 and queue controller 210 is responsible for selecting a QBin for service. Once a QBin has been selected for service, queue controller 210 finds the cell memory 212 location of the cell at the head of the selected QBin and provides this information to cell memory controller 214. The cell at the designated storage location is then read out of cell memory 212 to COE 218 that loads the cell into an output queue. Connection information from the departing cell is extracted and provided to queue controller 210 which uses this information to retrieve and update the relevant queue statistics and cell counts and provides COE 218 with VCI, VPI, and EFCI update information for the departing cell. COE 218 then transmits the cell.
As indicated above, queuing circuit 200 may be used by a local processor to accomplish frame injection. During frame injection, a data frame is segmented into ATM cells for handling by queuing circuit 200. This may be accomplished using a segmentation engine that may be part of local processor interface 220 and may further be performed under DMA control.
In general, the local processor may store data in an associated local memory (e.g., a RAM), for example as part of an application running on the local processor. When the data is to be transmitted, the local processor configures cell header information for the data and also determines the frame length in terms of the number of cells (48-byte payloads). The data frame may then be provided to a segmentation engine that will segment the frame into ATM cells for queuing circuit 200. Preferably, the frame of data is segmented into ATM cells according to the conventional AAL-5 protocol. The completed cells are then injected into CIE 216 through a dedicated cell input queue (not shown). Thus, the injected cells appear as regular ATM traffic to queuing circuit 200, allowing the use of the queuing structure described above.
In addition to handling the processing of regular ATM traffic, the BXMs 130 may be used to simulate trunk delay, in accordance with the methods of the present invention, by injecting and maintaining a constant number of "no-op" or delay cells in front of any incoming cell representing regular network traffic at an egress QBin. Thus, the incoming traffic is delayed by the injected traffic for a fixed amount of time.
FIGS. 6a, 6 b and 6 c illustrate alternative configurations for the use of a BXM 130 as a trunk delay simulator. In FIG. 6a, the simulated network 300 is represented using BXMs 302 and 304 in switches 306 and 308, respectively. The BXMs 302 and 304 are coupled so as to communicate with each other across digital link 310. Now, to simulate delay that may be experienced on link 310, a BXM delay server 320 maybe installed between the existing BXM cards 302 and 304. As shown in FIG. 6b, the BXM delay server 320 may be located on the same digital switch as one of the regular BXM cards (e.g., within switch 306). Alternatively, the BXM delay server 320 may be installed on a third node, for example switch 322. In either case, the BXM delay server 320 is coupled between BXMs 302 and 304 (e.g., using digital communication links 324 and 326) and should remain transparent to the network 300.
In operation, the BXM delay server 320 should allow regular network traffic (i.e., cells) received at one port (an input port) to be automatically directed to an output port. That is, the regular network traffic should be delayed, but no cells should be dropped. The BXM delay server 320 should also be capable of generating cells by itself. The generated cells are injected into the same QBin as the regular network traffic at the egress circuit of the BXM delay server 320 to simulate propagation delay on the link 310. Injected cells should arrive faster than the regular network traffic so as to keep the egress QBin non-empty.
For proper simulation, delay should be introduced in both directions. That is. cells transmitted by BXM 302 should be delayed en route to BXM 304 and vice-versa. Further, a control must be maintained on the percentage of injected cells in the egress QBins. The BXM delay server 320 has to be able to keep a constant number of injected cells in the QBin so that every incoming network traffic cell experiences the same length of delay. BXM delay server 320 also has to ensure that the injected cells do not occupy the entire egress QBin and cause cells from the regular network traffic to be dropped. Therefore, the goal is to keep the number of injected cells in the egress QBin at a fixed percentage of the maximum queue depth. This should be accomplished while allowing the length of the simulated delay to be user configurable, e.g., from 10 to 1000 msec.
As shown in FIG. 7, at BXM delay server 320 incoming network traffic 330 from input port 332 is directed to the output port 334 by preprogramming a sufficient number of virtual path connections to cover all possible values of VPIs that may exist. Thus, cells are routed from the input port 332 to the backplane 335 of the host switch (e.g., switch 306 or 322) and then to the output port 334 on BXM server 320. This comprises a traffic path configured to route the regular traffic ATM cells from the input port to the egress queue.
Because BXM delay server 320 already has the ability to inject AAL5 frames of data or raw cells into the QBins (as described above), this feature may be used to inject cells 336 into the ingress QBins of ingress circuit 340. If the cell injection rate is not high enough to keep the queue non-empty, some or all of the injected cells may be replicated (e.g., at bus interface 190) using the multicast capability of the BXM delay server 320 to achieve a higher cell arrival rate at the egress QBin 342 of egress circuit 344. The goal is to have the injected cells deposited in the same QBin (i.e., egress QBin 342) as the regular network traffic 330 in the egress circuit 344 of BXM delay server 320. By injecting cells into the egress QBin 342, regular network traffic cells 330 are serviced at an overall slower rate than would otherwise be the case. Thus, at the receiving BXM card (e.g., BXM 304), it appears these cells have been delayed en route (e.g., due to propagation delays on communication link 310). Injected and replicated cells may be discarded after departing the QBin 342; thus, the traffic used to simulate link delay may be totally hidden from the regular network data traffic.
Dynamic scaling may be used to control the QBin depth so that the injected cell traffic is not allowed to overwhelm the egress QBin 342 to the point where regular network traffic cells are dropped. Complete details regarding the dynamic scaling scheme may be found in co-pending application Ser. No. 08/648,556, now issued as U.S. Pat. No. 6,034,945. Briefly, when a global cell count or a connection's cell count reaches a predetermined percentage of its maximum value (e.g., 50% or more), each cell count generates its own scaling index based on the percentage of resources used. The scaling indexes are used to read out (e.g., from memory) associated scale factors from a scale factor table. The scale factor is used to scale back the connection's thresholds. In one embodiment, the scaling table may be user configurable.
As shown in FIG. 8, if the entire queue 350 is divided into 64 equal divisions, the scaling index then represents the number of divisions that are not used. For example, if the max size threshold for the connection is 8192 cells, each division's size is 8192/64=128. If the current cell count is then 5240 cells, the scaling index is (8192−5240)/128=23. The scaling index is then used to read the scale factor from the table 360 and the scale factor is used to set the new connection threshold.
Thus, the VC resources are scaled down by reducing the VC thresholds. In one embodiment, each VC has four thresholds, one of them being the max threshold which is the maximum number of cells that a VC can have in the queue (arriving cells are discarded if the threshold is reached). Dynamic VC scaling reduces the thresholds by subtracting the derived scale factor from the exponent of the VC thresholds (where, in this embodiment, the threshold records are stored in a format which allows for such scaling). For example, if the current VC max threshold is 4*215, with scale factor equal to 12, the new VC threshold is 4*2(15−12)=4*23.
By setting the VI max size, QBin max threshold, VC max threshold and the scaling class of each VC in the scale factor table, it is possible to control the number of cells for each VC in the queue. Consider the scale factor table in Table 1. Scaling class 0 has all the entries set to 0 which means that there is no scaling on connections with scaling class set to 0. Scaling class 1 has the first two entries set to 15 (which for this embodiment is the maximum value of the exponent of VC thresholds) which indicates that if the queue length reaches (64−2)/64=96.875% of the VI max size, the thresholds of all connections with scaling class 1 are scaled down to almost 0 (if original threshold=4*212, new threshold=4). The real traffic is configured to use scaling class 0 so its cells are not subject to the thresholds applied to the delay cells, which use scaling class 1, 2 or 3.
. . .
. . .
Usage Percentage
. . .
. . .
No scaling
. . .
. . .
(64 − 2)/64 = 96.875%
. . .
. . .
(64 − 16)/64 = 75%
. . .
. . .
(64 − 32)/64 = 50%
Therefore, the VI max size, QBin max threshold and the VC max threshold together determine the absolute value of the queue size and the number of entries which are set to 15 in the scale factor table determines the percentage of the queue that a connection cannot fill.
The above mechanism is applied to all the multicast connections to control the number of "no-op" cells in the egress QBin 342. Therefore, even though multicast cells are continually generated, they can only fill up the QBin to a fixed percentage of the maximum queue size and any remaining no-op cells are discarded. This is how fixed delay is achieved for the regular traffic. For one embodiment, the VI max size can be programmed to be 4k, 8k, 16k, 32k, 64k, 128k, 256k or 512k cells.
FIG. 9 illustrates the calibration of the QBin depth using the mechanism just described. The VI max size decides the range of the actual QBin length and the range can be further subdivided into 32 sub-ranges by proper setting of the scale factor table. Note that the calibration is not uniform. The resolution is finer when the VI max size is smaller.
In operation, BXM delay server 320 is configured so that regular network traffic has scaling class 0 and multicast traffic has scaling class 1 to 3, depending on the required delay. The scaling classes are assigned such that connections belonging to different port-pairs have different scaling classes. Therefore, a user may introduce different lengths of delay on different port-pairs. However, both ports from the same port-pair have the same scaling class. Sufficient virtual path connections (4096 in on embodiment) to cover all possible VPIs of the incoming traffic are programmed so as to direct the traffic from the input port to the output port of the BXM delay server. One root multicast connection, which is used by the injected cells at the ingress direction, is also programmed. At the egress direction, the multicast leaf connections are programmed for each port. Note that the number of ports the BXM delay server can support is limited by the number of connections and multicast connections that a BXM card can support. This, in turn, depends on the available memory and the number of statistics to be maintained per connection.
Users may also configure the VI max size to get different ranges of delay. The QBin max threshold and VC thresholds of multicast connections on the same port are also changed to match the value of VI max size. Note that ports from the same port-pair may have different VI max sizes (but the same scaling class), this allows for different delays in different directions.
As indicated above, the maximum delay that any one BXM delay server can support is limited by the maximum queue length that the card can support. That is,
If a longer delay is desired, multiple BXM delay servers can be connected in series.
Thus a trunk delay simulator has been described. Although the foregoing description and accompanying figures discuss and illustrate specific exemplary embodiments, it should be appreciated that the present invention is to be measured only in terms of the claims that follow.
|Cited Patent
|Filing date
|Publication date
|Nov 30, 1989
|May 7, 1991
|At&T Bell Laboratories
|Method and apparatus for congestion control in a data network
|Jul 30, 1993
|May 3, 1994
|Ando Electric Co., Ltd.
|ATM cell delay circuit for ISDN system
|Apr 1, 1992
|May 17, 1994
|Stratacom, Inc.
|Congestion control for cell networks
|Nov 4, 1994
|Mar 12, 1996
|Electronics And Telecommunications Research Institute
|Asynchronous transfer mode (ATM) multiplexing process device and method of the broadband integrated service digital network subscriber access apparatus
|Aug 23, 1994
|Jun 25, 1996
|Hitachi, Ltd.
|ATM switching system and cell control method
|Oct 4, 1994
|Jul 30, 1996
|At&T Corp.
|Dynamic queue length thresholds in a shared memory ATM switch
|Oct 4, 1993
|Jul 30, 1996
|Kabushiki Kaisha Toshiba
|ATM cell assembly and disassembly device with enhanced data handling flexibility
|Apr 28, 1995
|Aug 27, 1996
|Nec Corporation
|Method and apparatus for performing priority control for cells in output buffer type ATM switch
|Aug 15, 1994
|Sep 17, 1996
|Fujitsu Limited
|Cell delay absorbing circuit
|Nov 30, 1994
|Sep 17, 1996
|Kabushiki Kaisha Toshiba
|Switching apparatus for ATM
|Dec 31, 1993
|Apr 21, 1998
|International Business Machines Corporation
|Switching apparatus and method for multiple traffic classes
|Mar 4, 1996
|May 5, 1998
|Siemens Aktiengesellschaft
|Method and circuit arrangement for forwarding message cells transmitted via an ATM communication equipment to a serving trunk
|Jan 11, 1996
|Jun 9, 1998
|Cisco Technology, Inc.
|Per channel frame queuing and servicing in the egress direction of a communications network
|Nov 17, 1995
|Jun 30, 1998
|Hitachi, Ltd.
|Regulation method and apparatus for ATM cell delay variation
|Aug 28, 1995
|Aug 18, 1998
|Integrated Device Technology, Inc.
|System and method for transmission rate control in a segmentation and reassembly (SAR) circuit under ATM protocol
|Aug 30, 1996
|May 4, 1999
|Mmc Networks, Inc.
|Apparatus and methods to change thresholds to control congestion in ATM switches
|Nov 27, 1996
|Jun 22, 1999
|Lucent Technologies Inc
|Adaptive time slot scheduling apparatus and method for end-points in an ATM network
|Aug 17, 1996
|Jun 22, 1999
|Fujitsu Limited
|Buffer control system
|Aug 5, 1996
|Sep 14, 1999
|Virata Limited
|Method and apparatus for source rate pacing in an ATM network
|Dec 27, 1996
|Oct 26, 1999
|Hitachi, Ltd.
|ATM controller and ATM communication control device
|Aug 15, 1996
|Nov 23, 1999
|Alcatel Str Ag
|Method for testing the conformity of an algorithm called GCRA for discriminating data cells, and an apparatus for executing the method
|May 15, 1996
|Mar 7, 2000
|Cisco Technology, Inc.
|Method and apparatus for per traffic flow buffer management
|May 20, 1996
|May 2, 2000
|Cisco Systems, Inc.
|Unified network cell scheduler and flow controller
|Jun 30, 1997
|Mar 13, 2001
|Cisco Technology, Inc.
|Method and apparatus for using ATM queues for segmentation and reassembly of data frames
|Sep 27, 1995
|Apr 10, 1996
|AT&T Corp.
|Dynamic queue length thresholds in a shared memory ATM switch
|H. Jonathan Chao & Donald E. Smith; Design of Virtual Channel Queue in an ATM Broadband Terminal Adaptor; Article; Infocom '92; CH3133-6/92/0000-0294; Bellcore, 331 Newman Springs Rd., Red Bank, N.J. 07701-7040, U.S.A.
|Massoud R. Hashemi & Alberto Leon-Garcia from the dept. of electrical & computer engineering-University of Toronto; A General Purpose Cell Sequencer/Scheduler for ATM Switches; 0-8186-7780-5/97.
|Massoud R. Hashemi & Alberto Leon-Garcia from the dept. of electrical & computer engineering—University of Toronto; A General Purpose Cell Sequencer/Scheduler for ATM Switches; 0-8186-7780-5/97.
|Voshihiro Ohba, Vumiokamatani, et al.; Dynamic Threshold Control for Shared Buffer ATM SWI; Shingaku Giho [Technical Report of IEICE], SSE95-12 [May 1995]; PTO 98-3836; United States Patent and Trademark Office, Washington, D.C., Aug. 1998, Translated by the Ralph McElroy Translation Company.
|Citing Patent
|Filing date
|Publication date
|Nov 23, 1999
|Apr 20, 2004
|International Business Machines Corporation
|Method and system for providing optimal discard fraction
|Jun 1, 2000
|Apr 19, 2005
|Cisco Technology, Inc.
|System and method for automated switching of data traffic in a packet network
|Aug 22, 2000
|Nov 8, 2005
|Fujitsu Limited
|Packet Switch
|Jul 31, 2000
|May 2, 2006
|Cicso Technology, Inc.
|System and method for improving reliability of a packet network
|Nov 15, 2001
|Aug 15, 2006
|International Business Machines Corporation
|Apparatus and method for managing work and completion queues using head and tail pointers with end-to-end context error cache for reliable datagram
|Apr 5, 2001
|Oct 3, 2006
|Juniper Networks, Inc.
|Packet switching system and method
|Dec 1, 2005
|Apr 21, 2009
|Turin Networks, Inc.
|System and method for remote traffic management in a communication network
|Oct 28, 2005
|Sep 22, 2009
|Broadcom Corporation
|Service aware flow control
|Jan 6, 2006
|Oct 6, 2009
|Kddi Corporation
|Communication system
|Mar 28, 2003
|Jan 19, 2010
|Alcatel-Lucent Usa Inc.
|Multicast scheduling and replication in switches
|Nov 30, 2005
|May 4, 2010
|Kddi Corporation
|Communication system, delay insertion server, backup server and communication control apparatus
|Aug 25, 2006
|Jul 13, 2010
|Juniper Networks, Inc.
|Packet switching system and method
|Oct 28, 2005
|May 24, 2011
|Broadcom Corporation
|Adaptive dynamic thresholding mechanism for link level flow control scheme
|Mar 11, 2008
|Jul 3, 2012
|Fujitsu Limited
|Communication device and method for controlling the output of packets
|Feb 1, 2010
|Jun 11, 2013
|Kddi Corporation
|Communication system, delay insertion server, backup server and communication control apparatus
|Jun 4, 2010
|Dec 24, 2013
|Juniper Networks, Inc.
|Packet switching system and method
|Aug 29, 2011
|May 6, 2014
|Marvell International Ltd.
|Apparatus and method for dynamically limiting output queue size in a quality of service network
|Nov 20, 2012
|Feb 17, 2015
|Cisco Technology, Inc.
|Fabric load balancing
|Aug 31, 2012
|Jun 16, 2015
|Cisco Technology, Inc.
|Multicast replication skip
|Mar 13, 2013
|Apr 18, 2017
|Cisco Technology, Inc.
|Intra switch transport protocol
|Apr 5, 2001
|Nov 8, 2001
|Masahiko Honda
|Packet switching system and method
|Nov 8, 2001
|Sep 12, 2002
|Shlomo Varsano
|Method and apparatus for automated service level agreements
|Nov 15, 2001
|May 15, 2003
|International Business Machines Corporation
|Apparatus and method for managing work and completion queues using head and tail pointers with end-to-end context error cache for reliable datagram
|Mar 28, 2003
|Jan 15, 2004
|Dimitrios Stiliadis
|Multicast scheduling and replication in switches
|Jul 28, 2004
|Mar 17, 2005
|Processing of data packets adaptable as a function of an internal load status, for routing in a QoS architecture
|Dec 1, 2005
|Apr 13, 2006
|Teraslinna Kari T
|System and method for remote traffic management in a communication network
|Oct 28, 2005
|May 4, 2006
|Broadcom Corporation
|Adaptive dynamic thresholding mechanism for link level flow control scheme
|Oct 28, 2005
|May 4, 2006
|Broadcom Corporation
|Service aware flow control
|Nov 30, 2005
|Jun 8, 2006
|Kddi Corporation
|Communication system, delay insertion server, backup server and communication control apparatus
|Jan 6, 2006
|Sep 7, 2006
|Kddi Corporation
|Communication system
|Aug 25, 2006
|Dec 21, 2006
|Juniper Networks, Inc.
|Packet switching system and method
|Mar 11, 2008
|Sep 25, 2008
|Fujitsu Limited
|Communication device and method for controlling the output of packets
|Feb 1, 2010
|Jun 10, 2010
|Kddi Corporation
|Communication system, delay insertion server, backup server and communication control apparatus
|Jun 4, 2010
|Sep 23, 2010
|Juniper Networks, Inc.
|Packet switching system and method
|U.S. Classification
|370/230.1, 370/428, 370/412, 370/395.7
|International Classification
|Cooperative Classification
|European Classification
|Sep 4, 1998
Owner name: CISCO TECHNOLOGY, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HUGHES, DAVID A.;MARATHE, MADHAV V.;WANG, CHANG-YU;REEL/FRAME:009448/0211
Effective date: 19980902
|Feb 6, 2006
|Fee payment
Year of fee payment: 4
|Jan 22, 2010
|Fee payment
Year of fee payment: 8
|Feb 6, 2014
|Fee payment
Year of fee payment: 12


text:
Tree Planting Info.
Planting a tree can serve several purposes; add beauty to your yard, act as a barrier, increase property value, erosion control or provide wildlife food and habitat. However, before you buy a tree there are several things to consider. You have to make the commitment to plant it properly and take care of it until it gets established. Here are some tips.
Before choosing a tree there are a few things to consider:
• Use of the tree - Will the purpose be for shade, adding privacy or windbreak?
• Aesthetics - Spring flowering? Year-round or fall leaf color?
• Size - Tall or short? Crown width? What will fit best when tree is at mature size?
• Zone Hardy - Make sure the tree is hardy for the zone in which you live.
• Soil Conditions - Do you have sandy, loamy or clay soil? What needs to be done to amend the soil?
• Light Conditions – Will the tree get more sun or more shade?
Planting and care of your tree:
• Call Diggers Hotline, (800)242-8511 in Wisconsin, before beginning to have underground utilities located.
• Dig a hole at least two times wider than the root ball or pot the tree came in.
• Loosen the sides and bottom of roots, especially if roots are circling. This will encourage roots to grow outward.
• Place root ball in the hole keeping the trunk flare slightly above ground level to allow for soil settling. Top of roots should be covered by 1-2 inches of soil.
• Fill hole with amended soil consisting of 1/3 soil dug out of hole, 1/3 compost and 1/3 peat. Tamp soil gently to fill possible air spaces, or water as you fill soil to eliminate air pockets.
• Top with 2-3 inches of mulch being careful to keep two inch clearance around trunk of tree.
• Water regularly the first year. Top 10-12 inches of soil should be kept moist, but not soggy.
Following these simple tips will keep you enjoying your tree for your lifetime.

subset: commoncrawl


text:
Paul Dean - guitar, vocals; Matthew Frenette - drums; Doug Johnson - keyboards; Mike Reno - vocals; Scott Smith - bass, vocals
Loverboy was literally an overnight sensation. Within weeks of being heard at a number of high profile rock clubs in its native Toronto, the band, with huge hair and spandex pants, had a number of labels chasing them. Signed immediately to Columbia Records and to producer Bruce Fairbain, the group released its debut album and quickly scored huge radio hits with "Turn Me Loose" and "The Kid Is Hot Tonight."
This show was recorded in 1982 as the band worked as a stadium rock opener, just two years after they formed. Singer Mike Reno was perfect for the times and very adequately filled the role as lead singer for Loverboy.
Although some forgettable tracks like "Lady Of The 80's," "Teenage Overdose," and "Gangs In The Street" fill out the set, most of these tracks rock pretty hard and seem to have withstood the changing musical tides, even if their hair and clothes didn't.
"Jump," "Lucky Ones," and "Take Me To The Top," along with the super hits, "Working For The Weekend," "Turn Me Loose," "The Kid Is Hot Tonight," and "When It's Over" make this show almost a greatest hits package. They close with an 11-minute version of "Emotional."
Loverboy was probably the biggest band in Canada, and one of the most popular bands in the rest of the world, when these tracks were cut. The band is credited as a later example of the AOR (album-oriented rock) FM format, as most of the radio cuts have since become staples in the classic rock genre. The band continued working with Bruce Fairbain, who had a knack for getting hit songs out of them, through the following year. When Fairbain took on Aerosmith, the group moved on to producer Tom Allom (Judas Priest), but they failed to produce any hits with him.
The group continued recording studio albums until 1987 when they decided to take a long break so singer Mike Reno and guitarist Paul Dean could pursue solo careers. The hiatus would last until they reformed to release Six in 1997. The original line-up of the band, sadly, would never play together again after the fall of 2000, when bassist Scott Smith was declared "lost at sea" after a freak wave knocked him from a sailing boat off the coast of San Francisco.


text:
3200 Rosslynn Dr., Kingman, AZ 86401
- $54,900
- 1+ Years on site
- Est: $203/month
Estimate Your Monthly Payment
Data provided by Informa Research Services. Payments do not include amounts for taxes and insurance premiums. The actual payment obligation will be greater if taxes and insurance are included. Click here for more information on rates and product details.
- Mortgage Center
- Beds: n/a
- Baths: n/a
- Building Lot
This exclusive neighborhood features 85 premium large-acreage homesites throughout the 188-acre community, each perfectly suited for homes w/ a minimum size of 1,800 square feet. These carefully planned homesites offer underground utilities (electric, phone, & cable), city water versus well water, & a concrete culvert systems to help ensure the integrity of both personal property & open spaces from erosion. This hillside community offers dramatic evening views of the Kingman city lights & stunning mountain vistas. Click here to learn more about this listing.
- Year Built: n/a
- 1+ Years on site
- Building Lot
- Beds: n/a
- Baths: n/a
Listing Details
- Lot Features
- Mountain View
- Lot Size
- Approximately 53578 Square Feet
- Tax Amount
- $704.16
- Tax Year
- 2016
Local Info
| Median Household Income
| Median Years In Residence
| Median Homeowner Age
| Households with Children
| Percent of Homes Rented
Nearby Elementary Schools
- Emmanuel Christian Academy
- 3120 Hualapai Mnt Rd Ste C
- Hualapai Elementary School
- 350 Eastern Ave
- Manzanita Elementary School
- 2601 Detroit Ave
Nearby Middle Schools
- Emmanuel Christian Academy
- 3120 Hualapai Mnt Rd Ste C
- Manzanita Elementary School
- 2601 Detroit Ave
- Kingman Academy Of Learning - Middle School
- 3269 Harrison St
Nearby High Schools
- Wave-Mohave Community College
- 1971 E Jagerson Ave
- Lee Williams High School
- 400 Grandview Ave
- Wave- Lee Williams High School
- 400 Grandview Ave
These are the closest schools to your requested location. Proximity does not guarantee enrollment eligibility. Please consult your real estate agent or school district to confirm the schools you are zoned to attend.
Property Contact Info
Need More Information?
Please fill out this form to request more photos or more information regarding this property.


text: Just yesterday I installed the skype application in my ampe A73 where I was able to connect the call as well but now for some reason its not booting up after that. Any idea what might have went wrong? What should I do now to resolve this problem soon? Kindly guide me on this.


text:
Conversational Russian *Private Class*
This Course Has No Reviews Yet
Conversational Russian Course
The Conversational Russian Course offers lessons specially designed for beginners and for those who intend to brush up their Russian language skills. The course covers simple dialogue (with the aid of English translation), basic grammar, vocabulary and expressions, and formal introductions including how to addressing people. This course does not cover reading or writing of the Russian characters.
In each lesson, illustrations of the RUSSIAN culture and customs will be presented, offering you a glimpse of their distinct lifestyle and diverse experiences. This will allow you to have a better "feel" of the language as it is used in its native context. The class is held in an interactive manner, enabling students to speak Russian with one another and the native speaking Russian teacher.
Our aim is to develop students' conversational skills such as delivering simple sentences with a vocabulary of at least 400 words. With the use of Phonetic Exercises, students will learn the proper pronunciation of Russian, as well as, speaking in the correct Russian accent. Additionally, through dialogue sessions, students will also:
- Acquire basic comprehension skills: listening and understanding
- Be able to carry out situational-based conversations
- Learn useful everyday phrases: colloquial/slang skills
At the end of the course, students will be able to construct basic sentences with proper grammatical structure through the correct use of verbs.
Conversational RUSSIAN Level 1 > Conversational RUSSIAN Level 2 > Higher Conversational RUSSIAN
At Oxford Language Academy, we offer private conversational Russian language classes for adults and children, and Russian language training for businesses and corporations.
|Course name:
|Conversational Russian *Private Class*
|Tuition fee, Administrative fee, Course material
|15 Enggor Street, #10-03 Tanjong Pagar 079716
Contact School
0 Course reviewsview all
Did you take this course? Review it here
Quick Facts
Course Facts...................................................................................
Tuition fee, Administrative fee, Course material
Contact School...................................................................................
Main OfficeOxford Institute Singapore
15 Enggor Street, #10-03
Tanjong Pagar 079716
Other Russian Courses
Private Russian lessons
2 reviews
Russian Language. ELEMENTARY course
1 reviews
Russian Language. START course
1 reviews
Russian Course (part-time)
0 reviews


text:
Kahlua, rum, lemon juice…this has to be the easiest drink to make. It's pretty good to.
Moon Quake Shake Ingredients
Moon Quake Shake Directions
Non Sequitur
According to NASA, there are at least four different kinds of moonquakes (not boobquakes):
Deep moonquakes (~700 km below the surface, probably caused by tidal in origin)
Meteorites impact vibrations
Thermal quakes (the frigid lunar crust expands sunlight returns after the two week lunar night)
Shallow moonquakes (20 or 30 kilometers below the surface)
The first three mentioned above tend to be mild; however, shallow moonquakes can register up to 5.5 on the Richter scale. Between 1972 and 1977, twenty-eight shallow moonquakes were observed. On Earth, quakes of magnitude 4.5 and above can cause damage to buildings and other rigid structures.
Little is known about the causes, or the distribution, of shallow moonquakes. One possible explanation is that relatively young craters may slump. Neal and his colleagues are proposing that a network of 12 seismometers be placed around the moon to gather data; this would be part of the larger plan to find safe lunar bases. All your base are belong to us!


text:
This quirky novelty meat tin product cleverly aims to sell canned yeti meat to the public. As far as folklore goes, Yeti meat is extremely hard to come by making this an exclusive and highly prized tin of cured meat.
While the Pure Himalayan Yeti Meat can isn't actually filled with Yeti flesh, it makes for a great gag gift for someone that perhaps enjoys canned foods a bit too much or who enjoys the legends of the snowy mammal. The can is modelled after spam with a sleek rectangular tin and a picture of a Yeti hiding behind the tree located under the wintery logo. Inside the can is a plushy Yeti foot rather than any actual meat.
Canned Yeti Meats
More Stats +/-
Novelty Macho Restaurants
Bento Box Travel Guides
Pretzel Chicken Nuggets
Plant-Based Protein Campaigns
Halal Smoked Meat Branding
The Pure Himalayan Yeti Meat Tins are a Fun Novelty Item
- By: Misel SabanNov 7, 2015
References: go.redirectingat & thatsnerdalicious
References: go.redirectingat & thatsnerdalicious


text:
I Usually Hold the Door Open For Others
Personal Stories, Advice, and Support 3,179 People
I always end up holding the door no matter whatI just feel like I have to.
mckennars 18-21, F 1 Response 2 Jun 14, 2015
It's not a hard thing to do.If I'm going out and someone is right behind me or coming in, I'll hold it open. It's not like it takes anything extra.
wedgieshurtalot 18-21, F 2 Responses 7 Feb 15, 2015
In London recently I noticedthat no one does this. Regardless of race and religion, saying please and thank you just doesn't seem to apply. Being from a small country village with not very many people, it's abnormal and quite rude to open a door and not have someone say thank you! Or am I expecting too...
I hold doors open for people cause it may seemlike a small thing but one time when I opened the door for someone they were so thankful and they told me how the last time someone opened the door for them was so long ago and awe but sometimes I don't hold the door open cause usually No one at all says thank you, one time I...
drunkpunker 16-17, F 1 Response 2 Jun 21, 2015
Alylovespuppies 18-21, F 5 Apr 3, 2015
My husband always opens the doorfor me and he teaches my son to do the same with women. What happen to all been doing that . Also how rude is it if you see someone coming just take the few seconds and hold it open
princessandravensmom 36-40, F 9 Responses 15 Aug 7, 2015
if I see a lady or a older personor handicap person I always hold the door open for them I was taught this by my dad he always told me you might need someone to hold the door for you one day
justmyself11 56-60, M 7 Jul 31, 2015
Usually when I am coming into work,I see people walking up behind me, straggling in, I stand there with my foot as a door stop, I must be insane.
1niceguy4u 51-55, M 3 Oct 9, 2015
I live in a fairly small town,I've been saying it's growing too much since the 70's though. Courtesy comes natural, I hold the door's open even if someone is fifteen feet away. That's just how I am. Some people think I'm crazy and give dirty looks, oh yes it happens. Oh well that's the city culture. Perhaps...
what can I say? I'm a nice personand it's practically a subconscious gesture.
CreativeKitty 22-25, F 2 Responses 6 Jul 30, 2015
I always do. Doesn't matter the gender,If someone is close I will hold the door. It is polite, courteous and considerate. If I am on a date, or out, I always try to open doors for them.
Kman4You 41-45, M 9 May 28, 2015
If they are coming behind me,I will either hold it open or push it open a little more so they can make it through.
aliadele 18-21, F 1 Response 7 Aug 10, 2015
Usually? I always hold the door open.Even if the person is 20 feet away, I'd probably just stand there waiting like a weirdo lol. One time at church, my brother, mother and I were leaving and I was walking behind both of them and my brother opened the door and walked out, then my mother did, then I did, then I...
YouCantEscapeMyDemons 16-17, M 3 Responses 13 Feb 14, 2015
just be a nice human beingand do a random act of kindness.
Every morning after I get off the bus,I hold the door open for at least 10 minutes for everyone who gets off the bus. It makes me happy to help others :) even though over half don't even say thank you
a little courtesy goes a long way.small acts that show ypu care about other people. Hold a door, Hold the elevator, let someone with three items in front of you at the checkout, let someone with an upset child in front of you at checkout, ect. These small acts of kindness shows you are caring and can turn a bad...
I've always done thisfor as long as I learned how to open a door. It's just a natural, innate thing for me. Doesn't matter the gender or age of the person, I like opening doors for people, to help and show I care about my fellow inhabitants :) A few times people have gotten offended that I...
JadeKnight 26-30, T 1 Jul 31, 2015
I try to be a gent and a caring human being Iwas raised proper
allychef 41-45, M 1 Response 6 Jul 30, 2015
It's just good manners.I also thank people who hold doors open for me. There are people who don't care to do either.
butterflybaby90 26-30, F 1 Response 7 Jan 9, 2016
I always do this, I don't seewhy you wouldn't lol
I Am Maybe Even Too Nice!This is really extreme with me. I not only open the door, hold it, but I also make a small bow, and make people feel at ease. :) When I was little, I used to secretly point at people who talked in a conversation, at the exact time, so I could measure the pace of how much...
XVII 18-21, F 9 Responses 4 Mar 2, 2010
Sometimes you hold the door openfor one person and before you know it you've been condemned to holding the door open for what seems like everyone.
SomeGuyNamedBlue 18-21, M 1 Response 3 Mar 1, 2015
yes especially elderlyor disabled person or pregnant for giving them respect and priorities
gloryglory1984 31-35, F 3 Aug 2, 2015
I feel guilty if I don't hold it open.It's almost as if I can feel those cold stares from them on my back sayin " dude you had one job"
luna500 18-21, F 2 Responses 3 Feb 15, 2015
It's just common courtesy.That, and I like being kind. Not much more to say about it.
lyricalongings 31-35, F 1 Response 10 Oct 24, 2015
i always hold the door open,even if they're. not right behind me.
Ang012685 31-35, F 1 Response 6 Apr 10, 2015
Why! Am! I! So! Kind!? I really don't mind it though...
RedMistDragon 18-21, M 5 Responses 10 Oct 24, 2015
I like to hold door for girlsand guys. Some guys are like, "Oh, thanks. I can...never mind."
XxCuTiE14xX 18-21, F 2 Jun 14, 2015
wildcardd 26-30, M 3 Responses 3 Jul 31, 2015
I do this nearly every day,no matter where I go, to work, to the gym, to the store, I think I was permanently damaged and conditioned to do so due to being a doorman in a movie theater while in high school!
1niceguy4u 51-55, M 1 Response 3 Nov 6, 2015
Why wouldn't you? A small act of kindnessGoes a long way.
My dad has always done this.It's just good manners. Plus, if just one person feels more important because you noticed them and stopped to be courteous, isn't that worth it? We could all use a little bit of courtesy these days.
CharryICT 36-40, F 1 Response 0 Jan 2, 2016
I think everyone, no matter their gender,should hold the door open for other people. It's just common courtesy.
I almost always do butonce I did and the guy (who was fairly elderly) said "what a nice young lady"
noahnah 18-21, M 2 Responses 6 Aug 1, 2015
for me its more of a habitthan being polite lol . i still open the door for my mum and girlfriend even after a huge arguement.
Mateom93 22-25, M 5 Feb 14, 2015
Last year during school I would always hold thedoor open for people and go in/out (whatever the case was) last. It actually was noticed by others but I didn't hear about it from them until later haha.
I have manners. I believe manners are extremelyimportant. It just makes me feel good to be nice. I'm a woman, but I'd still hold the door open for both guys and women.
The other day I was going to the store.some guy was comeing out as I was walking in. I stopped and held the door for him. he just stood there with a dirty look on his face. Maybe he wanted me to just go in first but he was standing right in my way. I didn't really know what to do so I just stood there holding the...
BornToBeCrazy 22-25, F 2 Responses 1 Mar 11, 2016
Actually, I always do.I was just taught to do that because it's the right thing to do. I HATE it when people don't say thank you. It's like DUDE I took the time out of my busy schedule to so that for you! Oh well, some people have no damn manners! LOL I appreciate when a random stranger does that for...
just being polite. it's nice to see someonesmile and say thanks.
johnbenfield 51-55, M 1 Response 7 Aug 8, 2015
Oh my god this is like a bad habit of mine,like I always but always do so. And once I went to see my sister's pageant show and when it ended like I was holding the fudging door for every single person and the part were I really don't like it is when people never say thank you or at least give you a smile like for real...
Even though I am a woman,I do not adhere to the old belief of only gentlemen open the doors. If someone needs help, open the door!
I do, it's good mannersand it doesn't take any effort - I think little things like that are nice! But if they don't say thank you, I'll slam the next one in their face!
CaffeineJunky 22-25, F 7 Responses 13 Jul 31, 2015


text:
Our website uses cookies to help provide you with the best experience we can. Cookies are small text files that are placed on your computer or mobile phone when you browse websites. We want to help you understand the implications of cookies so have included a cookie information page for your information. We will take your continued use of the site as acceptance of our cookies and will not show this message again, the cookie information can be accessed from the link at the bottom of the page at any time.
You haven't logged in yet. If you have an account already then Log In or, if you are new then Register for an account now... it's free!
Hints and tips on setting up a grass arena.
click on the diagrams to see larger versions
You will need:
When you have everything ready, you can mark out the arena
Ensure that all the tools and instruments used to mark out the arena are removed before you enter on your horse.


text:
A Little Peek...AnimeDutchess: The obsessive otaku chick from Jersey
Can also be found on:
...and most any other site as the same person.
Dream Avies (Won, i am, erm..."borrowing" what you did on your profile! XD;; ):
The Snarky Wench:
Total Value: 209,484 Gold
[Item Information]
Item List:
Maple Tavern Wench's Honey Cake Tray
Oak Tavern Wench's Wooden Shoes
Berry Tavern Wench's Bustier
Clean White Tavern Wench's Blouse
Berry White Gathered Tavern Wench's Skirt
She owned the only tavarn in town, she did, and let no man forget it as she served them all honeyed cakes with a smile that had long learned to reach her eyes, even if she didn't mean it.
The KeyBlade Warrior:
Total Value: 146,872 Gold
[Item Information]
Item List:
Ume Blossom Hairpin
Emo Glasses
G Blade
Black Workjeans
Coal Gunner Boots
Silver BFF Heart Chain
Lex's Dark Gloves
Berry Tavern Wench's Bustier
Coal Black Tavern Wench's Blouse
With a blade that cut through the deepest darkness, she fights on to protect those that are close to her...
Concubine To The King:
Total Value: 38,293 Gold
[Item Information]
Item List:
Felicia's Gloves
Scar Of Duelist
Pearl Necklace
Black Orchid Brooch
Purple Reading Glasses
Elegant Black Lace Fan
Black Cross Lace Shoes
Felicia's Wise Gown
Lovely Genie Double Silver Earrings
She didn't want to be King Louie Von Helson's favorite, or the most beautiful of all his vampiress concubines...she just wanted him to acknowledge her, even though she was turned from the vampire potion. And he did acknowledge her. Many, many times.
...yeah, i made some weird ones. don't ask. ^^;;