СПОСОБ И УСТРОЙСТВО ДЛЯ УПРАВЛЕНИЯ ТРАФИКОМ

Изобретение относится к средствам управления трафиком. Техническим результатом является экономия ресурсов хранения, требуемых для буферизации информации связанного списка, и улучшение рабочих характеристик системы управления трафиком. В способе принимают запрос операции, когда запрос операции включает запрос на удаление очереди либо запрос на установку очереди, выполняют операцию диспетчеризации на списке очередей согласно запросу операции, при этом список очередей содержит первый участок и второй участок, при этом второй участок связывают с хвостом первого участка, при этом первый участок используют для хранения одной либо большего количества активных очередей, а второй участок используют для хранения одной либо большего количества неактивных очередей. Устройство реализует заявленный способ. 2 н.п. и 9 з.п. ф-лы, 5 ил.

СПОСОБ УПРАВЛЕНИЯ ПЕРЕКЛЮЧЕНИЕМ

... 1. Способ управления переключением в сети мобильной связи, в которой происходит обмен IP-пакетами между маршрутизатором доступа и базовой станцией, включающий в себя прием от мобильной станции запроса на переключение; отбрасывание пакета, повторно передаваемого в данный момент, и пакета, находящегося в состоянии ожидания для осуществления над ним планирования; и переключение между сотами. ! 2. Способ управления переключением в сети мобильной связи, в которой происходит обмен IP-пакетами между маршрутизатором доступа и базовой станцией, включающий в себя прием от мобильной станции запроса на переключение; отбрасывание пакета, находящегося в состоянии ожидания для осуществления над ним планирования; ожидание завершения передачи пакета, повторно передаваемого в данный момент; и переключение между сотами. ! 3. Способ управления переключением в сети мобильной связи, в которой происходит обмен IP-пакетами между маршрутизатором доступа и базовой станцией, включающий в себя прием от мобильной станции ...

Verwaltung von Aushungern und Überlastung in einem zweidimensionalen Netz mit Flusskontrolle

Verfahren zur Verkehrsverwaltung mit einer Wegauswahlvorrichtung, die mehrere Eingangsports (210, 212, 214, 210) und mehrere Ausgangsports aufweist, wobei das Verfahren umfasst:Pflegen, mit einem lokalen Entscheider (205), einer Round-Robin-Warteschlange, um Nachrichten, die in den mehreren Eingangspuffern gespeichert sind, Zugriff auf die mehreren Ausgangsports bereitzustellen, wobei der lokale Entscheider ferner eine First-in/First-out(FIFO)-Warteschlange für Nachrichten pflegt, die sich bereits länger als einen gewissen vorgegebenen Zeitschwellwert in der Round-Robin-Warteschlange befinden, wobei den Nachrichten in der FIFO-Warteschlange eine höhere Priorität zugewiesen wird als den Nachrichten in der Round-Robin-Warteschlange; undBetreiben, mit einem globalen Entscheider (230), eines Anti-Starvation-Mechanismus mit Round-Robin-Warteschlange, um mit einer Aushungerungs-Markierung markierte Nachrichten einer höheren Prioritätsentscheidungsklasse zuzuordnen, die von einer oder mehreren ...

Message flow control in assembly group of digital exchange

The method involves controlling a message flow in an assembly group of a digital exchange with at least two data processing processes for the processing of messages, whereby a. A message arriving at an assembly group is accepted in the first process, if a receiving of messages is released. The accepted message is stored in a free memory element, and a further receipt of messages in the first process is blocked through the memory unit, if no free memory elements are available, or if no free memory elements should be occupied by further messages. A stored message is output by the second process, the memory element occupied by the output message is freed, and the receipt of further messages in the first process is released through the memory unit, if free memory elements can be used by further messages.

VERFAHREN UND SYSTEM ZUR SCHLEIFENDATENRUNDFUNKSENDUNG

Erste Netzwerkeinheit eines Kommunikationsnetzwerks

Es wird ein Verfahren zum Betreiben einer ersten Netzwerkeinheit (202) bereitgestellt, wobei das Verfahren umfasst: Verschieben wenigstens eines Teils zweiter Datenpakete in Abhängigkeit von einem ermittelten Übergabebefehl von einer zweiten Queue in eine erste Queue und Versenden der ersten Datenpakete und der zweiten Datenpakete über den ersten Kommunikationskanal in Richtung der zweiten Netzwerkeinheit (204).

VERFAHREN ZUR PLANNUNG VON PACKETDATENÜBERTRAGUNG UND PAKETABLAUFSTEUERUNG

Inhibition of underrun in network switches and the like for packet-based communication systems

State engine for data processor

Coherent accesses and updates to state shared by parallel processors, such as SIMD array processors, is made possible by the use of state elements having local memory storing the state and permitting serialisation of accesses. Operations on single or multiple items of state are perfumed by a fixed/hardwired set of operations but they can be programmable by sending command and data to control operations. Individual state elements comprise the local memory, an arithmetic unit, and command and control logic. Multiple state elements are pipelined in state cells which can, in turn, be organised into state arrays and state engines effecting complete control over shared state access. A read/modify/write operation can be performed in only two cycles and a complete command in only three to five cycles.

