СПОСОБЫ И СИСТЕМЫ ИСПОЛЬЗОВАНИЯ РЕСУРСОВ В РЕЖИМЕ КОНКУРЕНЦИИ ПРИ ЛЮБОЙ НАГРУЗКЕ С ЦЕЛЬЮ ОБЕСПЕЧЕНИЯ ЖЕЛАЕМОЙ ПОЛОСЫ ЧАСТОТ ДЛЯ УСТРОЙСТВ ОДНОГО ИЛИ МНОЖЕСТВА КЛАССОВ

Изобретение относится к способам и системам использования ресурсов в режиме конкуренции при любой нагрузке с целью обеспечения желаемой полосы частот для устройств одного или множества классов. Технический результат заключается в уменьшении накопления устройств, не прошедших испытание на аперсистентность, при доступе к ресурсу в системе связи. Для каждого класса ресурсов определяют масштабный коэффициент использования и сравнивают с пороговым значением. Затем для каждого класса создают модель характеристики аперсистентности, включающую входные значения характеристики аперсистентности, соответствующие циклам обновления аперсистентности окна моделей аперсистентности. Если масштабный коэффициент находится в первом диапазоне, соответствующем низкой нагрузке на ресурс, модель класса включает беспрепятственные входные значения, позволяющие устройствам пытаться использовать ресурс. В противном случае создают модель класса, включающую по меньшей мере одно блокирующее входное значение, препятствующее ...

СПОСОБ И СИСТЕМА ДЛЯ ПЕРЕДАЧИ IP-ПАКЕТОВ ПУТЕМ ОБЪЕДИНЕНИЯ НЕСКОЛЬКИХ КАНАЛОВ РАДИОСВЯЗИ ДЛЯ ВЫСОКОСКОРОСТНОЙ ПЕРЕДАЧИ ДАННЫХ

Изобретение относится к системам радиосвязи и, в частности, к системам радиосвязи, работающим в сетевой среде передачи данных. Сущность состоит в том, что мобильный радиотерминал (MWT) принимает IP-пакеты, предназначенные для наземной сети в заданном порядке следования, фрагментирует каждый из IP-пакетов на более мелкие фрагменты пакетов, добавляет идентификационную информацию в каждый из фрагментов пакетов и передает фрагменты пакетов параллельно друг другу по одновременно действующим спутниковым каналам. Принимающая станция принимает фрагменты пакетов, переданные от MWT, пересылает принятые фрагменты пакетов в наземный контроллер по сетевому соединению на основании идентифицирующей информации, добавленной во фрагменты пакетов. Наземный контроллер объединяет фрагменты пакетов в реконструированные IP-пакеты на основании идентифицирующей информации, добавленной во фрагменты, а также упорядочивает реконструированные IP-пакеты в заданном порядке следования на основании идентифицирующей информации ...

ВЫЧИСЛЕНИЕ ДОЛГОСРОЧНЫХ РАСПИСАНИЙ ДЛЯ ПЕРЕДАЧ ДАННЫХ ПО ГЛОБАЛЬНОЙ ВЫЧИСЛИТЕЛЬНОЙ СЕТИ

Изобретение относится к передаче данных и предназначено для передачи больших объемов данных между вычислительными устройствами в WAN. Технический результат – повышение эффективности использования сети за счет обеспечения сглаживания объема трафика в сети во времени. Изобретение описывает различные технологии, связанные с диспетчеризацией сетевого трафика в сети. Запрос передать данные из первого вычислительного устройства во второе вычислительное устройство включает в себя данные, которые идентифицируют объем данных, которые должны передаваться в крайний срок, причем данные должны передаваться до крайнего срока. Долгосрочное расписание вычисляется на основе запроса, при этом долгосрочное расписание задает поток трафика через сеть для относительно долгосрочного временного горизонта. Краткосрочное расписание вычисляется на основе долгосрочного расписания, причем устройства в сети сконфигурированы на основе краткосрочного расписания. 3 н. и 17 з.п. ф-лы, 10 ил.

ЛОКАЛИЗОВАННОЕ ВЫЯВЛЕНИЕ ПЕРЕГРУЗКИ

Изобретение относится к области использования сетей связи, а более конкретно, к предотвращению перегрузки в области использования сетей. Способ для локализованного выявления перегрузки в пределах локального контура в сотовой сети связи выполняется принимающим узлом локализованного выявления перегрузки локального контура. Способ включает в себя прием пакетов нисходящей линии связи, предназначенных нижестоящему пользовательскому устройству. Пакеты нисходящей линии связи имеют обратную связь, которая указывает уровень перегрузки, испытываемый пакетами нисходящей линии связи. Заголовки также указывают уровень ожидаемой перегрузки в нисходящем направлении, объявленный вышестоящим узлом. Способ также включает в себя пересылку пакетов нисходящей линии связи нижестоящему пользовательскому устройству через беспроводное соединение. Способ дополнительно включает в себя посылку пакетов восходящей линии связи, имеющих обратную связь, указывающую уровень перегрузки, испытываемый пакетами нисходящей линии ...

СПОСОБ И АППАРАТ ДЛЯ МНОГОПОЛЬЗОВАТЕЛЬСКОЙ ВОСХОДЯЩЕЙ ЛИНИИ СВЯЗИ

Изобретение относится к беспроводной связи. Технический результат заключается в потребности улучшения протокола для передачи по восходящей линии связи от множества терминалов. Предложены способы и аппарат для многопользовательской восходящей линии связи. В одном аспекте предложен способ для беспроводной связи. Способ включает в себя передачу CTX-сообщения (сообщения разрешения передачи) двум или более станциям, причем CTX указывает возможность передачи восходящей линии связи, при этом CTX-сообщение дополнительно содержит запрос того, чтобы упомянутые две или более станции одновременно передавали данные восходящей линии связи в конкретное время. Способ дополнительно включает в себя прием множества данных восходящей линии связи от по меньшей мере двух станций в конкретное время. 4 н. и 25 з.п. ф-лы, 15 ил.

СИСТЕМА И СПОСОБ АДАПТАЦИИ К ПЕРЕГРУЗКЕ СЕТИ

Заявленное изобретение относится к беспроводной связи. Техническим результатом является улучшение адаптации к перегрузке сети. В конкретном варианте осуществления раскрывается способ, который включает в себя прием сообщения обратной связи на передатчике, причем сообщение обратной связи включает в себя индикацию величины перегрузки и долгосрочной скорости передачи данных на приемнике. Данный способ также включает в себя определение скорости разгрузки и времени разгрузки на основе по меньшей мере одного из: долгосрочной скорости передачи данных и величины перегрузки, когда величина перегрузки удовлетворяет пороговому значению. Способ дополнительно включает в себя отправку данных от передатчика приемнику на скорости разгрузки в течение времени разгрузки. Способ также включает в себя коррекцию скорости передачи данных на передатчике до долгосрочной скорости передачи данных после окончания времени разгрузки. 9 н. и 16 з.п. ф-лы, 10 ил.

УЗЕЛ ДОСТУПА, СЕТЕВОЙ ЭЛЕМЕНТ УПРАВЛЕНИЯ МОБИЛЬНОСТЬЮ И СПОСОБ ОБРАБОТКИ ПЕЙДЖИНГОВОГО СООБЩЕНИЯ

Изобретение относится к области технологий сетевой связи и раскрывает узел доступа, сетевой элемент управления мобильностью и способ обработки пейджингового сообщения, согласно которому после приема сетевым элементом управления мобильностью уведомляющего сообщения о функциональных возможностях узла, переданного узлом доступа, причем уведомляющее сообщение о функциональных возможностях узла используется для обозначения, что узел доступа поддерживает использование Протокола пользовательских датаграмм, отличающегося от Протокола передачи и управления потоком, для приема пейджингового сообщения с сетевого элемента управления мобильностью, сетевой элемент управления мобильностью выбирает и использует Протокол пользовательских датаграмм для передачи первого пейджингового сообщения на узел доступа, так чтобы пользовательское требование надежной передачи пейджингового сообщения могло выполняться, степень потребления ресурсов сетевого элемента управления мобильностью могло быть снижено и удавалось ...

СПОСОБ И УСТРОЙСТВО УПРАВЛЕНИЯ СЛУЖЕБНЫМ КАНАЛОМ В МОБИЛЬНОЙ СИСТЕМЕ СВЯЗИ

Заявлены способ и устройство для управления служебным каналом базовой станции в мобильной системе связи. Способ включает операции вычисления нагрузки базовой станции, если вычисленная нагрузка достигает порогового значения, то передачи сообщения запроса назначения дополнительного служебного канала процессору интерфейса платы каналов и дополнительного назначения служебного канала, и если вычисленная нагрузка снижается, то передачи сообщения запроса отмены назначения служебного канала процессору интерфейса платы каналов и отмены упомянутого служебного канала. Техническим результатом является повышение эффективности и стабилизации характеристик мобильной системы связи. 2 с. и 4 з.п. ф-лы, 2 табл, 4 ил.

СИСТЕМА ВЫСОКОСКОРОСТНОЙ СВЯЗИ И СПОСОБ ВЫСОКОСКОРОСТНОЙ СВЯЗИ

Настоящее изобретение относится к системе высокоскоростной связи. Технический результат изобретения заключается в уменьшении количества данных, накопленных в каждой из очередей множества узлов, присутствующих в канале связи, и улучшении рабочих характеристик связи. Система высокоскоростной связи включает в себя множество узлов, расположенных в канале связи; и множество соединений связи, установленных между множеством узлов. Множество узлов обменивается множеством фрагментов информации о модели рабочих характеристик между узлами, причем множество фрагментов информации о модели рабочих характеристик представляет собой рабочие характеристики связи, достигаемые каждым из множества соединений связи. Каждый из множества узлов осуществляет управление связью на основе любого одного из множества фрагментов информации о модели рабочих характеристик связи. 2 н. и 8 з.п. ф-лы, 6 ил.

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

Изобретение относится к управлению потоком в рамках NFV (виртуализация сетевых функций) архитектуры. Технический результат – возможность управления физическими подресурсами для их использования в виртуальном ресурсе на основе приоритета виртуального ресурса и соответствия между виртуальном ресурсом и физическим подресурсом. Для этого осуществляют: виртуализацию физического ресурса на множество виртуальных ресурсов, используемых для независимого запуска на выполнение служб, и разделяют физический ресурс на множество физических подресурсов при наличии соответствия между виртуальным ресурсом и физическим подресурсом; получают заданное отношение отображения между приоритетом службы и виртуальным ресурсом и устанавливают приоритет для виртуального ресурса в соответствии с заданным отношением отображения между приоритетом службы и виртуальным ресурсом; и когда пакет трафика службы вызывает перегрузку физического ресурса, управляют, в соответствии с приоритетом виртуального ресурса и соответствием ...

СПЕКТРАЛЬНО-ОГРАНИЧЕННАЯ КОНТРОЛИРУЮЩАЯ ПАКЕТНАЯ ПЕРЕДАЧА ДЛЯ УПРАВЛЕНИЯ ПЕРЕГРУЗКОЙ И УСТАНОВЛЕНИЯВЫЗОВА В СЕТЯХ, ОСНОВАННЫХ НА ПАКЕТАХ

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

АДАПТИВНЫЙ СПОСОБ ОЦЕНИВАНИЯ СКОРОСТИ ПЕРЕДАЧИ МУЛЬТИМЕДИЙНЫХ ДАННЫХ

... 1. Адаптивный способ оценивания скорости передачи мультимедийных данных, содержащий прием пакета сообщения приемника протокола управления передачей в реальном времени (RTCP), определения коэффициента потерь пакетов из пакета сообщения приемника протокола RTCP и адаптивного оценивания доступной скорости передачи в соответствии с диапазоном, в который попадает коэффициент потерь пакетов. 2. Способ по п.1, в котором на этапе оценивания доступная скорость передачи оценивается с использованием способа вычислений, который варьируется в соответствии с диапазоном, в который попадает коэффициент потерь пакетов. 3. Способ по п.1, в котором процесс оценивания содержит оценивание доступной скорости передачи с использованием первого уравнения, когда коэффициент потерь пакетов попадает в первый диапазон, оценивание доступной скорости передачи с использованием второго уравнения, когда коэффициент потерь пакетов попадает во второй диапазон, и оценивание доступной скорости передачи с использованием третьего ...

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

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

АКТИВНОЕ УПРАВЛЕНИЕ ОЧЕРЕДЬЮ ДЛЯ ВОСХОДЯЩЕЙ ЛИНИИ СВЯЗИ В СЕТИ БЕСПРОВОДНОЙ СВЯЗИ

... 1. Способ управления очередью передачи, также называемой буфером (54) передачи, в пользовательском оборудовании (10), передающем пакеты к базовой станции (28), отличающийся тем, что активное управление очередью в восходящей линии связи в упомянутом буфере (54) передачи реализуется в упомянутой базовой станции (28) посредством этапов, на которых:оценивают (100) в упомянутой базовой станции (28) по меньшей мере одно из размера буфера передачи и задержки очереди в буфере передачи для пользовательского оборудования (10) ивыборочно отбрасывают или маркируют при перегрузке (102) в упомянутой базовой станции (28) пакеты, принятые на базовой станции (28) от пользовательского оборудования (10), на основе, по меньшей мере, одного из оцененного размера буфера передачи и оцененной задержки очереди в буфере передачи.2. Способ по п.1, в котором пакеты являются пакетами Интернет-протокола (IP), отправленными пользовательским оборудованием (10) по информационному соединению Протокола управления передачей ...

СИСТЕМА ВЫСОКОСКОРОСТНОЙ СВЯЗИ И СПОСОБ ВЫСОКОСКОРОСТНОЙ СВЯЗИ

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

СПОСОБ И АППАРАТ ДЛЯ МНОГОПОЛЬЗОВАТЕЛЬСКОЙ ВОСХОДЯЩЕЙ ЛИНИИ СВЯЗИ

СИСТЕМА И СПОСОБ ДЛЯ МАРШРУТИЗАЦИИ ЭЛЕКТРОННОГО КОНТЕНТА НА УСТРОЙСТВО ПОЛУЧАТЕЛЯ

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

КОМПОНЕНТ, СИСТЕМА И СПОСОБ УПРАВЛЕНИЯ ПЕРЕДАЧЕЙ ДАННЫХ ПО МЕНЬШЕЙ МЕРЕ ОДНОГО ПРИЛОЖЕНИЯ СЕТИ СВЯЗИ

... 1. Компонент (31_2-3n_2, 412) управления трафиком приложения, выполненный с возможностью управлять передачей данных по меньшей мере одного приложения (31_11-31_1k, 3n_11-3n_1k, 411_1, 411_2, 421_1, 421_2, 431_1, 431_2) сети связи в объекте (20, 22, 23, 3_1-3_n, 41-43) сети связи, причем управлению подлежит передача данных первого и второго типов по меньшей мере одного приложения (31_11-31_1k, 3n_11-3n_1k, 411_1, 411_2, 421_1, 421_2, 431_1, 431_2) сети связи, и причем компонент (31_2-3n_2, 412) управления трафиком приложения выполнен с возможностью инициировать временный сеанс (44) подавления передачи, при котором прерывается передача данных первого типа, являющихся данными первого типа, и передаются вторые данные, являющиеся данными второго типа, в течение временного сеанса подавления передачи, причем компонент (31_2-3n_2, 412) управления трафиком приложения выполнен с возможностью инициировать временный сеанс (44) подавления передачи, если компонент (31_2-3n_2, 412) управления трафиком ...

ÜBERLASTVERHINDERUNG IN EINEM FERNMELDENETZKNOTEN

Verfahren und Vorrichtung zur Konfiguration einer Datenübertragung über einen Übertragungskanal eines drahtlosen Kommunikationssystems mit dezentraler Überlastregelung

Die Erfindung betrifft ein Verfahren zur Konfiguration einer Datenübertragung über einen Übertragungskanal eines drahtlosen Kommunikationssystems (20) mit dezentraler Überlastregelung (16), wobei die dezentrale Überlastregelung (16) einen entspannten Zustand (Rel), einen aktivierten Zustand und einen eingeschränkten Zustand (Res) umfasst. Es ist vorgesehen, dass fünf aktivierte Zustände (A1, A2, A3, A4, A5) vorgesehen sind, deren Einteilung auf einer Kanallast (CL) in dem Übertragungskanal basiert.

