Data transfer apparatus and data transfer method

Electrical computers and digital processing systems: multicomput – Computer conferencing – Priority based messaging

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S200000, C709S250000

Reexamination Certificate

active

10219256

ABSTRACT:
A forwarding table7where a next transmission queue is registered is sequentially transferred within a queue chain30as a group of queues131. If a priority of a queue to which the forwarding table7is transferred is higher than that of a queue registered in the forwarding table7as a next transmission queue, a next transmission queue number or the like is updated. Further, an arbiter8outputs a transmission command to a queue registered as the next transmission queue in the forwarding table7which has been transferred through all the queues, to transmit the next data frame from the queue having the highest priority. By this arrangement, it is possible to determine data frame transmission priorities among plural queues easily and efficiently while insuring a minimum guaranteed rate defined in each queue.

REFERENCES:
patent: 5128932 (1992-07-01), Li
patent: 5487172 (1996-01-01), Hyatt
patent: 5925097 (1999-07-01), Gopinath et al.
patent: 5991817 (1999-11-01), Rowett et al.
patent: 6167041 (2000-12-01), Afanador
patent: 6212164 (2001-04-01), Murakami et al.
patent: 6240458 (2001-05-01), Gilbertson
patent: 6279050 (2001-08-01), Chilton et al.
patent: 6400715 (2002-06-01), Beaudoin et al.
patent: 6434620 (2002-08-01), Boucher et al.
patent: 6570875 (2003-05-01), Hegde
patent: 6845100 (2005-01-01), Rinne
patent: 7010607 (2006-03-01), Bunton
patent: 2002/0091826 (2002-07-01), Comeau et al.
patent: 2004/0003126 (2004-01-01), Boucher et al.
patent: 2004/0030745 (2004-02-01), Boucher et al.
patent: 2004/0100952 (2004-05-01), Boucher et al.
patent: 2005/0160139 (2005-07-01), Boucher et al.
patent: 2005/0185651 (2005-08-01), Rinne
patent: 2005/0204058 (2005-09-01), Philbrick et al.
patent: 2005/0278459 (2005-12-01), Boucher et al.
patent: 2224419 (1990-05-01), None
patent: 2324678 (1998-10-01), None
patent: 2342810 (2000-04-01), None
patent: 6-338905 (1994-12-01), None
patent: 10-84346 (1998-03-01), None
patent: 11-317743 (1999-11-01), None
patent: WO 97/13353 (1997-04-01), None
Quality-of-Service in Packet Networks Basic Mechanisms and..—Guérin, Peris (1999) www.seas.upenn.edu/˜guerin/publications/qos.ps.gz.
Theory and Practice in Parallel Job Scheduling—Feitelson, Rudolph.. (1994) www.cs.huji.ac.il/˜feit/parsched/p-97-1.ps.gz.
Internet Engineering Task Force IPTEL WG—Internet-Draft Lennox Schulzrinne www.cs.columbia.edu/˜lennox/draft-ietf-iptel-cpl-requirements-00.
Performance of PLAYTHROUGH rings with mixed types of traffic Ghafir, H.M.; Silio, C.B., Jr.; Local Computer Networks, 1989., Proceedings 14th Conference on Oct. 10-12, 1989 pp. 426-434.
Using system state information for adaptive state polling policy in distributed load balancing Gil-Haeng Lee; Parallel Algorithms/Architecture Synthesis, 1997. Proceedings. Second Aizu International Symposium Mar. 17-21, 1997 pp. 166-173.
Practical use of Ada 95's concurrency features Carter, J.R.; Sanden, B.I.; Concurrency, IEEE [see also IEEE Parallel & Distributed Technology] vol. 6, Issue 4, Oct.-Dec. 1998 pp. 47-56.
www.techweb.com/encyclopedia (2 pages).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Data transfer apparatus and data transfer method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data transfer apparatus and data transfer method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data transfer apparatus and data transfer method will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3868023

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.