Method and apparatus for scheduling cells based on pre-synchronized frames

ATM Network time management method

Inhibition of underrun in network switches and the like for packet-based communication systems

A proxy device for changing the data format and/or transmission parameters of communications between mobile end user terminals

The present invention relates to scheduling, compression and transcoding of data content for mobile terminals with limited resources, and provides a method of transferring information or content to or from a terminal dependent on a number of its parameters such as its battery level, processing resource status and memory resource status, and the link conditions. Thus for example a terminal with plenty of processor resources but a single narrowband wireless link may implement a high compression ratio in order to improve the file transfer time to the terminal, even if this requires a high de-compression processing overhead. Such a set-up may be changed during a connection session, for example if the battery runs low necessitating reduced processing. In preferred embodiments this method of transferring content is implemented using a programmable or dynamically adaptable proxy device which adjusts the transcoding and/or compression, as well as its scheduling or rate and timing of transfer of ...

Wireless terminal dynamically programmable proxies

SWITCHING EQUIPMENT AND MEDIATION PROCEDURE

IMPROVEMENT INTO OR REGARDING SWITCHING EQUIPMENT

SET FROM PRIORITIES FOR DATA WITH FLOW CONTROL

PLANNING OF DISTRIBUTED OPERATIONAL FUNDS BETWEEN SYNCHRONOUS ONES AND ASYNCHRONOUS ONE PACKAGE RIVERS

Sprachübertragung in redundanten Systemen

Die Erfindung betrifft ein Verfahren zur Übermittlung von Sprachdaten zwischen zwei Teilnehmern (2x, 1w), die über eine Mehrzahl von redundanten Kommunikationsservern (2a, 2b) vernetzt sind. Die Erfindung sieht vor, dass vom sendenden Teilnehmer (1x) Sprachinformationen erstellt werden und Datenpakete (X1, ... Xn) umfassend Sprachdatenwerte (x) erstellt werden mit einem Zeitstempel (t) in Form einer fortlaufenden Zahl, - dass die Datenpakete (X1, ... Xn) an die Kommunikationsserver (2a, 2b) übermittelt werden, - dass von jedem Kommunikationsserver (2a, 2b) jeweils weitere Datenpakte (A1, ..., An; B1, ..., Bn) erstellt werden, denen jeweils zumindest ein vom sendenden Teilnehmerrechner (10x) übertragener Sprachdatenwert (x) und ein, weiterer Zeitstempel (t') zugeordnet werden, wobei der Wert des Zeitstempels (t') dem Rest der Division des Zeitstempels (t) geteilt durch eine Zahl N entspricht, und - dass der Teilnehmerrechner (10w) die weiteren Datenpakete (A1, ... An; B1, ... Bn) empfängt ...

SCHALTANORDNUNG, THE TIME SLOT BUSES AND BUFFER CONTAINING

PROCEDURE FOR THE OVERLOADING ADMINISTRATION IN A NETWORK SWITCHING

ROUT

PRIORITY SELECTION MEANS FOR DATA TRANSMISSION DEVICE

ROUT

METHOD AND APPARATUS FOR PROTECTING LEGITIMATE TRAFFIC FROM DOS AND DDOS ATTACKS

METHOD AND ARRANGEMENT FOR DINAMIC ALLOCATION OF NETWORK RESOURCES

Method and system for collating data in a distributed computer network

Apparatus and method for processing packets in wireless local area network access point

Bidirectional data traffic control

A system includes an egress apparatus communicatively coupled with an ingress apparatus via at least one bi-directional network connection established for a given site. Each of the ingress and egress apparatuses includes packet categorizer to categorize each of the egress data packets based on packet evaluation thereof with respect to prioritization rules. Packet routing control places each outgoing data packet (from the ingress or egress apparatus) in one of multiple according to the categorization of each respective packet to control sending the packets according to the priority of the respective queue into which each packet is placed.

A high-speed, programmable packet scheduler and buffer manager

System and process for application-level flow connection of data processing networks

SCHEDULING A SHARED RESOURCE AMONG SYNCHRONOUS AND ASYNCHRONOUS PACKET FLOWS

Each synchronous flow (i=1, 2, ..., Ns) is associated to a respective synchronous capacity value (Hi) that is related the period of time for which a synchronous flow can be serviced before the server moves on. This value can be selected either according to a local allocation criteria or according to a global allocation criteria. Each asynchronous flow (i=1, 2, ..., NA) s is associated to a respective first value indicating the delay to be made up so that the respective queue has the right to be serviced and to another value indicating the instant in which the server visited the respective queue in the previous cycle. Each queue associated to a synchronous flow (h) is then serviced for a period of time that is related to be aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is serviced only if the server's visit occurs before the expected moment. The server's visit (10) to the synchronous queues should preferably take place during two successive ...

SCHEDULING A SHARED RESOURCE AMONG SYNCHRONOUS AND ASYNCHRONOUS PACKET FLOWS

