УЗЛОВОЕ УСТРОЙСТВО И ПРОГРАММА

Изобретение относится к области маршрутизации в сети передачи данных. Технический результат заключается в снижении нагрузки на сеть. Сущность изобретения заключается в том, что узловое устройство и программа для простых структур автономно выбирают соответствующий маршрут, не создавая нагрузку на сеть. В узловом устройстве в сети связи таблица управления FID хранит FID для уникальной идентификации кадра и информацию об узле адресата кадра, а таблица весов хранит информацию о весах для другого узла как адресата для ретрансляции кадра каждому конечному узлу адресата кадра. Когда переданный местному узлу кадр принимается и если FID принятого кадра хранится в таблице управления FID, данные об узле адресата, связанные с FID, обновляются. Если FID кадра, принятого от устройства приема кадра, не хранится в таблице управления FID, ссылаются к таблице управления FID, соответствующей узлу адресата кадра, и другой узел определяется в качестве адресата для ретрансляции кадра. 4 н. и 8 з.п. ф-лы, 23 ...

СПОСОБ УПРАВЛЕНИЯ ТАБЛИЦЕЙ ПОТОКА И СООТВЕТСТВУЮЩИЕ УСТРОЙСТВО И СИСТЕМА

Изобретение относится к технологиям сетевой связи. Технический результат заключается в повышении скорости передачи данных. Способ управления таблицей потока, содержащий этапы, на которых: генерируют, с помощью программно-определенного сетевого контроллера, первую запись таблицы потока, при этом первый набор полей в первой записи таблицы потока переносит индекс фактического значения вместо самого фактического значения в первом наборе полей, причем первый набор полей включает в себя N полей, где N – положительное целое число; и передают, с помощью программно-определенного сетевого контроллера, сообщение протокола OpenFlow в коммутатор OpenFlow, причем сообщение протокола OpenFlow переносит первую запись таблицы потока. 6 н. и 12 з.п. ф-лы, 18 ил.

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

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

СПОСОБ ДЛЯ ПРЕДОСТАВЛЕНИЯ СЛУЖБЫ ИМЕН ВНУТРИ ПРОМЫШЛЕННОЙ СИСТЕМЫ АВТОМАТИЗАЦИИ И УСТРОЙСТВО СВЯЗИ

Группа изобретений относится к технологиям предоставления службы имен. Техническим результатом является расширение арсенала технических средств по предоставлению службы имен внутри промышленной системы автоматизации. Предложен способ для предоставления службы имен внутри промышленной системы автоматизации. В предложенном способе, устройства связи промышленной системы автоматизации посредством компонента службы имен проверяют, ассоциировано ли с соответствующим устройством связи имя устройства с топологической и/или иерархической составной частью имени, которая по существу полностью обозначает пространственное или иерархическое расположение соответствующего устройства связи. При положительном результате проверки устройства связи обращаются с их ассоциированными именами устройств как с полными именами устройств. При отрицательном результате проверки устройства связи самостоятельно генерируют их полные имена устройств из распространенных посредством сообщений с оповещениями маршрутизатора ...

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

Изобретение относится к технологиям сетевой связи. Технический результат заключается в повышении скорости передачи данных. В способе обнаруживают, что следующий транзитный участок маршрута к хосту, на который ориентирован маршрут подсети, становится неверным; когда следующий транзитный участок маршрута к хосту становится неверным, то формируют и направляют инструкцию на удаление для удаления следующего транзитного участка маршрута к хосту; перехватывают инструкцию на удаление и преобразовывают инструкцию на удаление в первую инструкцию на обновление для модификации следующего транзитного участка маршрута к хосту; и обновляют выход следующего транзитного участка маршрута к хосту в центральном процессоре (CPU) оборудования для направления сообщений согласно первой инструкции на обновление. 2 н. и 16 з.п. ф-лы, 3 ил.

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

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

УСТОЙЧИВОЕ ПРИКРЕПЛЕНИЕ К СЕТЯМ, ПОДДЕРЖИВАЮЩИМ ТЕХНОЛОГИЮ МЕЖСЕТЕВОГО СОПРЯЖЕНИЯ ПО ПРОТОКОЛУ МАРШРУТИЗАЦИИ ПО СОСТОЯНИЮ КАНАЛА СВЯЗИ ПОСТАВЩИКА (PLSB)

Изобретение относится к средствам для взаимодействия между клиентской системой в первом сетевом домене и доменом сети, поддерживающей технологию межсетевого сопряжения по протоколу маршрутизации по состоянию канала связи поставщика (PLSB). Технический результат заключается в повышении устойчивости соединения с доменом сети. Предоставляют, по меньшей мере, два пограничных моста опорной сети (BEB) домена PLSB. Каждый BEB является конечной точкой соединения в первом сетевом домене с клиентской системой и конечной точкой, по меньшей мере, одноадресного пути, определенного в пределах домена PLSB. Межузловой транковый канал предоставляют в домене PLSB для взаимного соединения, по меньшей мере, двух BEB. Фантомный узел определяют в домене PLSB. Фантомный узел имеет уникальный адрес в домене PLSB и абстрактно расположен на межузловом транковом канале в одном скачке от каждого BEB. Каждый BEB конфигурируют таким образом, что входящий пакет, принятый с клиентской системы через соединение в первом ...

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

Изобретение относится к беспроводной связи, в частности к различным методикам для множественных регистрации и мобильности на основе потоков в сетях беспроводной связи. Техническим результатом является расширение функциональных возможностей маршрутизации потоков в беспроводных сетях связи. Описываются системы и способы, которые способствуют множественным регистрациям и мобильности на основе потоков в сети беспроводной связи. Компонент маршрутизации потоков может быть включен в мобильное устройство, домашний агент/р-шлюз или сервер функции правил политики и тарификации, который определяет, каким образом маршрутизировать один или более IP-потоков через набор точек доступа к сети. Компонент маршрутизации потоков может определять маршрутизацию на основе набора политик и/или сетевых данных, например требований к качеству обслуживания, требований к полосе пропускания, перегрузки сети, активных IP-потоков в настоящее время и так далее. 5 н. и 29 з.п. ф-лы, 14 ил.

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

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

ИНФРАСТРУКТУРНАЯ СЕТЬ

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

Способ организации работы компонентов сетевого оборудования для обработки сетевых пакетов (4 варианта)

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

СПОСОБ ОПРЕДЕЛЕНИЯ МАРШРУТА И СООТВЕТСТВУЮЩИЕ УСТРОЙСТВО И СИСТЕМА

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

УСТРОЙСТВО УПРАВЛЕНИЯ, СИСТЕМА СВЯЗИ, СПОСОБ УПРАВЛЕНИЯ УЗЛОМ И ПРОГРАММА

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

ОПРЕДЕЛЕНИЕ И КОНФИГУРИРОВАНИЕ ПУТИ ПЕРЕДАЧИ ДАННЫХ В СЕТИ

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

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

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

ВЫБОР МАРШРУТА В БЕСПРОВОДНЫХ СЕТЯХ

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

СПОСОБ И СИСТЕМА РЕАЛИЗАЦИИ ДОСТИЖИМОСТИ МАРШРУТА К ХОСТУ В КОЛЬЦЕ ДОСТУПА СЕТИ ПЕРЕДАЧИ ПАКЕТОВ

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

СПОСОБ ВОССТАНОВЛЕНИЯ СВЯЗИ ПРИ ОТКАЗЕ КАНАЛА СВЯЗИ И СПОСОБ ПЕРЕДАЧИ ТРАФИКА (ВАРИАНТЫ)

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

СПОСОБ ДЛЯ ПРЕДОСТАВЛЕНИЯ СЛУЖБЫ ИМЕН ВНУТРИ ПРОМЫШЛЕННОЙ СИСТЕМЫ АВТОМАТИЗАЦИИ И УСТРОЙСТВО СВЯЗИ

Система и способ защиты автоматизированных систем при помощи шлюза

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

СПОСОБ И СИСТЕМА ДЛЯ ПОДДЕРЖКИ ОПЕРАЦИЙ ПО ПРОТОКОЛУ УПРАВЛЕНИЯ РАСПРЕДЕЛЕННЫМ РЕТРАНСЛЯТОРОМ (DRCP) ПРИ СБОЕ СВЯЗИ

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

SDN-КОНТРОЛЛЕР, СИСТЕМА ЦЕНТРА ОБРАБОТКИ ДАННЫХ И СПОСОБ МАРШРУТИЗИРУЕМОГО СОЕДИНЕНИЯ

ИНФРАСТРУКТУРНАЯ СЕТЬ

СИНХРОНИЗАЦИЯ LDP И IGP ДЛЯ ШИРОКОВЕЩАТЕЛЬНЫХ СЕТЕЙ

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

Technologien zur Durchführung einer Orchestrierung mit Online-Analyse von Telemetriedaten

Technologien zur Durchführung einer Orchestrierung mit Online-Analyse von Telemetriedaten umfassen einen Orchestrator-Server zum Zuweisen von Arbeitslasten an jeden aus einer Gruppe verwalteter Knoten, Empfangen von Telemetriedaten, die eine Ressourcennutzung anzeigen, von den verwalteten Knoten, wenn die Arbeitslasten ausgeführt werden, Erzeugen einer Datenanalyse in Abhängigkeit von den Telemetriedaten, wenn die Arbeitslasten ausgeführt werden, Bestimmen von Anpassungen der Arbeitslastzuweisungen in Abhängigkeit von der Datenanalyse, wenn die Arbeitslasten ausgeführt werden, um die Ressourcennutzung unter den verwalteten Knoten zu erhöhen, und Anwenden der bestimmten Anpassungen auf die verwalteten Knoten, wenn die Arbeitslasten ausgeführt werden. Außerdem werden andere Ausführungsformen beschrieben und beansprucht.

Technologien zum Verwalten der Zuweisung von Beschleunigerressourcen

Technologien zum dynamischen Verwalten der Zuweisung von Beschleunigerressourcen enthalten einen Orchestrator-Server. Der Orchestrator-Server hat die Aufgabe, einem verwalteten Knoten eine Arbeitslast zur Ausführung zuweisen, einen vorhergesagten Bedarf für eine oder mehrere Beschleunigerressourcen zu bestimmen, um die Ausführung eines oder mehrerer Jobs innerhalb der Arbeitslast zu beschleunigen, vor dem vorhergesagten Bedarf eine oder mehrere Beschleunigerressourcen bereitzustellen, um den einen oder die mehreren Jobs zu beschleunigen, und dem verwalteten Knoten die eine oder die mehreren bereitgestellten Beschleunigerressourcen zuzuweisen, um die Ausführung des einen oder der mehreren Jobs zu beschleunigen. Andere Ausführungsformen werden ebenfalls beschrieben und beansprucht.

Verfahren zur Bereitstellung von Informationen für die Lokalisierung von Fehlern in einem Kommunikationsnetzwerk eines Gerätes, entsprechend ausgelegte Busteilnehmerstation sowie Fahrzeug

Die Erfindung betrifft ein Verfahren zur Bereitstellung von Informationen für die Lokalisierung von Fehlern in einem Kommunikationsnetzwerk eines Gerätes (10), bei dem die Daten über einen oder mehrere serielle Kommunikationsbusse (102, 104, 106) zwischen zwei oder mehr Busteilnehmerstationen (121, 124) übertragen werden. Es erfolgt in einer Busteilnehmerstation (121, 124) die Durchführung von Überprüfungsmaßnahmen, um einen Kommunikationsfehler einer Nachricht von einer anderen Busteilnehmerstation (124, 121) zu erkennen, wobei bei Erkennen des Kommunikationsfehlers der Nachricht von dieser Busteilnehmerstation (121, 124) ein Fehlerbericht in einem Fehlerspeicher (EM) der Busteilnehmerstation eingetragen wird. Das Verfahren kennzeichnet sich dadurch aus, dass in den Fehlerbericht eine Angabe über wenigstens den vermeintlichen Sender (Tx_ID) und/oder den vermeintlichen Empfänger (Rx_ID) der vom Kommunikationsfehler betroffenen Nachricht eingefügt wird.

VERFAHREN ZUR STEUERUNG DER LEITWEGLENKUNG IN EINEM PAKETVERMITTLUNGSNETZWERK.

Grundursachenkorrelation in verbindungslosen Netzen

Routing-Information-Erzeugungsvorrichtung, Routing-Information-Erzeugungsverfahren und Routing-Information-Erzeugungsprogramm