DOMÄNEBASIERTE ÜBERLASTUNGSVERWALTUNG

VERFAHREN UND VORRICHTUNG ZUR NETZVERKHERSKONTROLLE

DROSSELUNG FÜR BANDBREITENUNAUSGEWOGENE DATENÜBERTRAGUNGEN

Techniken zur Drosselung bandbreitenunausgewogener Datenübertragungen werden offenbart. In einigen Beispielen kann ein computerimplementiertes Verfahren das Aufteilen einer Nutzlast einer Datenübertragungsoperation über eine Netzwerkstruktur in mehrere Chunk-Get-Operationen, das Starten der Ausführung einer Schwellenanzahl der Chunk-Get-Operationen, und das Einplanen der verbleibenden Chunk-Get-Operationen für eine nachfolgende Ausführung umfassen. Das Verfahren kann auch das Ausführen einer eingeplanten Chunk-Get-Operation in Reaktion auf das Bestimmen eines Abschlusses einer ausgeführten Chunk-Get-Operation umfassen. In einigen Ausführungsformen können die Chunk-Get-Operationen als ausgelöste Operationen implementiert sein.

VERFAHREN UND SYSTEM ZUR VERKEHRSKONTROLLE ZWISCHEN MULTIMEDIEN-GATEWAY-KONTROLLEUREN UND PROXIES

VERFAHREN ZUR EFFIZIENTEN RÜCKMELDUNG VON EMPFANGSKANALZUSTÄNDEN IN ADAPTIVEN VIDEO-MULTICAST- UND -BROADCAST-SYSTEMEN

Estimating processor load

Devices and methods for scheduling transmission time of media data

A telecommunication end-point device data transmission controller

Overload control for session setups

Providing fair access for VLANs to a shared transmission medium

A method of controlling access to a common physical data transmission link 1 from the members of a packet-based local area network (LAN), wherein the members are partitioned into a plurality of virtual local area networks (VLANs) and packets are identified according to the VLAN from which they come, comprises (a) monitoring packet traffic from the VLANs on the link to obtain measures of the traffic flow from each VLAN; (b) determining whether the traffic flow for a VLAN is above or below a threshold; (c) denoting a VLAN which is above its threshold as in a restricted state and a VLAN which is below its threshold as in a priority state; (d) arbitrating between requests from the VLANs to transmit data packets on the link; and (e) according priority in the arbitration to a VLAN which is in a priority state over any VLAN which is in a restricted state. In response to the presence of any priority requests the arbitration is made only in respect of the set of priority requests and in the absence ...

Method and apparatus for scheduling available link bandwidth between packet-switched data flows

Network congestion control employing data packet construction and prioritisation

The invention provides a method for transmitting data from a plurality of data sources across a data packet data communications network having a congestion control mechanism for reducing the effects of congestion by selectively prioritising data packets. The data packets can contain data in a number of different multimedia types, e.g. voice, video, audio, email, each being within a separate partition in the packet. The packets can be transmitted as a data packet train, which consists of a number of data packets with some association in time and an order of precedence. The association and order of precedence are used to decide which packets can be kept and which packets can be discarded in the presence of a congested network. The data packet partitioning may be made adaptive where the lengths of data packet partitions can be varied dynamically according to the type of data present and current network conditions.

Transmitting data

Flow control system for ethernet network devices

Overload control method for a packet-switched network

Adaption of metadata based on network conditions

In methods and arrangements for adapting metadata depending on conditions in a network or at user equipment (100, 200, 300) and for using such adapted metadata, for example information about the traffic conditions in a network can be used to adapt metadata to comprise, or to comprise references to, such media content that is suitable regarding the network conditions. Different versions, having different bandwidth requirements, of the media content, may for example be used.

Wireless communications systems

Mixed-media telecommunication call set-up

Controlling data transmission rates based on feedback from the data recipient

A first device sends data to a second device via a communication path across an interconnect. The second device sends feedback to the first device. The feedback may be the time taken for a request to reach the second device and the response to return to the first device. The feedback may be the amount of data stored in a buffer on the second device. This may be whether the amount of data exceeds a threshold. The first device adjusts the rate at which it outputs data to the second device based on the feedback. It may adjust the bandwidth allocated to the data or the frequency with which it transmits data. The first device may send a request for feedback via a different path to that on which the data is sent.

Network route finding using path costs based upon percentage of bandwidth free on each link

The invention determines the network topology and support data rate (maximum bandwidth) for each network link S0-1. Nodes monitor their actual bandwidth usage on each of their links and calculate an arithmetic mean over a given time period S2. This data is reported to a central controller. When the controller receives a request for a path between two nodes S3 it calculates link costs S4. The link costs are based upon the fraction of free capacity on the link [(support rate average data rate) / support rate]. Candidate paths between the selected nodes are determined S5 and total path costs are accumulated by summing link costs S6. The total cost of each path is analysed (e.g. using the Dijkstra algorithm) S7.

Adaption of metadata based on network conditions

Overload control method for a packet-switched network

Improvements relating to traffic managers

On chip router

Performing network congestion control utilizing reinforcement learning

Enhanced smart process control switch port lockdown

A lockdown routine for a smart process control switch 146B, wherein traffic at the ports 203, 213, 215 of the switch is limited. Upon initiation of the lockdown routine and detection that a port 203, 213, 215 of the process control switch is connected to a second switch 109, 146C, 146D, a determination as to whether the second switch is lockable is carried out (e.g. using a handshake between the two switches). If the second switch is not lockable 109 (e.g. if it is an unmanaged switch) then a set of addresses (e.g. physical addresses or network addresses) for a set of known devices that have communicated via the second switch is received from the second switch, and the process control switch is transitioned into a locked state wherein traffic at the port 203 is limited to messages associated with an address in the set of addresses. If the second switch is lockable 146C, 146D, then the port 213, 215 is left unlocked. The switches may be used in automated or industrial control networks.

VERFAHREN UND RECHNERPROGRAMMPRODUKT ZUM EFFIZIENTEN UND ZUVERLÄSSIGEN ÜBERTRAGEN VON KLEINEN DATENNACHRICHTEN VON EINEM SENDESYSTEM ZU EINER GROSSEN ANZAHL VON EMPFANGSSYSTEMEN

MULTI-HAVEN SERIAL HIGH-SPEED SWITCHING CROSS CONNECTION CHIP IN A MESHED CONFIGURATION

REACTIVE RANGE CONTROL FUR STREAMING DATA

PROCEDURE FOR THE CONTROL OF DATA COMMUNICATION OF A SENDING MECHANISM AT A RECEIVING INSTALLATION OF A RADIO ENTRANCE NET OF A RADIO COMMUNICATION SYSTEM AS WELL AS RECEIVING MECHANISM AND RADIO ENTRANCE NET

EDGE KNOT FOR A NETWORK DOMAIN

SUPPLY OF MOTORING INFORMATION REGARDING THE FORECAST OF THE PILOT STATUS AND USE OF THESE

NETWORK CHANNEL ACCESS MINUTES - INTERFERENZUND LOAD ADAPTIVE

PROCEDURE AND DEVICES FOR THE NETWORK ROPE PRICE INCREASE

PROCEDURE FOR THE CONTROLLING OF THE FORWARDING QUALITY IN A DATA NETWORK WORK

DEVICE, PROCEDURE AND COMPUTER PROGRAMME PRODUCTS WITH FAST CARRIER PRIORITIZATION IN A MAC HS PACKAGE PLANNER ON BASIS OF THE RECOGNITION OF NECESSARY ACTIVITIES

MAC MULTIPLEXING AND TFC SELECTIVE PROCEDURE FOR EXTENDED UPLINKS

PERMISSION CONTROL IN A PACKAGE NETWORK

NETZWERKSPFADSMETRIKENMESSUNG

RADIO COMMUNICATION SYSTEM, RADIO COMMUNICATION PROCEDURE AND BASIS STATION

PROCEDURE AND DEVICES FOR THE DATA LINK CONTROL

SUPPORT FOR GUARANTEED BIT RATE TRAFFIC FOR UPLINK TRANSMISSIONS

PROCEDURE AND SYSTEM FOR THE CONTROLLING OF CONSUMPTION AT VERKEHRSVOLUMEN BY UNITS OF INFORMATION WITH ENTRANCE TO COMMON RESOURCES

FLOW CONTROL PROCEDURE FOR THE DECREASE OF THE OVERLOADING IN THE ABIS INTERFACE IN A MOBILE TELECOMMUNICATION SYSTEM

BAKE PRESSURE MECHANISM WITH DELAY VARIATION BETWEEN PACKAGES ON A POINT-TO-POINT CONNECTION

Verfahren zur Datenkommunikation mit reduziertem Overhead in einem echtzeitfähigen Ethernet-Datennetzwerk

Um in einem echtzeitfähigen Ethernet-Datennetzwerkprotokoll mit geringem Aufwand die Zykluszeit der Sendezyklen in einem echtzeitfähigen Ethernet Datennetzwerk zu verkürzen, ist vorgesehen, dass eine Mehrzahl von Slaves (S1, S2, S3, S4, S5) zu einer Summenrahmengruppe (SG) zusammengefasst werden und ein Slave (S2, S4) der Summenrahmengruppe (SG) als Sammelknoten (SK) festgelegt wird und alle anderen Slaves (S1, S2, S3, S4, S5) der Summenrahmengruppe (SK) ihre Daten jeweils mit einem Sammel-Datenpaket (DPS1, DPS2, DPS3, DPS4, DPS5) an den Sammelknoten (SK) senden, der Sammelknoten (SK) die Daten der anderen Slaves (S1, S2, S3, S4, S5) der Summenrahmengruppe (SG) in ein Summenrahmen-Datenpaket (DPSR) einfügt und der Sammelknoten (SK) das Summenrahmen- Datenpaket (DPSR) an den Master (M) sendet.

PROCEDURE FOR THE CONTROLLING OF A WIRELESS DATA TRANSMISSION RATE

ARRANGEMENT AND PROCEDURE FOR THE ADJUSTMENT OF A DATA COMMUNICATION IN A NET

OVERLOADING REGULATION IN COMPUTER NETWORK

PROCEDURE AND SYSTEM FOR TREATING NETWORK ROPE

Information transmission, sending, and acquisition method and device

Disclosed are an information transmission, sending, and acquisition method and device. In a specific embodiment, the method comprises: using a master relay terminal and a slave relay terminal in an information relay terminal pair at the head of an information relay terminal pair queue to synchronously receive information sent by an information sending end, and using the master relay terminal to transmit information to an information receiving end; when a fault occurs in the master or slave relay terminal in the information relay terminal pair at the head of the queue, stopping using the master relay terminal and the slave relay terminal in the information relay terminal pair at the head of the queue to receive information, and deleting the information relay terminal pair from the information relay terminal pair queue; after the slave or master relay terminal in the deleted information relay terminal pair transmits all the information to the information receiving end and the fault of the ...

Computing long-term schedules for data transfers over a wide area network

A method comprising: receiving a request to transfer data from a first computing device in a network to a 5 second computing device in the network, the request identifying: the second computing device; a volume of data to be transferred from the first computing device to the second computing device in accordance with the request; and a deadline, the transfer of the data from the first computing device to the 10 second computing device to be completed prior to the deadline; responsive to receiving the request and based upon the request, executing an optimization process to compute a long-term schedule that covers a plurality of time units, the long-term schedule generated to facilitate completion of the transfer of the data from the first computing device to the second computing device prior to the deadline, the long 15 term schedule identifies, for a time unit in the plurality of time units, at least one path in the network over which the data is to be transferred from the first computing ...

System and method for managing secure flows between a plurality of remote sites

The invention relates to a system (100) for managing secure flows transmitted between a first local network (S1) and at least one second local network (S2) which are interconnected by a plurality of extended WAN networks(WAN M, WAN C), characterized in that said system (100) comprises at least: one observation module (OB), one encryption module (CH), one qualitative and quantitative analysis module (AN) for analyzing the data flows, one interface module (IN), one decision module (DE), and one lexical and syntactic analysis module (ALS) for analyzing the messages transmitted between said decision module (DE) and said interface module (IN).

Method for bandwidth information notification, method for service processing, network node and communication system

The present invention relates to the technical field of communications, and discloses a method for bandwidth information notification, a method for service processing, a network node and a communication system. The method for bandwidth information notification comprises: obtaining the current bandwidth information of a link; through a service connection at which the link locates, sending the bandwidth information to an endpoint of the service connection, thus enabling the endpoint of the service connection to carry out service policy adjustment according to the bandwidth information. The technical solution provided by this invention enables the endpoint of the service connection, at which a microwave link locates, to obtain the bandwidth information after the self- adapting modulation of the microwave link.

Methods and apparatus for network congestion control

Mixed-media telecommunication call set-up

METHOD AND ARRANGEMENT FOR DINAMIC ALLOCATION OF NETWORK RESOURCES

Information processing system, information processing apparatus, and program

The purpose of the present invention is to change a bit rate in accordance with occurrence of communication congestion upon receipt of distributed data and an increase in a packet loss rate. An information terminal (10) sequentially receives a plurality of packets constituting distributed data from an information distribution server (20). When congestion is determined to have occurred in communication with the information distribution server (20) on the basis of a change in a time interval from transmission to reception for each of the sequentially received packets, and when the packet loss rate, which is a ratio of the lost packets to the packets transmitted from the information distribution server (20) and which is calculated on the basis of the sequentially received packets, is determined to have increased above a value obtained by multiplying the packet loss rate prior to receiving the packets constituting the distributed data by a predetermined weight, the information terminal (10) ...

Traffic shaping drive method and driver

Disclosed are a traffic shaping drive method and a driver. The method comprises: when traffic shaping is executed, setting a timing time, and sending a data packet in a cache queue in accordance with a preset constant rate in the timing time; when the timing time is reached, stopping sending the data packet, and starting to send an ACK acknowledgement packet in the cache queue; and after the ACK acknowledgement packet is sent, returning to execute the traffic shaping. By conducting traffic shaping on a drive layer, the present invention enables a data packet to be sent in accordance with a constant rate, and reserves a certain bandwidth to send an ACK acknowledgement packet in time, thereby avoiding the condition of network congestion caused by the delayed sending of the ACK acknowledgement packet, and improving the user experience.

Scalable TTI with advanced pilot and control

The disclosure relates in some aspects to a scalable transmission time interval (TTI) and hybrid automatic repeat request (HARQ) design. The TTI is scalable to, for example, achieve latency and/or efficiency tradeoffs for different types of traffic (e.g., mission critical traffic versus traffic with more relaxed latency requirements). In the event a longer TTI is employed, various techniques are disclosed for ensuring a fast turn-around HARQ, thereby maintaining a high level of communication performance.

System and method for connecting calls with a time division multiplex matrix

Variable transmission rate services in a radio access network

Dynamic traffic management on a shared medium

SYSTEM AND METHOD FOR CONNECTING CALLS WITH A TIME DIVISION MULTIPLEX MATRIX

... ▓▓▓A system (102) and method for connecting a call includes a signaling processor ▓(104) adapted to receive and process call signaling to select connections ▓(318, 320, 322) for a call. The signaling processor transmits control messages ▓designating the selected connections. A controllable time division multiplex ▓matrix (202) receives control messages from the signaling processor (104) and, ▓in response to the control messages, makes connections for the call. The ▓system (102) and method may include an interworking unit (302, 304, 306, 308) ▓that receives control messages from the signaling processor (104) and, in ▓response to the control messages, interworks the calls to selected connections ▓(326, 328, 330). The system (102) and method may include an asynchronous ▓transfer mode matrix (310) that receives control messages from the signaling ▓processor and, in response to the control messages, connects the calls to ▓selected connections (334).▓ ...

PROVIDING TRAFFIC INFORMATION RELATING TO A PREDICTION OF CONGESTION STATUS AND USING THE SAME