... ²²²Each synchronous flow (i=1, 2, ..., Ns) is associated to a respective ²synchronous capacity value (Hi) that is related the period of time for which a ²synchronous flow can be serviced before the server moves on. This value can be ²selected either according to a local allocation criteria or according to a ²global allocation criteria. Each asynchronous flow (i=1, 2, ..., NA) s is ²associated to a respective first value indicating the delay to be made up so ²that the respective queue has the right to be serviced and to another value ²indicating the instant in which the server visited the respective queue in the ²previous cycle. Each queue associated to a synchronous flow (h) is then ²serviced for a period of time that is related to be aforesaid synchronous ²capacity value, while each queue associated to an asynchronous flow (i) is ²serviced only if the server's visit occurs before the expected moment. The ²server's visit (10) to the synchronous queues should preferably take place ²during ...

TRANSMISSION APPARATUS AND METHOD FOR MULTIMEDIA SERVICE IN MOBILE COMMUNICATION SYSTEM

A scheduling method for providing multimedia service and packet data service efficiently. The scheduling is a Round-Robin scheduling in an MQC (Multiple Quality Control) protocol structure. A transmitter in a base station transmits or retransmits TUs from different streams in a PLP using priority queues by the scheduling.

Congestion Control Method in ATM Network

NETWORK NODE FOR SHARING A COMMON BUFFER AMONG MULTIPLE CONNECTIONS WHILE ENSURING MINIMUM BANDWIDTH FOR EACH CONNECTION

A network node includes a single buffer connected to a transmission medium. Detection circuitry receives an incoming packet and detects the virtual connection of the received packet. Control circuitry calculates a value of delivery instant for the received packet according to a minimum bandwidth assigned to the detected virtual connection so that vacancy of the transmission medium is reduced to a minimum if the received packet were delivered from the buffer onto the transmission medium at the instant of the calculated value. The calculated value is compared with a decision threshold assigned to the detected virtual connection. The received packet is stored into the buffer if the calculated value is smaller than the decision threshold or discarded if the calculated value is greater than the decision threshold.

HIGH-SPEED PROGRAMMABLE PACKET SCHEDULER AND BUFFER MANAGER

A method and apparatus for managing the buffering and for scheduling the transfer of packets of data arriving on one or a plurality of input ports and destined f or one or a plurality of output ports of a packet switch or router or a subsystem thereo f is disclosed. Each arriving packet is assigned an index that specifies both a unique destination output port for the packet and membership in a subclass, such as a priority class, a connection or flow, or a class of packets that is to receive a certain type of transmissio n or buffering service. For each arriving packet, a minipacket is created that contains the index of the packet, a unique identifier such as a storage location, and optionally information relevant to the scheduling and buffering of the packet. Each index is assigned a uniq ue queue in which minipackets with the given index are placed in order of arrival. A method and apparatus for a scheduler and buffer manager is disclosed that: maintains a large number of said queues; ...

HIGH SPEED PACKET SCHEDULING METHOD AND APPARATUS

A packet scheduler is disclosed which provides a high degree of fairness in scheduling packets associated with different sessions. The scheduler also minimizes packet delay for packet transmission from a plurality of sessions which may have different requirements and may operate at different transfer rates. When a packet is received by the scheduler, the packet is assigned its own packet virtual start time based on whether the session has any pending packets and the values of the virtual finish time of the previous packet in the session and the packets arrival time. The scheduler then determines a virtual finish time of the packet by determining the transfer time required for the packet based upon its length and rate and by adding the transfer time to the packet virtual start time of the packet. The packet with the smallest virtual finish time is then scheduled for transfer. By selecting packets for transmission in the above described manner, the available bandwidth may be shared in pro-rata ...

PACKET FORWARDING APPARATUS WITH A FLOW DETECTION TABLE

A packet forwarding apparatus provided with a plurality of line interface units, comprises a routing processing unit for referring to a routing table, based on header information of received packet to specify one of output lines to output the received packet, a flow detection unit for referring to an entry table, in which a plurality of entries with flow conditions and control information are registered, to retrieve control information defined by the entry with a flow condition which coincides with that of the header information of the received packet, and a packet forwarding unit for transferring the received packet to one of the line interface units connected to the output line specified by the routing processing unit. The entry table id divided into a plurality of subtables corresponding to the values of flow attributes associated with the received packets and the flow detection unit retrieves the control information from one of said subtables specified by the value of the flow attribute ...

Based on depth of the reinforcement learning multi-path transmission control protocol data packet scheduling method

Wireless sensing terminating set

Aviation ARINC429 bus module circuit

Queue scheduling method and device

The embodiment of the invention provides a queue scheduling method and a device. In a queue scheduling polling, according to the current to-be sent grouping of the current scheduling active queue, the current to-be sent grouping is sent when the length of the current to-be sent grouping of the active queue is no longer than the average length of the current to-be sent groupings of the current all active queues; the difference value between the current maximal allowable sending quantity of the active queue and the length of the sent grouping is used for updating the current maximal allowable sending quantity corresponding to the active queue, and scheduling processing of other to-be sent groupings is carried out; when the length of the current to-be sent grouping of the active queue is larger than the average length of the current to-be sent groupings of the current all active queues, scheduling processing of the current to-be sent groupings of the next active queue is carried out; when ...

Router for improving forward speed and efficiency based on virtual monitoring group