Netzwerkverbindungsabschnitte 102 und 103 einer eigenen Station liefern eine Routing-Information, die von einem Relaisabschnitt 101 auf derselben Basis gemeldet worden ist, an Netzwerkverbindungsabschnitte anderer Stationen eigener Netzwerke 104 und 105. Wenn eine neue Routing-Information in einer von den Netzwerkverbindungsabschnitten der anderen Stationen empfangenen Routing-Information vorhanden ist, melden die Netzwerkverbindungsabschnitte 102 und 103 der eigenen Station die Routing-Information an den Relaisabschnitt 101 auf derselben Basis. Der Relaisabschnitt 101 aktualisiert eine von dem Relaisabschnitt 101 gehaltene Routing-Information auf Grundlage der Routing-Information, die von den Netzwerkverbindungsabschnitten 102 und 103 auf derselben Basis gemeldet worden ist.

Netzwerkeinheiten zur Verwendung in und Organisation von Kaskaden-systemen

Verfahren zur Erzeugung eines Netzes

The invention concerns a method of producing a network, in particular a telecommunication, water supply, remote heat supply or electric network, the network connecting all consumers (3) to a main distributor node (7) as a function of the locally existing or predeterminable requirements and demands (4) of the individual consumers (3). The method is characterized by the following steps: I) generating of a graph (G) consisting of edges (14) and nodes (15), the graph (G) including all technically possible and/or predeterminable connection paths (5) of the network, and the lengths and directions of the edges (14) resulting from the actual topography of the road sections and predeterminable network line paths (5) of the region (1) to be supplied by means of the network, and the nodes (15) being the points of intersection between the edges (14), streets and/or network line paths (5); (II) allocating of consumers (3) to the graph (G) such that each consumer (3) is connected by an additional consumer ...

ROUTERS UND VERFAHREN FÜR OPTIMALE LEITWEGTABELLENKOMPRIMIERUNG

Sichere Bearbeitung von Verbindungseinstellungen eines eingebetteten Modems durch Kommunikation über Kurznachrichtenübermittlungsdienst

Ein Fahrzeug kann mindestens eine Steuerung umfassen, die konfiguriert ist, einen Kommunikationskanal über ein Netz zwischen einem Fahrzeug und einem Fahrzeug-Dienstserver durch einen Zugangspunktknoten aufrecht zu erhalten. Die mindestens eine Steuerung kann ferner konfiguriert sein, über das Netz außerhalb des Bandes vom Kommunikationskanal eine Aktualisierungsnachricht zu empfangen, welche aktualisierte Kommunikationskanal-Verbindungsinformationen umfasst, und den Kommunikationskanal bei Empfang der Nachricht gemäß den aktualisierten Verbindungsinformationen erneut verbindet. Ein sicherer Server kann konfiguriert sein, die Aktualisierungsnachricht, die mindestens eine von aktualisierten Zugangspunktknoteninformationen und aktualisierten Adressinformationen spezifiziert, zu erzeugen, die Aktualisierungsnachricht gemäß einem Chiffrierungsschlüssel, der mit einem Fahrzeugziel geteilt wird, zu verschlüsseln und die Aktualisierungsnachricht über ein Netz außerhalb des Bandes vom Kommunikationskanals ...

Verfahren, Vorrichtung und Computerprogramm um Topologiedaten eines Link State Routing Netzwerkes aktuell zu halten

Mechanismus und Verfahren zur Bestimmung und schnellen Wiederherstellung einer minimalen Kapazität in einem vermaschten Netz

System und Verfahren zur Optimierung eines Leitweges in einem drahtlosen Netzprotokoll für Internet

Ein adaptiver Pfad-Erkennungs-Prozess zum Routen von Datenpaketen in einem Mehrknotennetzwerk

Hochgeschwindigkeitsverteilung von Fehlerinformation in vermaschten Netzwerken

Verfahren zur Überprüfung von neuen bereitgestellten Kundennetzroutenanzeigen

Systeme zur Ableitung der Netzwerktopologie und Pfadmetrik in Wide-Area-Netzwerken

System, das Folgendes umfasst:Mehrere Monitore für die Netzwerkmaßzahlen, die so konfiguriert sind, dass sie: Messungen einer oder mehrerer Netzwerkmaßzahlen vornehmen, und Angaben zur Bewertung des Netzwerks auf der Basis der erhaltenen Messungen an einen Netzwerkanalysator in einem ersten Netzwerk übertragen, wobei die Angaben zur Bewertung des Netzwerks Werte für Eigenschaften eines oder mehrerer Netzwerkpfade von dem jeweiligen Netzwerkmaßzahlenmonitor an einen Knoten in einem zweiten Netzwerk angeben, wobei sich mindestens einer der Monitore für die Netzwerkmaßzahlen in einem Netzwerk außerhalb des ersten Netzwerks befindet; Der Netzwerkanalysator ist so konfiguriert, dass er: die Angaben zur Bewertung des Netzwerks von den Monitoren für die Netzwerkmaßzahlen empfängt, und die empfangenen Angaben zur Bewertung des Netzwerks aggregiert; Ein Netzwerk-Controller für das erste Netzwerk, der so konfiguriert ist, dass er:auf der Basis der aggregierten Informationen eine von mehreren möglichen ...

VIRTUELLE NETZWERKE

VIRTUELLE NETZWERKE

Verfahren, System und Pfadberechnungselement zum Verarbeiten verteilter Pfadberechnungsanfragen

Verfahren und Einrichtung zur adaptiven Bandbreitenverwendung in einem digitalen Netzwerk

VERFAHREN UND VORRICHTUNG ZUR ENDKNOTEN-GESTÜTZTEN NEIGHBOR-ERKENNUNG

Method and apparatus for routing and forwarding between virtual routers within a single network element

Method and apparatus for routing and forwarding between virtual routers within a single network element

Cross layer routing (XRP) protocol

Network data congestion management system

Method and dedicated frame buffer for receiving frames

Method and process for routing and node addressing in wireless mesh networks

Method and apparatus for system network installation using hybrid wired wireless connections

Method and apparatus for longest match address lookup

We present a method and apparatus for increasing the depth of a lookup table. The lookup table includes at least two lookup units. A search request for a final result value corresponding to the key is issued to each of the lookup units in parallel. Each of the lookup units performs a multi-level search in parallel for the final result value. The final result value stored in only one of the lookup units is provided by one of the lookup units.

Method and apparatus for discovering topology information in a network

Efficient path setup in a provider backbone bridge network

Multichannel mesh network,multichannel mesh router and methods for routing using bottleneck channel identifiers

Nodes of a multichannel mesh network generate channel-metric matrices for routing packets to destinations based on a bottleneck channel identified for the source- destination pair. The identification of bottleneck channels increases the diversity among the different communication channels used along a route. This link-state routing approach may allow better paths to be found.

Multichannel mesh router and methods for path selection in a multichannel mesh network

A wireless mesh network router comprises at least one transceiver to receive a packet over a wireless communication channel and path selection circuitry. The packet identifies a source node and a destination node in a multichannel mesh network. The path selection circuitry combines a channel-metric matrix associated with the packet's source node and a channel-metric matrix associated with the packet's destination node to determine a bottleneck channel for the source-destination pair. The next-hop node and associated transmission channel may be selected from the destination node matrix based on the bottleneck channel.

Switching communications between different networks based on device capabilities

Methods and systems provided herein allow a communication session to be established on an optimal communication network and subsequently transferred to alternative networks if conditions dictate that such a change is necessary or desirable. The types of conditions which may be considered when identifying the optimal communication network or the alternative network include conditions related to the operation of a user device, communication profiles of the user, resources available on other networks, and the like.

Switching communications between different networks based on device capabilities

CAMERA-BASED FACIAL RECOGNITION AS A METHOD OF EFFECTING TELECOM DEVICE ALERTING

A camera can be associated with each conference participant endpoint. The camera, either frame or video-based, can monitor and detect one or more of gestures, facial recognition, emotions, and movements of the conference participant. Based on the detection of one or more of these triggering events, a correlation to an action corresponding the triggering event can be evoked. For example, if a participant raises their hand, e.g., a triggering event, the system can recognize that this is a request to speak. The participant can then be queued in the system based, for example, relative to other participants' requests. When the other participants have finished speaking, and it is the time for the user who raised their hand to speak, the system can optionally queue the user by modifying the endpoint with which they are associated.

Identifying an egress port of a device

A computer implemented method is performed to identify an egress port of a networked device from which a hypothetical packet would be sent. A monitor computer connected to the network sends a query message to a source device (fig. 2a), the message including an address identifying the device, a query key formulated on the basis of a destination identifier, and an instruction to return a result message identifying an egress port from which packets addressed to the destination identifier would be sent. If the result message does not identify an egress port, at least one subsequent query message is autonomously generated until the egress port is identified. The subsequent messages may involve using a different device address or a different query key. Once the egress port is identified, a device connected to that port is identified and a query message is sent to the next device and the process repeated (figs 2b, 2c). In this way direct computation of a network path can be achieved (fig. 4).

Processing capacity management

Communication system and method

A communication system and method is disclosed for facilitating connection by a user to a selected one or more of multiple ISP's, thereby alleviating problems associated with providing a fixed link to a single ISP. Advantages may include ease of switching between ISP's and the system may enable a virtual ISP to be created having characteristics more suited to a user's need than the individual ISP's.

Processing network topology data

Network topology data or data indicating a topology of a network, is analyzed and refined by merging portions of the data and removing false data from the network topology data. For example, network topology data is processed by evaluating interface data 102, deleting erroneous data 104 from the network topology data based on the evaluating, and merging data 106 in the network topology data based on the evaluating.

Efficient path setup in a provider backbone bridge network

In a provider backbone - traffic engineering network, a method and a bridge node are provided for setting up path between edge bridges connected to customer premises. A first edge bridge advertises towards peer edge bridges a tuple comprising a port identity and a layer two address. When it needs to set up a path towards the first edge bridge, one of the peer edge bridges uses information in the tuple to compute a path label.

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.

Mesh relay

Auto-configuration of a mesh relay's TX/RX schedule

A mesh network consists of wireless nodes which are each capable of relaying packets to their intended destination. Flood routing may be used to propagate the packets from source to destination via multiple hops. This implies that each device continuously listens for signals from other nodes within the network, which increases power consumption. To reduce power consumption, a wireless node detects the number of wireless nodes nearby which are also able to relay packets and adjusts its power consumption accordingly. For instance, if a large number of relay nodes is detected, the wireless node will conserve power by adjusting its listening schedule (e.g. increasing the time between each listening period), and vice versa. Alternatively, the wireless node may save power by reducing a receive range if a large number of nodes is detected. This may also reduce loading on a network due to less duplicate packets being relayed concurrently.

Intelligent connection management

Method and process for routing and node addressing in wireless mesh networks

Distributed network connection policy management

Spanning tree protocol

Data routing

Traffic flow optimisation system

Network

Communications network node

Method and system for analyzing the topology of a multiprotocol label switching(MPLS) virtual private network (VPN) network

Topology control system and control method for dynamic network

A topology control system includes a sensing module, a data processing module, a data judgment module, a communication module and a central module. The sensing module collects data of surrounding nodes and transmits it to the data processing module for caching. The data processing module selects a cluster head of the current node according to the data in the cache and then transmits it to the data judgment module. The data judgment module checks the rationality of the cluster head and if the selection is reasonable feeds back the result to the data processing module. The communication module monitors the data sent by the data processing module and is responsible for wireless transmission of cluster head information to the central module. The central module collects the data of all nodes in the network and transmits the results to a client. It can be used for topology control of an ad-hoc network composed of fast-moving vehicles such as automobiles, ships, unmanned aerial vehicles (UAV).

Method of operation of multi-station network.

The invention provides a method of operating a communication network. The network comprises numerous stations, each of which can transmit and receive data in order to transmit messages from originating stations to destination stations opportunistically via intermediate stations. Each station selects one of a number of possible calling channels to transmit probe signals to other stations. The probe signals contain data identifying the station in question and include details of its connectivity to other stations. Other stations receiving the probe signals respond directly or indirectly, thereby indicating both to the probing station and other stations their availability as destination or intermediate stations. The probing station evaluates the direct or indirect responses to identify other stations with which it can communicate optimally. For example, the stations may monitor the cumulative power required to reach another station, thereby defining a power gradient to other stations, with ...

Method of operation of a multi-station network

Method of operation of a multi-station network

COEXISTENCE OF STATIC AND DYNAMIC IP MULTICAST

HIGH-SPEED DISTRIBUTION OF ERROR INFORMATION IN MESHED NETWORKS

DISSOLVE FROM VIRTUAL NETWORK NAMES

PROCEDURE AND DEVICE FOR THE END NODE-SUPPORTED NEIGHBOR RECOGNITION

COMMUNICATION SYSTEM AND - DEVICE

PROCEDURE AND NETWORK MANAGEMENT SYSTEM FOR THE DETERMINATION OF A COMMUNICATIONS NETWORK TOPOLOGY

PROCEDURE AND SSYSTEM FOR THE NETWORK TOPOLOGY ACTUALIZATION USING A TOPOLOGIEPERTURBATION