... ²²²A method for identifying traffic information is provided. The method includes ²receiving traffic data including a first identifier, information corresponding ²to a prediction of an amount of congestion for a particular link, and ²information corresponding to a location associated with the particular link. ²The first identifier enables a determination of a type of the information that ²is included within the received traffic data. The method also includes ²determining a type of information included within the received traffic data ²based on the first identifier and determining congestion amount prediction ²information based on the information included in the received traffic data ²only if the first identifier enables a determination that the received traffic ²data includes a prediction related to congestion amount. The method further ²includes determining location information based on the information that is ²included in the received traffic data corresponding to the location associated ...

METHOD FOR REALIZING BACKPRESSURE OF MASSES OF PORTS AND DEVICE THEREOF

A method for realizing back pressure of masses of ports and the device re alizing the method are provided. It is belong the technical field of network prots back pressure control. The method for realizing back pressure of mass es of ports comprises steps: detecting whether the user's data transmited to the channelizing physical port reaches to the back pressure threhold or not , when the back pressure threshold is reached, generating an idle frame or a series of idle frames; after combining the idle frame and the user's data w hich needs to be transmitted to the channelizing physical port reaching the back threshold, the combined data is transmitted; before the said combined d ata enters into the channelizing physical port, the idle frame is dropped. T he invention ueses the idle frame to realize the back pressure, the idle fra me takes up some of transmiting broadband, and reduces the bandwidth of the user's data, but the idle frame doesn't enter into the physical port,therefo re reaches ...

METHOD AND SYSTEM FOR AGGREGATE BANDWIDTH CONTROL

A virtual link bandwidth control scheme is described that is a software-based mechanism for achieving distributed and coordinated bandwidth control. The scheme can be seamlessly integrated with the data transfer protocols utilizing queuing delay as part of rate control mechanism for data transfer and allows multiple processes to self-limit their transfer speeds, so that the aggregate rate stabilizes at a pre-configured level below the physical bottleneck capacity.

METHOD AND SYSTEM FOR AGGREGATE BANDWIDTH CONTROL

A virtual link bandwidth control scheme is described that is a software-based mechanism for achieving distributed and coordinated bandwidth control. The scheme can be seamlessly integrated with the data transfer protocols utilizing queuing delay as part of rate control mechanism for data transfer and allows multiple processes to self-limit their transfer speeds, so that the aggregate rate stabilizes at a pre-configured level below the physical bottleneck capacity.

SYSTEM AND METHOD FOR PROVIDING BANDWIDTH MANAGEMENT FOR VPNS

A method and system for controlling the bandwidths of data traffic over virtual private networks are provided. The method includes classifying the data traffic for the virtual private network into different flows, monitoring a current bandwidth usage by at least one of the flows, comparing the current bandwidth usage with a predetermined threshold for the flow, and performing a bandwidth control operation for the flow if the current bandwidth usage exceeds the predetermined threshold for that flow.

CONGESTION CONTROL IN LTE-V2V FOR PRIORITIZED TRAFFIC ACCORDING TO A CHANNEL RESOURCE UTILIZATION

Improvements may be made for the congestion control considering different technologies, types of radio resources, and priorities of different packets. The apparatus may be a User Equipment, UE. The UE determines a channel busy ratio (CBR). The UE further determines one or more channel resource utilization limits based on the CBR, wherein each channel resource utilization limit of the one or more channel resource utilization limits corresponds to a respective packet priority. The UE controls transmission of a plurality of packets based on the one or more channel resource utilization limits, each packet of the plurality of packets being associated with a respective packet priority.

CONGESTION CONTROL FOR LTE-V2V WITH DECODE-BASED CHANNEL BUSY RATIO DETERMINATION

Improvements may be made for the Channel Busy Ratio, CBR, based congestion control considering different technologies, types of radio resources, and priorities of different packets. The apparatus may be a User Equipment, UE. The UE determines an energy-based channel busy ratio (CBR) based on a number of probes on a set of radio resources having respective energy levels greater than an energy threshold. The UE performs congestion control based on the energy-based CBR by adjusting at least one transmission parameter of one or more transmission parameters or transmission power of the UE based on the energy-based CBR.The adjusting may be carried out taking into account a usage limit, or CBR limit. In addition, the UE may detect that a second technology different from a first technology is also using the channel, and in addition consider a decode-based CBR for the purpose.

SYSTEM AND METHOD FOR COLLECTING NETWORK PERFORMANCE INFORMATION

A network communications device including an input/output (I/O) unit conf igured to communicate (303) data packets to and from a communications networ k (300) and at least one module. The module(s) may be configured to count to tal data packets being communicated via the I/O unit during a time period, c ount data packets including real-time content being communicated via the I/O unit during the time period, determine bandwidth of total data packets bein g communicated via the I/O unit, determine bandwidth of data packets includi ng real-time content being communicated via the I/O unit, and communicate in dicia representative of the bandwidth of data packets including real-time co ntent and total data packets (302) via said I/O unit to another network comm unications device (304). The module(s) may be software, hardware, or a combi nation thereof.

EDGE NODE FOR A NETWORK DOMAIN

An egress node is proposed for a network domain that comprises at least o ne ingress node for receiving and routing data units belonging to a pluralit y of flows into said network domain, a plurality of interior routers for rou ting said data units through said network domain, and said egress node(s). O ne or more of the interior routers is arranged to detect whether it is subje ct to a congestion condition and to congestion mark routed data units if it is subject to said congestion condition. The egress node comprises a control element arranged for performing a congestion handling function that compris es a part for detecting the presence of congestion marked data units arrivin g at said edge node, and a part for reacting to the detection of the presenc e of congestion marked data units by invoking a congestion control process. The congestion control comprises sending to said ingress node an instruction for terminating one or more flows to thereby reduce a traffic load, waiting a predetermined ...

AIRCRAFT MESSAGE ROUTING SYSTEM

Systems and methods for managing aircraft messages are provided. In one embodiment, the method can include receiving a message from an onboard system of an aircraft. The method can include determining a priority associated with the message based, at least in part, on data associated with the message. The data can be indicative of at least a content of the message. The method can include determining data indicative of availability for each of a plurality of communications networks based, at least in part, on one or more first parameters associated with the aircraft. The method can include selecting a network based, at least in part, on message priority, the data indicative of availability, and one or more second parameters associated with each of the networks. The method can include sending the message via the selected network when the network is available, or storing the message when the network is unavailable.

METHOD FOR DATA COMMUNICATION WITH REDUCED OVERHEAD IN A REAL-TIME CAPABLE ETHERNET DATA NETWORK

In order that in a real-time capable Ethernet data network protocol the cycle time of the transmission cycles in a real-time capable Ethernet data network can be shortened, according to the invention a plurality of slaves (S1, S2, 53, S4, S5) is combined into a sum frame group (SG) and a slave (S2, S4) of the sum frame group (SG) is specified as collector node (SK) and all other slaves (S1, S2, S3, S4, S5) of the sum frame group (SK) transmit their data in each case with a collective data packet (DPS1, DPS2, DPS3, DPS4, DPS5) to the collector node (SK) transmit, the collector node (SK) inserts the data of the other slaves (S1, S2, S3, S4, S5) of the sum frame group (SG) into a sum frame data packet (DPSR) and the collector node (SK) transmits the sum frame data packet (DPSR) to the master (M).

METHOD OF NETWORK TRAFFIC MANAGEMENT IN INFORMATION AND COMMUNICATION SYSTEMS

The subject of the invention is a method of network traffic management in information and communication systems (in particular, in active network devices) where it is desired/operated/insufficient to use the QoS (Quality of Service) characteristics in order to improve the quality of information and communication services. The method lies in the fact that, by using a multilayer neural network, knowledge base and feedback, the system is able to autonomously adjust Q0S parameters and settings in the device to the existing conditions and circumstances.

REDUCING DELAY IN VIDEO TELEPHONY

In an example, a method of processing data includes transmitting data over a network at a first bit rate, identifying a reduction in a network link rate of the network from a first network link rate to a second network link rate, and in response to identifying the reduction in the network link rate, determining a recovery bit rate at which to transmit the data over the network, where the recovery bit rate is less than the second network link rate. The method also includes determining a buffering duration based on a difference between a time of the identification of the reduction in the network link rate and an estimated actual time of the reduction in the network link rate, and determining a recovery rate duration during which to transmit the data at the recovery bit rate based on the recovery bit rate and the buffering duration.

SYSTEM AND METHOD FOR HEURISTIC CONTROL OF NETWORK TRAFFIC MANAGEMENT

A method for heuristic control of traffic management on a computer network, the method including: setting predetermined benchmarks for traffic; performing a traffic management control loop to determine at least one value of a quality of experience (QoE) metric, via a QoE measuring module, on the network based on the traffic flow; performing a heuristic control loop comprising: aggregating the at least one value of the QoE metric obtained from the traffic management control loop; determining a new benchmark based on the aggregation of the QoE metric, via a heuristic control module; and sending the new benchmark to the QoE measuring module. a system for heuristic control of traffic management on a computer network, the system including: a heuristic calibration module configured to set predetermined benchmarks for traffic; a QoE module configured to determine at least one value of a quality of experience (QoE) metric, on the network based on the traffic flow; an analysis module configured ...

COMPUTER SYSTEM AND COMMUNICATION METHOD IN COMPUTER SYSTEM

A computer system according to the present invention is provided with: a controller for setting the flow entry for each of a plurality of switches before packets are transmitted from a plurality of nodes; and a switch for transmitting received packets, which include destination addresses specified by the flow entry, to destination devices specified by the flow entry, regardless of the transmission origin addresses of the received packets.

Method and apparatus for handling traffic in a data communication network

A method and apparatus for offloading data traffic routing from one NI (network interface) to another. The NI receives data traffic, and that portion of the data traffic that must be L3 routed is passed to the CPU of the NI though a token bucket meter or equivalent metering device that selectively designates a portion of the routing traffic to another NI for routing. The portion of the traffic designated corresponds to the capacity of the CPU and offloading a portion of the data traffic helps to reduce the number of packets that are discarded when a CPU is overloaded. The threshold for determining when and in what quantity the data traffic should be offloaded is either statically or dynamically set, and in the latter case may be updated automatically when traffic levels and, in some implementations, other considerations require.

Monitoring network performance and detecting network faults using round trip transmission times

A computer program product is provided for performing a method including: receiving transmission data over a selected time interval for each of a plurality of communication paths; calculating an average round-trip transmission time for each of the plurality of communication paths over the time interval; comparing an average round-trip transmission time for a communication path having the highest average round-trip transmission time to a threshold value and to a multiple of an average round-trip transmission time for a communication path having the lowest average round-trip transmission time; and determining, based on a result of comparing the highest round-trip transmission time to the threshold value and to a multiple of the lowest round-trip transmission time, whether the time period indicates a delay in communication between the I/O subsystem and the control unit requiring at least one of a monitoring action and a recovery action.

Wireless load balancing across bands

A technique for wireless load balancing involves providing a wireless infrastructure that creates a target band option and helps push clients toward that band. An example of a method according to the technique involves, by way of example but not limitation, responding only to probe requests on a first band when a client is detected on the first band and a second band. For example, using the techniques described herein, a platform that is both 802.11a and 802.11b/g compliant may attempt to connect preferentially to the 802.11b/g band of a wireless network, and be migrated toward the 802.11a band instead.

Automated traffic engineering for fat tree networks

Embodiments of a method implemented in at least one fat tree network node for improved load distribution, wherein the node is one of a plurality of fat tree network nodes in a fat tree network each of which implement a tie-breaking process to produce minimum cost trees, is described. In some embodiments, a spanning tree computation for each root node of the fat tree network in order from a lowest ranked root node to a highest ranked node is performed, a filtering database for each root node of the fat tree network, wherein the filtering database includes a set of media access control (MAC) addresses of the leaf nodes of the fat tree network generated, and link utilization for each computed tree to use as a prefix to link identifiers used for at least one tie-breaking algorithm added.

Method and apparatus for adaptive bandwidth control with defined priorities for different networks

A computer implemented method, apparatus, and computer usable program code to receive data from a source at a plurality of gateways for distribution using a selected priority. The data is transmitted from the plurality of gateways to a plurality of receivers using the selected priority. Every gateway in the plurality of gateways has an adaptive bandwidth control process and a respective set of parameters for controlling the adaptive bandwidth control process for sending the data at the selected priority. Transmission of the data from each gateway for the selected priority has a different impact on other traffic at different gateways in the plurality gateways for the selected priority when different values are set for the set of parameters for the different gateways.

Method and apparatus for traffic engineering in shortest path bridged networks

A method and apparatus for diverting traffic in a communications network are disclosed. According to one aspect, the invention provides a communications network with a first node and a second node. Connecting these two nodes is a first set of intermediate nodes on a first path (the true shortest path) and a second set of intermediate nodes on a second alternate path. At a first node, a first processor determines whether a packet arriving at the first node must transit the second node. If so, the base virtual local area network (VLAN) identifier (VID) of the packet is replaced by a first VID, and the packet is transmitted along the second path through the second set of intermediate nodes to the second node. At the second node, a second processor determines whether a packet arriving at the second node must transit the first node. If so, the base VID of the packet is replaced by a second VID different from the first VID and different from the base VID, and the packet is transmitted along the second path through the second set of intermediate nodes to the first node.

Parameterized recursive network architecture with topological addressing

A digital data communications network that supports efficient, scalable routing of data and use of network resources by combining a recursive division of the network into hierarchical sub-networks with repeating parameterized general purpose link communication protocols and an addressing methodology that reflects the physical structure of the underlying network hardware. The sub-division of the network enhances security by reducing the amount of the network visible to an attack and by insulating the network hardware itself from attack. The fixed bandwidth range at each sub-network level allows quality of service to be assured and controlled. The routing of data is aided by a topological addressing scheme that allows data packets to be forwarded towards their destination based on only local knowledge of the network structure, with automatic support for mobility and multicasting. The repeating structures in the network greatly simplify network management and reduce the effort to engineer new network capabilities

Data transfer device

A data transfer device 210 is equipped with a plurality of communication ports 211 a and 211 b, a communication establishment processor 212, and a communication maintenance processor 213. The communication establishment processor 212 transmits and receives communication establishing information for establishing communication with an external device connected via the communication port to and from the external device. The communication maintenance processor 213 is configured to operate independently of the communication establishment processor 212 and, every time a predetermined transmission period elapses, transmits communication maintaining information for maintaining the establishment of communication with the external device, to the external device. In a state that communication with a plurality of external devices via the plurality of communication ports is established, the data transfer device 210 transmits data received from one of the plurality of external devices to the other one of the plurality of external devices.

Network control apparatus and method for populating logical datapath sets

For a network control system that receives, from a user, logical datapath sets that logically express desired forwarding behaviors that are to be implemented by a set of managed switching elements, a controller for managing several managed switching elements that forward data in a network that includes the managed switching elements is described. The controller includes a set of modules for detecting a change in one or more managed switching elements and for updating logical datapath set based on the detected change. The logical datapath set is for subsequent translation into a set of physical forwarding behaviors of the managed switching elements.

Bandwidth information notification method, service processing method, network node and communication system

A bandwidth information notification method includes: obtaining current bandwidth information of a link; and sending the bandwidth information to an endpoint of a service connection through the service connection which passes through the link. The endpoint of the service connection can adjust a service policy according to the bandwidth information. An endpoint of a service connection which passes through a microwave link may obtain bandwidth information of the microwave link, where the bandwidth information is obtained after adaptive modulation of the microwave link.

System and method for optimizing packet routing in a mesh network

A method is provided in one example and includes receiving a first packet and a second packet that propagate in a mesh network and evaluating hop count metrics associated with the first packet and the second packet (e.g., evaluate the number of hops traversed in the mesh network, hop characteristics, etc.). The first packet is sent to a first queue, the second packet is sent to a second queue. The first queue is associated with a first hop count detected in the first packet, and the second queue is associated with a second hop count detected in the second packet. A buffer overflow condition can be identified. The method further includes discarding the second packet based on the second hop count being less than the first hop count. Discarding of the second packet may be performed in response to any type of congestion parameter detected in the mesh network.

Systems and techniques for utilizing resource aware queues and/or service sharing in a multi-server environment