The invention relates to a router located between adjacent networks. The router comprises a port which is used for receiving and transmitting data packets, a storage which is distributed to different queues and distinguishes usable and spare queues, and a central processor which only transmits the data packets in the usable queues by triggering. The usable queues are the queues in which no new data packets are received through the port in certain time. The router monitors and manages the queues by adopting a virtual monitoring group. The virtual monitoring group mothballs the spare queues and only provides the usable queues for the scheduling module of the computer network node, which simplifies the operation of the scheduling module and improves the speed and efficiency of the data packet forwarding.

Method and system for queue scheduling optimization

The invention discloses a method and a system for the optimization of queue dispatching. The system comprises a data communication device, and a mirror module and message analyzing equipment which are positioned on the data communication device. The corresponding method comprises the following steps: the mirror module performs real-time monitoring on the business flow of the data communication device; when detecting congestion occurs, the mirror module extracts messages that are abandoned by the data communication device during the queue dispatching and mirrors the abandoned messages to a destination port. The message analyzing equipment analyzes the composition of the current business flow according to the mirrored messages and outputs analysis results for the network administrator to analyze so as to adjust the queue dispatching mode currently adopted by the data communication device accordingly. The adoption of the invention can optimize the queue dispatching algorithm adopted by the ...

Message pushing method, device and system

Ethernet design scheme based on dynamic two-level feedback scheduling

A message forwarding method and device

A Intel million trillion network card based on the sampling data transmission method of the class is low delay

Apparatus and method for processing packets in wireless local area network access point

The notification information management method, intelligent terminal and having memory function device

Websocket-based account security verification method

A method for realizing multi-process shared port of data processing of the method and device

Method and device for reducing high-priority data transmission delay in ONU (ONU) in congestion state

Message order-preserving method and device thereof

The present invention discloses a method and a device for preserving message sequence; the device comprises a flow classification and identification unit, a message processing unit, a flow state monitoring unit and a sequence-preserving, controlling and emitting unit. The flow classification and identification unit classifies the received messages into different business flows according to the specified rules and at the same time completes the multi-core and multi-thread load balancing distribution of message; the message processing unit processes the received message; the flow state monitoring unit is used for maintaining flow-state queues and identifying the processing state of the message and keeping the flow-state queues and the business flow queues corresponding to each other one to one; the sequence-preserving, controlling and emitting unit realizes the synchronization of message control and emission according to the message state vector in the flow-state queues and correspondingprocessing ...

Method for reporting smart electric meter

A queue-based heterogeneous resources multi-objective scheduling strategy

Network traffic monitoring method and device

HOME AUTOMATION NETWORK

Audio and video buffer controller for MPEG system

Dispositlif de commande de tampons audio et vidéo pour système MPEG comportant un décodeur (200) séparant une séquence reçue de données en séquences audio et vidéo et recevant des références d'horloge (SCR), un tampon audio (210) mémorisant la séquence audio et l'émettant selon des signaux d'horloge audio et de commande d'émission, un tampon vidéo (220) mémorisant la séquence vidéo et l'émettant selon des signaux d'horloge de sortie vidéo et de commande d'émission, une commande d'entrée de données (240) commandant la quantité de données envoyées au décodeur du système selon une quantité de données de tampon audio, et une commande d'entrée et de sortie de tampons (230) produisant des signaux d'horloge d'entrée et sortie des tampons audio et vidéo et mesurant la quantité de données du tampon audio. L'invention concerne aussi un dispositif de synchronisation, un décodeur et un procédé associé.

Server device of client-server system, controls receiving load of receiving data depending on receiving capability of internal process section

L'invention concerne un serveur (1), un système en réseau, et un procédé de commande de charge reçue, dans lesquels la charge reçue au niveau du serveur (1) est réduite et la détérioration des performances du serveur (1) est évitée. Le serveur (1) comprend un dispositif de mise en forme (11), une section de fixation de valeur de mise en forme (12), et une unité de traitement avec stockage (13). Le dispositif (11) compare la charge reçue totale provenant de plusieurs clients (2a à 2z) et une valeur de mise en forme fixée par cette section (12), rejette les données dépassant la valeur de mise en forme sur la base du résultat comparé. A une entrée du serveur (1), c'est-à-dire le dispositif de mise en forme (11), la charge reçue est commandée selon la capacité de réception du serveur (1).

DEVICE OF WORKING OF TRAFFIC AND APPARATUS OF COMMUNICATION PER PACKAGES.

Un dispositif (100) de mise en forme de trafic faisant partie d'un appareil de communication par paquets reçoit des paquets et calcule immédiatement un temps de départ pour chaque paquet reçu en utilisant des paramètres d'allocation de largeur de bande désignés. Les paquets sont stockés dans une mémoire (105) de paquets en fonction de leurs temps de départ calculés. Lorsque chaque temps de départ est atteint, les paquets qui ont été stockés pour ce temps de départ sont transférés vers une file d'attente de sortie. Les paquets sont extraits en ordre séquentiel de la file d'attente de sortie.

PROCESS AND SYSTEM FOR THE DATA DISSEMINATION IN LOOP

PROCESS AND SYSTEM FOR THE DATA DISSEMINATION IN LOOP

PROCESS AND SYSTEM FOR THE DATA DISSEMINATION IN LOOP

PROCESS AND SYSTEM FOR THE DATA DISSEMINATION IN LOOP

