Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2002-04-18
2004-07-20
Hsu, Alpus H. (Department: 2665)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S419000, C370S230000, C370S395400, C370S412000
Reexamination Certificate
active
06765905
ABSTRACT:
BACKGROUND OF THE INVENTION
The present invention pertains to packet data traffic through a network and more particularly to cumulative delays in node to node transfer of packet data through an internet protocol network.
Modern high speed communication networks send information, which may be data or voice information, from one network to another or from one node in a network to another node in a network. The packet data is routed or sent from node to node through a network moving towards its final destination. Network nodes are switch points which may direct the data packet to various other nodes within the network or to other networks. These network nodes temporarily stop and hold or queue data packets before forwarding them on to another selected node. The flow is similar to that of an automobile moving down a street with other traffic being periodically stopped by traffic lights.
Each node to node transfer is termed a hop. Typically transferring from node to node through an internet protocol network requires a multi-hop path. This means that several nodes will receive, temporarily store or queue and then forward the data packet to another node.
Each data packet includes a header which is a specified number of data bits which indicate the destination and a type of service field that is used to allow routers and servers, which are network nodes, to distinguish the priority of each data packet. At each network node the data packets are queued for transmission. Since transmission lines which link the network nodes have fixed bandwidth or capacity, the transmission of each data packet must be scheduled in sequence. Hence, while one data packet is being transmitted many other data packets will have to wait or be queued. Some network nodes may substantially delay the data packets' transmission through the network while others may provide only minimal or marginal delay. The delay depends upon the position within each network node's queue in which the data packet resides. A number of prioritized queues may exist at each network node based upon the priority markings contained in the header.
Traffic such as voice over IP, streaming traffic, and TCP traffic is sensitive to delay variation within a network. Delay variation contributes a reduction in the quality of the service perceived by the end user or application.
Accordingly, it would be highly desirable to have an internet protocol network which minimizes the overall delay associated with transmitting a data packet through this network.
REFERENCES:
patent: 5224009 (1993-06-01), Misencik
patent: 5764641 (1998-06-01), Lin
patent: 5793747 (1998-08-01), Kline
patent: 6188670 (2001-02-01), Lackman et al.
patent: 6658485 (2003-12-01), Baber et al.
patent: 6680948 (2004-01-01), Majd et al.
patent: 6683879 (2004-01-01), Kado
patent: 2002/0027928 (2002-03-01), Fang
Jang J-S et al., “Analysis of DQLT Scheduling Policy for an ATM Multiplexer”, IEEE Communications Letters, IEEE Service Center, Piscataway, US, vol. 1, No. 6, Nov. 1, 1997, pp. 175-177.
Gross Jonathan H.
Mense Allan T.
Bogacz Frank J.
Hsu Alpus H.
Molinari Michael J
Motorola Inc.
LandOfFree
Method for reducing packet data delay variation in an... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for reducing packet data delay variation in an..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for reducing packet data delay variation in an... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3213099