Systems and techniques for utilizing resource aware queues and/or service sharing in a multi-server environment. Requests directed to an application server are received into one or more queues in front of the application server. An acknowledgement of the requests is provided in response to the requests being received by the one or more queues. Metadata associated with the requests is utilized to manage the one or more queues. The requests from the one or more queues are processed based on the metadata.

Method for notifying bandwidth information, method for processing service, network node, and communication system

The present invention relates to the field of communication technologies, and discloses a method for notifying bandwidth information, a method for processing a service, a network node, and a communication system. The method for notifying bandwidth information includes: obtaining current link bandwidth information of a microwave link; determining, according to a mapping relationship between link bandwidth information and service bandwidth information, corresponding to the current link bandwidth information, service bandwidth information that is allocated to a service connection on which the microwave link is located; and transmitting the allocated service bandwidth information to an endpoint of the service connection through the service connection, so that the endpoint of the service connection adjusts a service policy according to the allocated service bandwidth information.

Lightweight multicast method and apparatus for data distribution service

The present invention provides a lightweight multicast method and apparatus for a data distribution service. The lightweight multicast apparatus includes a network congestion detection unit for multicasting packets to a plurality of subscriber node terminals, and detecting a cause of network congestion using a negative response message transferred from a relevant subscriber node terminal that could not receive the packets among the plurality of subscriber node terminals. A network recovery control unit determines a recovery control policy depending on the cause of the congestion detected by the network congestion detection unit, and solves the cause of the congestion.

Load management in wireless mesh communications networks

Methods and systems for providing a network and routing protocol for utility services are disclosed. A method includes discovering a utility network. Neighboring nodes are discovered and the node listens for advertised routes for networks from the neighbors. The node is then registered with one or more utility networks, receiving a unique address for each network registration. Each upstream node can independently make forwarding decisions on both upstream and downstream packets, i.e., choose the next hop according to the best information available to it. The node can sense transient link problems, outage problems and traffic characteristics. Information is used to find the best route out of and within each network. Each network node maintains multi-egress, multi-ingress network routing options both for itself and the node(s) associated with it. The node is capable of several route maintenance functions utilizing the basic routing protocol and algorithms.

Techniques for selecting paths and/or trunk ports for forwarding traffic flows

Techniques that offer enhanced diversity in the selection of paths (e.g., ECMP paths) and/or ports from ports associated with trunks for forwarding data traffic. In one embodiment, one or more functions are used to generate a result. A first portion of the generated result may be used as an index (e.g., ECMP index) for selecting a path (e.g., an ECMP path) from multiple possible paths for forwarding a packet. A second portion of the generated result, different from the first portion, may be used as an index (trunk index) for selecting an output port from multiple output ports associated with a trunk for forwarding a packet. In this manner, selected portions of the generated result may be used as indices, one for selecting a path and another for selecting a trunk port for forwarding packets such that the two indices are not the same and are not dependent upon one another.

Traffic flow control based on vlan and priority

A method for controlling traffic flow at a traffic routing device of a network comprises a plurality of operations. An operation is performed for determining an instance of traffic flow congestion for traffic of a particular VLAN (virtual local area network) flow control group and having a particular priority. The particular VLAN flow control group and the particular priority jointly define a particular prioritized VLAN flow control group. An operation is performed for issuing traffic flow instructions for causing flow of the traffic of the particular prioritized VLAN flow control group to be temporarily inhibited. Thereafter, an operation is performed for inhibiting transmission of traffic for the particular prioritized VLAN flow control group at a particular traffic routing device in response to the particular traffic routing device receiving the traffic flow instructions.

Mobile application traffic optimization

Systems and methods for mobile application traffic optimization are disclosed. In one aspect, embodiments of the present disclosure include a distributed proxy and cache system, including, a local proxy on a mobile device for intercepting a data request made via a mobile device, and a proxy server coupled to the mobile device and a content server to which the data request is directed. In one embodiment, the local proxy can forward the data request to the proxy server for transmission to the content server for a response to the data request. In addition, the proxy server sends the data request to the content server independent of activities on the local proxy and notifies the local proxy when changed or different content on the content server is detected for the data request.

System and method for variable-size table construction applied to a table-lookup approach for load-spreading in forwarding data in a network

A network element disposed in a network, where the network element implements a process to manage load distribution across a plurality of network interfaces of the network. The network element redirects traffic flow directed toward the plurality of network interfaces in response to changes in configuration of the plurality of network interfaces, where each traffic flow is a set of protocol data units (PDUs), having an ordered delivery requirement, and where the PDUs are transmitted across the network between a source node and a destination node. The redirection process minimizes data traffic flow disruption when the load distribution is determined using a set of load distribution tables instead of a hashing algorithm.

System and method for selecting network egress

A system and method for selecting communications routing. Network performance information is gathered from a communications network using performance information packet data packets. A network connection offering the best quality of service is selected between the communications network and an outside network based on the network performance information. The network connection is established between the communications network and the outside network for routing communications.

Load-Balancing Structure for Packet Switches with Minimum Buffers Complexity and its Building Method

This invention provides a structure of load-balancing packet switches with minimum buffers complexity and its concomitant methodology. It abandons the VOQ between the first stage and the second stage fabrics, which has no problems of queue delay and packets out-of-sequence. Therefore, this invention solves the packets out-of-sequence problem in load-balancing Birkhoff-von Neumann switching structure and improves the end-to-end throughput. Moreover, it greatly reduces the buffer complexity to O(N).

Method and apparatus providing network coding based flow control

A method, apparatus and computer program product for providing network based flow control is presented. A linear combination of packets to transmit from a transmit queue is determined. The linear combination of packets is transmitted across a network using a sliding window protocol. An acknowledgement (ACK) is generated, wherein a packet is acknowledged when a receiving node receives the linear combination of packets and determines which packet of the linear combination of packets has been newly seen.

Traffic management in distributed wireless networks

Wireless networks and devices are ubiquitous today. For service providers to offer customers QoS and Service Level Agreements (SLAs) means in part providing resilient connectivity of wireless devices with good signal strength, good Signal to Noise and Interference Ratio (SNIR), and adequate useable bandwidth. Doing so requires that devices transmitting and receiving packets use over-the-air bandwidth efficiently and manage over-the-air congestion. According to embodiments of the invention QoS measurements and controls are incorporated only in the network (i.e. APs or controllers) and therefore QoS and SLAs can be achieved with all deployed client stations versus standards based approaches that require additional capabilities in network nodes, client stations and in most cases modifications to the applications. SLAs can be provided exploiting embodiments of the invention for traffic prioritization, capacity improvements through load distribution, and adjacent channel interference mitigation discretely or in combination with standards based mechanisms.

Method and apparatus for addressing in a resource-constrained network

An electronic device may receive a protocol data unit (PDU) comprising a plurality of addressing bits. Data-link-layer processing of the PDU may be based on each of the addressing bits. Network layer processing of the PDU may be based on a first subset of the plurality of addressing bits. Transport-layer processing of the PDU may be based on a second subset of plurality of addressing bits. The data-link-layer processing may comprise determining whether the PDU is unicast-addressed or non-unicast-addressed. For a unicast-addressed PDU, the data-link-layer processing may comprise determining whether the PDU is destined for the electronic device based on a comparison of a Target ID field of the PDU and a device ID of the electronic device. For a non-unicast-addressed PDU, the Target ID field may not be present, and whether the PDU is destined for the electronic device may be determined based on other criteria.

Method and apparatus for forward error correction (fec) in a resource-constrained network

An electronic device may utilize or support adaptive use of forward error correction (FEC) in a resource-constrained network. The adaptive FEC use may comprise determining whether use of FEC encoding in transmissions from another electronic device to the electronic device is necessary, desirable, and/or feasible, and when use of FEC encoding is deemed feasible and either necessary or desirable, instructing the another electronic device to utilize FEC encoding when transmitting signals destined for the electronic device. Use of FEC encoding may be determined to be feasible, necessary and/or desirable based on power loss associated with the communications from the another electronic device; based on determination of latency associated with the communications from the another electronic device; and/or based on power and/or processing related resources in the electronic device. The electronic device may separately and selectively apply FEC encoding to transmissions to the another electronic device.

Method and system for processing request message, and load balancer device

A method and a system for processing a request message, and a load balancer device are provided. The load balancer obtains a service name and an operation name through simple string matching, and a large amount of computing is performed at a server side, thereby solving a session hold problem of a composition engine cluster, reducing a computing task of a load balancer, maximizing a fan-out capability of the load balancer, and increasing a throughput of the composition engine cluster to a maximum extent, therefore satisfying a demand for a large capacity of a composition engine.

Method, device and system for processing service traffic based on pseudo wires

The embodiment of the present invention relates to a method, device and system for processing service traffic based on pseudo wires, wherein the method includes: receiving service traffic from a customer edge device ( 101 ); determining a pseudo wire aggregation group corresponding to the service traffic ( 102 ); forwarding the service traffic, according to a local strategy, to a peer device via a pseudo wire in “forwarding” or “active” status in the pseudo wire aggression group, the pseudo wire aggregation group including more than one pseudo wire corresponding to the service traffic ( 103 ). The embodiments of the invention improve average convergence rate of the service traffic and reduce switchover time when a failure occurs in the network.

Mobile communication system, constituent apparatuses thereof, traffic leveling method and program

A mobile communication system includes a traffic monitoring apparatus arranged between predetermined nodes in a mobile network for monitoring a traffic amount between the nodes; and a traffic control apparatus that outputs control information to the predetermined nodes based on a report from the traffic monitoring apparatus wherein the control information instructs the predetermined nodes to level the traffic amount.

System and method for managing ephemeris requests from client devices

A system and method for reducing peak loads on a network, includes: a server in communication with a plurality of GPS receivers, the receivers sending requests for an ephemeris to the server when a time of ephemeris (TOE) for a previous ephemeris expires; and the ephemeris received by the receivers being adjusted by the addition of a value to the TOE of the ephemeris, the value being randomly adjusted to a 16 second interval between 16 seconds and 30 minutes.

Method and apparatus for generic mapping procedure gmp and method and apparatus for generic mapping procedure gmp demapping

Embodiments of the present invention disclose a method for the generic mapping procedure GMP mapping, a method for GMP demapping, and an apparatus. The method for mapping includes: carrying, in an overhead GMP OH of the ith GMP block container, information about a TS that needs to be occupied by the (i+n)th GMP block container; adjusting the (i+n)th GMP block container according to the information about the TS that needs to be occupied by the (i+n)th GMP block container; performing, according to the adjusted (i+n)th GMP block container, the GMP mapping on customer service data to be sent, so that a receive end is capable of adopting a corresponding demapping manner according to a change of the block container, which implements lossless mapping and demapping processing by adopting a GMP for a variable block container.

Method and apparatus for providing congestion management for a wireless communication network

A method and apparatus for providing a congestion management of a wireless communication network are disclosed. For example, the method projects dynamically a trend for a network element of the wireless communication network, using a functionality metric associated with the network element of the wireless communication network, and determines if there is a potential congestion in accordance with the trend. The method then provides a notification of the potential congestion, if there is a potential congestion for the network element of the wireless communication network.

Compact load balanced switching structures for packet based communication networks

A switching node is disclosed for the routing of packetized data employing a multi-stage packet based routing fabric combined with a plurality of memory switches employing memory queues. The switching node allowing reduced throughput delays, dynamic provisioning of bandwidth and packet prioritization.

Personal media broadcasting system with output buffer

A personal media broadcasting system enables video distribution over a computer network and allows a user to view and control media sources over a computer network from a remote location. A personal broadcaster receives an input from one or more types of media sources, digitizes and compresses the content, and streams the compressed media over a computer network to a media player running on any of a wide range of client devices for viewing the media. The system may allow the user to issue control commands (e.g., “channel up”) from the media player to the broadcaster, causing the source device to execute the commands. The broadcaster and the media player may employ several techniques for buffering, transmitting, and viewing the content to improve the user's experience.

Session initiation protocol (sip) overload protection

A device receives a Session Initiation Protocol (SIP) response that includes a load header associated with a downstream Session Initiation Protocol (SIP) device. The device also determines an amount of traffic to send to the downstream Session Initiation Protocol (SIP) device based on the load header. The device further sends the determined amount of traffic to the downstream Session Initiation Protocol (SIP) device.

Selective topology routing for distributed data collection

In one embodiment, a device, such as a network management server, determines a traffic matrix of a mesh network, where the traffic matrix indicates an amount of traffic per type of traffic transitioning between the mesh network and a global computer network via one or more current root devices. One or more optimized root devices may then be selected for corresponding directed acyclic graphs (DAGs) based on the amount of traffic and type of traffic. As such, a DAG formation request may be transmitted to the selected root devices, carrying a characteristic for a corresponding DAG to form by the respective selected root devices that indicates which one or more types of traffic correspond to the corresponding DAG.

Uplink transmission method and apparatus in wireless communication system

The present invention provides an uplink transmission method and apparatus in a wireless communication system. A terminal receives an uplink resource allocation from a base station; and transmits uplink transmission blocks to a PUSCH (physical uplink shared channel) by using the uplink resource allocation. The uplink resource allocation indicates an allocated RBs (resource blocks) within a subframe that includes a plurality of RBs. The subframe is divided into at least one PUCCH (physical uplink control channel) area for PUCCHs and a plurality of PUSCH (physical uplink shared channel) area for PUSCHs, wherein the PUCCH area is arranged between the plurality of PUSCH regions.

Scheduling under congestion with traffic load-based scaling

Apparatus and techniques for scheduling packets to reduce congestion in a packet data network are described. In one embodiment of the invention, packets are received through each of a plurality of channels and are stored in a respective queue for each channel. The status of each queue is monitored as empty or not empty. When an empty queue becomes not empty, then bandwidth allocation value is added for the respective channel to a port load value. When a not empty queue becomes empty, then the bandwidth allocation for the respective channel is subtracted from the port load value. The traffic rate through the port is then scaled based upon the port load value.

Application and network-based long poll request detection and cacheability assessment therefor

Systems and methods for application and network-based long poll request detection and cacheability assessment therefore are disclosed. In one aspect, embodiments of the present disclosure include a method, which may be implemented on a distributed proxy and cache system, including, determining relative timings between a first request initiated by the application, a response received responsive to the first request, and a second request initiated subsequent to the first request also by the application. The relative timings can be compared to request-response timing characteristics for other applications to determine whether the requests of the application are long poll requests.

Systems and methods for intelligent discard in a communication network

Systems and methods for optimizing system performance of capacity and spectrum constrained, multiple-access communication systems by selectively discarding packets are provided. The systems and methods provided herein can drive changes in the communication system using control responses. One such control responses includes the optimal discard (also referred to herein as “intelligent discard”) of network packets under capacity constrained conditions. Some embodiments provide an interactive response by selectively discarding packets to enhance perceived and actual system throughput, other embodiments provide a reactive response by selectively discarding data packets based on their relative impact to service quality to mitigate oversubscription, others provide a proactive response by discarding packets based on predicted oversubscription, and others provide a combination thereof.

Controlling the operation of server computers

A plurality of server computers in a network that includes load balancing processes to enhance performance employs a non-performance related variable, such as power consumption, and modifies the load balancing processes in response to the reading of the non-performance variable. Such variables do not affect the response and performance as perceived by a browsing client but do provide other advantages with in the environment as a whole. The non-performance related variable is employed such that one or more of said server computers are de-activated to reduce power consumption, and the load balancing processes balance load across the remaining active server computers.

Centralized logical l3 routing

A novel method for logically routing a packet between a source machine that is in a first logical domain and a destination machine that is in a second logical domain is described. The method configures a managed switching element as a second-level managed switching element. The method configures a router in a host that includes the second-level managed switching element. The method communicatively couples the second-level managed switching element with the router. The method causes the router to route a packet when the router receives a packet from the first logical domain that is addressed to the second logical domain.

System and method for detecting sources of rogue non-audio traffic marked as audio traffice

