1-9. (canceled)
10. An office chair assembly, comprising:
a support element having an accommodating groove formed therein;
an areal covering element to be secured to said support element and tensioned at said support element;
said covering element carrying at least one welt strip on a marginal edge thereof, said welt strip being configured for placement, in a fitted state of said areal covering element, in said accommodating groove in said support element;
said accommodating groove having two mutually opposite contact faces and a projection formed on one of said contact faces, projecting into said accommodating groove, and extending along a longitudinal direction of said groove;
said welt strip and said accommodating groove being configured such at least one of said projection and said welt strip is resiliently deformed when said welt strip is pressed into said accommodating groove; and
wherein said welt strip, in the fitted state of said areal covering element, is retained in said accommodating groove in a positive lock andor a force-lock, with said welt strip abutting against said contact faces, and said welt strip being prevented from escaping from said accommodating groove by said projection.
11. The assembly according to claim 10, configured as an office chair or a part of an office chair.
12. The assembly according to claim 10, configured as a backrest or a seat of an office chair.
13. The assembly according to claim 10, wherein said areal covering element is a fabric, a cushioning element, or a webbing element.
14. The assembly according to claim 10, wherein said support element is formed by arms of a support frame of an office chair and said covering element is tensioned between said arms.
15. The assembly according to claim 10, wherein said welt strip has two oppositely situated side faces and two oppositely situated end faces, wherein said welt strip is insertable into said accommodating groove by said welt strip being pressed with one of said end faces to the fore into said accommodating groove, and in the fitted state, by way of said side faces abutting against said contact faces of said accommodating groove.
16. The assembly according to claim 10, wherein said welt strip is formed with a clamping strip extending in the longitudinal direction of said welt strip and, in the fitted state, abutting against said projection.
17. The assembly according to claim 10, wherein said accommodating groove is formed on said support element to define an angle of less than 90\xb0 between a direction of extraction of said welt strip from said accommodating groove and a tensioning direction of said covering element tensioned between said support elements.
18. The assembly according to claim 17, wherein said projection is configured to, in the fitted state, abut against said side face of said welt strip pointing in the tensioning direction.
19. The assembly according to claim 10, wherein said accommodating groove is formed between a basic body of said support element, defining one of said two contact faces of said accommodating groove, and a profile element connected to said basic body of aid support element, defining the other of said two contact faces of said accommodating groove.
20. The assembly according to claim 19, wherein said profile element is detachably connected to said basic body.
21. The assembly according to claim 10, wherein at least one side face of said welt strip is covered with a welt rim in such a manner that, in the fitted state, the welt rim abuts against at least one contact face of the accommodating groove.
22. The assembly according to claim 21, wherein said covering element is said welt rim.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
What is claimed:
1. A packet engine for use in a node in a data network, comprising:
a packet switch;
a forwarding engine; and
a queuing processor;
where the queuing processor assigns individual packets to a flow queue by parsing a header appended by the forwarding engine.
2. The packet engine of claim 1, where flow queues are assigned to a plurality of subclasses, and each subclass is assigned to a plurality of classes.
3. The packet engine of claim 2, where the queuing processor services the queues in each class with a different priority weight, where the sum of the priority weights over all of the classes equals 1.
4. The packet engine of claim 2, where the queuing processor services the queues in each subclass with a different priority weight, where the sum of the priority weights over all of the subclasses equals 1.
5. The packet engine of claim 3 where the queuing processor services the queues in each subclass with a different priority weight, where the sum of the priority weights over all of the subclasses equals 1.
6. The packet engine of any of claims 2-5, where the queues are serviced in a weighted round robin manner.
7. The packet engine of claim 6, where the round robin manner defines unit quantities of data or unit quantities of time, and allocates more units to the higher priority weights according to a user defined algorithm.
8. A packet engine for use in a node in a data network, comprising:
a packet switch;
a forwarding engine; and
a queuing processor,
where the queuing processor assigns individual packets to a flow queue by parsing a header appended by the forwarding engine, and where said header is determined by reading user defined sets of bits in each packet.
9. The packet engine of claim 8, where flow queues are assigned to a plurality of subclasses, and each subclass is assigned to a plurality of classes.
10. The packet engine of claim 9, where the queuing processor services the queues in each class with a different priority weight, where the sum of the priority weights over all of the classes equals 1.
11. The packet engine of claim 9, where the queuing processor services the queues in each subclass with a different priority weight, where the sum of the priority weights over all of the subclasses equals 1.
12. The packet engine of claim 11 where the queuing processor services the queues in each subclass with a different priority weight, where the sum of the priority weights over all of the subclasses equals 1.
13. The packet engine of any of claims 9-12, where the queues are serviced in a weighted round robin manner.
14. The packet engine of claim 13, where the round robin manner defines unit quantities of data or unit quantities of time, and allocates more units to the higher priority weights according to a user defined algorithm.
15. A method of providing differentiated services in a data network comprising:
near immediate rerouting; and
organizing packet flow queues in multiple classes,
where each class has one or more subclasses.
16. The method of claim 15, where each class is assigned a different priority weight for service.
17. The method of claim 16, where within each class, each subclass is assigned a different priority weight for service.
18. The method of any of claims 16 or 17, where the queues are serviced in a weighted round robin manner, according to the assigned priority weights.
19. The method of claim 18, where a given queue can be dynamically assigned to a given class and subclass based upon user defined criteria.
20. The method of claim 18, where the round robin manner defines unit quantities of data or unit quantities of time, and allocates more units to the higher priority weights according to a user defined algorithm.
21. The method of claim 19, where said user defined criteria include the aggregate of the various customer defined differentiated service classes served by the data network.
22. The method of claim 15 where said class and subclass are determined by reading user defined sets of bits in each packet.
23. A packet engine for use in a node in a data network, comprising:
packet switching means;
packet routing means; and
packet queuing means;
where the packet queuing means assigns individual packets to a flow queue by parsing a header appended by the packet routing means.
24. A data network comprised of multiple nodes, each comprising the packet engine of any of claims 1, 8 or 23, or implementing the method of claim 15.
25. The packet engine of any of claims 2-5, or 9-12, where the functions of the packet switching means, routing means and queuing means do not impede the flow of packets through the node at the line rate.
26. The packet engine of claim 23, where the functions of the packet switch, forwarding engine and queuing processor do not impede the flow of packets through the node at the line rate.
27. The method of claim 15, where the provision of said differentiated services does not impede the flow of data through the network at line rates.