PROCESS AND SYSTEM FOR THE DATA DISSEMINATION IN LOOP

서비스에 따른 트래픽 처리를 이용한 QoS 제어 방법

... 소프트웨어 정의 네트워킹 환경에서 서비스 별 트래픽 처리를 통한 QoS 제어 방법이 개시된다. 컨트롤러가 QoS를 제어하는 방법은, 네트워크 장치의 출력 포트에 설정되는 적어도 하나의 큐(Queue)에 대한 추가, 삭제 및 변경 중 적어도 하나의 수행을 위한 큐의 설정 변경을 결정하는 단계와; 결정된 큐의 설정 변경에 대한 정보를 포함하는 큐 상태 변경 메시지를 네트워크 장치로 전송하여 큐의 설정 변경을 수행시키는 단계를 포함한다. 따라서, 다양한 서비스들을 트래픽 특성에 따라 차별화하여 처리해 줌으로써 서비스 별 품질을 만족시켜 주면서 네트워크 자원을 효율적으로 사용할 수 있도록 한다.

SDN-BASED INFORMATION CACHE AND CACHING ROUTER SELECTION METHOD IN WIRELESS MESH NETWORK

The present invention relates to an SDN-based information cache and a caching router selection method in a wireless mesh network. The SDN-based information cache and the caching router selection method in the wireless mesh network comprises: a step of provisioning a rule for sending an HTTP GET (HTTP 200(OK)) message in a mesh router to an SDN controller; and a step of detecting an acknowledge number (AN) value. The present invention can search for desired information through the routing and provide desired information without an access to a designated target server. COPYRIGHT KIPO 2017 (10) SDN controller (20) Mesh client (30a) Mesh router (Request access) (30b) Mesh router (Cache object) (30c) Mesh portal (Information access) (40) HTTP server (AA) Internet (S1) Adding a flow table, Match: {dst_port (80), TCP_flag (PSH)}, Action: Report to a controller (S3) Adding the flow table, Match: src_ip (Server IP), src_port (Server port), dst_ip (Client IP), dst_port (Client port), AN (Calculated ...

시스템 온 칩에서의 대역폭 할당의 제어

... 일 실시예에서, 시스템 온 칩(SoC)과 같은 프로세서의 패브릭은 복수의 에이전트로 및 복수의 에이전트로부터, 그리고 메모리로 및 메모리로부터 전달되는 데이터를 각각 저장하는 복수의 엔트리를 포함하는 적어도 하나의 데이터 버퍼와, 패브릭의 순서화된 도메인으로 출력될 계류 중인 요청의 추적을 유지하는 요청 트래커와, 코어 에이전트로부터의 기입 트랜잭션과 메모리로부터의 판독 완료 트랜잭션 사이의 순서화된 도메인으로의 할당을 제어하는 아웃바운드 스로틀 로직을 포함한다. 다른 실시예가 기술되고 청구되어 있다.

METHOD FOR TRANSMITTING QoS PACKET IN WIRELESS BACKHAUL NETWORK AND APPARATUSES PERFORMING SAME

A method for transmitting a QoS packet in a wireless backhaul network and apparatuses performing the same are disclosed. According to an embodiment of the present invention, the method for transmitting a packet in a wireless backhaul network comprises the steps of: checking a state of queue corresponding to each of a plurality of access categories; determining a packet to be transmitted in the queue corresponding to each of the plurality of access categories based on the state of the queue; and aligning the packet to be transmitted. COPYRIGHT KIPO 2017 ...

클라이언트 디바이스 상에서의 패킷 송신을 스케줄링하기 위한 시스템 및 방법

... 클라이언트 디바이스 상에서 패킷 스케줄링을 관리하기 위한 컴퓨터 구현 방법. 예를 들어, 방법의 일 실시예는 송신될 패킷을 수신하는 단계; 패킷을 네트워크 스택 레벨에서 큐에 인큐잉하는 단계; 패킷 스케줄링이 현재 드라이버 레벨에서 수행되고 있는지 또는 네트워킹 스택 레벨에서 수행되고 있는지를 판정하는 단계; 스케줄링이 현재 네트워크 스택 레벨에서 수행되고 있다면, 송신을 위한 패킷을 네트워크 스택 레벨에서 큐로부터 선택하는 단계; 및 스케줄링이 현재 드라이버 레벨에서 수행되고 있다면, 송신을 위한 패킷을 드라이버 레벨에서 큐로부터 선택하는 단계를 포함한다.

LOW PASS FILTER FOR HIERARCHICAL PIPELINED DISTRIBUTED SCHEDULING TRAFFIC MANAGER

A method is implemented by a network element to provide scalable hierarchical traffic management (HTM) over a plurality of network layers for a network and eliminate priority leaking caused by quick loopback batch scheduling that analyzes a subset of network layers to shorten processing time and resource requirements when the scalable HTM selects data packets to be forwarded. The method and system function as a low pass filter over the selected data packets to prevent low priority data packets being forwarded where higher priority data packets are available to be forwarded.

DETERMINATION OF A DATA TRANSMISSION SCHEDULE

A device for communication includes a processor and a transmitter. The processor is configured to determine a target quality of service (QoS). The processor is also configured to determine, based on the target QoS, a transmission schedule identifying one or more transmission time-blocks. The transmitter is configured to transmit data to at least one device during a transmission time-block of the one or more transmission time-blocks.

HIGH-CONCURRENCY DATA PROCESSING METHOD AND APPARATUS, AND COMPUTER READABLE STORAGE MEDIUM

The present application provides a high-concurrency data processing method, which is applied to a data processing apparatus. The high-concurrency data processing method comprises the following steps: receiving an access request sent by a client; storing the received access request into a message queue in a message manner; and processing messages in the message queue by invoking a preset quantity of threads, reading related data from a database, and feeding back the processing result to the client. When a server receives a great quantity of data access requests at the same time, the concurrent pressure of the server can be effectively reduced, and the availability and the throughput of an application system are ensured. The present application also provides a high-concurrency data processing apparatus and a computer readable storage medium.

SYSTEM AND METHOD FOR FACILITATING DATA-DRIVEN INTELLIGENT NETWORK WITH PER-FLOW CREDIT-BASED FLOW CONTROL

Data-driven intelligent networking systems and methods are provided. The system can accommodate dynamic traffic with fast, effective per-flow credit-based flow control. The system can maintain state information of individual packet flows, which can be set up or released dynamically based on injected data. Each flow can be provided with a flow-specific input queue upon arriving at a switch. Packets of a respective flow can be acknowledged after reaching the egress point of the network, and the acknowledgement packets can be sent back to the ingress point of the flow along the same data path. As a result, each switch can obtain state information of each flow and perform flow control on a per-flow basis.

PACKET ARBITRATION FOR BUFFERED PACKETS IN A NETWORK DEVICE

Devices and techniques for packet arbitration for buffered packets in a network device are described herein. A packet can be received at an input of the network device. The packet can be placed in a buffer for the input and a characteristic of the packet can be obtained. A record for the packet, that includes the characteristic, is written into a data structure that is independent of the buffer. Arbitration, based on the characteristic of the packet in the record, can then be performed among multiple packets to select a next packet from the buffer for delivery to an output.

HEADER REPLICATION IN ACCELERATED TCP (TRANSPORT CONTROL PROTOCOL) STACK PROCESSING

In one embodiment, a method is provided. The method of this embodiment provides storing a packet header at a set of at least one page of memory allocated to storing packet headers, and storing the packet header and a packet payload at a location not in the set of at least one page of memory allocated to storing packet headers.

Port empty transition scheduling

Aspects of port empty transition scheduling are described herein. In one embodiment, when one or more cells are added to a queue in a network communications device, an enqueue indicator is generated. The enqueue indicator identifies a number of cells added to the queue. With reference to the enqueue indicator, a queue scheduler maintains a count of cells enqueued for communication and issues a port pick credit for a port of the network communications device. A port scheduler schedules a pick for communicating over the port with reference to the port pick credit and forwards the pick to the queue scheduler. In turn, the queue scheduler forwards a queue pick to the queue, and at least one of the cells is forwarded to dequeue logic. According to aspects of the embodiments described herein, empty port scheduling inefficiencies may be avoided and network throughput increased.

DATA TRANSMISSION USING MODIFIED WEIGHTED FAIR QUEUE ALGORITHM

To transmit data packets over a shared data path, data packets of a first message and a second message are received and stored, respectively, in first and second queues. First and second data packets are then extracted from, respectively, the first and second messages. First and second priority values are calculated, respectively, for the first and second data packets and are associated thereto. If the first priority value is determined to be lower than the second priority value, then the first packet is transmitted over the shared data path. If the second priority value is determined to be lower than the first priority value, then the second packet is transmitted over the shared data path.

Optimization of network resources

A method may include, by a network resource optimization system, receiving from a network node a resource request, determining a plurality of network resources based on the resource request, and determining a subset of network resources from the plurality of network resources and a network resource from the subset based on a score of each network resource. The score of each network resource may be based on a rate of acceptance of communication requests received or a number of communication sessions established. The method may include, by the network resource optimization system, transmitting a communication request to the determined network resource and receiving an acceptance from the network resource. The method may include, by the network resource optimization system, causing a selection mechanism to be activated at the network node, receiving from the network node a selection, and initiating the communication session in response to the selection.

Data transmission method and data transmission system

A data transmission method for a data transmission system including a host and a peripheral device is disclosed, including: setting at least one identification number to at least one packet stored in the host; transmitting the at least one packet from the host to the peripheral device; allocating the at least one packet to plural temporary blocks of a memory of the peripheral device corresponding to the at least one identification number according to the at least one identification number of the at least one packet. Each of the temporary blocks includes a threshold value, and the threshold value of each of at least two of the temporary blocks are different; and transmitting part of the at least one packet stored in one of the temporary blocks when the one of the temporary blocks reaches the threshold value of the one of the temporary blocks.

Packet forwarding apparatus with QoS control

A technique capable of controlling packets to be output to a plurality of ports is provided. Disclosure is made of a packet forwarding apparatus for distributing packets received from a physical port to be transmitted over a plurality of physical ports, which includes a transmitting/receiving unit for transmitting/receiving packets via a physical port, a port group decision unit for deciding a port group corresponding to a plurality of physical ports, and a port group control unit for controlling flow of packets for each port group decided by the port group decision unit.

Transmission apparatus and transmission method

There is provided a transmission apparatus including: a buffer provided with a queue for each of user flows, the buffer configured to store data in the queue for the user flow to which the data belongs; a storage unit configured to store a link list indicating an output order of the user flows; an issuing unit configured to issue a predetermined output permissible amount to the queue for the user flow by referring to the link list; and an output control unit configured to output data from the queue to which the output permissible amount is issued.

Apparatus and methods for removing a large-signal voltage offset from a biomedical signal

Apparatus and methods remove a voltage offset from an electrical signal, specifically a biomedical signal. A signal is received at a first operational amplifier and is amplified by a gain. An amplitude of the signal is monitored, by a first pair of diode stages coupled to an output of the first operational amplifier, for the voltage offset. The amplitude of the signal is then attenuated by the first pair of diode stages and a plurality of timing banks. The attenuating includes limiting charging, by the first pair of diode stages, of the plurality of timing banks and setting a time constant based on the charging. The attenuating removes the voltage offset persisting at a threshold for a duration of at least the time constant. Saturation of the signal is limited to a saturation recovery time while the saturated signal is gradually pulled into monitoring range over the saturation recovery time.

Method for managing traffic in a network based upon ethernet switches, vehicle, communication interface, and corresponding computer program product

A method for managing traffic in a network based upon Ethernet switches, which are compliant with the IEEE 802.1Q and TSN communication standards, including the steps of dividing frames received into queues; scheduling transmission of the frames contained in the queues on the basis of the respective priorities of the traffic classes; and, if frames are present belonging to a traffic class in the plurality of traffic classes that has a higher priority than frames belonging to the event-triggered traffic class and when at least one protected time window occurs, transmitting the frames that belong to the traffic class with higher priority and blocking transmission of the frames that belong to the remaining traffic classes; and if the queue dedicated to the event-triggered traffic class is empty, transmitting a frame belonging to one of the remaining traffic classes that have frames with a priority lower than the frames belonging to the event-triggered traffic class.

Packet processing method, apparatus, and device

A packet processing method, apparatus, and device are disclosed. The method includes: receiving, by a forwarding plane, an item from a control plane of the forwarding plane, where the item includes an identifier of a connected terminal; receiving an access protocol packet; when the access protocol packet is not an authentication start packet, determining, by the forwarding plane according to the identifier of the connected terminal, whether a terminal served by the access protocol packet is the connected terminal; and discarding, by the forwarding plane, the access protocol packet when the access protocol packet is not the authentication start packet and when the terminal served by the access protocol packet is not the connected terminal. The method improves user experience.

Network processors

The present disclosure is directed to a network processor for processing high volumes of traffic provided by todays access networks at (or near) wireline speeds. The network process can be implemented within a residential gateway to perform, among other functions, routing to deliver high speed data services (e.g., data services with rates up to 10 Gbit/s) from a wide area network (WAN) to end user devices in a local area network (LAN).

METHOD FOR AVOIDING CONGESTION ON NETWORK DEVICE AND NETWORK DEVICE

The present invention discloses a method for avoiding congestion on a network device and a network device, in order to resolve a problem of a decrease in a throughput of a network device caused when the network device performs, after receiving a series of packets, packet discarding processing on the series of packets in a manner of randomly and discretely discarding packets. The method includes: determining, by a network device according to a size of currently used storage space, whether packet discarding processing needs to be performed on packets that belong to a same data flow in the currently used storage space, where there are N packets that belong to the same data flow, and N≧2; and if packet discarding processing needs to be performed, discarding, by the network device, continuous M packets that belong to the same data flow, where 1≦M≦N.

Transmission control protocol window size adjustment for out-of-order protocol data unit removal

A system and method for sharing a WAN TCP tunnel between multiple flows without having head of the line blocking problem is disclosed. When a complete but out of order PDU is stuck behind an incomplete PDU in a TCP tunnel, the complete but out of order PDU is removed from the tunnel. To do that, first the boundaries of the PDUs of the different flows are preserved and the TCP receive window advertisement is increased. The receive window is opened when initially receiving out-of-order data. As out-of-order complete PDUs are pulled out of the receive queue, to address double counting, place holders are used in the receive queue to indicate data that was in the queue. As out-of-order data PDUs are pulled out of the queue the window advertisement is increased. This keeps the sending side from running out of TX window and stopping transmission of new data.

ALLOCATING BANDWIDTH BETWEEN BANDWIDTH ZONES ACCORDING TO USER LOAD

A bandwidth management system includes a plurality of queues respectively corresponding to a plurality of zones. An enqueuing module receives network traffic from one or more incoming network interfaces, determines a belonging zone to which the network traffic belongs, and enqueues the network traffic on a queue corresponding to the belonging zone. A dequeuing module selectively dequeues data from the queues and passes the data to one or more outgoing network interfaces. When dequeuing data from the queues the dequeuing module dequeues an amount of data from a selected queue, and the amount of data dequeued from the selected queue is determined according to user load of a zone to which the selected queue corresponds.

QUEUE SCHEDULING METHOD AND APPARATUS

A queue scheduling method and apparatus is disclosed in the embodiments of the present invention, the method comprises: one or more queues are indexed by using a first circulation link list; one or more queues are accessed respectively by using the front pointer of the first circulation link list, and the value acquired from subtracting a value of a unit to be scheduled at the head of the queue from a weight middle value of each queue is treated as the residual weight middle value of the queue; when the weight middle value of one queue in the first circulation link list is less than the unit to be scheduled at the head of the queue, the queue is deleted from the first circulation link list and the weight middle value is updated with the sum of a set weight value and the residual weight middle value of the queue; the queue deleted from the first circulation link list is linked with a second circulation link list. The present invention enables the scheduling to support any number of queues ...

PACKET SWITCHING

In an embodiment, an apparatus is provided that may include an integrated circuit including switch circuitry to determine, at least in part, an action to be executed involving a packet. This determination may be based, at least in part, upon flow information determined, at least in part, from the packet, and packet processing policy information. The circuitry may examine the policy information to determine whether a previously-established packet processing policy has been established that corresponds, at least in part, to the flow information. If the circuitry determines, at least in part, that the policy has not been established and the packet is a first packet in a flow corresponding at least in part to the flow information, the switch circuitry may request that at least one switch control program module establish, at least in part, a new packet processing policy corresponding, at least in part, to the flow information.

Vehicle Security System

Systems and methods for addressing a vehicle condition are provided. In one example embodiment, a method includes receiving data indicative of a condition associated with an autonomous vehicle. The autonomous vehicle is associated with a service provider that provides a service to a plurality of users of the service. The method includes identifying at least a subset of the plurality of users of the service based, at least in part, on a respective location associated with each user of the subset of users and a location of the vehicle. The method includes determining a selected user from the subset of users to address the condition associated with the vehicle based at least in part on one or more parameters. The method includes providing, to the selected user, a communication. The communication including a request that the selected user address the condition associated with the vehicle.

Congestion Flow Identification Method And Network Device

The present disclosure relates to congestion flow identification methods. One example method includes obtaining, by a network device, a queue length of a non-congestion flow queue, where the non-congestion flow queue includes a data packet or description information of the data packet, determining, by the network device, a target output port of a target data packet when the length of the non-congestion flow queue is greater than or equal to a first threshold, where the target data packet is a data packet waiting to enter the non-congestion flow queue or a next data packet waiting to be output from the non-congestion flow queue, and when utilization of the target output port is greater than or equal to a second threshold, determining, by the network device, that a flow corresponding to the target data packet is a congestion flow.

Load balancing across a group of load balancers

Some embodiments provide an elastic architecture for providing a service in a computing system. To perform a service on the data messages, the service architecture uses a service node (SN) group that includes one primary service node (PSN) and zero or more secondary service nodes (SSNs). The service can be performed on a data message by either the PSN or one of the SSN. However, in addition to performing the service, the PSN also performs a load balancing operation that assesses the load on each service node (i.e., on the PSN or each SSN), and based on this assessment, has the data messages distributed to the service node(s) in its SN group. Based on the assessed load, the PSN in some embodiments also has one or more SSNs added to or removed from its SN group. To add or remove an SSN to or from the service node group, the PSN in some embodiments directs a set of controllers to add (e.g., instantiate or allocate) or remove the SSN to or from the SN group. Also, to assess the load on the ...

Large message support for a publish-subscribe messaging system

A system, apparatus, and methods are provided that support the passing of oversized messages within a publish-subscribe messaging system. During operation, the system subscribes to a message stream brokered by a message brokering cluster that imposes a maximum message size. Responsive to receiving a given message of the message stream, the system (1) determines an offset to commit to the message brokering cluster, wherein the determined offset is based on whether one or more segments of one or more oversized messages are buffered, and (2) commits the determined offset to the message brokering cluster. Responsive to recovering from a crash, wherein the offset at which to resume the receipt of messages from the message stream is unknown, the system then retrieves the determined offset from the message brokering cluster and resumes the receipt of messages from the message brokering cluster based on the determined offset.

APPARATUS, SYSTEM AND METHOD FOR THE TRANSMISSION OF DATA WITH DIFFERENT QoS ATTRIBUTES

An apparatus, system and method are provided for transmitting data from logical channel queues over a telecommunications link, each of the logical channel queues capable of being associated with quality of service attributes, the method including determining available resources for transmission over the telecommunications link in a frame; selecting one of the logical channel queues based on a first one of the quality of service attributes; packaging data from the selected one of the logical channel queues until one of: a second one of the quality of service attributes for the selected one of the logical channel queues is satisfied, the available resources are used, or the selected one of the logical channel queues is empty; and repeating the selecting step and the packaging step for remaining ones of the logical channel queues.

METHODS AND APPARATUSES FOR PACKET SCHEDULING FOR SOFTWARE- DEFINED NETWORKING IN EDGE COMPUTING ENVIRONMENT

Provided are methods and apparatuses for packet scheduling for software-defined networking in an edge computing environment. A packet scheduling method according to an exemplary embodiment of the present disclosure comprises: receiving packets arriving at a queue connected to a switch in a software-defined network in an edge computing environment; moving the packets in the queue forward one position based on the order of arrival each time a packet is served by the switch; and if a new packet enters the switch while the buffer in the queue is full, pushing out the packet at the front and putting the new packet at the end of the queue.