Disclosed herein are systems, methods, and computer-readable storage media for managing a packet network to deal with rogue applications that produce non-audio packets marked as audio packets. The system analyzes packet flow through the network to identify an unauthorized source of non-audio packets marked as audio packets, and upon identifying the unauthorized source, the system stops subsequent unauthorized transmission of non-audio packets marked as audio packets from the identified unauthorized source. For example, such an unauthorized source is identified by finding that an audio marked packet has a source address that is not found on a list of authorized sources, or by detecting atypical patterns of audio queue utilization, or by determining whether audio marked packets from a source exceed a threshold value related to transmission of audio marked packets.

OVERLOAD CALL CONTROL IN A VOIP NETWORK

The invention provides a system, method and apparatus for controlling a mass calling event in a VoIP network. The invention provides for monitoring port traffic information on a network edge device and detecting the occurrence of a mass calling event in conjunction with a call control module. Control instructions or information may then be provisioned to network edge devices to alleviate congestion. The invention enables network edge devices to gap or provide other controls to reduce call overloading. Controls for alleviating congestion include blocking the packets, providing an announcement to the call, re-routing the traffic associated with this specific mass calling event, and reducing the quality of the service. 124-. (canceled)25. A call control method , comprising:obtaining information indicative of a quantity of telephone calls to a common target destination during a first interval of time;in response to the quantity of telephone calls sharing the common target destination during the first interval of time exceeding a threshold, sending, to a network edge device associated with the common target destination, a provisioning instruction to take a mass calling event action.26. The method of claim 25 , wherein the provisioning instruction instructs the network edge device to block packets associated with the common target destination.27. The method of claim 25 , wherein the provisioning instruction instructs the network edge device to reduce a quality of service associated with the common target destination28. The method of claim 25 , wherein the provisioning instruction instructs the network edge device to re routing traffic addressed to the common destination target.29. The method of claim 25 , wherein the provisioning instruction instructs the network edge device to provide an announcement to an originator of a call to the common network address.30. The method of claim 25 , wherein the provisioning instruction instructs the network edge device to alter a voice ...

METHOD, NETWORK, AND COMPUTER PRODUCT FOR FLOW BASED QUALITY OF SERVICE

A method, network, and computer program product are provided for traffic flow quality of service. A quality of service priority table is received for services defined by a user at the network, and the quality of service priority table includes quality of service levels for the services. Traffic flows are determined to correspond to packets being communicated over the network for the user. The traffic flows are mapped to services. The traffic flows are mapped to the quality of service levels for the services. The quality of service levels are assigned to the traffic flows as assigned quality of service levels corresponding to the services. Each of the traffic flows is routed over the network according to its assigned quality of service levels, respectively. 1. A method of traffic flow for a network , the method comprising:receiving a quality of service priority table for a plurality of services defined by a user at the network, wherein the quality of service priority table includes quality of service levels for the plurality of services;determining traffic flows to correspond to packets being communicated over the network for the user;mapping the traffic flows to the plurality of services, the plurality of services respectively corresponding to individual software applications on a computer of the user;wherein the individual software applications on the computer comprise a peer-to-peer software application, a web browsing software application, an email software application, a business software application, and a social networking application;mapping the traffic flows to the quality of service levels for the plurality of services that respectively correspond to the individual software applications on the computer of the user;assigning the quality of service levels to the traffic flows as assigned quality of service levels corresponding to the plurality of services of the individual software applications on the computer, each of the software applications having its own ...

Method for configuration of a load balancing algorithm in a network device

A method for configuration of a network device is described herein. Counter information for one or more ports of a plurality of ports of the network device is managed. The one or more ports are aggregated to a logical port in a logical communication channel. The counter information may be determined by the network device. A current load balancing algorithm is determined. The current load balancing algorithm is set for use on network packets on egress out of the logical port. Statistics are determined using the counter information and the current load balancing algorithm. Based on the statistics, the network device is configured with an available load balancing algorithm of a plurality of load balancing algorithms available to the network device.

Link Aggregation Based on Port and Protocol Combination

A network switch suitable for receiving packets of information from and the packets of information to a communications network includes a plurality of physical ports, packet processing functionality and memory. The packet processing functionality operates on information stored in memory to determine the LAG, from among two or more LAGs, over which a packet received by the switch should be correctly forwarded. The switch memory stores a plurality of LAG tables, each one of which can include one or more entries comprising a physical port number and a packet parameter that are used by the packet processing functionality to determinately identify the correct LAG over which to forward a packet.

METHODS AND APPARATUS TO CONTROL TRAFFIC IN A PACKET-SWITCHED NETWORK

Methods and apparatus to control traffic in a packet-switched network are disclosed. An example circuit manager includes a usage analyzer to estimate a utilization of a network for a future time interval based on data associated with actual utilization of the network, a rebalancer to detect a trigger event based on the estimated utilization, and to identify a future virtual circuit path through the network for the future time interval based on the estimated utilization when the trigger event is detected, the usage analyzer and the rebalancer to repetitively change mapping of virtual circuit paths including the future virtual circuit path to physical resources to adapt the network to expected usage conditions, a rerouter to identify the future virtual circuit path based on a first predicted weighted cost for a first communication link and a second predicted weighted cost for a second communication link, and a capacity manager to determine whether the identified future virtual circuit path is expected to reduce a future utilization of a communication path below a first threshold, and to determine where additional transmission capacity should be added to the network when the predicted future utilization of the communication path exceeds the first threshold. 1. A circuit manager comprising:a usage analyzer to estimate a utilization of a network for a future time interval based on data associated with actual utilization of the network;a rebalancer to detect a trigger event based on the estimated utilization, and to identify a future virtual circuit path through the network for the future time interval based on the estimated utilization when the trigger event is detected, the usage analyzer and the rebalancer to repetitively change mapping of virtual circuit paths including the future virtual circuit path to physical resources to adapt the network to expected usage conditions;a rerouter to identify the future virtual circuit path based on a first predicted weighted cost ...

Network traffic distribution

A switch for a switching network includes a plurality of ports for communicating data traffic and a switch controller that controls switching between the plurality of ports. The switch controller selects a forwarding path for the data traffic based on at least topological congestion information for the switching network. In a preferred embodiment, the topological congestion information includes sFlow topological congestion information and the switch controller includes an sFlow client that receives the sFlow topological congestion information from an sFlow controller in the switching network.

METHODS AND APPARATUS FOR LOAD BALANCING IN COMMUNICATION NETWORKS

Example methods disclosed herein include, in response to receiving a first message associated with a first registration request for a device, determining whether the device is currently assigned to a first call processor and performing a load balancing procedure to reassign the device to one of a plurality of call processors including the first call processor, the load balancing procedure to bias reassignment to the first call processor in response to the device being determined to be currently assigned to the first call processor. Such example methods further include, in response to receiving a second message associated with a second registration request for the device, causing the first call processor to de-register the device in response to determining that the second message is associated with a pending reassignment of the device from the first call processor to a second call processor included in the plurality of call processors. 1. A method to perform load balancing in a communication network , the method comprising:in response to receiving a first message associated with a first registration request for a user device, determining, via a logic circuit, whether the user device is currently assigned to a first call processor, the first registration request being associated with a reregistration of the user device when the user device is currently assigned to the first call processor;in response to receiving the first message, performing, via the logic circuit, a load balancing procedure to reassign the user device to one of a plurality of call processors including the first call processor, the load balancing procedure to bias reassignment to the first call processor in response to the user device being determined to be currently assigned to the first call processor; andin response to receiving a second message associated with a second registration request for the user device, causing the first call processor to de-register the user device in response to ...

Managing Utilization Of A Logical Communication Path In A Multi-Path Channel

A method of managing utilization of a logical communication path in a multi-path channel consisting of a plurality of logical communication paths overlying a plurality of physical connections connecting a first and a second node, including: for a non-ordered communication stream implementing a load-balancing communication mode to distributedly communicate messages of the non-ordered communication stream over the plurality of logical paths; and for an ordered communication stream implementing a designated logical path mode including designating a logical path of the multiple-path channel for communicating thereover messages of the ordered communication stream.

METHOD, APPARATUS, AND SYSTEM FOR SHARING NETWORK TRAFFIC

A method, a node, and a system for sharing network traffic are provided. In the method the node receives a flow label in a message sent by an upper-level node; the node adjusts the flow label, so that flow labels of adjacent intermediate nodes are different; and the node performs equal-cost path routing according to the adjusted flow label. 1. A method for sharing network traffic , comprising:receiving, in a node having a processor, a flow label in a message sent by an upper-level node;adjusting, by the node having the processor, the flow label, so that flow labels of adjacent intermediate nodes are different; andperforming, in the note having the processor, equal-cost path routing according to the adjusted flow label.2. The method according to claim 1 , wherein the adjusting the flow label is adjusting the flow label according to a preset rule.3. The method according to claim 1 , wherein the flow label in the message sent by the upper-level node comprises a label value field claim 1 , an experimental field claim 1 , a stack bottom identification field claim 1 , and a time to live field.4. The method according to claim 2 , wherein the flow label in the message sent by the upper-level node comprises a label value field claim 2 , an experimental field claim 2 , a stack bottom identification field claim 2 , and a time to live field.5. The method according to claim 2 , wherein the preset rule is determined according to an actual condition of network traffic or a specific setting of an operator claim 2 , comprising one of the following:performing an operation of a value of the flow label or a value of the label value field in the flow label modulo the total number of equal-cost routes; andtransposing positions of odd numbers and positions of even numbers of 20-bit data of the label value field in the flow label; andtransposing different values of 2 bits or more bits in 20-bit data of the label value field in the flow label; andtransposing positions of odd numbers and ...

Server-Side Load Balancing Using Parent-Child Link Aggregation Groups

Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the network node, a packet including a destination address of the packet; resolving the destination address of the packet to a first address of a first receiving node; identifying a second address of a second receiving node as being associated with the first address; and transmitting the packet to both the first address and the second address. 1. A method of routing packets in a communications network by a network node , the method comprising:receiving, at the network node, a packet including a destination address of the packet;resolving the destination address of the packet to a first address of a first receiving node;identifying a second address of a second receiving node as being associated with the first address; andtransmitting the packet to both the first address and the second address.2. The method of claim 1 , wherein:a third address of the second receiving node is additionally associated with the first address, andtransmitting the packet comprises transmitting the packet to both the first address and the second address and refraining from transmitting the packet to the third address.3. The method of claim 1 , further comprising identifying a third address of a third receiving node as being associated with the first address claim 1 ,wherein transmitting the packet comprises transmitting the packet the first address, the second address, and the third address.4. The method of claim 1 , wherein the first address belongs to a first link aggregation group (LAG) and the second address belongs to a second LAG.5. The method of claim 1 , wherein identifying the second address comprises:identifying a parent link aggregation group (PLAG) identified by the first address; andidentifying a child link aggregation group (CLAG) that belongs to the PLAG, wherein the second address belongs to the CLAG.6. The method of claim 5 , wherein identifying the ...

Computer system and management system therefor

A computer system in an embodiment of this invention comprises a plurality of host computers in which a plurality of host programs are executed, a plurality of storage systems including a plurality of volumes provided to the plurality of host programs, and a management system. Each of the plurality of host programs is located at a port of a host computer. Each of the plurality of volumes is located at a port of a storage system. The management system obtains information on bandwidths of a plurality of paths included in a data communication network among the plurality of storage systems and the plurality of host computers. The management system determines priority levels of individual candidate ports for new location of at least either one of a first host program and a first volume with reference to the information.

QUALITY OF SERVICE DETERMINATION BASED ON UPSTREAM CONTENT SOURCE

Systems and methods for providing trigger based dynamic changes to a packet flow in a communication network are described. The trigger based dynamic changes can include upgrading and downgrading quality of service (QoS), processing the packet flow, and providing services to the packet flow. These changes can be provided by inspecting packets at a gateway for trigger conditions and setting up a proxy instance for the packet flows. The proxy can coordinate QoS changes and management of packet flows. The triggers can be based on the destination of the packet, for example, the uniform resource locator (URL) and/or by the services (e.g., email, video, messaging) that the subscriber is accessing. The triggers can also be based on the identity of the user or agreements a provider might have with an operator of network equipment for users accessing the provider's website. 1. A gateway comprising:a processor operable to execute instructions;one or more interfaces for communicating with a plurality of mobile devices associated with respective mobile subscribers, and with a plurality of upstream destination content sources via a service provider's network, wherein the upstream destination content sources each have a different identity; anda non-transitory memory storing computer-readable instructions that, when executed by the processor, cause the processor to:receive packets in a session at the gateway at a first quality of service (QoS) level from a first upstream destination content source and intended for one of the mobile devices;inspect the packets to determine the identity of the first upstream destination content source;determine whether to provide a higher QoS level for the session based at least in part on the determined identity of the first upstream destination content source;based on the determined identity, modify the level of service for the session from the first QoS level to a higher QoS level for the first upstream destination content source; andcause the ...

Splitting a network traffic flow

Systems and methods for splitting a network traffic flow in a data network are described. A flow of traffic between a source node and a destination node in the data network is split into a set of data paths. A data path includes one or more data links between nodes in the data network. A submap of the data network that excludes at least one data link is used to determine the set of flow paths.

MULTIPLEXING APPARATUS AND DISCARD METHOD

An ATM multiplexing apparatus of the present invention is the apparatus for selectively performing cell discard processing in the case of congestion on the basis of a use state of the same connection formed by cells from the side of an ATM switching unit and subscribers without installing UPC units, and the ATM multiplexing apparatus, which is connected to the ATM switching unit and each of plural subscribers through ATM communication lines and performs multiplexing processing to ATM cells sent from the plural subscribers, comprises: detection means for detecting a level of a congestion state corresponding to the received ATM from the subscribers; and discard means ( and ) for selectively discarding the received ATM cells from the subscribers on the basis of a communication state determined by the received ATM cells from the ATM switching unit and the received ATM cells from the subscribers and a level value of a warning signal indicating the detected congestion state. 19-. (canceled)10. A device comprising: 'obtain information from data received by the device, a first portion of the data being received from a network device and a second portion of the data being received from a subscriber device,', 'one or more processors todetermine, based on the obtained information, a communication state associated with transmitting the data between the network device and the subscriber device,determine, based on receiving the data, a level of congestion associated with the data, andselectively discard data from the second portion of the data based on the communication state and the level of congestion.11. The device of claim 10 , where claim 10 , when obtaining the information claim 10 , the one or more processors are to:obtain the information from header portions of the received data.12. The device of claim 10 , where the one or more processors are further to:store the second portion of the data in a memory, and determine an amount of memory used to store the second portion of ...

ADAPTIVE LOAD BALANCING

Methods and systems for performing load balancing within an Ethernet network are provided. According to one embodiment, a set of virtual networks, into which a network has been logically divided that can be used by a first component is maintained. Each of the virtual networks is a loop-free switching path, reverse path learning network and provides a path through the network between the first component and a second component. A packet destined for the second component is received by the first component. On a packet-by-packet basis or on a per flow basis, the first component dynamically selects a particular path by selecting a virtual network for transporting the received packet that tends to balance traffic load across the virtual networks. The first component causes the received packet to be transported through the network to the second component via the particular path. 1. A computer-implemented method comprising:maintaining, within a virtual network storage of a first component of a plurality of components coupled in communication with a network, information regarding a set of virtual networks into which the network has been logically divided and that can be used by the first component to transport packets through the network, wherein each virtual network of the set of virtual networks comprises a loop-free switching path, reverse path learning network and wherein each virtual network of the set of virtual networks provides a path through the network between the first component and a second component of the plurality of components thereby collectively providing a plurality of paths through the network between the first component and the second component;receiving, by the first component, a packet destined for the second component;on a packet-by-packet basis or on a per flow basis, dynamically selecting, by the first component, a particular path of the plurality of paths by selecting a virtual network of the set of virtual networks for transporting the received ...

DYNAMIC LOAD BALANCING USING QUALITY/LOADING BANDS