SENSOR NETWORK

COMMUNICATION PROCEDURE AND - SYSTEM WITH PARTIAL DESIGNATE TRANSITION LIST (DTL: DESIGNATED TRANSIT CUNNING)

LOCATION OF A DIRECTION, AN ACYCLIC GRAPH AND A DISTRIBUTION OF NET PREFIX INFORMATION REGARDING A CLUSTER HEAD IN A MOBILE ADHOC NET

EXTENDED DATA TRANSFER MINUTES FOR A MULTI-STATION NET

PACKAGE FORWARDING TO AN CONNECTINGORIENTED NETWORK

PROCEDURE, DEVICE AND SYSTEM FOR RINGSCHUTZ

PROCEDURE FOR THE ROUTING OF DATA TRAFFIC IN A NETWORK

Border Gateway Protocol Extended Community Attribute for Layer-2 and Layer-3 Virtual Private Networks

Described are a network, computer program product, and method of distributing routing information for a virtual private network (VPN) application through a packet-switched network (PSN) having fully meshed provider edge (PE) routers through Provider Backbone Bridge (PBB) tunnels. A PE router is configured to participate in a VPN and to run a BGP (Border Gateway Protocol) as an auto-discovery process for finding one or more other PE routers participating in the VPN. The VPN is associated with a PBB tunnel. A service instance identifier (I-SID) is assigned to the VPN. The PE router advertises membership in the VPN by including the I-SID assigned to the VPN in a BGP message issued during the auto-discovery process.

Communications network

A node for a communications network, the node comprising a plurality of ports and a processor. The processor configured to determine that a first status change signal, indicative of a topology status change in the network, has been received, and the processor configured to decide from at least an origin of the first status change signal to output a second status change signal to only a subset of possible destination nodes.

Hybrid Learning Component for Link State Routing Protocols

In a network that executes a link state routing protocol, a network node receives periodic disseminations of link state information from other network nodes. The link state information includes neighboring node identity and link cost metrics. The network node calculates the initial routing paths based on the received link state information by using a link state routing algorithm. It then adapts the calculated path based on both the current link state information and past link state information through a reinforcement learning process. The network node then selects a routing path to each destination node based on the adaptation and updates the routing table accordingly.

Data frame routing method and network bridge

A method operates at the data link level. Each bridge associates, during a guard time, the port through which a frame is first received with a source MAC address until a unicast reply frame confirms the matching two-way path between the source and destination addresses. Any frame from the same source received through another different port is discarded. Each bridge forwards the received broadcast frames through the rest of the ports, except those involving prohibited (down-up) turns, and deviates (or optionally returns) the unicast frames with an unknown or aged destination address through the spanning tree. The protocol can operate with encapsulation in the border bridges or without encapsulation, using in this case the replacement of universal MAC addresses in the border bridges with local MAC addresses. The establishment and control of paths can optionally be performed proactively by the border bridges, especially the bridges connected to servers.

Scalable multiprotocol label switching (mpls) based networks

Example scalable multiprotocol label switching (MPLS) based networks, and methods, apparatus and articles of manufacture to implement the same are disclosed. A disclosed example method includes determining at an area border router (ABR) an OSPF metric representing a cost associated with transporting data between a provider edge router (PER) and the ABR within a non-zero OSPF area, replacing at the ABR a first MPLS label included in a BGP message received from the PER with a second MPLS label associated with the PER and assigned by the ABR, replacing at the ABR a next-hop attribute included in the BGP message with a value representing a loopback address of the ABR, updating at the ABR a route cost attribute included in the BGP message to include the OSPF metric, and re-advertising from the ABR the modified BGP message into an OSPF area 0.

Fast flooding based fast convergence to recover from network failures

A router detects a network failure and responsive to that failure, floods a fast failure notification message out a set of interfaces of the router. The fast failure notification message includes information that identifies the network failure and includes as its source MAC (Media Access Control) address a MAC address that is assigned to an interface that is coupled with the detected network failure and is not part of the set of interfaces of the router. The router updates a routing table to reflect the network failure. The flooding of the fast failure notification message is performed prior to completion of the routing table update to reflect the network failure.

Method for Inheriting Attribute of Forwarding Adjacency in Multilayer Network and Corresponding Multilayer Network

The present invention provides a method for inheriting an attribute of a FA in a multilayer network, which comprises: returning information of a first attribute of each link on a FA LSP in a path computation reply message to an upper layer head node, and initiating connection setup; a head node on the FA LSP constructing the first attribute of this FA according to information of the first attribute of each link on the FA LSP included in a path message sent from a upstream node and storing the first attribute of this FA, and sending information of the first attribute of this FA to a downstream node; and c) the tail node on the FA LSP obtaining information of the first attribute of this FA and storing the first attribute of this FA. The present invention also provides a multilayer network.

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.

Node apparatus, storage medium and frame transmitting method

When stored identifying information of a transmission target frame and identifying information of a received frame are equal, a node apparatus updates transmission feasibility information stored in association with the final destination of the received frame. The transmission feasibility information indicates feasibility of transmission to each of a plurality of adjacent node apparatuses being a transmission destination, and is updated so that feasibility of transmission to the transmission destination associated with the identifying information of the received frame indicates that “the transmission is infeasible”. The node apparatus transmits the received frame, when there is no adjacent apparatus to which transmission is feasible, and when the stored identifying information of the transmission target frame is equal to the identifying information of the received frame, to the adjacent node apparatus recognized as the origin in association with the identifying information of the received frame.

Method and system for caching regular expression results

A method and system for efficiently processing regular expressions associated with new BGP packets uses the caches results of prior processing of regular expressions associated with a prior matching BGP packet within the same epoch.

Methods and apparatus to dynamically control connectivity within virtual private networks

Methods and apparatus to dynamically control connectivity within VPNs are disclosed. A disclosed example route server to control connectivity within a VPN comprises a memory to implement a database, a border gateway protocol (BGP) engine to process BGP advertisements, a network interface to receive a first BGP advertisement, which a first route target (RT) associated with the first PE router, from a first provider edge (PE) router associated with the VPN, and an intra-VPN connectivity controller to, in response to the first BGP advertisement, query the database to determine whether the first PE router is to be communicatively coupled to a second PE router of the VPN and when the first and second PE routers of the VPN are to be communicatively coupled, direct the BGP engine to form a second BGP advertisement that includes a second RT associated with the second PE router based on the first BGP advertisement.

Restarting Network Reachability Protocol Sessions Based on Transport Layer Authentication

In an embodiment, a method comprises establishing a first data communications session with a first router. In response to receiving a first request to establish a second data communications session, a probe message that is configured to test whether the first data communications session or the first router is responsive is sent to the first router. In response to determining that the first router has not acknowledged the probe message before a probe timer has expired, and receiving a second request to establish the second data communications session, the second data communications session with the first router is established and a state for the first data communications session is deleted.

Gmpls based oam provisioning

A method and network are described herein for provisioning Operations, Administration, and Maintenance (OAM) entities for a connection when setting-up the connection between an ingress edge node and an egress edge node.

Ldp igp synchronization for broadcast networks

A network element that has a broadcast interface to a broadcast network becoming operational determines whether at least one alternate path exists to the broadcast network. The broadcast interface is to carry traffic on a label switched path. If an alternate path exists, the broadcast interface will not be advertised to the broadcast network until label distribution protocol (LDP) is operational with all neighbors on the broadcast interface.

Method for controlling times of refreshing ethernet forwarding database

The present invention discloses a method for controlling the times of refreshing an Ethernet Forwarding Database, and the method includes: pre-configuring the time of an address refresh pause timer, receiving a first request for refreshing the Ethernet Forwarding Database; refreshing the Ethernet Forwarding Database and starting the address refresh pause timer; and receiving subsequent requests for refreshing the Ethernet Forwarding Database successively, detecting, each time when receiving the request for refreshing the Ethernet Forwarding Database, whether the address refresh pause timer expires, if yes, then proceeding to step 2, otherwise not performing refresh. The present invention overcomes the problem that the switching is unstable caused by a large amount of broadcast frames which are generated by the nodes refreshing the Ethernet Forwarding Database frequently when switching occurs to the network links

Method and System for Determining Initiator and Terminator in Forwarding Adjacency Label Switched Path

A method for determining beginning and end nodes in a FALSP, applied to a multilayer network using an higher-layer signaling triggering model to establish the FALSP is provided, comprising: a path compute element, when a computed service path comprises FALSPs of one or more layers, encapsulating FALSP path information of each layer into a Secondary Explicit Route Object (SERO) respectively to return together with service path information through inquiry response message to a beginning node in a first layer initiating the inquiry; after receiving them, a node in the service path determining whether the node is a beginning node in the FALSP of a layer according to said FALSP path information, if yes, learning that the FALSP is the FALSP of next layer, and determining an end node in the FALSP of the next layer according to FALSP path information of the next layer. A multilayer network is also provided.

Hot Standby Neighbor Discovery Protocol for Internet Protocol Version 6

Techniques are provided herein for receiving synchronization messages at a second network device that is in a hot standby configuration from a first network device that is maintaining Internet Protocol version 6 (IPv6) state machines for one or more neighbor devices. The synchronization messages are configured to indicate an IPv6 state for each state machine maintained in the first network device. An IPv6 state for corresponding state machines is updated in the second network device based on the synchronization messages such that the IPv6 states in the second network device allows the second network device to actively process IPv6 traffic for the one or more neighbor devices upon traffic switchover from the first network device to the second network device without restarting the corresponding IPv6 state machine associated with each of the one or more neighbor devices in the second network device. The roles of the first and second device with respect to active and standby state are reversed after a switchover.

Method And Apparatus For Network Node Discovery

Various methods and devices are provided to address the need for improved network node discovery. In one method, a network node receives from a sending node a request indicating a criterion of interest to an originator node. If the network node meets the criterion, the network node sends a response to the originator node indicating that the network node meets the criterion. The network node also forwards the request to any nodes that neighbor the network node other than the sending node.

Dynamic Reroute Scheduling in a Directed Acyclic Graph (DAG)

In one embodiment, a particular node joins a directed acyclic graph (DAG) in a computer network at a parent node, and determines its grade based on a topology of the DAG, the grade lower than the parent node and higher than any child nodes of the particular node. In response to detecting a trigger for a routing change in the DAG, the particular node delays the routing change based on the grade such that the delay is longer than a first associated delay of any of the child nodes and shorter than a second associated delay of the parent node. Upon expiration of the delay, the particular node may determine if the trigger for the routing change is still valid, and if valid, performs the routing change.

Apparatus and method for rerouting multiple traffics

The disclosure discloses an apparatus and method for rerouting multiple traffics. The apparatus includes a path computation unit and a traffic path incorporation unit, the path computation unit forwards a received uniform route computation notification message including multiple pieces of failed traffic connection information to the traffic path incorporation unit, and also forwards a route inquiry request transmitted from the head node of the fault traffic to the traffic path incorporation unit; the traffic path incorporation unit analyzes and detects the failed traffic connection information according to traffic incorporating and route inquiry statistic algorithm, and uniformly obtains and records the recovery route information from the path computation unit; when receiving the route inquiry request forwarded by the path computation unit, the traffic path incorporation unit is further configured to search the record according to the route inquiry request, and return the found corresponding recovery route information to the head node which requests the recovery through the path computation unit. The disclosure uses a incorporating and uniform route inquiry method, the resource loss of the path computation unit is reduced, and the efficiency of link restoration is improved.

Hiding a service node in a network from a network routing topology

Hiding a service node in a network from a network topology is provided. In one embodiment, for example, an apparatus for hiding a service node in a network from a network topology, the apparatus comprising: a network interface; a processor; and one or more stored sequences of instructions which, when executed by the processor, cause the processor to perform: discovering a service node in a data network in accordance with a link-state protocol wherein the service node provides a network topology dependent service other than packet forwarding; establishing a link-state adjacency with the service node and one or more packet forwarding nodes in accordance with the link-state protocol; receiving a link-state advertisement; in response to identifying the link-state advertisement as an originating link-state advertisement sent from the service node, suppressing flooding of the received link-state advertisement to the one or more packet forwarding nodes.

Graceful network merge by performing a graceful transition of conflicting routing identifiers

A first switch of a first network may receive a second set of information including routing identifiers associated with a second network, wherein the first switch of the first network is connected to a second switch of the second network. The first switch of the first network may transmit a first set of information 54 including routing identifiers associated with the first network. The first switch may determine whether a conflict exists between the second set of information and the first set of information. A conflicting one of the routing identifiers associated with the first or second network may be transitioned to a non-conflicting routing identifier according to the determination of whether a conflict exists between the first set of information and the second set of information.

Cluster router and cluster routing method

