Parallel traffic generator with priority flow control
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H04L-012/26
G08C-015/00
H04L-012/28
G06F-015/173
G06F-015/16
출원번호
US-0240746
(2011-09-22)
등록번호
US-8687483
(2014-04-01)
발명자
/ 주소
Hutchison, Michael
Kowalski, Christopher
Luking, Robert
출원인 / 주소
Ixia
대리인 / 주소
SoCal IP Law Group LLP
인용정보
피인용 횟수 :
2인용 특허 :
18
초록▼
An apparatus to generate test traffic for testing a network. A scheduler may provide packet definition data for a sequence of packets, each packet associated with a respective flow control group. A channelized schedule FIFO (first-in first-out) queue may store the packet definition data. The channel
An apparatus to generate test traffic for testing a network. A scheduler may provide packet definition data for a sequence of packets, each packet associated with a respective flow control group. A channelized schedule FIFO (first-in first-out) queue may store the packet definition data. The channelized schedule FIFO queue may include multiple parallel channels, each channel dedicated to storing packet definition data associated with a corresponding flow control group. A plurality of non-channelized packet builder lanes may build packets in accordance with packet definition data read from the channelized schedule FIFO. A channelized output FIFO buffer may store packets built by the plurality of packet builder lanes. The channelized output FIFO buffer may include multiple parallel channels, each channel dedicated to storing packets associated with a corresponding flow control group. An output multiplexor may interleave packets from the channelized output FIFO buffer to form the test traffic.
대표청구항▼
1. An apparatus to generate test traffic for testing a network, comprising: a scheduler to provide packet definition data for a sequence of packets to be built, each packet uniquely associated with a respective flow control group from a plurality of flow control groups;a channelized schedule queue t
1. An apparatus to generate test traffic for testing a network, comprising: a scheduler to provide packet definition data for a sequence of packets to be built, each packet uniquely associated with a respective flow control group from a plurality of flow control groups;a channelized schedule queue to store the packet definition data, the channelized schedule queue including a plurality of parallel channels, each channel dedicated to storing packet definition data associated with a corresponding one of the plurality of flow control groups;a distributor configured to combine packet definition data read from the channels of the channelized schedule queue with stateful packet content to create packet forming data;a plurality of non-channelized packet builder lanes to independently build packets in accordance with the packet forming data provided by the distributor, each lane configured as a pipeline, wherein each packet must travel through all sequential stages of the pipeline and exit the lane before any subsequent packet in the lane can be completed;a channelized packet buffer to store packets built by the plurality of non-channelized packet builder lanes, the channelized packet buffer including a plurality of parallel channels, each channel dedicated to storing packets associated with a corresponding one of the plurality of flow control groups; andan output multiplexor to interleave packets from the channels of the channelized packet buffer to provide the test traffic. 2. The apparatus of claim 1, further comprising: flow control logic configured to selectively pause and unpause one or more of the flow control groups in response to received flow control packets, whereinthe output multiplexor discontinues reading packets from channels of the channelized packet buffer associated with paused flow control groups. 3. The apparatus of claim 1, wherein the distributor comprises a model to predict a capacity of each channel of the channelized packet buffer, andthe distributor routes each item of packet forming data to a selected non-channelized packet builder lane only if the predicted capacity of the corresponding channel of the channelized packet buffer is sufficient to hold the packet defined by the packet forming data. 4. The apparatus of claim 1, wherein the channelized packet buffer is configured to store packets in each channel in accordance with packet sequence data provided by the distributor. 5. The apparatus of claim 1, wherein the channelized schedule queue is configured to inform the scheduler when one more channels are full, andthe scheduler is configured to discontinue scheduling flow control groups associated with full channels. 6. A method for generating test traffic to test a network, comprising: generating packet definition data for a sequence of packets to be built, each packet uniquely associated with a respective flow control group from a plurality of flow control groups;storing the packet definition data in a channelized schedule queue, the channelized schedule queue including a plurality of parallel channels, each channel dedicated to storing packet definition data associated with a corresponding one of the plurality of flow control groups;a distributor combining packet definition data read from the channels of the channelized schedule queue with stateful packet content to create packet forming data;a plurality of non-channelized packet builder lanes independently building packets in accordance with the packet forming data, each packet builder lane configured as a pipeline, wherein each packet must travel through all sequential stages of the pipeline and exit the lane before any subsequent packet in the lane can be completed;storing built packets in a channelized packet buffer, the channelized packet buffer including a plurality of parallel channels, each channel dedicated to storing packets associated with a corresponding one of the plurality of flow control groups; andinterleaving packets read from the channels of the channelized packet buffer to provide the test traffic. 7. The method of claim 6, further comprising: receiving flow control packets;selectively pausing and unpausing one or more flow control groups in response to the received flow control packets; anddiscontinuing reading packets from channels of the channelized packet buffer associated with paused flow control groups. 8. The method of claim 6, further comprising: the distributor maintaining a model to predict a capacity of each channel of the channelized packet buffer; andthe distributor routing each item of packet definition data to a selected non-channelized packet builder lane only if a predicted capacity of the corresponding channel of the channelized packet buffer is sufficient to hold the packet defined by the packet definition data. 9. The method of claim 6, further comprising: storing the built packets in each channel of the channelized packet buffer in accordance with packet sequence data provided by the distributor. 10. The method of claim 6, further comprising: the channelized schedule queue determining when one or more channels are full; anddiscontinuing generating packet definition data for flow control groups associated with full channels. 11. A non-transitory computer-readable storage medium storing programming code which, when used to program a programmable device, configures the programmable device to perform actions comprising: generating packet definition data for a sequence of packets to be built, each packet uniquely associated with a respective flow control group from a plurality of flow control groups;storing the packet definition data in a channelized schedule queue, the channelized schedule queue including a plurality of parallel channels, each channel dedicated to storing packet definition data associated with a corresponding one of the plurality of flow control groups;a distributor combining packet definition data read from the channels of the channelized schedule queue with stateful packet content to create packet forming data;a plurality of non-channelized packet builder lanes independently building packets in accordance with the packet forming data, each packet builder lane comprising a pipeline wherein each packet must travel through all sequential stages of the pipeline and exit the lane before any subsequent packet in the lane can be completed;storing built packets in a channelized packet buffer, the channelized packet buffer including a plurality of parallel channels, each channel dedicated to storing packets associated with a corresponding one of the plurality of flow control groups; andinterleaving packets read from the channels of the channelized packet buffer to provide the test traffic. 12. The non-transitory computer-readable storage medium of claim 11, the actions performed further comprising: receiving flow control packets;selectively pausing and unpausing one or more flow control groups in response to the received flow control packets; anddiscontinuing reading packets from channels of the channelized packet buffer associated with paused flow control groups. 13. The non-transitory computer-readable storage medium of claim 11, the actions performed further comprising: the distributor maintaining a model to predict a capacity of each channel of the channelized packet buffer; andthe distributor routing each item of packet definition data to the selected channelized packet builder lane only if a predicted capacity of the corresponding channel of the channelized packet buffer is sufficient to hold the packet defined by the packet definition data. 14. The non-transitory computer-readable storage medium of claim 11, the actions performed further comprising: storing the built packets in each channel of the channelized packet buffer in accordance with packet sequence data provided by the distributor. 15. The non-transitory computer-readable storage medium of claim 11, the actions performed further comprising: the channelized schedule queue determining when one or more channels are full; anddiscontinuing generating packet definition data for flow control groups associated with full channels of the channelized schedule queue.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (18)
Bennett Toby D. ; Davis Donald J. ; Harris Jonathan C. ; Miller Ian D., Apparatus and method for constructing data for transmission within a reliable communication protocol by performing portions of the protocol suite concurrently.
Johnson, Stephen M.; Hoglund, Timothy E.; Weber, David M.; Adams, John M.; Reber, Mark A., Method and apparatus for transmitting data to a node in a distributed data processing system.
Galand Claude,FRX ; Lebizay Gerald,FRX ; Spagnol Victor,FRX, Method and system for optimizing data transmission line bandwidth occupation in a multipriority data traffic environmen.
van Tetering Johannes A. M. (Zevenbergen NLX) Denissen Frank L. (Boom BEX), Performance measurement system for a telecommunication path and device used therein.
Sathe, Satish; Singh, Satish; Gambhir, Jaspreet Singh; Gupta, Sundeep, System and method for Ethernet per priority pause packet flow control buffering.
Toby D. Bennett ; Donald J. Davis ; Jonathan C. Harris ; Ian D. Miller, System for transmitting and receiving data within a reliable communications protocol by concurrently processing portions of the protocol suite.
Majumdar, Partha; Datta, Deep, Methods, systems, and computer readable media for providing a unified framework to support diverse data generation engines.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.