Methods and apparatus for load balancing data traffic are disclosed. An example method includes determining a respective quality metric for each of a plurality of members of an aggregation group of the network device, each respective quality metric representing respective data traffic loading for each member of the plurality of aggregation group members. The example method also includes grouping the plurality of aggregation members into a plurality of loading/quality bands based on their respective quality metric. The example method further includes selecting members of the aggregation group for transmitting packets from a loading/quality band corresponding with members of the aggregation group having lower data traffic loading relative to other members of the aggregation group. 1. A method comprising:determining, by a network device, a respective quality metric for each of a plurality of members of an aggregation group of the network device, each respective quality metric representing respective data traffic loading for each member of the plurality of aggregation group members;grouping the plurality of aggregation members into a plurality of loading/quality bands based on their respective quality metric; andselecting members of the aggregation group for transmitting packets from a loading/quality band corresponding with members of the aggregation group having lower data traffic loading relative to other members of the aggregation group.2. The method of claim 1 , wherein each respective quality metric is based on at least one of port loading corresponding with each of the plurality of aggregate members and an amount of queued data corresponding with each of the plurality of aggregate members.3. The method claim 1 , wherein each respective quality metric is determined by combining a first quality metric corresponding with a respective port loading and a second quality metric corresponding with a respective amount of queued data.4. The method of claim 1 , wherein ...

ENHANCEMENT OF PATH QUALITY OF SERVICE IN MULTI-HOP PACKET COMMUNICATION NETWORKS

Techniques and systems for enhancing quality of service (QoS) in communication networks, including wired and wireless communication networks. Implementations of described techniques and systems can be used to provide path-based QoS with distributed per-hop scheduling for carrying traffic over a multi-hop packet communication network. 1. A method for enhancing quality of service (QoS) in a multi-hop communication network under a distributed scheduling , comprising:determining unused portions of per-hop QoS metric values in transmitting data in nodes of a multi-hop path;communicating information on unused portions of per-hop QoS metric values in transmitting data obtained at one node to the next downstream node along the multi-hop path; andallowing at least part of the unused portions of per-hop QoS metric values to be used by the next downstream node in data transmission to enhance QoS in the multi-hop path.2. The method as in claim 1 , comprising:providing an in-band signaling to the next downstream node that contains values of the unused portions of per-hop QoS metrics to communicate the information on the unused portions of per-hop QoS metric values.3. The method as in claim 1 , wherein:the per-hop QoS metrics are cumulative along the multi-hop path.4. The method as in claim 3 , wherein:the per-hop QoS metrics are delays incurred at nodes.5. The method as in claim 1 , comprising:after a data unit is scheduled for transmission, determining whether a unused portion of a per-hop QoS metric value associated with the data unit is equal to or exceeds a threshold; andcommunicating information on the unused portion of the per-hop QoS metric value to the next downstream node only when the unused portion of QoS metric value is equal to or exceeds the threshold.6. The method as in claim 5 , comprising:after determining that the unused portion of the per-hop QoS metric value associated with the data unit is equal to or exceeds the threshold, adding to the data unit an in-band ...

Multiple Media Fail-Over To Alternate Media

The present invention is a system and method for failing over from a current network access medium to an alternative network access medium. A customer premises equipment (CPE) box has ports for connections to a network through several network access media, such as high speed cable connections, DSL connections and dial-up connections. QoS parameters for each of the connections are monitored from a bandwidth manager remote from the CPE box. When it is determined that a fail-over would be beneficial, a message is sent from the bandwidth manager to the CPE box containing a command to fail-over and an identity of the alternate network access media. 1. A method for providing automatic fail-over service for premises equipment that is accessing a network via a first network access medium , the fail-over service providing fail-over from the first network access medium to a second network access medium , the method comprising:at a bandwidth manager, transmitting a first network ping through the network and through the first network access medium to the premises equipment;at the bandwidth manager, receiving from the premises equipment a response to the first network ping;determining a status of the first network access medium based on the response to the first network ping;at a bandwidth manager, transmitting a second network ping through the network and through the second network access medium to the premises equipment;at a bandwidth manager, receiving from the premises equipment a response to the second network ping;determining a status of the second network access medium based on the response to the second network ping; andbased on the status of the first and second network access media, transmitting a message to the premises equipment to change from accessing the network via the first network access medium to accessing the network via the second network access medium.2. The method of claim 1 , wherein the bandwidth manager is an application server connected through the ...

FLOW TEMPLATING IN LOGICAL L3 ROUTING

For a network controller for managing hosts in a network, a method for configuring a host to handle flow entries and template flow entries is described. The method generates a template flow entry to be populated in order to create a flow entry for a particular managed forwarding element. The method sends the template flow entry to the particular forwarding element in a host. The method configures a flow entry generating flow entry generating module in a host to create the flow entry by populating the template flow entry. The method configures the particular managed forwarding element to (1) send the template flow entry to the flow entry generating flow entry generating module (2) forward packets using the flow entry created by the flow entry generating flow entry generating module. 1. For a network controller for managing hosts in a network , a method for configuring a host to handle flow entries and template flow entries , the method comprising:generating a template flow entry to be populated in order to create a flow entry for a particular managed forwarding element;sending the template flow entry to the particular forwarding element in a host;configuring a flow entry generating flow entry generating module in a host to create the flow entry by populating the template flow entry; andconfiguring the particular managed forwarding element to (i) send the template flow entry to the flow entry generating flow entry generating module (ii) forward packets using the flow entry created by the flow entry generating flow entry generating module.2. The method of claim 1 , wherein the flow entry generating flow entry generating module and the particular managed forwarding elements are separate software applications configured in the host.3. The method of claim 1 , wherein the flow entry has a plurality of different fields to store different information claim 1 , wherein the template flow entry has the same plurality of different fields but at least one of the fields is missing ...

Dynamic Bandwidth Adjustment in Packet Transport Network

A method for adjusting bandwidth in a communications network having a plurality of nodes connected over multiple links with a plurality of services running on the links includes detecting an impairment of a link wherein the impairment invokes a reduction in bandwidth available to the services running on the link, communicating information about the impairment to other nodes in the network and redistributing services between the links to limit a bandwidth required by services running on the impaired link to a value not exceeding the bandwidth available on the impaired link. 1. A method for adjusting bandwidth in a communications network including a plurality of nodes connected over multiple links and having a plurality of services running on the links , the method comprising the steps of:detecting an impairment of a link, the impairment invoking a reduction in bandwidth available to the services running on the link;communicating information about the impairment to other nodes in the network; andredistributing services between the links to limit a bandwidth required by services running on the impaired link to a value not exceeding the bandwidth available on the impaired link.2. The method of claim 1 , wherein the redistribution of services comprises moving at least one service from the impaired link to another link.3. The method of claim 1 , wherein the redistribution of services comprises:exchanging services between the impaired link and at least one additional link.4. The method of claim 4 , wherein the exchanging of services comprises:routing a service from the impaired link to another link and routing a service from the other link to the impaired link.5. The method of claim 1 , further comprising:detecting a reduction in the link impairment, the reduction resulting in the impaired link regaining its original bandwidth; andreturning the redistributed services to their original paths.6. The method of claim 1 , further comprising:redistributing real-time services.7. ...

LOAD BALANCING IN A LOGICAL PIPELINE

A non-transitory machine readable medium storing a program that configures a managed forwarding element to perform logical L2 switching and L3 routing is described. The program generates a first set of flow entries for configuring the first managed forwarding element to perform (1) a first logical L2 processing for a first logical L2 domain, (2) a logical L3 processing, (3) a load balancing processing to select a second managed forwarding element from a plurality of managed forwarding elements to which to forward packets and (4) a logical ingress L2 processing for a second logical L2 domain on the packets. The program generates a second set of flow entries for configuring the second managed forwarding element to perform a second logical L2 processing for a second logical L2 domain on the packets. 1. A non-transitory machine readable medium storing a program which when executed by at least one processing unit configures a managed forwarding element to perform logical L2 switching and L3 routing , the program comprising sets of instructions for:generating a first set of flow entries for configuring the first managed forwarding element to perform (i) a first logical L2 processing for a first logical L2 domain, (ii) a logical L3 processing, (iii) a load balancing processing to select a second managed forwarding element from a plurality of managed forwarding elements to which to forward packets and (iv) a logical ingress L2 processing for a second logical L2 domain on the packets; andgenerating a second set of flow entries for configuring the second managed forwarding element to perform a second logical L2 processing for a second logical L2 domain on the packets.2. The machine readable medium of claim 1 , wherein the first set of flow entries is further for configuring the first managed forwarding element to perform a source network address translation (NAT) processing before performing the load balancing processing.3. The machine readable medium of claim 1 , wherein the ...

Logical l3 routing with dhcp

For a network controller for managing a set of hosts, a method for configuring a host to provide a Dynamic Host Configuration Protocol (DHCP) service is described. The method configures a DHCP module in a first host to provide a DHCP service. The method configures a managed forwarding element in the first host to ( 1 ) use the DHCP module to obtain network addresses and ( 2 ) forward packets using the obtained network addresses. The method configures a second managed forwarding element in a second host to ( 1 ) use the DHCP module to obtain network addresses and ( 2 ) forward packets using the obtained network addresses.

CONTENT SERVICE AGGREGATION SYSTEM

A network content service apparatus includes a set of compute elements adapted to perform a set of network services; and a switching fabric coupling compute elements in said set of compute elements. The set of network services includes firewall protection, Network Address Translation, Internet Protocol forwarding, bandwidth management, Secure Sockets Layer operations, Web caching, Web switching, and virtual private networking. Code operable on the compute elements enables the network services, and the compute elements are provided on blades which further include at least one input/output port. 1. A method comprising:receiving, with a flow control element of a data center, a plurality of packet flows from a network, wherein the data center includes a plurality of compute elements interconnected by a hardware switching fabric to communicate packet data between the compute elements, and wherein the set of compute elements is arranged in a plurality of processing pipelines to provide a set of network services;identifying, with the flow control element, each of the packet flows as being associated with a subscriber and determining a subset of one or more of the network services that are required to be applied to each of the packet flows based on the identified subscriber;selecting, with the flow control element and for each of the packet flows, one of the processing pipelines based on the subset of network services for the subscriber associated with the packet flow; anddistributing, with the flow control element, each of the plurality of packet flows to the compute elements in accordance with the processing pipeline selected for the packet flow to provide the subset of network services determined for the subscriber associated with the packet flow.2. The method of claim 1 , further comprising storing a forwarding table within the flow control element that defines the processing pipelines as a plurality of different routes through the compute elements claim 1 , the routes ...

PERFORMING RATE LIMITING WITHIN A NETWORK

Methods and systems for performing rate limiting are provided. According to one embodiment, information is maintained regarding a set of virtual networks into which a network has been logically divided. Each virtual network comprises a loop-free switching path, reverse path learning network and provides a path through the network between a first and second component thereby collectively providing multiple paths between the first and second components. Packets are received by the first component that are associated with a flow sent by a source component. The packets are forwarded by the first component to the second component along a particular path defined by the set of virtual networks. A congestion metric is determined for the particular path and based thereon it is determined whether a congestion threshold has been reached. Responsive to an affirmative determination, the source component is instructed to limit the rate at which the packets are sent. 1. A computer-implemented method comprising:maintaining, within a virtual network storage of a first component of a plurality of components coupled in communication with a network, information regarding a set of virtual networks into which the network has been logically divided and that can be used by the first component to transport packets through the network, wherein each virtual network of the set of virtual networks comprises a loop-free switching path, reverse path learning network and wherein each virtual network of the set of virtual networks provides a path through the network between the first component and a second component of the plurality of components thereby collectively providing a plurality of paths through the network between the first component and the second component;receiving, by the first component, one or more packets associated with a flow sent by a source component, wherein the source component is sending the one or more packets associated with the flow at a particular rate;forwarding, by ...

Web server constraint support

Techniques are disclosed for a web server to support constraints specified by a client. In one embodiment, the web server receives, from the client, a request for one or more blocks of data. The request includes one or more constraints provided by the client. The web server may perform an action responsive to an increase in network congestion, based on the one or more constraints. Accordingly, the web server may handle the request in a manner that more closely meets the needs of the client.

FLEXIBLE AND SCALABLE DATA LINK LAYER FLOW CONTROL FOR NETWORK FABRICS

A network fabric may divide a physical connection into a plurality of VLANs as defined by IEEE 802.1Q. Moreover, many network fabrics use Priority Flow Control to identify and segregate network traffic based on different traffic classes or priorities. Current routing protocols define only eight traffic classes. In contrast, a network fabric may contain thousands of unique VLANs. When network congestion occurs, network devices (e.g., switches, bridges, routers, servers, etc.) can negotiate to pause the network traffic associated with one of the different traffic classes. Pausing the data packets associated with a single traffic class may also stop the data packets associated with thousands of VLANs. The embodiments disclosed herein permit a network fabric to individually pause VLANs rather than entire traffic classes. 1. A method for pausing network traffic , comprising:upon determining to suspend traffic flow through a virtual local area network (VLAN), generating, by operation of one or more computer processors, a data frame comprising a VLAN ID that specifies the VLAN, the data frame configured to instruct a computing device to stop transmitting data packets assigned to the VLAN; andtransmitting the data frame to the computing device.2. The method of claim 1 , wherein the VLAN is configured based on at least one of:IEEE 802.1Q and a derivative of IEEE 802.1Q.3. The method of claim 1 , wherein the VLAN is a service VLAN (S-VLAN) and the VLAN ID is an S-VLAN ID.4. The method of claim 3 , wherein the data frame further comprises a customer VLAN ID that is associated with a customer VLAN that is assigned to the S-VLAN.5. The method of claim 3 , wherein the S-VLAN is configured based on at least one of:IEEE 802.1QinQ and a derivative of IEEE 802.1QinQ.6. The method of claim 1 , wherein the data frame further comprises a priority enable value that selects a traffic class as defined by IEEE 802.1bb.7. The method of claim 1 , wherein the data frame further comprises a ...

METHOD AND APPARATUS FOR SCHEDULING COMMUNICATION TRAFFIC IN ATCA-BASED EQUIPMENT

A method for scheduling communication traffic in an Advanced Telecom Computing Architecture based equipment and a corresponding apparatus are provided. In the method, communication traffic information of traffic processing means in the equipment is collected; based on the collected communication traffic information, a traffic distribution rule for the traffic processing means in next time period is generated; and based on the generated traffic distribution rule, incoming communication traffic of the equipment is scheduled. The method of the invention considers the quality of service and contracted capacity of the whole equipment and the dynamic processing capability and running environment of the traffic processing means, and can balance the loads of the respective traffic processing means in the equipment with asymmetric multi-application configuration well by adaptively adjusting the distribution of the communication traffic, to guarantee the quality of service of the whole equipment. 1. A method for scheduling communication traffic in an Advanced Telecom Computing Architecture based equipment , wherein the equipment includes at least a traffic processing means , said method comprising:collecting communication traffic information of the traffic processing means;generating a traffic distribution rule for the traffic processing means in next time period based on the collected communication traffic information; andscheduling incoming communication traffic of the equipment based on the generated traffic distribution rule.2. The method according to claim 1 , wherein the step of collecting communication traffic information of the traffic processing means comprises:measuring incoming traffic and dropped traffic on the traffic processing means.3. The method according to claim 2 , wherein the step of generating a traffic distribution rule for the traffic processing means in next time period based on the collected communication traffic information comprises: for each ...

SYSTEM AND METHOD OF ADAPTIVE CONGESTION MANAGEMENT

A system and method for adaptive congestion management uses measurements of usage of each edge network segment both per-customer and for each edge network segment as a whole. The technique then processes these measurements to determine what changes to make to allowed transfer rates to alleviate congestion. Adaptive congestion management also uses these measurements to determine when to remove any restrictions on transfer rates in the case that the edge network segment is no longer congested. 1. A method for adaptive congestion management comprising:determining when data usage on an edge network segment crosses a first threshold of data usage; andadjusting a data transfer rate for one or more customers on said edge network segment by an amount predetermined for said one or more customers when said data usage crosses the first threshold of data usage.2. The method of claim 1 , further comprising:gathering periodic measurements of data on said edge network segment;determining when said data usage crosses the first threshold of data usage based on said periodic measurements.3. The method of claim 2 , further comprising:determining a customer profile for the one or more customers; andadjusting the data transfer rate for the one or more customers based on the customer profile.4. The method of claim 3 , further comprising:determining the customer profile for the one or more customers based on per-customer measurements.5. The method of claim 3 , wherein adjusting the data rate comprises:restricting the data transfer rate for the one or more customers when the data usage on said edge segment crosses the first threshold from a congested rate to congested an uncongested rate.6. The method of claim 3 , wherein adjusting the data rate comprises:removing a restriction of the data transfer rate for the one or more customers when the data usage on said edge network segment crosses a second threshold from an uncongested rate to a congested rate.7. The method of claim 1 , further ...