A cluster router includes at least one control apparatus and at least two forwarding apparatuses. The control apparatus is connected to the forwarding apparatuses, and the forwarding apparatuses are connected with each other. The control apparatus is configured to generate a routing table of each forwarding apparatus and a packet processing information conversion table of each forwarding apparatus. The forwarding apparatus is configured to receive the routing table of the forwarding apparatus and the packet processing information conversion table of the forwarding apparatus, and execute data exchange between the forwarding apparatuses according to the routing table and the packet processing information conversion table.

Method & apparatus for the distribution of network traffic

A packet network device, such as a router or switch, includes functionality that operates to receive network traffic, process the traffic as needed and to forward the traffic to its destination. Additionally, each router includes a weighted equal cost multipath routing function that operates to identify equal cost paths over which to forward the network traffic, to calculate a path weighting that is dependent upon the path bandwidth and to forward the traffic ingressing to it over each of the equal cost paths according to the calculated path weighting.

System and method for intelligently maintaining connectivity in a network environment

A method is provided in one example embodiment and includes establishing a communication pathway between a first network node and a second network node coupled to a network; forming an adjacency to a new network node coupled to the network, where a designated intermediate system (DIS) election operation is executed after the adjacency is formed in order to determine that the new network node is a newly identified DIS for the network; and communicating a message advertising connectivity to both a previously identified DIS and the newly identified DIS, where the message is communicated during a specified time interval.

Dynamic management of signal routing capacity for satellites using a digital transparent processor having rapid reconfiguration

The present invention relates to a device for managing signal routing on board a satellite, and use of “agile” digital transparent processors. The device decorrelates the spreading band of the uplink to said satellite from the instantaneous useful band of each signal, used for routing on board the satellite and on the downlink. For a given protection dictating the spreading width of the uplink signals, the device makes it possible to optimize connectivity, i.e. the number of routes through said satellite, as well as the total capacity of the satellite by means of individualized control of the gain of each route. The routing band is limited to the instantaneous useful communication band and is not extended to the spreading band of the uplink. The band used in the downlink by each signal can also be limited to the instantaneous useful band or possibly widened by a new frequency spread.

Apparatus and method for layer-2 and layer-3 vpn discovery

An apparatus and a method for layer-2 and layer-3 VPN discovery are disclosed. The apparatus is incorporated in a network, and the network includes a first carrier network. The first carrier network includes at least two layer-1 provider edge devices. Layer-1 VPN information is created within the first carrier network. BGP next hop information passes within the first carrier network. The BGP next hop information is for a selected one of the following: a layer-2 VPN-based provider edge device, a layer-3 VPN-based provider edge device, and a layer-2 and layer-3 VPN-based provider edge device. The network also includes a second carrier network within which the BGP next hop information is used for VPN discovery.

Zone-based network traffic analysis

Network discovery is performed to detect routers and to collect discovery data from them. The discovery data is analyzed to identify zones, i.e., autonomous routing domains and subdomain areas. Network traffic is monitored at border router ports to obtain zone traffic data. The zone traffic data is analyzed to evaluate per-zone or inter-zone traffic parameters.

Routing table lookoup algorithm employing search key having destination address and interface component

A routing table lookup algorithm is described that, for a first outbound packet, performs a first route lookup into the routing table with a first search key that includes the first packet's destination address and a first network interface identifier, and, for a second outbound packet, performs a second route lookup into the routing table with a second search key that includes the second outbound packet's destination address but does not include any network interface identifier.

Accelerated Routing Convergence

In an embodiment, a method comprises: determining that a session restart on a restarting node has been initiated; in response to determining that the restarting node has preserved a last acknowledged version of routing information received from a peer node, and determining that the restarting node has preserved a routing state corresponding to the last acknowledged version of routing information, transmitting to the peer node a message indicating that the last acknowledged version of routing information and the routing state have been preserved at the restarting node; wherein the method is performed by one or more computing devices.

Collective Acceleration Unit Tree Structure

A mechanism is provided in a collective acceleration unit for performing a collective operation to distribute or collect data among a plurality of participant nodes. The mechanism receives an input collective packet for a collective operation from a neighbor node within a collective tree. The input collective packet comprises a tree identifier and an input data field and wherein the collective tree comprises a plurality of sub trees. The mechanism maps the tree identifier to an index within the collective acceleration unit. The index identifies a portion of resources within the collective acceleration unit and is associated with a set of neighbor nodes in a given sub tree within the collective tree. For each neighbor node the collective acceleration unit stores destination information. The collective acceleration unit performs an operation on the input data field using the portion of resources to effect the collective operation.

Collecting network performance data from multiple autonomous systems

A computer apparatus comprises first Border Gateway Protocol (BGP) logic comprising BGP route table data; a network interface to communicatively couple to a first autonomous system; data collection logic in computer-readable storage media when executed operable to perform discovering an address prefix of a data collector that is communicatively coupled to second BGP logic of a router within a second autonomous system that is coupled to the first autonomous system, wherein the second autonomous system is independent of the first autonomous system; determining a path through the first autonomous system, the one or more networks or internetworks, and the second autonomous system to the data collector based on the BGP route table; requesting the data collector to provide one or more data values relating to performance of network elements of the second autonomous system; receiving and storing the one or more data values.

Method and Apparatus For Selecting Between Available Neighbors in a RAPID Alternate Path Calculation

A weighting process may be used to select between alternate neighbors in a RAPID calculation to enable policy and/or traffic engineering considerations to affect the selection of an alternate path through the network. The information used to weight the neighbors may static administratively assigned weighting information or dynamic weighting information such as local statistical traffic condition information. The process may take into account the amount of traffic being handled by the current primary next hop for the destination, the available capacity of the available alternate neighbors, the ability of the alternate neighbors to handle the additional traffic, and other considerations. Weighting may occur after a set of available loop free alternate neighbors has been determined. Alternatively, weighting may occur before the RAPID calculation has been performed to cause the neighbors to be ordered prior to RAPID processing. This may enable RAPID calculation to stop without considering all available neighbors.

Method and apparatus for advertising border connection information of autonomous system

A method and an apparatus for advertising border connection information of autonomous system are disclosed. Moreover, the method includes: establishing and maintaining, by a border node of the autonomous system, the border connection information of the autonomous system; flooding the border connection information within the autonomous system; and receiving, by nodes of the autonomous system, the border connection information. The method and the apparatus for advertising border connection information of autonomous system of embodiments of the present invention may adapt to dynamic change of network topology, and dynamically advertise the border connection information of the autonomous system within the system in time, so as to optimize networks and improve quality of service of the networks.

Apparatus, system and mehtod for reliable, fast, and scalable multicast message delivery in service overlay networks

A method to organize nodes into an overlay network and to disseminate multicast messages within this overlay both through an efficient tree embedded in the overlay and through gossips exchanged between overlay neighbors. Regardless of the size of the system, this invention incurs a constant low overhead on each node.

Method and device for relocating address space

The invention relates to a method for relocating address space in a peer-to-peer network with hierarchical addressing is performed in a network ( 1 ) that has a tree structure with routers ( 3 ) at different network depths (D). Each router ( 3 ) has an assigned address space ( 10 ), including an identifying address ( 11 ) for the router ( 3 ), one or more address blocks ( 12 ) for providing further routers ( 3 ) with assigned address space ( 10 ) and a further address block ( 13 ) for providing end devices with identifying addresses. The size of the address space ( 10 ) assigned to a router ( 3 ) without relocation depends on the network depth (D) of the router ( 3 ) in a predetermined way, leading to specific sizes of the address space ( 10 ) assigned to routers ( 3 ). The method comprises the following steps: An association request is received from a joining router or a joining end device by a first router ( 3 ) of the network ( 1 ), wherein the address space ( 10 ) of the first router ( 3 ) is exhausted. The first router ( 3 ) sends a relocation request ( 20 ) to a second router ( 3 ) of the network ( 1 ), wherein the relocation request denotes a size of a requested address block ( 12 ), and wherein the size of the requested address block ( 12 ) equals one of the specific address space sizes. The invention further relates to a router ( 3 ) for use in an according network ( 1 ), the router ( 3 ) being suited to perform the described method.

Routing information generating apparatus, routing information generating method and routing information generating program

Network connecting sections of an own station deliver routing information notified from a relay section on the same base to network connecting sections of other stations of own networks. If new routing information is present in routing information received from the network connecting sections of the other stations, the network connecting sections of the own station notify the relay section on the same base of the routing information. The relay section updates, based on the routing information notified from the network connecting sections on the same base, routing information held by the relay section.

Apparatus, system and method for reliable, fast and scalable multicast message delivery in service overlay networks

A method to organize nodes into an overlay network and to disseminate multicast messages within this overlay both through an efficient tree embedded in the overlay and through gossips exchanged between overlay neighbors. Regardless of the size of the system, this invention incurs a constant low overhead on each node.

Methods and network elements operable to specify and determine complete sets of link state messages for link state routing protocols

A method, performed by a transmitter network element utilizing a link state routing protocol which has a maximum link state message size. The method is for providing information to avoid a disruption in data forwarding that would result from a receiver network element performing preferred route computations based on an incomplete set of link state messages. The method includes generating a complete set of link state messages having information indicating that the link state messages are the complete set of the link state messages. The complete set of the link state messages are collectively coherent with a link state of the transmitter network element. The method also includes transmitting the complete set of the link state messages, and the information indicating that the link state messages are the complete set of the link state messages, to a network. Also disclosed are transmitter network elements, receiver network elements, and methods thereof.

Network evaluation apparatus and network evaluation method

A network evaluation apparatus that evaluates a design of an optical network, the network evaluation apparatus including: a processor that selects two nodes, between which a lightpath is to be set up, from a plurality of nodes based on a traffic volume demand values, calculates a decreased amount of cost based on numbers of the plurality of nodes and a plurality of routers for relaying a signal transmitted between the two nodes selected, calculates an increased amount of cost based on a transmission distance of the lightpath and a number of a plurality of repeaters to be inserted according to a segment distance, and determines a value of the optical network based on the decreased amount of cost and the increased amount of cost.

Controller Placement for Fast Failover in the Split Architecture

A method implemented by a network topology design system, the network topology design system including a processing device. The method to determine placement of a controller within a network with a split architecture where control plane components of the split architecture network are executed by a controller and the control plane components are separate from data plane components of the split architecture network. The placement of the controller is selected to minimize disruption of the split architecture network caused by a link failure, a switch failure or a connectivity loss between the controller and the data plane components

Vertebral joint implants and delivery tools

A spinal joint distraction system for treating a facet joint including articular surfaces having a contour is disclosed and may include a delivery device including a generally tubular structure adapted to engage a facet joint, an implant adapted to be delivered through the delivery device and into the facet joint, the implant comprising two members arranged in opposed position, and an implant distractor comprising a generally elongate member adapted to advance between the two members of the implant causing separation of the members and distraction of the facet joint, wherein the implant is adapted to conform to the shape of the implant distractor and/or the articular surfaces of the facet upon being delivered to the facet joint. Several embodiments of a system, several embodiments of an implant, and several methods are disclosed including a method for interbody fusion.

Automatically Routing Super-Compute Interconnects

A mechanism is provided for automatically routing network interconnects in a data processing system. A processor in a node of a plurality of nodes receives network topology from neighboring nodes in the plurality of nodes within the data processing system. The processor constructs a system node map that identifies a physical connectivity between the node and the neighboring nodes. The processor programs a switch in the node with a connectivity map that indicates a set of point-to-point connections with the neighboring nodes. The set of point-to-point connections comprise locally-connected connections and pass-through connections.

Network control apparatus and method

Some embodiments provide a controller for managing several managed switching elements that forward data in a network. The controller includes an interface for receiving input logical control plane data. It also includes a converter for converting the input logical control plane data to output logical forwarding plane data. The logical forwarding plane data for subsequent translation into a set of physical forwarding behaviors that direct the forwarding of data by the managed switching elements.

CONSISTENT UPDATES FOR PACKET CLASSIFICATION DEVICES

A method for managing incremental classifier tables is disclosed. A sequence of classifier table updates is received. Each update in the sequence of updates is associated with a filter and is analyzed. If multiple updates are received at the same time, then all updates associated with the same filter are identified. The updates on the same filter can be reduced to a single update resulting in an identical final state of the same filter. The other updates associated with the filter are removed from the sequence of updates. A reduced sequence of classifier updates is generated based on other updates of filters with multiple updates being removed. The reduced sequence of classifier updates comprises a set of classifier table updates, where for each distinct filter in the reduced sequence only one update is associated therewith. A reordered sequence of update operations is generated from the reduced sequence of update operations. 1. A method for managing classifier tables , the method comprising:receiving a sequence of classifier table updates, wherein each update in the sequence of updates is associated with a filter;analyzing each update in the sequence of updates;identifying, based on the analyzing, at least two updates associated with the same filter, wherein the two updates result in an identical final state of the same filter;removing at least one of the two updates from the sequence of updates; andgenerating, based on the removing, a reduced sequence of classifier table updates comprising a set of classifier table updates from the sequence of classifier table update where for each distinct filter in the reduced sequence of classifier table updates only one update is associated with a given final state of the distinct filter.2. The method of claim 1 , wherein the set of classifier table updates are a set of Internet router table updates.3. The method of claim 1 , wherein the filter is a prefix.4. The method of claim 1 , further comprising: {'br': None, 'i': T', 'U ...

Intelligent Backhaul Management System

A intelligent backhaul system is disclosed to manage and control multiple intelligent backhaul radios within a geographic zone. The intelligent backhaul system includes multiple intelligent backhaul radios (IBRs) that are able to function in both obstructed and unobstructed line of sight propagation conditions, one or more intelligent backhaul controllers (IBCs) connecting the IBRs with other network elements, and an intelligent backhaul management system (IBMS). The IBMS may include a private and/or public server and/or agents in one or more IBRs or IBCs.

Distributed IPv6 Neighbor Discovery for Large Datacenter Switching Systems

A distributed neighbor discovery module is disclosed where all neighbor discovery operations and functionalities may be distributed to a switch device processor. Each neighbor discovery process on a switch device may run as an individual neighbor discovery router node. There may be no coordination between neighbor discovery processes occurring on different switch devices. All other traffic, including both IPv6 control traffic and data traffic destined to the router may be processed by the central controller processor.

Medium access control address protection method and switch

The present disclosure discloses a MAC address protection method and switch. A switch in a layer 2 ring network obtains network topology information of the layer 2 ring network, the network topology information includes a protection MAC address of a protected device, an identifier of a switch corresponding to the protection MAC address, and an identifier of each switch in the layer 2 ring network, wherein the protection MAC address is the MAC address of the protected device; and determines a local outgoing interface of the protection MAC address of the protected device according to the network topology information, establishes and stores an outgoing interface of an MAC entry corresponding to the protection MAC address according to the local outgoing interface of the protection MAC address, thereby ensuring the protected device to correctly send and receive messages to meet the topology change of the layer 2 ring network.

Sub-Topology Discovery for Operating Hybrid Solutions

Network topology information may be determined for a plurality of network devices on a network. System identifier information may then be determined for each of the plurality of network devices on the network. The system identifier information may be a list of network solutions that each network device actually or potentially belongs to. The system may then flag the system identifier information to indicate whether each solution is an actual or a potential solution.

SWITCH AND FLOW TABLE CONTROLLING METHOD

In an open flow system, it is made possible to confirm a flow having succeeded or failed in the registration on a flow table. Specifically, a controller transmits and receives an open flow message to and from a switch. The switch is provided with a flow table which manages flows registered from a controller, and a flow table reading section which reads corresponding data, a flow table control section which performs processing of addition, deletion and modification of a flow entry, and a platform function managing section which determine whether an object flow entry is valid or invalid according to an inquiry from the flow table control section. The flow table has a normal flow table and a save flow table. A valid flow entry which conforms to configuration data of the switch is registered on the normal flow table. An invalid flow entry which does not conform to the configuration data of the switch is registered on the save flow table. 1. A switch comprising:means for confirming whether or not a flow notified from a controller conforms to a predetermined function and determining whether or not the flow is valid or invalid;means for registering a valid flow on a normal flow table;means for registering an invalid flow on a save flow table; andmeans for recognizing a packet received from a network as a flow and performing processing specified for the flow to the packet when the flow has been registered on the normal flow table.2. The switch according to claim 1 , further comprising:means for reading the flow from either of the normal flow table and the save flow table in response to an inquiry of success or failure of flow registration from the controller; andmeans for responding that the flow is registered on which of the normal flow table and the save flow table, to the controller.3. The switch according to claim 1 , further comprising:means for detecting a modification of the predetermined function;means for confirming whether or not each of the flows registered on ...

FLOODING-BASED ROUTING PROTOCOL HAVING DATABASE PRUNING AND RATE-CONTROLLED STATE REFRESH

An enhanced, flooding-based link state routing protocol is described that provides pruning of link state data and, when needed, rate-controlled refresh of the pruned link state data from other routers of the flooding domain. A routing device comprises a network interface to send and receive packets over a layer-two (L2) communication medium. The routing device includes a control unit coupled to the network interface, and a flooding-based link state routing protocol executing on a processor of the control unit. The link-state routing protocol establishes an adjacency with a peer router. A database of the routing device includes entries that store a plurality of link state messages for a flooding domain of the link state routing protocol, wherein at least one of the entries in the database stores a partial link state message having a header portion and a payload having pruned link state data. 1. A method comprising:establishing a link-state routing adjacency between a first router and a second router over a layer-two (L2) communication medium in accordance with a flooding-based link-state routing protocol;receiving, with the first router, a link state message in accordance with the link state routing protocol, wherein the link state message contains link state data for a flooding domain of the link state routing protocol;storing the link state message to a database of the first router;flooding the link state message from the first router to at least a third router of the flooding domain; andafter receiving an acknowledgement from the third router, pruning at least a portion of the link state data from the link state message stored within the database without deleting the entire link state message.2. The method of claim 1 , further comprising:identifying an event requiring the first router to flood the link state message including the pruned link state data to the flooding domain;outputting a database synchronization message from the first router to direct the second ...

METHOD AND ROUTER FOR IMPROVED UPDATING OF A ROUTING INFORMATION BASE

Method for use in updating a routing information base of a node of a network, said routing information base comprising for each destination node of a number of destination nodes in said network a number of paths; wherein an update message with routing information is sent in said network from a first node to a peer of the first node, said first node having a first routing information base; wherein the update message comprises: a selected path for a first destination node of said number of destination nodes, said selected path comprising a next hop node adjacent the first node; at least one routing topology variable derived from the number of paths available for said first destination; said at least one routing topology variable being a measure for the risk on bottlenecks in the selected path. 1. Method for use in updating a routing information base of a node of a network , said routing information base comprising for each destination node of a number of destination nodes in said network a number of paths; wherein an update message with routing information is sent in said network from a first node to a peer of the first node , said first node having a first routing information base; a selected path for a first destination node of said number of destination nodes, said selected path comprising a next hop node adjacent the first node;', 'at least one routing topology variable derived from the number of paths available for said first destination; said at least one routing topology variable being a measure for the risk on bottlenecks in the selected path., 'wherein the update message comprises2. Method of claim 1 , wherein the at least one routing topology variable is derived from the number of paths available for said first destination as stored in the first routing information base.3. Method of claim 1 , wherein said at least one routing topology variable comprises:a diversity variable related to the number of paths stored in the first routing information base for said ...

METHOD AND APPARATUS FOR TOPOLOGY DISCOVERY

A method and an apparatus for topology discovery are disclosed. Link state information of each port of each device on a ring network is confirmed through neighbor negotiation between a first device and a neighbor device, and by broadcasting a link state information base of each device to other devices on the ring network, each device on the ring network can obtain the newest and synchronous link state information of each port on the ring network, so that each network device on the ring network implements topology discovery of the ring network where the network device is located. 1. A topology discovery method for use in a ring network comprising a first device and a first neighbor device adjacent to the first device , the method comprising:when determining to perform neighbor negotiation of the first device, sending, through a first port of the first device, a neighbor negotiation packet to the first neighbor device connected to the first port, wherein a second port of the first neighbor device is connected to the first port;receiving a neighbor negotiation reply packet returned by the first neighbor device, wherein the neighbor negotiation reply packet is generated according to an update result of link state information of the second port after the first neighbor device updates, according to the neighbor negotiation packet, the link state information of the second port;according to the neighbor negotiation reply packet, updating link state information of the first port in the first device; andaccording to an update result of the link state information of the first port, broadcasting a link state information base of the first device according to predetermined configuration to other devices, except the first device, on the ring network, so that the other devices update, according to the link state information of the first port, local link state information bases, wherein the link state information base comprises link state information of each port on the ring network ...

METHOD, ROUTER BRIDGE, AND SYSTEM FOR TRILL NETWORK PROTECTION

Embodiments of the present invention disclose a method, a router bridge, and a system for TRILL network protection. An active RB node and a standby RB node share a virtual Nickname and a virtual MAC address, and construct a protection group. The active RB node, through the TRILL protocol, obtains a network topology and generates a forwarding path to perform forwarding of a data packet. When the active RB node is faulty, the standby RB node is raised to be active and the data packet is forwarded through the standby RB node, so that the time for fault recovery is shortened, thereby solving the problem that in an existing TRILL network when a root RB node is faulty, a long time for the fault recovery causes a service interruption and affects network performance. 1. A method for Transparent Interconnection of Lots of Links TRILL network protection , comprising:negotiating, by a first router bridge RB, with a second RB about an active/standby state, wherein the first RB and the second RB have the same virtual nickname Nickname and virtual media access control MAC address;when the state of the first RB is active, establishing, by the first RB, a neighbor relationship with another RB other than the second RB through a Hello message according to the virtual MAC address, obtaining network topology information according to the virtual Nickname, and generating and delivering a neighbor check table, a reverse path forwarding RPF table, and a TRILL forwarding table; andwhen the state of the first RB is standby, if the second RB is faulty, raising the state of the first RB from standby to active, and notifying another RB in the network of the fault of the second RB so that another RB updates the network topology information, the neighbor check table, the reverse path forwarding RPF table, and the TRILL forwarding table, and generating and delivering, by the first RB, a neighbor check table, a reverse path forwarding RPF table, and a TRILL forwarding table.2. The method according ...

Adaptive Broadband Platforms And Methods Of Operation

A subscriber platform for broadband communication, according to various aspects of the present invention, includes an antenna, a plurality of transceivers, and a processor. The antenna supports communication via a plurality of directional beams. The plurality of frequency agile transceivers operate simultaneously, each transceiver being coupled to the antenna for communication via a respective directional beam. The processor is coupled to the plurality of transceivers. And, the transceivers are coupled to the antenna to communicate data among the directional beams as directed by the processor, communication including directional diversity and frequency diversity.

Method and System for Survival of Data Plane Through a Total Control Plane Failure

A system and method for retaining routes in a control plane learned by an inter-domain routing protocol in the event of a connectivity failure between routers. Routers are classified as either route reflectors or originators. A determination is made whether the connectivity failure occurred between a route reflector and an originator, two originators, or two route reflectors. A determination is then made whether to propagate a withdrawal of learned routes based on whether the connectivity failure occurred between a route reflector and an originator, two originators, or two route reflectors. A withdrawal of learned routes is propagated to neighboring routers if the connectivity failure occurred between two originators, or between a route reflector and an originator that is inaccessible via an intra-domain routing protocol. No withdrawal of learned routes is propagated if the connectivity failure occurred between two route reflectors, or between a route reflector and an originator that is accessible via an intra-domain routing protocol.

User centric virtual network and method of establishing the same

Provided is a method of establishing a user centric virtual network. The method includes: performing a first tunneling operation between a first tunnel end and an address translation device, which are connected to a first private network, and a tunnel relay device; performing a second tunneling operation between a second tunnel end and an address translation device, which are connected to a second private network, and the tunnel relay device; and performing a third tunneling operation between the tunnel relay device and an end client, wherein a virtual IP is allocated to each of the first and second tunnel ends, the address translation devices, the end client, and the tunnel relay device; and each of the first to third tunneling operations connects routing information on the virtual IP to a corresponding tunnel.

NETWORK ACCESS APPARATUS

A network access apparatus comprising a tunneling interface to collect device access information of network devices of a first computer network having a first network gateway device and device access information of network devices of a second computer network having a second network gateway device, wherein the apparatus is to send device access information of network devices of said first computer network to said second computer network upon receipt of an inquiry for request of device access information from said second computer network, and vice versa. 1. A network access apparatus comprising a tunneling interface to collect device access information of network devices of a first computer network having a first network gateway device and device access information of network devices of a second computer network having a second network gateway device , wherein the apparatus is to send device access information of network devices of said first computer network to said second computer network upon receipt of an inquiry for request of device access information from said second computer network , and vice versa.2. A network access apparatus according to claim 1 , wherein the first and the second networks are private networks claim 1 , and the network access apparatus is to communicate with the first and the second computer networks via a public network using a tunneling protocol such as IP GRE protocol.3. A network access apparatus according to claim 1 , wherein the tunneling interface is IP GRE compatible.4. A network access apparatus according to claim 1 , wherein the apparatus is to collect said device access information by ISIS protocol.5. A network access apparatus according to claim 1 , wherein the device access information is in MAC (medium access code) form and the network access apparatus is to collect the device access information in MAC-over-GRE-over-IP protocol.6. A network access apparatus according to claim 1 , wherein the apparatus is to collect the ...

CONTROL APPARATUS, A COMMUNICATION SYSTEM, A COMMUNICATION METHOD AND A RECORDING MEDIUM HAVING RECORDED THEREON A COMMUNICATION PROGRAM

A control apparatus for controlling a network includes a path control unit for selecting a communication apparatus having an identifier as a destination communication apparatus among a communication apparatus group, based on a connection relationship between the communication apparatus group, which is connected to the network and includes communication apparatuses each having a same identifier, and a source communication apparatus which performs communication using the identifier as a destination address, and setting a process corresponding to a path from the source communication apparatus to the selected destination communication apparatus to a transfer apparatus in the network. 1. A control apparatus for controlling a network comprising:a path control unit that selects a communication apparatus having an identifier as a destination communication apparatus among a communication apparatus group, based on a connection relationship between the communication apparatus group, which is connected to the network and includes communication apparatuses each having a same identifier, and a source communication apparatus which performs communication using the identifier as a destination address, and setting a process corresponding to a path from the source communication apparatus to the selected destination communication apparatus to a transfer apparatus in the network.2. The control apparatus according to claim 1 , wherein the connection relationship includes a connection relationship between the communication apparatus group and the transfer apparatus which is located in a boundary of the network.3. The control apparatus according to claim 1 , wherein the path control unit comprising:a first storage unit that stores the connection relationship between the communication apparatus and the transfer apparatus which is located in a boundary of the network;a second storage unit that stores the communication apparatus having the same identifier among the communication apparatus ...

Providing Full Point-To-Point Communications Among Compute Nodes Of An Operational Group In A Global Combining Network Of A Parallel Computer

Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link. 1. A method for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer , each compute node connected to each adjacent compute node in the global combining network through a link , the method comprising:receiving a network packet in a compute node, the network packet specifying a destination compute node; identifying a receipt link on which the network packet was received by the compute node;', 'determining whether the destination compute node is one of the adjacent compute nodes for the compute node; and', 'selecting all of the links for the compute node except the receipt link if the destination compute node is not one of the adjacent compute nodes for the compute node; and, 'selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node, includingforwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link.2. The method of wherein:the method further comprises: determining a network topology for the compute nodes of the operational group in the ...

Technique for improving ldp-igp synchronization

A technique may improve LDP-IGP synchronization in a MPLS network when an interface of a router coupled to a communications link along a shortest path between a source router and a destination router becomes newly active. Specifically, an IGP adjacency may be held down over the newly active link while a LDP adjacency is established over the link. The router may inject a temporary, non-redistributable route having a large administrative weight into its routing table utilizing addresses learned during establishment of the LDP adjacency. The injected route ensures that there is a reachable route to a peer router so that LDP may converge. After LDP has converged and all needed label bindings have been distributed in the MPLS network utilizing the injected route, IGP executing on the router may advertise a normal cost metric for the link associated with the newly active interface, and IGP convergence may be completed.

METHOD AND APPARATUS FOR MANAGING MAC ADDRESS TABLE

Embodiments of the present invention disclose a method and an apparatus for managing a MAC address table. The method includes: receiving a packet and obtaining MAC address information carried in the packet; matching the MAC address information with a MAC address table; and if the matching succeeds, prolonging an aging time of the MAC address information in the MAC address table. 1. A method for managing a Medium Access Control (MAC) address table , comprising:receiving a packet and obtaining MAC address information carried in the packet; andmatching the MAC address information with an entry within the MAC address table, and, if the matching succeeds, prolonging an aging time of the entry containing the MAC address information in the MAC address table.2. The method for managing a MAC address table according to claim 1 , wherein:the MAC address information comprises at least one of the group consisting of: source MAC (SMAC) address information and destination MAC (DMAC) address information.3. The method for managing a MAC address table according to claim 2 , wherein:the matching the MAC address information with the entry within the MAC address table, and the prolonging the aging time of the MAC address information in the MAC address table if the matching succeeds comprise:judging whether the SMAC address information matches the MAC address information recorded in the MAC address table;if the matching succeeds, updating the aging time of the entry within the MAC address information in the MAC address table according to a preset delay rule; andif the matching fails, writing the SMAC address information into a new entry within the MAC address table, and setting the aging time of the new entry within the MAC address information to a shortest aging time.4. The method for managing a MAC address table according to claim 2 , wherein:the matching the MAC address information with the entry within the MAC address table, and the prolonging the aging time of the MAC address ...

MANAGING MAC MOVES WITH SECURE PORT GROUPS

A method includes determining that a source MAC address is associated with a particular port that is a member of a secure group () of ports (-) of a network edge device (). A move of the source MAC address to any port of the network edge device () that is a member of the secure group of ports is allowed. Moves of the MAC address to any port of the network edge device () that is outside the secure group of ports are disavowed. An apparatus and at least one computer-readable medium for implementing the method also are described. 1. A method , comprising:{'b': 34', '36', '1', '14', '20', '50, 'determining that a source MAC address is associated with a particular port that is a member of a secure group (, ) of ports (-) of a network edge device (, );'}{'b': 20', '50, 'allowing a move of the source MAC address to any port of the network edge device (, ) that is a member of the secure group of ports; and'}{'b': 20', '50, 'disallowing moves of the MAC address to any port of the network edge device (, ) that is outside the secure group of ports.'}2562050. The method of claim 1 , wherein the determining comprises searching for an association between the port associated with the source MAC address and the secure port group in a table () accessible by the network edge device ( claim 1 , ).36050. The method of claim 1 , further comprising extracting the source MAC address from a network packet () received on a particular port of the network edge device () claim 1 , and detecting a move of the source address based on the extracted source MAC address.4. The method of claim 3 , wherein the detecting comprises:{'b': '50', 'searching for an association between a port of the network edge device () and the extracted source MAC address; and'}based on a successful search for the association, determining that a move of the source MAC address has occurred based on a comparison of the associated port and the particular port.5. The method of claim 1 , further comprising:{'b': 60', '50, ' ...

ROUTER BASED ON CORE SCORE AND METHOD FOR SETTING CORE SCORE AND PROVIDING AND SEARCHING CONTENT INFORMATION THEREIN

The method for setting a core score in a router on a Content-Centric Network (CCN) includes setting a core score according to closeness to a core of a CCN; and transmitting the core score to one or more adjacent routers. 1. A method for setting a core score in a router on a Content-Centric Network (CCN) , the method comprising:setting a core score according to closeness to a core of a CCN; andtransmitting the core score to one or more adjacent routers.2. The method of claim 1 , wherein the more adjacent to the core of a CCN claim 1 , the greater the core score is to be set.3. The method of claim 1 , further comprising:storing a core score transmitted from the one or more adjacent routers.4. A method for providing content information based on a core score in a router on a CCN claim 1 , the method comprising:generating a register message comprising information about a piece of content stored in a router; andtransmitting the generated register message to one or more adjacent routers which have core scores equal to or greater than that of the router.5. The method of claim 4 , wherein the register message comprises a content name claim 4 , a location of the piece of content and a value representing a distance to the piece of content.6. The method of claim 4 , wherein the generating of the register message comprises modifying the register message if the information about the piece of content stored in the router has changed.7. A method for providing content information based on a core score in a router on a CCN claim 4 , the method comprising:receiving a register message from one or more adjacent routers;storing the received message;modifying content distance information included in the received register message; andtransmitting the modified content distance information to one or more adjacent routers which have core scores equal to or greater than that of a corresponding router.8. The method of claim 7 , further comprising:determining whether the received register ...

SYSTEMS AND METHODS FOR EQUAL-COST MULTI-PATH VIRTUAL PRIVATE LAN SERVICE

A provider edge device, associated with a virtual private local area network service (VPLS) system, includes a memory to store instructions to implement a pseudowire mechanism to receive a first data frame from a source customer edge (CE) device associated with the VPLS system, incorporate the first data frame into a first VPLS packet, determine whether the source CE device is a single-homed CE device or a multi-homed CE device, and incorporate, into the first VPLS packet, a first pseudowire label, if the source CE device is a single-homed CE device, and incorporate, into the first VPLS packet, a second pseudowire label, different from the first pseudowire label, if the source CE device is a multi-homed CE device; and a processor to execute the instructions. 120-. (canceled)21. A system comprising: [ the packet including a data frame, and', 'the first edge device and the second edge device being connected to a multi-homed edge device;, 'receive a packet from a second edge device,'}, 'the neighbor edge device being the multi-homed edge device; and', 'determine that the data frame originated from a neighbor edge device based on information that indicates that the neighbor edge device is connected to the second edge device,'}, 'transmit, based on determining that the data frame originated from the neighbor edge device, the data frame to one or more other edge devices that are connected to the first edge device and are not connected to the second edge device., 'a first edge device to22. The system of claim 21 ,where the first edge device is a first provider edge (PE) device, andwhere the second edge device is a second PE device.23. The system of claim 21 , where the neighbor edge device is a customer edge (CE) device associated with a virtual private local area network service (VPLS) system.24. The system of claim 21 , where the first edge device is further to:determine a source address that is included in the data frame, andstore, in an address table, the source ...

VALIDATING REACHABILITY OF NODES OF A NETWORK OF AN INDUSTRIAL AUTOMATION AND CONTROL SYSTEM

A device validates reachability of nodes of a communication network of an industrial automation and control system. The device includes a collector module configured to update a data set including discovered dataflow information by detecting direct neighbour nodes having a physical connection to a selected node, and updating the data set by adding the selected node and those direct neighbour nodes which have configured logical network constraints matching logical network constraints of the selected node. The device includes a repeater module configured to repeat the selecting of a direct neighbour node in the data set and directing the collector module to update the data set using the selected direct neighbour node. The device includes a validation module configured to validate reachability of nodes of the network by comparing the data set with a data set including designed dataflow information which defines reachability requirements for nodes of the communication network.

METHODS, APPARATUS AND ARTICLES OF MANUFACTURE TO MANAGE ROUTING IN NETWORKS

Example methods, apparatus and articles to manage routing in networks are disclosed. A disclosed example method includes identifying a first network element associated with a problematic network element; identifying a first maximum transmission unit of the first network element and a second maximum transmission unit of the problematic network element; determining whether the first and second maximum transmission units are different; and when the first and second maximum transmission units are different, identifying a value of a greater one of the first and second maximum transmission units and configuring the first network element and the problematic network element to each have the identified value. 1. A method comprising:identifying a first network element associated with a problematic network element;identifying a first maximum transmission unit of the first network element and a second maximum transmission unit of the problematic network element;determining whether the first and second maximum transmission units are different; and identifying a value of a greater one of the first and second maximum transmission units; and', 'configuring the first network element and the problematic network element to each have the identified value., 'when the first and second maximum transmission units are different2. A method as defined in claim 1 , wherein identifying the first network element comprises identifying neighboring network elements of the problematic network element.3. A method as defined in claim 1 , wherein the neighboring network elements of the problematic network element are directly connected to the problematic network element.4. A method as defined in claim 1 , further comprising detecting whether a mismatch exists between a first Bellman-Ford constant associated with the first network element and a second Bellman-Ford constant associated with the problematic network element.5. A method as defined in claim 4 , further comprising claim 4 , when the mismatch ...

Unregistered multicast (mc) packet forwarding to multicast router ports

In one embodiment, a system includes a switching processor, logic configured for installing a Multicast Control (MC) table on a switching processor managing switching on a virtual local area network, logic configured for determining if multicast flooding is disabled in the switching processor, logic configured for installing a drop entry in the MC table upon determining that multicast flooding is disabled in the switching processor, logic configured for detecting whether one or more multicast routers is connected to one or more ports coupled to the switching processor, logic configured for receiving at least one multicast packet, and logic configured for dropping the at least one multicast packet based on the drop entry when no multicast router is connected to any of the one or more ports coupled to the switching processor. Other systems, methods, and computer program products are presented in accordance with more embodiments.

Supporting Software Defined Networking with Application Layer Traffic Optimization

A network node for managing the control plane functions for a plurality of nodes within a software defined networking (SDN) domain, comprising a processor configured to collect a plurality of network information from the nodes, forward the network information based on a plurality of domain-specific policies, receive traffic optimization information based on the network information, and compute forwarding decisions for the nodes based on the traffic optimization information. In another embodiment, an Application Layer Traffic Optimization (ALTO) node, comprising a processor configured to import a first set of network information from one or more SDN nodes, aggregate the network information received from the SDN nodes, calculate a plurality of traffic optimization decisions based on the aggregated network information, and forward the traffic optimization decisions to the SDN nodes.

Devices and methods for beacon communication in ad-hoc networks

A method includes receiving discovery messages from respective devices of an ad-hoc wireless network. The messages are received by a first device in the ad-hoc wireless network prior to a particular discovery interval. The discovery messages include information identifying the respective devices. The method further includes caching the information identifying the respective devices. During the particular discovery interval, a first discovery message is sent. The first discovery message includes a request to reserve a paging interval during the particular discovery interval. The first discovery message further includes an indication of the information.

Updating zone information in a distributed switch of data forwarders

Provided are a computer program product, system, and method for updating zone information in a distributed switch of data forwarders. For each data forwarder, a sequence number is maintained for zone distribution messages sent to the data forwarder. A change to the ports in the network is detected comprising at least one of an allocation or deallocation of at least one port in the network. The sequence number for each data forwarder is incremented in response to detecting the change. For each data forwarder, a zone distribution message is generated indicating the at least one port allocated and/or deallocated, port information indicating each port in the network that may communicate with each other port, and the sequence number for the data forwarder. The generated zone distribution message is transmitted for each data forwarder to the data forwarder for which the zone distribution message was added.

OSNR Model For Optical Engineering Rules Used In A Planning Tool

Increasing data rates in next-generation optical networks requires a change in the type of optical modulation used to encode optical signals carried by the optical networks. Different types of optical modulation incur different optical impairments, which may degrade the fidelity of the optical signals by reducing the optical signal-to-noise ratio (OSNR). A method or corresponding apparatus in an example embodiment of the present invention provides a planning tool for deploying an optical network in a manner based on the optical modulation that reduces the cost and complexity of the deployed network. In one embodiment, the disclosed planning tool may adjust a model of the optical network to be deployed by changing the topology and/or the number and/or type of optical network elements in response to optical impairments for a given optical modulation.

Router advertisement for multiple stack scenario

It is provided an apparatus, comprising advertisement receiving means adapted to receive an advertisement message according to a first network layer protocol, wherein the advertisement message comprises a flag, a network layer address according to a second network layer protocol different from the first network layer protocol, and a first link layer address; flag detecting means adapted to detect if the flag is set in the advertisement message; routing table setting means adapted to set the first link layer address as a router address in a routing table of the second network layer protocol if the flag is set; and directing means adapted to direct a message of the second network layer protocol to the router address as a first hop router.

Information system, control apparatus, method of providing virtual network, and program

An information system of the present invention includes a plurality of physical nodes each of which processes a packet received from external node(s) according to a processing rule (packet handling operation) that associates a matching rule for identifying a flow and processing content to be applied to a packet that matches the matching rule, and a control apparatus which sets the processing rule in each of the plurality of physical nodes, thereby causing the plurality of physical nodes to operate as virtual nodes on a virtual network(s) usable by the external node(s). The control apparatus includes a first storage unit defining a correspondence relationship between each of the plurality of physical nodes and virtual network(s), and a second storage unit defining a correspondence relationship between each of the external node(s) and virtual node(s) on virtual network(s). The control apparatus determines the virtual network(s) and the virtual node(s) to which the external node(s) is to be connected, based on information on the physical node(s) to which the external node is connected and information on the external node(s).

Synchronization topology and route analytics integration

Various exemplary embodiments relate to a method and related network node including one or more of the following: displaying, by the network management system, a first representation of a synchronization topology, wherein the synchronization topology includes a set of network elements and a set of peers; identifying a set of peers to be monitored; receiving an indication that a network path associated with a peer of the set of peers to be monitored has changed; and displaying an alarm indication.

Systems and Methods for Creating, Managing and Communicating Users and Applications on Spontaneous Area Networks

A Spontaneous Area Network (SPAN) is formed by mobile and fixed nodes using wireless transmission links between nodes, usually in a nearby geographical area. Applications allow users to create, join, leave, and manage SPANs and groups in a SPAN. Automatic procedures allow nodes to join other SPANs. Transmission power of the wireless network interface is dynamic, varying depending on battery level, type of information to transmit, state and topology of the network. A delay tolerant object layer abstraction creates, modifies, deletes, publishes, and handles Delay Tolerant Distributed Objects (DTDOs). A Patient Transport Protocol (PTP) ensures a reliable transport of information through the network while avoiding congestion conditions. An aggressive and explosive network protocol (AGENET) has routing and forwarding capacities and uses datagrams to establish communication between different nodes of the SPAN. Cooperation and diversity are exploited to react to node mobility that causes frequent changes in network topology and disconnections. 1. A Delay-Tolerant Object Layer Abstraction system comprising:a first create interface to a first application on a first node, the first create interface receiving a data object from the first application and creating from the data object a first Delay-Tolerant Distributed Object (DTDO) in a first memory on the first node;wherein the first memory is a solid-state memory or a magnetic memory powered by a battery on the first node;a second request interface to a second application on a second node, the second request interface sending a second request from the second node to the first node, the second request causing the first node to transmit the first DTDO to the second node to create a second copy of the first DTDO, the second copy stored in a second memory on the second node; anda third request interface to a third application on a third node, the third request interface sending a third request from the third node to the second ...

ROUTE CALCULATION METHOD AND MASTER NODE DEVICE IN VIRTUAL NETWORK ELEMENT

The present invention provides a route calculation method and a master node device in a virtual network element. The method includes: receiving and storing, by the master node, topology information; performing, according to a topology type of the VNE, topology verification for all topology information locally stored on the master node; and calculating, after the topology verification is passed, internal paths in the VNE and weights of the internal paths, generating and storing an internal routing entry, and sending the internal routing entry to nodes except the master node in the VNE. Therefore, in various topology structures, such as a dual-homing tree, a ring, and a half ring, calculation of the internal routes in the VNE and load balancing within the VNE can be implemented. 1. A route calculation method in a virtual network element , comprising:receiving and storing, by a master node in the virtual network element, first topology information reported by nodes except the master node in the virtual network element;performing, by the master node, according to a topology type of the virtual network element, topology verification for all topology information locally stored on the master node, wherein the locally stored topology information comprises second topology information about the master node and the first topology information;calculating, by the master node, internal paths in the virtual network element and weights of the internal paths according to the topology type and the locally stored topology information after the topology verification is passed; andgenerating and storing, by the master node, an internal routing entry according to the internal paths and the weights of the internal paths and sending the internal routing entry to the nodes except the master node in the virtual network element.2. The method according to claim 1 , before the receiving and storing claim 1 , by the master node in the virtual network element claim 1 , the first topology ...

Method and Device for Processing Data Cell

A method and device for processing data cells are disclosed. The method includes: configuring a unicast routing table which includes a corresponding relation between unicast destination addresses and port trunking (Trunks), and a multicast routing table which includes a corresponding relation between multicast group addresses and Trunks; receiving data cells; determining a corresponding Trunk according to types of the data cells, if the data cell is a unicast cell, extracting a destination address of the unicast cell, querying the unicast routing table, and obtaining a Trunk corresponding to the unicast cell; and if the data cell is a multicast cell, extracting a multicast group address of the multicast cell, querying the multicast routing table, and obtaining one or more Trunks corresponding to the multicast cell; and selecting an output link from the determined Trunks according to a preset load balancing policy, and sending data cells through the selected output link.

Methods and apparatus to determine a capacity for a network layer topology

Methods and apparatus to determine a capacity for a network topology are disclosed herein. An example method includes accessing a topology comprising a plurality of links; applying weights to the links; selecting a traffic element, the selected traffic element comprising a source node, a destination node, and a traffic demand; for each of the links: (a) determining for a selected link from the plurality of the links, whether the selected traffic element may be routed on the selected link without adding capacity to the selected link; and (b) applying penalties to the weights associated with the links that cannot support the selected traffic element without adding capacity; determining, based on the weights and penalties of the links, a routing path comprising at least one of the links between the source node and the destination node; and determining capacities of at least some of the links based on the routing path.

Optimization for Trill LAN Hellos

Systems and methods may be provided embodying an optimized Trill LAN network hello mode. The optimized hello mode may allow the number of LAN hellos exchanged to be reduced significantly in a steady state mode of operation. No modifications to the current Trill specification are needed and in a converged state (when designated RBridge election and appointed forwarder appointments are complete), only 1 hello PDU per RBridge is originated in every hello interval.

Systems and Methods for Creating, Managing and Communicating Users and Applications on Spontaneous Area Networks

A Spontaneous Area Network (SPAN) is formed by mobile and fixed nodes using wireless transmission links between nodes, usually in a nearby geographical area. Applications allow users to create, join, leave, and manage SPANs and groups in a SPAN. Automatic procedures allow nodes to join other SPANs. Transmission power of the wireless network interface is dynamic, varying depending on battery level, type of information to transmit, state and topology of the network. A delay tolerant object layer abstraction creates, modifies, deletes, publishes, and handles Delay Tolerant Distributed Objects (DTDOs). A Patient Transport Protocol (PTP) ensures a reliable transport of information through the network while avoiding congestion conditions. An aggressive and explosive network protocol (AGENET) has routing and forwarding capacities and uses datagrams to establish communication between different nodes of the SPAN. Cooperation and diversity are exploited to react to node mobility that causes frequent changes in network topology and disconnections.

Method & apparatus for the distribution of network traffic

A packet network device, such as a router or switch, includes functionality that operates to receive network traffic, process the traffic as needed and to forward the traffic to its destination. Additionally, each router includes a weighted equal cost multipath routing function that operates to identify equal cost paths over which to forward the network traffic, to calculate a path weighting that is dependent upon the path bandwidth and to forward the traffic ingressing to it over each of the equal cost paths according to the calculated path weighting.

Location of Unprotected Access Points Through Protected Access Points

A solution for locating unprotected access points is provided. Particularly, a wireless network access point providing an access to a network over a wireless connection maintains a location structure comprising an indication of a geographical position of each one of a set of unprotected access points in proximity of the access point, each unprotected access point providing the access to the network at least partially unconditionally. A mobile station submits a request to access the network to the access point when the mobile station is within a transmission range thereof, receives the indication of the geographical position of at least part of the unprotected access points in response to a denial of the access from the access point, and outputs directions towards one of the unprotected access points according to the corresponding geographical position.

TRANSMISSION DEVICE, TRANSMISSION METHOD, AND COMPUTER-READABLE RECORDING MEDIUM

A transmission device includes a memory which stores a program, and a processor which executes, based on the program, a procedure including calculating a difference between a first time when a frame is received by a first port which is in a blocked state and a second time when the frame is received by a second port which is not in a blocked state, and correcting a frame received after topology of a network is changed in accordance with states of the first and second ports after the topology is changed and the difference. 1. A transmission device comprising:a memory which stores a program; anda processor which executes, based on the program, a procedure includingcalculating a difference between a first time when a frame is received by a first port which is in a blocked state and a second time when the frame is received by a second port which is not in a blocked state, andcorrecting a frame received after topology of a network is changed in accordance with states of the first and second ports after the topology is changed and the difference.2. The transmission device according to claim 1 ,wherein the procedure includesdetermining whether the blocked state of the first port is cancelled and the first port is selected as a root port after the topology is changed,determining whether a port selected as a designated port before and after the topology is changed exists, anddetermining whether correction of the frame received after the topology is changed is available, andwherein, when it is determined that the correction of the frame received after the topology is changed is available and the frame is transferred from the first port to the port selected as the designated port, the correction of the frame which is received after the topology is changed is performed.3. The transmission device according to claim 1 ,wherein the correction of the frame received after the topology is changed is performed by adding the difference to a value of a correction field included in the ...

System, Method, and Apparatus for Electronic Patient Care

A method implemented by an operative set of processor executable instructions configured for execution by a processor includes: determining if a monitoring client is connected to a base through a physical connection; establishing a first communications link between the monitoring client and the base through the physical connection; updating, if necessary, the interface program on the monitoring client and the base through the first communications link; establishing a second communications link between the monitoring client and the base using the first communications link; and communicating data from the base to the monitoring client using the second communications link. 1. A system for electronic patient care , the system comprising:a medical sensor configured to couple to a patient and measure a physiological parameter of the patient;a medical device configured to operatively receive the measured physiological parameter from the medical sensor, the medical device configured to communicate the measured physiological parameter; anda server in operative communication with the medical device to receive the measured physiological parameter for storage therein.2. The system according to claim 1 , wherein:the medical sensor is configured to receive an interrogation signal to at least partially power the medical sensor, andthe medical device includes an interrogator circuit configured to interrogate the medical sensor to receive the measured physiological parameter.3. The system according to claim 1 , wherein:the medical sensor includes an accelerometer and the measured physiological parameter is a movement of the patient, andthe medical device is configured to alarm if the movement of the patient does not exceed a predetermined threshold of movement.4. The system according to claim 1 , further comprising a second medical sensor configured to couple to the patient and measure a second physiological parameter of the patient.5. The system according to claim 4 , wherein the ...

End-to-end multipathing through network having switching devices compatible with different protocols

A first cluster includes first switching devices that are compatible with a software-defined networking (SDN) protocol. A second cluster includes second switching devices within or partially overlapping the first cluster. Each second switching device is compatible with a protocol for an open systems interconnection (OSI) model layer. The first switching devices include one or more border switching devices located at a boundary between the first cluster and the second cluster. Each border switching device is also compatible with the protocol for the OSI model layer. The first switching devices effect first multipathing through the network except through the second cluster, and the second switching devices effect second multipathing just through the second cluster of the network. As such, the first switching devices and the second switching devices together effect end-to-end multipathing through both the first cluster and the second cluster of the network.

Method of Network Connectivity Analyses and System Thereof

There are provided network analyzer and method of analyzing connectivity between a source and a destination. The method comprises: upon obtaining a partial topological network model comprising at least one cloud, generating the one or more paths between the source and the destination, specifying the cloud as a source point of the one or more paths if at least one source network address belongs to the cloud address space and specifying the cloud as a destination point of the one or more paths between the source and the destination if at least one destination network address belongs to the cloud address space. The method further comprises discovering at least one on-path cloud, the method further comprising specifying, by the processor, the at least discovered on-path cloud as a router configured to route the cloud traffic in accordance with predefined rules. 1. A method of analyzing , by a network analyzer comprising a processor operatively coupled to a memory , connectivity between a source and a destination characterized , respectively , by one or more source network addresses and one or more destination network addresses , the method comprising:upon obtaining in the memory a partial topological network model comprising at least one cloud comprising at least one unmonitored router, the cloud characterized by a cloud address space and connected to one or more monitored routers, specifying by the processor at least one pair of end points of one or more paths between the source and the destination, wherein the cloud is specified as a source point of the one or more paths if at least one source network address belongs to the cloud address space and the cloud is specified as a destination point of the one or more paths between the source and the destination if at least one destination network address belongs to the cloud address space; andgenerating by the processor the one or more paths between the specified at least one pair of the end points.2. The method of wherein ...

Defining Data Flow Paths in Software-Defined Networks with Application-Layer Traffic Optimization

A method implemented by a software defined network (SDN) controller, the method comprising receiving, from a network node, a request for path optimization, wherein the request comprises information identifying the network node and a destination node, forwarding the request to an application layer traffic optimization (ALTO) server, receiving, from the ALTO server, path information that identifies a plurality of SDN domains to be traversed from the network node to the destination node, wherein the plurality of SDN domains comprises a first SDN domain, in which the SDN controller resides, and a second SDN domain, in which an edge node known by the SDN controller resides, and determining a first path segment from the network node to the edge node. 1. A method implemented by a software defined network (SDN) controller , the method comprising:receiving, from a network node, a request for path optimization, wherein the request comprises information identifying the network node and a destination node;forwarding the request to an application layer traffic optimization (ALTO) server;receiving, from the ALTO server, path information that identifies a plurality of SDN domains to be traversed from the network node to the destination node, wherein the plurality of SDN domains comprises a first SDN domain, in which the SDN controller resides, and a second SDN domain, in which an edge node known by the SDN controller resides; anddetermining a first path segment from the network node to the edge node.2. The method of claim 1 , wherein the information in the request identifies a set of destination nodes claim 1 , wherein the path information from the ALTO server comprises an order of the destination nodes and further identifies one or more SDN domains for each of the destination nodes claim 1 , and wherein the order represents a level of preference to be used by the network node.3. The method of claim 1 , wherein the information in the request comprises network addresses of the ...

Multicast service in virtual networks

Techniques are described to provide multicast service within a virtual network using a virtual network controller and endpoint replication without requiring multicast support in the underlying network. The virtual network controller is configured to create a multicast tree for endpoint devices of a multicast group in the virtual network at a centralized location instead of in a distributed fashion. The virtual network controller communicates the multicast tree to one or more of the endpoint devices of the multicast group to instruct the endpoint devices to replicate and forward multicast packets to other endpoint devices according to the multicast tree. The replication and forwarding of multicast packets is performed by virtual switches executed on the endpoint devices in the virtual network. No replication is performed within the underlying network. The techniques enable multicast service within a virtual network without requiring multicast support in the underlying network.

RELAY FORWARD SYSTEM, PATH CONTROL DEVICE, AND EDGE APPARATUS

In a relay forward system, in setting a label switched path between edge nodes: information which is dependent on a user network such as routing information in the user network, which is also referred to as user network routing information, and information which is dependent on a label switching network such as a relay route of a label switched path and a path ID for specifying a label switched path, which is also referred to as internode path information are separated from each other; and are also managed separately in the whole relay forward system, to thereby control forwarding of a packet. 1. A relay forward system , comprising:a routing control device that: stores, in a storage unit thereof, internode path information which includes information on a first edge apparatus connected to a first user network, on a second edge apparatus connected to a second user network, and on a relay route from the first edge apparatus to the second edge apparatus, in association with each other, and user network routing information which includes information on a destination address of a packet received from the first user network and on the second edge apparatus, in association with each other; and transmits the internode path information and the user network routing information to the first edge apparatus;the first edge apparatus that, when the packet is received from the first user network, references the internode path information and the user network routing information, identifies the second edge apparatus to which the packet is to be forwarded, and forwards the packet to the identified second edge apparatus; andthe second edge apparatus that transmits the packet forwarded from the first edge apparatus, to the second user network.2. The relay forward system according to claim 1 ,wherein, when the packet is received from the first user network, the first edge apparatus extracts the destination address of the packet; extracts the second edge apparatus by searching the user ...

METHOD AND DEVICE FOR ESTABLISHING ROUTER NEIGHBOR

Embodiments of the present invention relate to a method and a device for establishing a router neighbor. The method includes: obtaining a first discovery protocol Hello message sent by a neighbor router, where the first Hello message carries identification information and priority information of the neighbor router; and determining whether to add the relevant information of the neighbor router into the neighbor list of a local end router, according to the priority information of the neighbor router, and/or priority information of the local end router, and/or whether the identification information of the neighbor router is identification information of an opposite end device of a virtual link configured for the local end router. The embodiments of the present invention ensure that a small device can establish neighbor relationships with a DR and a BDR on a network and that the small device's OSPF function is normal. 1. A method for establishing a router neighbor , the method comprising:obtaining a first discovery protocol Hello message sent by a neighbor router, wherein the first Hello message carries identification information and priority information of the neighbor router; anddetermining whether to add relevant information of the neighbor router into a neighbor list of a local end router, according to the priority information of the neighbor router, and/or priority information of the local end router, and/or whether the identification information of the neighbor router is identification information of an opposite end device of a virtual link configured for the local end router.2. The method according to claim 1 , wherein the first Hello message further carries a neighbor list of the neighbor router claim 1 , and if it is determined to add the relevant information of the neighbor router into the neighbor list of the local end router claim 1 , the method further comprises:judging whether the neighbor list of the neighbor router comprises relevant information of the ...

Distributed routing mechanisms for a virtual switch enabled by a trill-based fabric

In one embodiment, a system includes a routing protocol engine (RPE) RBridge which includes a local uplink port adapted to be coupled to a router, a local processor for executing logic, logic adapted for receiving a data frame at the local uplink port, logic adapted for running routing protocols to enable L3 processing of the data frame, and logic adapted for configuring learned routes and routes passed from another RPE RBridge in the local processor. In more embodiments, methods for providing L3 processing in a TRILL-enabled network include receiving a data frame at a local uplink port of a RBridge enabled with a RPE to enable L3 processing, running routing protocols to provide L3 processing of the data frame, and configuring learned routes and routes passed from any other RPE RBridges. The RPE RBridge may be connected to a router or to a first server and a second server.

Method and arrangement for providing security through network address translations using tunneling and compensations

This invention provides a method for providing network security services, such as those provided by the IPSEC protocol, through network address translation (NAT). The method is based on determining the transformations that occur on a packet and compensating for the transformations. Because only TCP and UDP protocols work through NATs, the IPSEC AH/ESP packets are encapsulated into UDP packets for transport. Special operations are performed to allow reliable communications in such environments.

Efficient layer-2 multicast topology construction

One embodiment of the present invention provides a switch. The switch includes a processor and a computer-readable storage medium. The computer-readable storage medium stores instructions which when executed by the processor cause the processor to perform a method. The method comprises determining whether the switch is a leaf switch of a multicast distribution tree of a multicast group based on a multicast topology query message from a root switch of the multicast distribution tree. If the switch is a leaf switch, the method further comprises constructing a multicast topology report message comprising layer-2 topology information of the multicast group associated with the switch.

APPARATUS AND METHOD TO HIDE TRANSIT ONLY MULTI-ACCESS NETWORKS IN OSPF

In one embodiment, a first router determines whether a network coupling the first router to one or more second routers is transit-only, wherein transit-only indicates connecting only routers to provide for transmission of data from router to router. When the network is transit-only, the first router generates an Open Shortest Path First (OSPF) Link State Advertisement (LSA) that includes an address for the network and a designated network mask. The designated network mast operates as a transit-only identification that indicates the address should not be installed in a Routing Information Base (RIB) upon receipt of the OSPF LSA at the one or more second routers. When the network is not transit-only, the first router generates an OSPF LSA that includes the address for the network but does not include the designated network mask, to permit installation of the address in a RIB upon receipt of the OSPF LSA at the one or more second routers. 1. A method comprising:determining, by a first router, whether a network coupling the first router to one or more second routers is transit-only, wherein transit-only indicates connecting only routers to provide for transmission of data from router to router; 'generating an Open Shortest Path First (OSPF) Link State Advertisement (LSA) that includes an address for the network and a designated network mask, the designated network mast operating as a transit-only identification that indicates the address should not be installed in a Routing Information Base (RIB) upon receipt of the OSPF LSA at the one or more second routers; and', 'when the network is transit-only,'} 'generating an OSPF LSA that includes the address for the network but does not include the designated network mask, to permit installation of the address in a RIB upon receipt of the OSPF LSA at the one or more second routers.', 'when the network is not transit-only,'}2. The method of claim 1 , wherein the designated network mask is 0xffffffff.3. The method of claim 1 , ...