Apparatus, system, and method for asymmetrical and dynamic routing

An asymmetrical and dynamic routing system (ADRS) is provided to enable the dynamic adjustment of the bandwidth capacity of two or more network devices exchanging data. The two or more network devices monitor their current bandwidth demand between themselves and others in a network and a first network device can transmit bandwidth request to a second network device when the first network device reaches transmission bandwidth capacity. Each network device is further configured with additional transmit and receive ports and can be selectively enabled in response to a bandwidth request from other network devices. Each network device is further configured to generate control signals that are sent to optical mirrors to re-direct data signals to or from the one or more enabled additional transmit and receive ports.

COMPUTER SYSTEM AND COMMUNICATION METHOD IN COMPUTER SYSTEM

A computer system of the present invention includes a controller which sets a flow entry to each of a plurality of switches before a packet is forwarded from a plurality of nodes, and each of switches which transfers a reception packet which contains a destination address defined in the flow entry, to a destination node defined in the flow entry regardless of a transmission source address of the reception packet. 1. A computer system comprising:a controller;a plurality of switches, each of which performs a relay operation which is defined in a flow entry set by said controller, to a packet conforming to the flow entry; anda plurality of nodes which communicate through any of said plurality of switches,wherein said controller sets a destination address as a rule of the flow entry and sets transfer processing to a destination node as an action of the flow entry, andwherein each of said plurality of switches transfers the packet containing the destination address, to said destination node based on the flow entry set to said switch, regardless of a transmission source address of the packet.2. The computer system according to claim 1 , wherein said controller sets the flow entry to each of said plurality of switches before the packet is transferred between said plurality of nodes.3. The computer system according to claim 1 , wherein said controller acquires a first MAC (Media Access Control) address of a first node of said plurality of nodes in response to a first ARP (Address Resolution Protocol) request from said first node claim 1 , and sets the first MAC address to each of said plurality of switches as the rule of the flow entry.4. The computer system according to claim 3 , wherein said controller transmits to the first node claim 3 , an ARP reply having a MAC address of another node of said plurality of nodes as a transmission source as a reply to the first ARP request from said first node to said another node.5. The computer system according to claim 2 , wherein ...

Scalable network apparatus for content based switching or validation acceleration

A network apparatus is provided that may include one or more security accelerators. The network apparatus also includes a plurality of network units cascaded together. According to one embodiment, the plurality of network units comprise a plurality of content based message directors, each to route or direct received messages to one of a plurality of application servers based upon the application data in the message. According to another embodiment, the plurality of network units comprise a plurality of validation accelerators, each validation accelerator to validate at least a portion of a message before outputting the message.

Network Self-Protection

A device used in a network is disclosed. The device includes a network monitor to monitor a network state and to collect statistics for flows going through the network, a flow aggregation unit to aggregate flows into clusters and identify flows that can cause a network problem, and an adaptive control unit to adaptively regulate the identified flow according to network feedback. Other methods and systems also are disclosed. 1. A device used in a network , the device comprising:a network monitor to monitor a network state and to collect statistics for flows going through the network;a flow aggregation unit to aggregate flows into clusters and identify flows that can cause a network problem; andan adaptive control unit to adaptively regulate the identified flow according to network feedback.2. The device as in claim 1 ,{'sup': −', '−', '−, 'sub': 1', '2', 'k, 'wherein the flow aggregation unit defines score S(P)=(max(F)−m(F))/m(F), where a set partition P={F, F, . . . , F}, and m is a low median operator,'}{'sub': 'P', 'finds aggregation that reveals an overloading behavior P*=maxS(P), and'}defines a set of reasonable aggregation rules.3. The device as in claim 2 , wherein the set of aggregation rules are obtained from a past experience or an operator specification.4. The device as in claim 2 , wherein the set of aggregation rules include at least one of:ingress or egress for end-to-end flooding,a source subnet for a compromised virtual machine (VM),a destination subnet for flash crowd to a specific VM,a destination port for attack against a specific service,a list of switches or routers on a path for routing misconfiguration,a start time range for a correlated data transfer,a packet arrival frequency threshold for new traffic load,a duration threshold for a short or failed connection attempt, anda burstiness threshold for buggy customized Transmission Control Protocol (TCP).5. The device as in claim 2 ,wherein at least one of the aggregation rules requires a ...

Method Of Simple And Efficient Failure Resilient Load Balancing

A resilient load balancing method uses fixed paths and a fixed path-splitting strategy to enable ingress routers to efficiently reroute traffic after a failure. An off-line management system computes a set of fixed paths and a set of splitting ratios for routing demand from ingress routers to egress routers, with sufficient capacity to meet demands under each failure scenario. That data is then used by the ingress router to reroute demand after observing a failure. 1. A method for balancing load in a network after failure of a link , the network comprising a plurality of interconnected vertices and edges and a set of traffic demands , each demand defining a flow requirement from an ingress router to an egress router , the network further comprising a set of failure states , the method comprising:at the ingress router, routing traffic by automatically balancing traffic load over a predefined set of paths from the ingress router to the egress router according to a set of splitting ratios, each splitting ratio defining a fraction of the demands to be transmitted over a path of the predefined set of paths in a case of a detectable failure state corresponding to a subset of a modeled set of the failure states, the modeled set of the failure states being states that cause at least one path of the predefined set of paths to fail, the modeled set of the failure states including a no-failure state in which the network has no failures, each modeled failure state having a predetermined probability of occurrence; andin an off-line management system, pre-computing the predefined paths and the splitting ratios, wherein pre-computing the splitting ratios further comprises solving a linear program having an objective function defining congestion over the modeled set of the failure states, the objective function including a factor comprising a sum of weights for each of the modeled set of the failure states to emphasize common failure states.2. The method of claim 1 , wherein the ...

Network traffic distribution

A switch for a switching network includes a plurality of ports for communicating data traffic and a switch controller that controls switching between the plurality of ports. The switch controller selects a forwarding path for the data traffic based on at least topological congestion information for the switching network. In a preferred embodiment, the topological congestion information includes sFlow topological congestion information and the switch controller includes an sFlow client that receives the sFlow topological congestion information from an sFlow controller in the switching network.

MULTI-CLASS DATA TRANSPORT

Methods and apparatus for controlling the forwarding of a flow () of data units across a network from a sender node () to a receiver node () via at least one intermediate node (), the data units each having one of a plurality of different types of class indication associated therewith, each type of class indication providing, to an intermediate node currently processing the data unit with which the class indication is associated, an indication denoting a particular class of treatment, selected from a plurality of different classes of treatment, according to which the data unit is to be processed by that intermediate node, such that different proportions of the data units of the flow are forwarded as different sub-flows each comprising data units having class indications of different types thereby providing indications denoting different classes of treatment. 1) A method for controlling the forwarding of a flow of data units across a network from a sender node to a receiver node via at least one intermediate node , said data units each having one of a plurality of different types of class indication associated therewith , each type of class indication providing , to an intermediate node currently processing the data unit with which said class indication is associated , an indication denoting a particular class of treatment , selected from a plurality of different classes of treatment , according to which said data unit is to be processed by said intermediate node , a first proportion of the data units of said flow being forwarded as a first sub-flow comprising one or more data units each having a class indication of a first type thereby providing an indication denoting a first class of treatment; said method comprising:obtaining a measure of a predetermined dynamic flow characteristic indicative of progress of said flow;determining, in dependence on said measure of said flow characteristic and on a predetermined threshold level for said flow characteristic indicative ...

Method and system of congestion control in a mobile virtual network

An approach is provided for dynamic congestion control among mobile virtual routers. A determination is made whether a congested segment of a network of a plurality of physical routers. A temporary congestion point is created at a mobile virtual router to divert traffic away from the congested segment using logical tunnels over non-congested physical links, wherein the mobile virtual router is configured to utilize resources of at least two of the physical routers.

Systems And Methods For Automatically Selecting A Communication Channel

In one embodiment, automatically selecting a local communication channel for downloading a block of data via a network includes downloading portions of the block of data using first and second communication channels, determining a bottleneck exists on one of the local communication channels or on a component upstream from the channels, in response to determining the bottleneck exists on one of the local communication channels, selecting the communication channel that has the lowest energy cost and a download speed that meets a minimum threshold, and in response to determining the bottleneck exists upstream from the local communication channels, selecting the local communication channel having the lowest energy cost. 1. A method for automatically selecting a local communication channel for downloading a block of data via a network , the method comprising:downloading portions of the block of data using first and second local communication channels;determining a bottleneck exists on either one of the local communication channels or on a component upstream from the channels;in response to determining the bottleneck exists on one of the local communication channels, selecting the local communication channel having the lowest energy cost and a download speed that meets a minimum threshold; andin response to determining the bottleneck exists upstream from the local communication channels, selecting the local communication channel having the lowest energy cost.2. The method of claim 1 , wherein determining the bottleneck exists comprises determining data transfer rates for the local communication channels.3. The method of claim 2 , further comprising computing for the local communication channels a transfer time to complete downloading the block of data.4. The method of claim 3 , further comprising computing for the local communication channels an energy cost to complete downloading the block of data.5. The method of claim 4 , further comprising computing an energy cost to ...

TECHNIQUE FOR OBTAINING, VIA A FIRST NODE, INFORMATION RELATING TO PATH CONGESTION

A method for obtaining, by a first node, information relating to a congestion on a path allowing the routing of packets from said first node destined for a second node in a packet communications network, said congestion potentially degrading said routing. 1. A method for obtaining , by a first node , information relating to a congestion on a path allowing the routing of packets from said first node destined for a second node in a packet communications network , said congestion potentially degrading said routing , said method for obtaining information comprising the following steps implemented by the second node:a step for receiving a first packet originating from the first node and destined for the second node, routed via at least a third node, said first packet being provided for triggering the sending of a control message in a control plane in which the first and second nodes exchange control messages;a step for processing said first packet in the control plane, following which transmission of the control message destined for the first node is requested;a step for obtaining said information from the first packet received; anda step for sending a second packet to the first node, said second packet carrying said control message and comprising said information obtained.2. The method for obtaining information as claimed in claim 1 , wherein the first and second nodes implementing a differentiated routing of the packets depending on classes of service claim 1 , the first packet received comprises information relating to a given class of service and said information obtained relates to a congestion affecting at least said class of service.3. The method for obtaining information as claimed in claim 1 , wherein the control message sent corresponds to a reply message to another control message received in the first packet.4. The method for obtaining information as claimed in claim 3 , wherein said other control message is an echo request transmitted from the first node to ...

COMMUNICATION SYSTEM, CONTROL APPARATUS, PACKET FORWARDING PATH CONTROL METHOD, AND PROGRAM

A communication system includes: a plurality of data forwarding nodes each including a packet processing unit processing an incoming packet in accordance with a packet handling operation in which a process to be applied to a packet and a matching rule for specifying a packet to which the process is applied are associated with each other; and a control apparatus capable of using at least two logical network topologies each obtained by applying a different path calculation policy to a physical network topology formed by the plurality of data forwarding nodes, selecting a logical network topology determined per data traffic and determining a packet forwarding path, and setting a packet handling operation realizing the packet forwarding path in data forwarding nodes on the packet forwarding path. 1. A communication system , comprising:a plurality of data forwarding nodes each comprising a packet processing unit processing an incoming packet in accordance with a processing rule (packet handling operation) in which a process to be applied to a packet and a matching rule for specifying a packet to which the process is applied are associated with each other; anda control apparatus capable of using at least two logical network topologies each obtained by applying a different path calculation policy to a physical network topology formed by the plurality of data forwarding nodes, selecting a logical network topology determined per data traffic and determining a packet forwarding path, and setting a processing rule (packet handling operation) realizing the packet forwarding path in data forwarding nodes on the packet forwarding path.2. The communication system according to ;wherein the path calculation policy is configured by weight information set in links or nodes in the physical network topology.3. The communication system according to ;wherein the control apparatus comprises a path calculation policy determination unit changing the path calculation policy based on ...

Method and system for propagating statistics between federated contact center sites for use in event distribution

A routing system includes a router, a statistics server (Stat Server) coupled to the router, receiving, processing and storing statistics related to event handling, and providing information regarding the statistics for use by routing intelligence in the router, and a first proxy data server coupled to the Stat Server and to a second proxy data server at a remote contact center over a network. The system is characterized in that the Stat Server receives event statistics regarding the local queue, and through the coupled first and second proxy data servers, event statistics regarding the remote queue, provides information related to the statistics to the router, and the router determines to route incoming events to local queue or to the remote queue based on the information provided.

SYSTEM AND METHODS FOR DISTRIBUTED QUALITY OF SERVICE ENFORCEMENT

A grid router for routing data over a grid sessionwise, involves multiple devices forwarding data according to sessions over an unreliable network between the devices. The devices include a first group of mailbox units to handle the sessions and a second group of egress units to forward session data to devices external to the network. The mailbox units and egress units are connected in a CLOS network such that each mailbox unit is accessible by each egress unit. The router further includes a distributed entity, which assigning specific sessions to specific mailbox units and to specific egress units and further defomes quality of service (QoS) levels for each session in the presence of congestion in either the network or the devices. 1. A grid router for routing data over a grid sessionwise , comprising:a plurality of devices forwarding data according to sessions over an unreliable network between said devices, said devices comprising a first multiplicity of mailbox units to handle said sessions and a second multiplicity of egress units to forward said session data to devices external to said network, said mailbox units and said egress units being connected in a CLOS network such that each mailbox unit is accessible by each egress unit; anda distributed entity, configured for assigning specific sessions to specific mailbox units and to specific egress units and further for providing quality of service (QoS) levels defined for each said session in the presence of congestion in one of: said network and said devices.2. The grid router of wherein said devices comprise transport units to transport said data across a link from said mailbox units to said egress units with acknowledgement claim 1 , and wherein said entity for providing comprises a congestion determiner in each said mailbox unit to determine congestion of said network from information from said transport units.3. The grid router according to wherein said congestion determiner comprises an interrogator to ...

METHOD AND EDGING DEVICE FOR CREATING FORWARDING TABLE, FORWARDING MESSAGE AND OBTAINING ADDRESS

The present invention provides a method and an edging device for creating the forwarding table, forwarding the message and obtaining the address, and the method for creating the forwarding table includes: the network provider edge (NPE) receives the label distribution protocol (LDP) message which carries the backbone media access control (MAC) address of the destination user facing-provider edge (UPE) and the load sharing negotiation parameter between the destination UPE and the NPE or the LDP message carries the created extend MAC address according to the backbone MAC address and the load sharing negotiation parameter; the NPE obtains multiple extend MAC addresses of the destination UPE according to the LDP message; the forwarding table is created for each extend MAC address respectively, and the forwarding table includes the extend MAC address and the corresponding multiple output ports. 1. A method for creating a forwarding table , applied in a PBB over H-VPLS network comprising a source user facing-provider edge (UPE) , a network provider edge (NPE) and a destination user facing-provider edge (UPE) , load sharing links being between the NPE and the destination UPE , wherein the method comprises:receiving, by the NPE, a label distribution protocol (LDP) message, the LDP message carrying a backbone MAC address of the destination UPE and a load sharing negotiation parameter between the destination UPE and the NPE or the LDP message carrying an extended MAC address created according to the backbone MAC address and the load sharing negotiation parameter;obtaining, by the NPE, a plurality of extended MAC addresses of the destination UPE according to the LDP message; andcreating a forwarding table for each extended MAC address, the forwarding table comprising the extended MAC address and a plurality of corresponding output ports.2. The method for creating a forwarding table according to claim 1 , wherein the load sharing negotiation parameter comprises the number of ...

SYSTEM AND METHODS FOR IDENTIFYING AND REMEDYING TRAFFIC IMBALANCES AND INEQUITIES BETWEEN NETWORKS