Monitoring method and apparatus

A disclosed monitoring method is executed by a computer. The monitoring method includes detecting an event occurred in a monitoring target; specifying data of an event which corresponds with the detected event, by searching a first storage storing at least data of an event, which occurred when maintenance on the monitoring target started, or data of an event, which occurred when the maintenance on the monitoring target ended; and outputting data indicating that the maintenance on the monitoring target started or ended when data of an event, which corresponds with the detected event, is specified.

NETWORK ROUTING USING INDIRECT NEXT HOP DATA

A router maintains routing information including (i) route data representing destinations within a computer network, (ii) next hop data representing interfaces to neighboring network devices, and (iii) indirect next hop data that maps a subset of the routes represented by the route data to a common one of the next hop data elements. In this manner, routing information is structured such that routes having the same next hop use indirect next hop data structures to reference common next hop data. In particular, in response to a change in network topology, the router need not change all of the affected routes, but only the common next hop data referenced by the intermediate data structures. This provides for increased efficiency in updating routing information after a change in network topology, such as link failure. 1. A method comprising:storing, within a network device, a forwarding tree that includes a set of hierarchically arranged nodes, wherein the set of nodes includes a root node, a plurality of intermediate nodes, and a plurality of leaf nodes, wherein the leaf nodes store data pointers to data structures that are external to the forwarding tree, wherein the data structures store next hop data, and wherein at least two of the leaf nodes each include a corresponding data pointer that points to a same one of the data structures that is external to the forwarding tree;receiving a network update packet at the network device, wherein the network update packet comprises network update information; andupdating network routes for future packets by modifying the next hop data in the data structures that are external to the forwarding tree without modifying the forwarding tree, wherein modifying the next hop data includes changing a specific next hop identified by the same data pointer that is included in the at least two of the leaf nodes so as to alter routes defined by the at least two of the leaf nodes of the forwarding tree without altering data stored within the ...

Method and Apparatus for the Fast Detection of Connectivity Loss Between Devices in a Network

A method and apparatus for quickly determining the status of a network device in a network communicates status inquiry messages over the forwarding plane of one network device to at least one neighboring network device. The status inquiry messages indicate the connectivity status with at least one neighboring network device.

Method and Apparatus for the Fast Detection of Connectivity Loss Between Devices in a Network

A method and apparatus for quickly determining the status of a network device in a network communicates status inquiry messages over the forwarding plane of one network device to at least one neighboring network device. The status inquiry messages indicate the connectivity status with at least one neighboring network device.

Method, apparatus and system for neighbor discovery

A method for neighbor discovery including: transmitting a neighbor detection message according to a neighbor VLAN information table, where the neighbor VLAN information table includes neighbor VLAN information; receiving a neighbor response message with which a terminal responds; acquiring a MAC address of the terminal according to the neighbor response message. With the method, numerous invalid detections, heavy apparatus load and large CPU resource consumption caused by traversing a public network VLAN and a private network VLAN to conduct neighbor detection decease.