Implementations described and claimed herein provide a system and methods for balancing network loads across distinct provider networks. In one implementation, a virtual network representative of at least a first provider network is established having at least one interconnection point where network traffic is exchanged between the first provider network and a second provider network and having at least one provider edge port and at least one potential interconnection point. A measurement of a bandwidth between the at least one provider edge port and the at least one interconnection point is obtained. A measurement of a distance between the at least one provider edge port and a geographically closest of the at least one potential interconnection point or the at least one interconnection point is obtained. A network load indication for the first provider network as a function of the bandwidth measurement and the distance measurement is obtained. 1. A method comprising:establishing a virtual network representative of at least a first provider network, the virtual network with at least one interconnection point where network traffic is exchanged between the first provider network and a second provider network, the virtual network with at least one provider edge port where the first provider network connects to a third party network, the virtual network with at least one potential interconnection point where the first provider network may be configured to exchange traffic with the second provider network;obtaining a measurement of a bandwidth between the at least one provider edge port and the at least one interconnection point;obtaining a measurement of a distance between the at least one provider edge port and a geographically closest point, the geographically closest point being the closest in geographical distance to the at least one provider edge port of either the at least one potential interconnection point or an assigned interconnection point;obtaining a network ...

Dynamically Balancing Resources In A Server Farm

Dynamically balancing resources in a server farm, where the server farm includes servers organized in functional server groups with the servers in each functional server group assigned a same type of data processing task, the servers operatively coupled to data storage through a packet switching fabric, the servers operatively coupled to a system management server, and the balancing of resources includes: monitoring, by a resource balancing module of the system management server, CPU utilization in at least one of the functional server groups; identifying, by the resource balancing module in dependence upon the monitored CPU utilization, an overburdened functional server group, the overburdened functional server group's CPU utilization exceeding a CPU overburden threshold; and increasing, by the resource balancing module, CPU resources of the overburdened functional server group, including moving a transfer server from a source functional server group into the overburdened functional server group. 120-. (canceled)21. A method of dynamically balancing data processing resources in a server farm , the server farm comprising a plurality of servers organized in functional server groups with the servers in each functional server group assigned a same type of data processing task , the servers operatively coupled to data storage through a packet switching fabric , the servers operatively coupled to a system management server , the method comprising:monitoring, by a resource balancing module of the system management server, CPU utilization in at least one of the functional server groups;identifying, by the resource balancing module in dependence upon the monitored CPU utilization, an overburdened functional server group, the overburdened functional server group's CPU utilization exceeding a CPU overburden threshold; andincreasing, by the resource balancing module, CPU resources of the overburdened functional server group, including moving a transfer server from a source ...

Reliability as an Interdomain Service

A system and techniques are disclosed that increase the redundancy (i.e., physical diversity and bandwidth) available to an IP network, thereby increasing the failure processing capability of IP networks. The techniques include pooling the resources of multiple networks together for mutual backup purposes to improve network reliability and employing methods to efficiently utilize both the intradomain and the interdomain redundancies provided by networks at low cost. 1. A controller to provide network reliability , the controller comprising:a processing device; and extracting a plurality of inter-domain bypass paths between a first intra-domain portion and a second intra-domain portion in a first network via a second network;', 'determining an inter-domain bypass path from the plurality of inter-domain bypass paths to link the first intra-domain portion and the second intra-domain portion in the first network via the second network in response to an intra-domain connectivity failure between the first intra-domain portion and second intra-domain portion; and', 'establishing an intra-domain label switched path in the second network and a tunnel from the first intra-domain portion in the first network to the intra-domain label switched path in the second network, the intra-domain label switched path and the tunnel being associated with the inter-domain bypass path., 'a memory device to store instructions that, when executed by the processing device, cause the processing device to perform operations comprising2. The controller of claim 1 , wherein the operations further comprise routing data packets between the first intra-domain portion and second intra-domain portion in the first network via the inter-domain bypass path using the tunnel to route packets from the first network to the second network and the intra-domain label switched path to route the packets in the second network.3. The controller of claim 1 , wherein the inter-domain bypass path links the first intra- ...

Reducing interarrival delays in network traffic

The disclosed embodiments provide a system that facilitates use of a network link. During operation, the system continuously monitors an interarrival delay of packets received from a sender over the network link. Next, the system adjusts a receive window for the sender based on the interarrival delay to facilitate receipt of subsequent packets from the sender and other senders over the network link.

Apparatus & method

A method of controlling data packet congestion in a data packet network comprises determining a reference flow condition that results in data packet congestion at a node of a data packet network, and identifying a data packet flow having a flow condition substantially equal to the reference flow condition. For such an identified data packet flow the following actions are taken causing a data packet to be dropped from the identified data packet flow, allowing a predetermined number of data packets from the identified data packet flow to proceed, and dropping data packets from the identified data packet flow subsequent to the predetermined number of data packets, until the packets that were not dropped have been delivered to the egress ports of the network.

Apparatus and method for managing contents cache considering network cost

Provided is a content cache managing method and apparatus, and more particularly, a method and an apparatus for managing a content cache by considering network cost in a network. A content cache managing method of transmission equipment that forwards a content data packet may include calculating a cache replacement factor value by using network cost that is incurred in a network path from the transmission equipment to an original content server storing original content data, based on the content data packet that the content data packet is received from neighboring transmission equipment, and managing a cache in the transmission equipment based on the calculated cache replacement factor value or a state of cache in the transmission equipment to store the content data packet.

SWITCH DEVICE, INFORMATION PROCESSING APPARATUS, AND METHOD OF CONTROLLING SWITCHING DEVICE

A switch device includes a relay unit relaying communication data when information processing units included in an information processing apparatus perform communications with external devices; an address learning unit registering ports receiving the communication data in association with addresses indicating transmission sources of the communication data; and a band control unit controlling a bandwidth to be allocated to the communications by setting a first port and a second port of the ports to belong to a same group and by setting the first port and the second port to belong to different groups based on a number of addresses registered by the address learning unit in association with each of the ports. 1. A switch device comprising:a relay unit configured to relay communication data when information processing units included in an information processing apparatus perform communications with external devices;an address learning unit configured to register ports receiving the communication data in association with addresses indicating transmission sources of the communication data; anda band control unit configured to control a bandwidth to be allocated to the communications by setting a first port and a second port of the ports to belong to a same group and by setting the first port and the second port to belong to different groups based on a number of addresses registered by the address learning unit in association with each of the ports.2. The switch device according to claim 1 ,wherein the information processing apparatus includes a first number of the information processing units,wherein the first port is allocated to a second number of the information processing units among the first number of the information processing units,wherein the band control unit is configured to, when an address number indicating a number of the addresses per information processing unit corresponding to the first port exceeds a predetermined threshold value, set the first port and ...

Apparatus and method for providing a congestion measurement in a network

Example embodiments of a system and method for providing a congestion measurement in a network are disclosed. In an example embodiment information is received at an information transfer rate, from a source network device. A sample of the information may be taken before the information is transmitted to a destination network device. In an example embodiment, a congestion measurement value is computed that corresponds to the sample and represented with at least two bits. A multi-bit indicator of the congestion measurement value is then transmitted to control the information transfer rate of information arriving in the future.

Method and system for power control based on data flow awareness in a packet network switch

Certain aspects of a method and system for a power control based on application awareness in a packet network switch are provided. Data communication flow may be monitored in ports in a packet network switch based on packet classification. Ports where data flow is not detected may have at least some functionality disabled to reduce power consumption. In this regard, a power saving mode may be utilized for disabling at least some functionality in a switch port, such as Ethernet ports, for example. A partially disabled port may be fully enabled when monitoring detects active data communication flow in that port. Port functionality may be enabled or disabled sequentially, for example. In some instances, a physical layer portion of the packet network switch may be utilized to adjust power in a port based on the data communication flow.

DEADLOCK PREVENTION IN DIRECT NETWORKS OF ARBITRARY TOPOLOGY

Aspects of the invention pertain to routing packets in a computer system while avoiding deadlock. A turn rule is set according to unique identifiers associated with switches in the system. Numeric values of switches in possible turns are compared to determine whether a turn is permissible. The rule applies to all nodes in the system. The rule may be violated when using virtual channels. Here, a violation is permissible when using monotonically increasing virtual channel numbers or monotonically decreasing virtual channel numbers. Alternatively, the violations of the turn rule may be allowed if they force a packet to change to a later virtual channel in some fixed ordering of virtual channels. Deadlock can thus be avoided in many different types of architectures, including mesh, torus, butterfly and flattened butterfly configurations. 1. A method of routing packets in a computer network to avoid deadlock , the method comprising:setting a turn rule for routing packets across the computer network, the turn rule prohibiting sending packets from a first switch (A) to a second switch (C) via an intermediate switch (B) given a value of a distinct identifier of the intermediate switch B in relation to values of distinct identifiers of both first switch A and second switch C; andproviding the turn rule to each of the first switch A, second switch C and intermediate switch B for routing the packets across the computer network according to the turn rule.2. The method of claim 1 , wherein one or more of the first switch A claim 1 , second switch C and intermediate switch B are configured for adaptive routing.3. The method of claim 1 , wherein one or more of the first switch A claim 1 , second switch C and intermediate switch B maintain multiple routing tables.4. The method of claim 1 , wherein the distinct identifier of each switch is a hash of a hardware identifier of that respective switch.5. The method of claim 1 , wherein the method further comprises:supporting a plurality ...

COMMUNICATION RELAY DEVICE, COMMUNICATION RELAY SYSTEM, AND METHOD OF CONTROLLING COMMUNICATION RELAY DEVICE

A CPU load monitoring unit monitors a load of a server that receives and processes data. An ARP table chance instructing unit instructs a second information processing device, which transmits data in which an IP address of the server is designated as a transmission destination toward a MAC address associated with the designated IP address, to associate an IP address oil the server with a MAC address of a communication relay device when the load of the server is a threshold value or more. A data relay unit receives data in which the IP address of the server is designated as the transmission destination from a client A transmission rate adjusting unit transmits the data received by the data relay unit to the server at a predetermined transmission rate. 1. A communication relay device , comprising:a load monitoring unit that monitors a load of a first information processing device that receives and processes data;a correspondence instructing unit that instructs second information processing device, which transmits data in which an IP address of the first information processing device is designated as a transmission destination toward a MAC address associated with the designated IP address, to associate an IP address of the first information processing device with a MAC address of the communication relay device when the load of the first information processing device is a threshold value or more;a data receiving unit that receives the data in which the IP address of the first information processing device is designated as the transmission destination from the second information processing device; anda transmitting unit that transmits the data received by the data receiving unit to the first information processing device at a predetermined transmission rate.2. The communication relay device according to claim 1 ,wherein the correspondence instructing unit changes correspondence between an IP address and a MAC address by updating an ARP table of the second information ...

Method And Apparatus For Sharing TCAP Traffic Load

The present invention relates to a point code emulation apparatus and method for dividing a Common Channel Signaling System No. 7 (or SS7) signaling network into two or more networks. The point code emulator is adapted to receive TCAP messages from two or more subnets and converts, for the messages crossing over the subnets, the information of the TCAP messages, including originating point code, destination point code, and transaction identifier, (and optionally, calling party number and called party number), and forwards to the other one of the two or more subnets. Correspondence among the two or more subnets may be provisioned by an authorized user of the system, may be learned automatically by the system based on ISUP message correspondences or previous TCAP transactions, or may be automatically discovered by the system broadcasting messages to nodes in the destined one of the two or more subnets. 1. A Signaling System No. 7 (SS7) node for sharing transaction capabilities application part (TCAP) traffic load from a SS7 subnet with one or more nodes in another SS7 subnet , comprising:a first interface for said SS7 subnet;a second interface for said another SS7 subnet;a processor in communication with said first and second interfaces and with one or more structured data storages, wherein said processor carries out a process of sharing said TCAP traffic load from said SS7 subnet with one or more nodes in said another SS7 subnet, said process comprising said steps of:receiving a TCAP message from said SS7 subnet through said first interface;extracting originating point code (OPC), destination point code (DPC) and transaction identifier (TID) of said TCAP message;looking up and retrieving, from one or more structured database storages, a corresponding OPC, a corresponding DPC and a corresponding TID for one of said one or more nodes in said another SS7 subnet partially or combinedly based on said OPC, said DPC and said TID of said received TCAP message; andreplacing ...

Scalable Virtual Appliance Cloud (SVAC) and Methods Usable in an SVAC

According to one embodiment, a method for providing scalable virtual appliance cloud (SVAC) services includes receiving incoming data traffic having multiple packets directed toward a SVAC using at least one switching distributed line card (DLC), determining that a packet satisfies a condition of an access control list (ACL), designating a destination port to send the packet based on the condition of the ACL being satisfied, fragmenting the packet into cells, wherein the designated destination port is stored in a cell header of the cells, sending the cells to the destination port via at least one switch fabric controller (SFC), receiving the cells at a fabric interface of an appliance DLC, reassembling the cells into a second packet, performing one or more services on the second packet using the appliance DLC, and sending the second packet to its intended port.

NETWORK ASSESSMENT AND SHORT - TERM PLANNING PROCEDURE

A method for relieving network node congestion includes determining an average of an aggregated load on a network node that routes network traffic, projecting a demand on the network node based on extrapolating the average of the aggregated load to a future period, determining a current level of congestion on the network node, and projecting a future level of congestion on the network node based on the projected demand and the current level of congestion. An available capacity of other network nodes in a portion of the communication network that includes the network node is determined, as well as whether the projected future level of congestion on the network node can be relieved using the determined available capacity of the other network nodes. 120-. (canceled)21. A method for relieving network node congestion , comprising:determining, using a processor of a tangible computer, an average of an aggregated load on a network node that routes network traffic using historical data for a period of time for the network node;projecting a demand on the network node based on extrapolating the average of the aggregated load to a future period of time for which the demand is projected;determining a current level of congestion on the network node;projecting a future level of congestion on the network node based on the projected demand and the current level of congestion;determining an available capacity of other network nodes in a portion of the communication network that includes the network node; anddetermining whether the projected future level of congestion on the network node can be relieved using the determined available capacity of the other network nodes;wherein the communication network is reconfigurable to relieve the projected future level of congestion when the projected future level of congestion can be relieved.22. The method according to claim 21 , in which determining the average of the aggregated load on the network node comprises:determining an interval ...

Scalable Virtual Appliance Cloud (SVAC) and Devices Usable in an SVAC

According to one embodiment, a system includes a scalable virtual appliance cloud (SVAC) comprising: at least one distributed line card (DLC); at least one switch fabric coupler (SFC) in communication with the at least one DLC; and at least one controller in communication with the at least one DLC, wherein one or more of the at least one DLC is an appliance DLC, wherein one or more of the at least one SFC is a central SFC, and wherein the SVAC appears to a device external of the SVAC as a single appliance device applying various services to a traffic flow.

CLIENT LOAD DISTRIBUTION

Systems and methods for providing an efficient partitioned resource server. In one embodiment, the partitioned resource server comprises a plurality of individual servers, and the individual servers appear to be equivalent to a client. Each of the individual servers may include a routing table that includes a reference for each resource that is maintained on the partitioned resource server. Requests from a client are processed as a function of the routing table to route the request to the individual server that maintains or has control over the resource of interest. 1. A system for managing a set of connections between a plurality of clients and a plurality of storage servers based on system load , comprising:a plurality of storage servers having a set of resources partitioned thereon, such that for any one of the resources a first portion of said resource is located on one of the storage servers and a second portion of said resource is located on a different storage server of the plurality of storage servers;at least two load monitor processes coupled for communication with each other across the plurality of storage servers and generating a measure of system load and a measure of client load on each of the plurality of storage servers; anda storage service process responsive to results generated by the load monitor processes and maintaining at least one volume of storage partitioned across the plurality of storage servers wherein repartitioning the set of connections distributes the client load across the plurality of storage servers.2. A system as claimed in further comprising:a client distribution process responsive to the generated measure of system load and repartitioning the set of client connections for distributing client load.3. A system as claimed in claim 1 , further comprising:a load distribution process for determining resource loads when moving client connections among storage servers.4. A system as claimed in claim 1 , further comprising:a client ...