Entries |
Document | Title | Date |
20080205412 | Multiple-instance meshing - One embodiment disclosed relates to a switching system. The switching system includes first, second, and third sets of switches. The first set of switches is configured with a first instance of meshing software such that the switches in the first set are members of a first mesh domain. The second set of switches is configured with a second instance of the meshing software such that the switches in the second set are members of a second mesh domain. The third set of switches is configured with both the first and second instances of the meshing software such that the switches in the third set are members of both the first and second mesh domains. Another embodiment disclosed relates to a packet switch apparatus executing multiple instances of meshing software. Another embodiment disclosed relates to a method of configuring a switching system having multiple mesh domains. | 08-28-2008 |
20080212593 | Automatic Adaptation of Quality of Service Over Packet-Switched Networks - An end node in a packet-switched network is proposed wherein the end node is arranged to exchange packets consisting of a packet header and payload data with a server node connected to the packet-switched network. The end node includes at least one module adapted to extract quality of service parameter values from the headers of packets received over the packet-switched network and to insert the extracted quality of service parameter value in the headers of packets destined for transmission to the server node over the packet-switched network. In this manner the end node automatically adapts the quality of service parameters received over the packet-switched network to correspond with the type of quality of service defined in received packets. Such a system means that only the server node need be configured with the quality of service parameters applicable on the particular packet switched network, so greatly reducing the installation and configuration overheads in a multi-user network. | 09-04-2008 |
20080219271 | IP multicast based systems, apparatuses and methods for TCP connection migration - Systems, apparatuses and methods for changing an address during a session between at least two network nodes is described, wherein at least one network node is able to change its address, comprising associating the session with a network routing entity performing group-based routing, changing the address of at least one of the network nodes, sending a address change request from the at least one network node having changed its address to the network routing entity, and forwarding the address change request to the at least one other network node involved in the session. | 09-11-2008 |
20080225861 | Installation of Intelligent Sensors for the High-Speed Acquisition of Data Via an Ethernet Network - The invention concerns an installation for the high-speed acquisition of acquisition data via an Ethernet network ( | 09-18-2008 |
20080225862 | Method and Arrangement Relating to Messaging - An arrangement for handling control signal messaging in a distributed system comprising a number of sending nodes and a number of receiving nodes and implementing a control signaling communication protocol. The sending and/or the receiving node is adapted to send and/or receive the current message as a compressed message comprising only the difference portion between a selected or preferred previous message and the current message and the unique identity of said previous message. | 09-18-2008 |
20080225863 | DATA PROCESSING SYSTEM, METHOD AND INTERCONNECT FABRIC SUPPORTING MULTIPLE PLANES OF PROCESSING NODES - A data processing system includes a first plane including a first plurality of processing nodes, each including multiple processing units, and a second plane including a second plurality of processing nodes, each including multiple processing units. The data processing system also includes a plurality of point-to-point first tier links. Each of the first plurality and second plurality of processing nodes includes one or more first tier links among the plurality of first tier links, where the first tier link(s) within each processing node connect a pair of processing units in the same processing node for communication. The data processing system further includes a plurality of point-to-point second tier links. At least a first of the plurality of second tier links connects processing units in different ones of the first plurality of processing nodes, at least a second of the plurality of second tier links connects processing units in different ones of the second plurality of processing nodes, and at least a third of the plurality of second tier links connects a processing unit in the first plane to a processing unit in the second plane. | 09-18-2008 |
20080232380 | Network system and audio signal processor - An audio network system that performs transport of audio signals among nodes by cascading a plurality of nodes each including two sets of transmission I/Fs and reception I/Fs, and circulating among the nodes in each fixed period an audio transport frame generated by a master node, is configured such that the master node generates the audio transport frame in an S-th period based on the audio transport frame in an (S−k)-th period, and each of the other nodes delays the audio signals written by another node after the audio transport frame is generated by the master node until the audio transport frame is transmitted to the self node, by k period(s) with respect to the other audio signals, for use in signal processing. | 09-25-2008 |
20080232381 | Method, terminal and media-relay for establishing a multi-media connection - In one aspect, a multi-media connection is established in a communications system based on packet oriented communication with at least a first station only supporting IPv6 data-packets, at least a second station only supporting IPv4 data-packets and at least a media relay station. A communication between the first station and the second station is at least partially established via the media relay station. A terminal and a media relay are also provided. | 09-25-2008 |
20080240115 | Treatment of Data in Networks - The invention relates to data networks, to nodes making up parts of data networks, and to information relating to the characterisation of paths taken by data travelling between nodes in the networks. Path characterisation information is arranged to be conveyed to nodes such that it may be used by nodes subsequently forwarding data. In particular the invention relates to nodes receiving such path characterisation information from upstream nodes, deriving therefrom information indicative of characteristics of a path downstream of said nodes, and using such information to make informed decisions such as routing decisions when forwarding data onward in data networks. | 10-02-2008 |
20080240116 | Method and Apparatus for Determining the Locating of Nodes in a Wireless Network - A method and apparatus for determining the relative locations of nodes in a wireless network is disclosed. A list of neighboring nodes of a master node of the wireless network is generated and, from this list, a list of independent nodes is generated. An adjacency table for the independent nodes is then generated by examining the neighbors of dependent nodes. Two independent nodes are determined to be adjacent nodes only if they are the only neighboring nodes of a dependent node. Relative locations of nodes in wireless network may be determined from the adjacency table. | 10-02-2008 |
20080240117 | System, Method, and Interworking Function for Interfacing MMS and IMS Messaging Systems - A system, method, and interworking function for interfacing the Multimedia Messaging Service (MMS) and IP Multimedia Subsystem (IMS) messaging systems. When an Multimedia Messaging Service Center (MMSC) receives an MMS message, the MMSC determines whether the message is addressed to an MMS user or an IMS user. If addressed to an MMS user, the MMSC routes the MMS message to an email server for forwarding to another MMSC. If addressed to an IMS user, the MMSC routes the MMS message to the interworking function. The interworking function converts a destination address in the MMS message to a destination address for the IMS user that is routable through a Session Initiation Protocol (SIP) core network. The message may be mapped to a SIP MESSAGE format or an MSRP format and sent through the SIP core network to the addressed IMS user. | 10-02-2008 |
20080240118 | Sending Routing Protocol Data on a Multi-Access Network Segment - In one embodiment, a method includes setting a re-flood time to a non-zero first value. Update data that indicates a change to link data is received over a network interface from an updating node of multiple nodes on a multi-access segment connected to the interface. The change is to link data that indicates links on the updating node. It is determined whether an acknowledgment message is not received within the re-flood time from a particular node of the multiple nodes. If an acknowledgment message is not received within the re-flood time, then a multicast packet directed to the multiple nodes and including the change to the link data is sent over onto the segment. This method enables rapid response to failure of a primary node designated to ensure reliable flooding of link data. | 10-02-2008 |
20080240119 | User interface for modeling estimations of resource provisioning - User interfaces are described for modeling estimations of resource provisioning. An example user interface may request a display of graphical indicators associated with nodes and edges, request a determination of an indicator of a service node workload associated with a service node included in a workflow path based on attribute values associated with the service node and an indicator of a propagated workload, and request provisioning of service nodes onto hardware nodes. The nodes may include external invocation nodes, service nodes, and hardware nodes, and the edges may include node connectors. An indication of an arrangement of an external invocation node, a group of service nodes, a group of node connectors, and a group of hardware nodes may be received, wherein the arrangement may be configured by a user interacting with the displayed graphical indicators, and may represent a workflow path. | 10-02-2008 |
20080240120 | COMMUNICATION NETWORK SYSTEM - In an MPLS/GMPLS network, a link used by a communication path for each hop and adaptations used at the boundary between management domains or layers are appropriately and automatically selected according to a service type and a required maintenance condition, without making a control sequence complicated. First, a unit for requesting path establishment by including an identifier of a service to be provided and a service attribute in a communication path establishment control message is provided for a source node. Second, a unit for determining a required maintenance condition for a communication path and adaptations according to the service identifier and/or the service attribute is provided for each node. Third, links and nodes through which the communication path passes are determined by comparing each of achievable maintenance conditions for network resources with the required maintenance condition. The determined links, nodes, adaptations are specified as operation parameters in switches and/or interfaces. | 10-02-2008 |
20080253382 | Multiple Interface Mobile Node With Simultaneous Home- And Foreign Network Connection - The invention relates to a method for node management in a packet-switched network, wherein a first node acts as a proxy for a second node, both nodes having network-layer addresses and link-layer addresses, the network-layer addresses at the network layer and the link-layer addresses at the link layer being used for communication in the packet-switched network. The method comprises the following steps performed by the first node: The first node receives from the second node a request to receive and forward packets addressed to the second node's network-layer address, whereby the same network-layer address is associated with the first node and the second node, and the first node and the second node have distinct link-layer addresses. The first node advertises to nodes attached to the packet-switched network the first node's link-layer address as a destination address for the second node's network-layer address, while the second node does not advertise. The first node receives in response to advertising, packets destined to the second node's network-layer address having the first node's link-layer address; and forwards packets addressed to the second node's network-layer address to the second node using its link-layer address. | 10-16-2008 |
20080259937 | Circuit Arrangement and Method for the Analysis of a Network - According to one aspect a network analyzer is configured such that destination addresses are allocated to measured quality-of-service values in network transfer units. Addresses of network nodes which do not meet the expected quality of service values are determined in a central network management system. An adequate quality-of-service can be maintained in the network by isolating the network nodes. | 10-23-2008 |
20080259938 | SESSION ANNOUNCEMENT SYSTEM AND METHOD - A cluster system and method. The cluster includes a first and a second interface and two or more nodes, wherein each node is connected to the first and second interfaces, wherein exactly one node includes a first redirector and wherein exactly one node includes a second redirector. The first and second redirectors include means for establishing and tracking sessions and means for forwarding packets to the chosen node. The chosen node receives a packet from the first redirector and uses the packet to send a Session Announcement to the second redirector. | 10-23-2008 |
20080259939 | Method for distributing resources to network nodes in a decentralized data network - A method is disclosed for distribution of resources to network nodes in a decentralized data network. In at least one embodiment of the method keywords, which are allocated to digital resources, are mapped onto digital bit sequences. These bit sequences are modified, with the subsequent bits after a predetermined bit position, preferably being replaced by random bits. A mapping onto bit sequences is then undertaken with these modified bit sequences, with each network node being responsible for a specific range of values of indices. The resource will then be allocated the index which is produced by the mapping. The mapping in this case can be selected so that a wildcard search according to keywords is guaranteed. The outstanding feature of the method is that the resources are distributed evenly in the decentralized network and at the same time a fast wildcard search according to truncated keywords is made possible. | 10-23-2008 |
20080259940 | METHOD AND APPARATUS FOR PEER-TO-PEER CONNECTION ASSISTANCE - One embodiment of the present method and apparatus for assisting a peer-to-peer connection between a first node and a second node includes receiving, at a third node, a request for connection assistance from one of the first and second nodes. The third node then connects to both the first node and the second node, receives the data from the first node and delivers the data to the second node. In this manner, data may be transferred between the first and second nodes even if the first and second nodes are unable to directly connect to each other (e.g., due to permanent or temporary limitations). | 10-23-2008 |
20080273541 | Linked-list hybrid peer-to-peer system and method for optimizing throughput speed and preventing data starvation - According to one embodiment, a system and method is described for formulating a linked-list hybrid peer-to-peer sub-network that analyzes capabilities of a plurality of nodes, and creating at least two linked-list hybrid peer-to-peer sub-networks by forming a first group of nodes of the plurality of nodes having similar capabilities and establishing serial connections between nodes of the first group of nodes to form a first linked-list hybrid peer-to-peer sub-network. | 11-06-2008 |
20080273542 | Communication Apparatus - A communication apparatus according to the invention can be applied to constitute each of relay nodes provided to constitute a novel communication network which avoids electric wave collision arising on a communication channel without carrying out “carrier sense” or operations for transmitting and receiving control information, such as “RTS”, “CTS”, and so no. The communication apparatus comprises a temporary managing portion | 11-06-2008 |
20080279198 | Method for the Transmission of Information in a Communication System Using a Path - A method transmits information in a communication system with a number of nodes. At least one node receives a message including the details of a path, running from a source node, though the at least one node, to a target node. The at least one intermediate node, using the details of the at least one path, stores identification information concerning the nodes, adjacent to the at least one node, along the at least one path and transmits the message further along the at least one path. A node in the communication system is also described. | 11-13-2008 |
20080279199 | Power Line Communication System and Communication Device Used in the System - A lock device having a lever is disclosed, in which the lever is released to rotate a latch bolt only if a correct electronic key is authenticated while the latch bolt is hooked over the lever at normal times. In the lock device of the present invention, having a latch bolt which is placed to rotate for opening a door once an electronic key is authenticated by its recognition or entering a password, the lock device comprises a motor rotated in one direction by a signal input after the electronic key is authenticated; a pinion assembly connected with a rotation axis of the motor and rotated by an operation of the motor; a lever having one end hooked over a projection formed in the latch bolt so as not to rotate the latch bolt at normal times, connected with the pinion assembly, and rotated by rotation of the motor to release binding state of the latch bolt once the electronic key is authenticated; and the latch bolt not rotated at normal times as its projection is hooked over the lever, and rotated as the projection is released by rotation of the lever once the electronic key is authenticated. Therefore, the lock device makes the manufacture easy and improves reliability of the operation. | 11-13-2008 |
20080285570 | Method for Managing an Interconnection Between Telecommunication Networks and Device Implementing this Method - This invention concerns a method of managing a telecommunication network ( | 11-20-2008 |
20080285571 | Media Data Processing Using Distinct Elements for Streaming and Control Processes - A hardware accelerated streaming arrangement, especially for RTP real time protocol streaming, directs data packets for one or more streams between sources and destinations, using addressing and handling criteria that are determined in part from control packets and are used to alter or supplement headers associated with the stream content packets. A programmed control processor responds to control packets in RTCP or RTSP format, whereby the handling or direction of RTP packets can be changed. The control processor stores data for the new addressing and handling criteria in a memory accessible to a hardware accelerator, arranged to store the criteria for multiple ongoing streams at the same time. When a content packet is received, its addressing and handling criteria are found in the memory and applied, by action of the network accelerator, without the need for computation by the control processor. The network accelerator operates repetitively to continue to apply the criteria to the packets for a given stream as the stream continues, and can operate as a high date rate pipeline. The processor can be programmed to revise the criteria in a versatile manner, including using extensive computation if necessary, because the processor is relieved of repetitive processing duties accomplished by the network accelerator. | 11-20-2008 |
20080291924 | Transmission device - According to an aspect of an embodiment, a transmission device, that automatically generates transmission paths within a transmission network, includes a storing unit that stores first information that indicates an end user to which a link, where a transmission path is contained, and a path bandwidth, which is used to generate the transmission path, are assigned and second information that indicates whether the path can be shared each of the end users; and a sending unit sending third information to identify the end user and the second information to a adjacent node. | 11-27-2008 |
20080291925 | METHOD AND APPARATUS FOR INTERACTIVE ROUTING - A method to provision routes in a network having a plurality of nodes and a plurality of links connecting various nodes. The method includes determining a route between a designated source node and a designated destination node based on a preselected routing algorithm and one of (i) a designated node of interest and (ii) a designated link of interest, and outputting information indicating the determined route. | 11-27-2008 |
20080291926 | Distributed content storage system, content storage method, node device, and node processing program - A node device included in a distributed content storing system configured that a plurality of content data are distributed and stored in a plurality of node devices mutually communicable through a network, and node information of the node device storing the above content data is registered in the node device administrating the content data, the node device including:
| 11-27-2008 |
20080291927 | Policy Based and Link Utilization Triggered Congestion Control - An apparatus comprising a plurality of ingress ports coupled to a plurality of upstream nodes, the ingress ports having an incoming data rate; and a plurality of egress ports coupled to the ingress ports and an aggregated link comprising a plurality of links, the aggregated link having a bandwidth capacity, wherein at least some of the upstream nodes reduce their data transfer rates to a rate greater than zero when the incoming data rate is greater than or about equal to the aggregated link's bandwidth capacity. Also disclosed is a network component comprising a processor configured to implement a method comprising varying a plurality of transmission rates at a rate greater than zero, wherein the transmission rates correspond to a plurality of nodes that send data over an aggregated link. | 11-27-2008 |
20080298376 | NETWORK COMMUNICATION WITH PATH MTU SIZE DISCOVERY - A method for network communication and an apparatus for discovery of a maximum transmission unit (MTU) size in a path between two nodes of a network are disclosed. A plurality of test packets of varying transmission unit (TU) size may be sent from the first host to the second host. A “do not fragment” (DF) flag for the test packets is not set. It is determined whether one or more of the test packets were received by the second host. An estimated path MTU for a network path between the first and second hosts size may then be calculated based on one or more patterns of receipt of the test packets by the second host. Once the estimated Path MTU size has been determined, message packets of a size less than or equal to the Path MTU size may be sent over the network path. | 12-04-2008 |
20080298377 | METHOD FOR PROCESSING DATA PACKETS WHILE COMMUNICATING WITH A MACHINE VIA ONE OR MORE SECONDARY NETWORKS - An apparatus and associated methodology for processing at least one data packet received by a receiving entity from a machine after transmission via at least one data transmission network. Identification data is obtained of a device involved in the transmission of said data packet. A decoding function associated with said device is identified using the identification data. The decoding function is an inverse function of an encoding function applied by the device to a packet before transmission. The received packet is decoded through the application of the decoding function. | 12-04-2008 |
20080304493 | ADAPTIVE DHT NODE RELAY POLICIES - In a distributed hash table overlay network, messages directed to a message ID are relayed one or more nodes that have published interest in that message ID. Messages are distributed, processed, and/or cached in accordance with relay policies, which enable a wide variety of different applications. Nodes to specify relay policies on a per-node, per-message, and/or per-message ID basis. Relay policies can specify any behavior associated with messages, including: message caching, distribution, and processing as well as migration of relay policies when nodes join or leave the network. Intermediate nodes can perform any arbitrary processing of message based on relay policies. Intermediate nodes can offload processing to other nodes, either by forwarding messages to a different message ID or by enlisting the help of nodes subscribed to the message ID. Messages can include one or more subfields specifying commands and/or data to be evaluated by the intermediate node. | 12-11-2008 |
20080304494 | COMMUNICATION DEVICE - A communication device comprising: a checking unit checking whether a bandwidth from the ingress of first path down to the egress thereof and a bandwidth from the ingress of second path down to the egress thereof as a standby of a partial zone of first path, are established or not; a route information management unit generating, when the checking unit confirms that the bandwidth from the ingress of first path down to the egress thereof and the bandwidth from the ingress of second path down to the egress thereof as the standby of the partial zone of first path are established, route maintaining information for maintaining the bandwidth of the partial zone of first path; and a transmission unit transmitting the route maintaining information generated by the route information management unit to the neighboring communication device on the side of the egress of first path. | 12-11-2008 |
20080310426 | Networks - A method for estimating a system state, for example an aircraft trajectory, in a decentralised network having a plurality of nodes, each node having means for receiving and sending information and means for processing information, and each node being connected to neighbouring nodes of the network, the method comprising, at each node:
| 12-18-2008 |
20080310427 | Method of Determining Reliability of Information - A method of determining reliability of information received at a destination ( | 12-18-2008 |
20080310428 | Method for Identifying Real-Time Traffic Hop by Hop in an Internet Network - A method for identifying real-time traffic hop by hop in an Internet network including a sender, a receiver, and routers in the network is provided. The method comprises steps of registering source port number and/or destination port number of the UDP respectively for RTP, RTCP and RTSP with the Internet Assigned Numbers Authority (IANA) under the Internet Engineering Task Force (IETF) arrangement, then in one aspect, adding in the UDP header a Session ID field for identifying the session. The method can be used to identify the frames of the Real-time Transport Protocol (RTP) hop by hop during the packet's transmission, and to provide priority for real-time traffic transport so as to provide a QoS guarantee for real-time traffic even in the case of dramatically increasing network traffic. | 12-18-2008 |
20080310429 | EQUIVALENT SWITCHING METHOD FOR TRANSMISSION DEVICES IN MPLS NETWORKS - In prior art, one of the problems of equivalent switching MPLS packets is that the transmission of MPLS packets is defined unidirectionally. The inventive method provides a solution to the problem in the form of a configuration which allows for bidirectional and 1:n unidirectional transmission (requiring a reverse LAN channel). Equivalent switching operations in the case of an error occurring when a working entity fails are administered in an efficient manner according to priority criteria and MPLS link information. | 12-18-2008 |
20080310430 | Control System, Data Message Transmission Method And Network Device In The Ethernet - A control system, a data transport method and a network device include: the control system obtains the link information in the Ethernet based on the layer 2 control protocol of the Ethernet, and establishes and maintains the network topology of the Ethernet based on the link information; the control system calculates the route connecting the endpoint bridges for the connection establishment request received by itself based on the network topology, and configures the transmission path information of the data system of each network bridge passed by the connection; the data system of each network bridge transmits the data packet based on the transmission path information. The implementation of the disclosure enables the data stream transferred in the Ethernet to be manageable and the data traffic in the Ethernet to be controllable. | 12-18-2008 |
20080317045 | Method and System for Providing Differentiated Service - The present invention relates to a method and a system for providing differentiated services (Diffservs). The core of the method is: determining a service level of the first hierarchy for a received service according to a type of the received service; determining a service level of the second hierarchy according to user requirements; providing service for the received service. The present invention can provide more possible QoS Diffserv levels using less resource, and can make better use of MPLS labels to provide traffic engineering service. | 12-25-2008 |
20080317046 | COMMUNICATION NODE AND COMMUNICATION ROUTE SELECTING METHOD - The present invention discloses a communication node including a communicating part connected to one or more communication ports, a deriving part configured to derive route candidates for transmitting a packet to a destination node with a connectionless oriented method, and a selecting part configured to select one of the communication ports to be used for transmitting the packet. The deriving part includes a user designation logic part configured to derive one or more of the route candidates with a logic designated by a user, a connection data processing part configured to select one or more of the route candidates based on connection data of each route, and a part configured to exclude at least a route passing a destination port having an unknown medium access control (MAC) address from the route candidates. The packet is transmitted from a communication port corresponding to the route that has not been excluded. | 12-25-2008 |
20090003355 | FRAMEWORK FOR CROSS-ECOSYSTEM AFFILIATE, VIRAL, AND WORD-OF-MOUTH ADVERTISING - Systems and/or methods are presented that can employ an ad object comprising a data packet(s) to facilitate providing an advertising platform that is ecosystem independent and can support various advertising models, such as affiliate, viral, and/or word-of-mouth (WOM) advertising. The data packet can be associated with an advertisement for a product(s) and/or service(s) and can include a mechanism(s) that facilitates enabling users to reproduce the data packet and associated advertisement in different sites, such as user sites. As the data packet propagates through a community network, the data packet can receive and accumulate data, such as data relating to purchases, comments, or ratings, storing such data in the data packet and displaying a portion of such data with the advertisement to facilitate WOM advertising. The data packet facilitates providing incentives to users who perform desired actions (e.g., purchases, syndication) related to the advertisement. | 01-01-2009 |
20090003356 | NODE DISCOVERY AND CULLING IN WIRELESS MESH COMMUNICATIONS NETWORKS - Methods and systems for providing a network and routing protocol for utility services are disclosed. A method includes discovering a utility network. Neighboring nodes are discovered and the node listens for advertised routes for networks from the neighbors. The node is then registered with one or more utility networks, receiving a unique address for each network registration. Each upstream node can independently make forwarding decisions on both upstream and downstream packets, i.e., choose the next hop according to the best information available to it. The node can sense transient link problems, outage problems and traffic characteristics. Information is used to find the best route out of and within each network. Each network node maintains multi-egress, multi-ingress network routing options both for itself and the node(s) associated with it. The node is capable of several route maintenance functions utilizing the basic routing protocol and algorithms. | 01-01-2009 |
20090003357 | Information communication system, information collection method, node device, and recording medium - An information communication system has features that efficient transmission of information to plural node devices can be carried out without a managing server, etc. and efficient collection of responses from the node devices can be carried out while suppressing loads imposed on a network. The information communication system has a means for receiving an information collection message from other node devices to the group, a means for transmitting an information collection message to one of the node devices in each of the groups when the group is further divided into plural groups, a means for receiving reply messages including response information, a means for generating new response information based on the response information in the reply message and its own response information, and a means for sending reply messages including the new response information to the other node devices. | 01-01-2009 |
20090010268 | Controlling Access to a Shared Communication Medium of a Mobile Adhoc Network - A method of controlling access of mobile users of a substantially infrastructureless communications network to a shared communication medium, wherein the shared communication medium is partitioned into a plurality of individual communication channels that can be individually exploited for communications between the network users. The method includes determining the existence of at least one main direction of movement of the network users, the main direction of movement being a direction around which directions of movement of a prescribed number of network users are clustered; associating a group of communication channels within the plurality of communication channels to the at least one main direction of movement; and reserving the communication channels of the group to the network users moving substantially in the main direction of movement. | 01-08-2009 |
20090010269 | Method And Apparatus For Routing Packets - Packets may be routed in a heterogeneous communications network as follows: for a set of packets comprising at least one packet to be transmitted from a sending node, said sending node being able to handle communication according to at least two access technologies, —selecting in a selection unit in the sending node an access technology for use when transmitting the set of packets, —selecting a receiving node in the network to which to transmit the set of packets among nodes in the network that are able to handle said selected access technology—transmitting the set of packets to the selected receiving node using the selected access technology. Alternatively, a set of packets may be transmitted to one or more nodes using at least two different access technologies. Depending on the transmission quality, one node may be selected to forward the set of packets. | 01-08-2009 |
20090016362 | FAST PATH PACKET DESTINATION MECHANISM FOR NETWORK MOBILITY VIA SECURE PKI CHANNEL - Disclosed is a method for reducing routing overheads during data transmission to a destination mobile router of a plurality of mobile routers roaming in a network. The method comprises registering by top level mobile routers with a central authority server, sending data packets by a corresponding node of the network to the destination mobile router operationally attached to a corresponding top level mobile router, locating a position of the destination mobile router by identifying attachment of the destination mobile router to the corresponding top level mobile router from the information registered by the plurality of mobile routers with the central authority server, routing the data packet directly to the corresponding top level mobile router to which the destination mobile router is operationally attached and receiving the data packet by the destination mobile router from the corresponding top level mobile router, thereby reducing routing overheads in the network. | 01-15-2009 |
20090022161 | COMMUNICATION SYSTEM AND COMMUNICATION NODE - A technique is disclosed, by which it is possible to identify a communication node having special function under the condition that a certain communication node knows only the address of a communication node having no special function. According to this technique, a first communication node | 01-22-2009 |
20090022162 | ADAPTIVE NETWORK TO DYNAMICALLY ACCOUNT FOR HIDDEN NODES - One embodiment of the present invention relates to a network element that is configured to be associated with a network having a number of nodes. A node is configured to receive a beacon signal from a master node and at least one relayed beacon signal from at least one proxy node, where the at least one proxy node transmits the at least one relayed beacon signal based at least in part on the beacon signal. The node is further configured to select one of the beacon and relayed beacon signals and analyze the selected signal to determine a timeslot reserved for node admission requests. Other methods and devices are also disclosed. | 01-22-2009 |
20090022163 | ADAPTIVE NETWORK TO DYNAMICALLY ACCOUNT FOR HIDDEN NODES - One embodiment of the present invention relates to a network element that is configured to be associated with a network having a number of nodes. A proxy node is configured to distinguish between a some signals received from a master node and other signals received from at least one hidden node, where the at least one hidden node is unable to bi-directionally directly communicate with the master at a given time. The proxy node is further configured to relay at least one signal between the master node and the hidden node to facilitate addition of the hidden node to the network via the master node. Other methods and devices are also disclosed. | 01-22-2009 |
20090022164 | ADAPTIVE NETWORK TO DYNAMICALLY ACCOUNT FOR HIDDEN NODES - One embodiment of the present invention relates to a network element that is configured to be associated with a network having a number of nodes. The master node is configured to communicate with a number of nodes and allocate bandwidth therebetween by sending outgoing signals and receiving incoming signals over a transmission medium. The master node is further configured to adaptively account for hidden nodes with which the master node cannot bi-directionally directly communicate by communicating at least one signal with at least one proxy node. Other methods and network elements are disclosed. | 01-22-2009 |
20090022165 | Content replacement by PID mapping - A method of content substitution involves receiving an ordered stream of packets containing content marked by a first packet identifier (PID) and one or more substitute content portions marked by one or more secondary PIDs, where the number and placement of packets marked by secondary PIDs ahead of packets marked by the first PID in the stream is retained during transmission of the ordered stream of packets; initiating processing for display or storage of content contained in packets having the first PID; initiating processing for display or storage of content contained in packets having a selected secondary PID that meets a substitution criterion; and either deleting or processing the content having the first PID depending upon a number of received intervening packets having secondary PIDs that reside between the packets having the first PID and the packets having the selected secondary PID that meets the substitution criterion. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract. | 01-22-2009 |
20090028163 | DISTRIBUTED NETWORK MANAGEMENT - This specification can provide resource allocation in peer-to-peer networks. This specification describes techniques whereby individual resources can in certain circumstances share their local views to create a network-wide view. The use of a performance manager facilitates this sharing. The sharing of fault information both access multiple devices and for a single device across restarts is also provided. A network-based aggregator for performance and fault analysis is also provided so that complex analysis algorithms can be provided centrally to assist network performance management. | 01-29-2009 |
20090028164 | METHOD AND APPARATUS FOR SEMANTIC SERIALIZING - A method and an apparatus for serializing a plurality of information elements that are extracted from a plurality of information sources and represented by nodes in a semantic network. The nodes are connected to other nodes via a plurality of connecting edges, and each of the connecting edges has at least one edge property value. The method includes selecting an initial node of the plurality of nodes and determining one of the at least one node property values of first order connecting nodes connected to the initial node, determining a first node connected to the initial node by the connecting edge having a highest value of the at least one node property value, examining further first order connecting nodes connected to the first node and determining a relevance order of the further first order connecting nodes connected to the first node and serializing the plurality of information elements in accordance with the relevance order of the further first order connecting nodes to produce a serial list. | 01-29-2009 |
20090028165 | Method for Operating a Decentralized Data Network - A decentralized data network contains a plurality of network nodes. The network nodes are able to direct requests into the data network with the aid of checking values. The network nodes are each assigned one or more table entries in a value table distributed between the network nodes, with each table entry containing a checking value and the data associated with the checking value. Each of the plurality of network nodes are monitored to determine the frequency with which requests for the checking values assigned to a respective network node are directed to the respective network nodes. If it is found that the frequency of the requests for one or more checking values to a respective network node exceeds a predetermined threshold value, at least the table entry or entries for this or these checking values is or are assigned to at least one other network node. | 01-29-2009 |
20090034536 | METHOD AND SYSTEM FOR LOCALISING USERS FOR SERVICES BASED ON SIP OR H.323 PROTOCOLS WITH DYNAMIC IP ADDRESS ALLOCATION - The aim of the invention is to localise a terminal ( | 02-05-2009 |
20090034537 | TEMPORAL AFFINITY-BASED ROUTING OF WORKLOADS - Techniques for routing client requests among a group of nodes offering a service are described. A coordinator determines that performance could be improved by using affinity-based routing. In one embodiment, the coordinator calculates a Time-to-Live (TTL) metric whereby clients benefit by returning to the same cache and posts this hint to subscribers. Client's start preserving locality data in an affinity context, such that later requests for a connection can be routed to the location last visited. The coordinator measures the system over subsequent intervals. If the gradient of the goodness (viz service quality and capacity) is stable or improving, then the coordinator continues to advise subscribers to use the affinity-based technique. Alternatively, if the gradient of the goodness is deteriorating, then the coordinator posts advice to the subscribers to stop using the affinity-based technique for any instance during the next intervals. | 02-05-2009 |
20090034538 | Node and control method thereof - According to an aspect of the embodiments, a node arranged on a ring network, for transmitting a frame from upstream to downstream, the ring network having a plurality of nodes capable of connecting a network apparatus, respectively, the node comprises: a detector for detecting the frame on the ring network; and a frame controller for distinguishing the detected frame whether the frame reaches a final destination, the frame controller stopping the transmitting for the frame when the ring network is lacked of ability to reach the frame to the destination. | 02-05-2009 |
20090034539 | ADDRESS ASSIGNMENT APPARATUS, ADDRESS ASSIGNMENT METHOD, AND COMPUTER PRODUCT - Upon receipt of a request to connect to an ad-hoc network from an external communication node, an address assigning unit obtains information on an IP address assigned to the external communication node. The address assigning unit determines whether the IP address is already used by any of communication nodes that are connected to the ad-hoc network based on network management information stored in a storage unit. The address assigning unit generates a new IP address that is used none of the communication nodes when the IP address is already used, and transmits the new IP address to the external communication node. The external communication node is assigned the new IP address, and connects to the ad-hoc network. | 02-05-2009 |
20090034540 | SYSTEM AND METHOD FOR STREAMING VIDEO ON DEMAND (VOD) STREAMS OVER A LOCAL NETWORK - A system and method for streaming numerous video on demand (VOD) streams over a network, such as a local area medium sized network on a vehicle such as an aircraft. The system and method that provides redundant and restricted paths for streaming numerous VOD streams while providing maximum bandwidth for traffic from multiple sources with minimal packet loss due to contention. | 02-05-2009 |
20090034541 | METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODUCTS FOR ROUTING TRAFFIC BETWEEN NODES IN A NETWORK THAT ARE CONNECTED BY REDUNDANT LINKS - A communications network is operated by providing a plurality of redundant links between a first network node and a second network node. A first identifier is associated with a first one of the plurality of redundant links and a second identifier is associated with a second one of the plurality of redundant links. The first and second identifiers are associated with the regulatory constraint. Traffic that is marked with the first identifier is routed to the first one of the plurality of redundant links and traffic that is marked with the second identifier is routed to the second one of the plurality of redundant links so that operation of the communications network is in compliance with the regulatory constraint. | 02-05-2009 |
20090034542 | METHOD OF OPERATING A NETWORK - An Internet Protocol router device ( | 02-05-2009 |
20090041032 | Method and a node device for transferring a message based on traffic engineering tunnels - Embodiments of the present invention provide a method and a node device for transferring a message based on MPLS TE tunnels. The main principle of the embodiments is to determine a switching node at which MPLS TE tunnel switching is needed, and to set routing and forwarding information for tunnel switching between different MPLS TE tunnels at the switching node. The switching node switches and transfers message into different MPLS TE tunnels according to the routing and forwarding information. The present invention makes the sum of the whole network edge bandwidth resources much higher than that of the bandwidth resource at the network core, allows the network resources to converge layer by layer, and avoids the N-square problem of the tunnel number effectively and lightens the load on the network core nodes by the large number of tunnels and the load of RSVP-TE state refreshing. | 02-12-2009 |
20090041033 | FITNESS BASED ROUTING - The present invention extends to methods, systems, and computer program products for fitness based routing. Embodiments of the invention significantly improve the likelihood that routing nodes contained in routing table have adequate (or even relatively increased) ability to transfer and process messages in an overlay network. Thus, when the node is to make a routing decision for a message, the node has some assurances that any selected routing node is adequate (or is at least the best currently available). Further, a sending node can take preference to routing nodes with higher fitness values when sending a message. Preference to higher fitness metric values further insures that messages are adequately transferred and processed. Accordingly, embodiments of the invention can be used to route messages in a manner that optimizes bandwidth and provides efficient routing capability. | 02-12-2009 |
20090041034 | Method and System for Characterizing Heterogeneous Communication Nodes - A method of sending data between heterogeneous nodes. The method includes a step of inserting a type indicator into a message (RE( | 02-12-2009 |
20090041035 | Information communication system, information communication method, node device included in information communication system and recording medium recording information processing program - The present invention is to provide an information communication system with its communication load of the communication network as a whole reduced. | 02-12-2009 |
20090052459 | METHODS AND APPARATUS FOR PROVIDING HIGH SPEED CONNECTIVITY TO A HOTEL ENVIRONMENT - Methods and apparatus are described for providing access to a network via a first one of a plurality of network access nodes in the network. The network access nodes each have a network address associated therewith which is unique on the network, the first network access node having a first network address associated therewith. The first network address is associated with a first computer while the first computer is connected to the first network access node thereby providing access to the network. | 02-26-2009 |
20090059931 | Method, system and use thereof for controlling real time contiguous data in a packet switched data system, real time contiguous data service provided using said method - The present invention relates to a method of controlling real time contiguous data in a packet switched data stream comprising data packages. Controlling of said real time contiguous data is performed by retaining data packages of said packet switched data stream for disturbing contiguousness of said real time contiguous data after receiving thereof. The invention further relates to a system for controlling said real time contiguous data the use of such a system in a packet switched data network, and a real time contiguous data service provided using a method as described above. | 03-05-2009 |
20090059932 | METHOD OF DATA TRANSMISSION IN COMMUNICATION SYSTEM - A communication system includes a source node for transmitting data and general nodes that function as relay nodes for relaying the data or destination nodes for receiving the data. Data encoding is performed in each node of the communication system. The source node is linked to the general nodes by one or more independent paths. The number of independent paths from the source node to each of the general nodes is counted. A tap-proof index is calculated based on the maximum number of independent paths and the size of a set of elements formed by the encoded data. The security level against tapping is determined according to the value of the tap-proof index. | 03-05-2009 |
20090067438 | METHOD, APPARATUS AND PROGRAM FOR TRANSFERRING DATA - A method, apparatus, and program for allowing a first transmitting apparatus among a plurality of transmitting apparatuses connected to a network to transmit data packets to the network. The method includes: receiving a control packet transmitted from a second transmitting apparatus among the plurality of transmitting apparatuses, judging whether the received control packet indicates permission for the first transmitting apparatus to transmit data packets, and also, transmitting data packets in response to the judgment that the permission is indicated, or receiving an additional control packet in response to the judgment that the permission is not indicated; and, transmitting a new control packet indicating, as a transmitting apparatus permitted to transmit data packets subsequently, one transmitting apparatus selected by a predetermined rule from the plurality of transmitting apparatuses, on condition that the transmission of the data packet is completed. | 03-12-2009 |
20090067439 | DATA COMMUNICATION SYSTEM - A method and a system for speeding up session establishment are provided, wherein the time required to establish a session is reduced, even in the case where a session management server requires a large amount of time to process respective functions required for establishing the session (such as making a decision regarding whether to permit or deny provision of a service, or generating a session key). | 03-12-2009 |
20090073991 | Dynamic Pairing of Patients to Data Collection Gateways - Systems, devices and methods transmit data from a patient device to a location, for example a remote location, where the patient is monitored. The system may comprise a server system, for example a backend server system, a gateway and the patient worn device. The gateway can be configured to communicate with the patient worn device in response to a list transmitted from the server, for example an approved patient device list transmitted from the server to the gateway. The gateway may exclude communication with patient worn devices that are not on the list. This use of the list can control data throughput from the patient device to the gateway and also from the gateway to the server, such that the communication from the device on the list to the server is maintained and appropriate information can be reliably sent from the patient device to the server. | 03-19-2009 |
20090073992 | SYSTEM AND METHOD FOR PROVIDING PROXY AND TRANSLATION DOMAINS IN A FIBRE CHANNEL ROUTER - A Fibre Channel router used to join fabrics. EX_ports are used to connect to the fabrics. The EX_port joins the fabric but the router will not merge into the fabric. Ports in the Fibre Channel router can be in a fabric, but other ports can be connected to other fabrics. Fibre Channel routers can be interconnected using a backbone fabric. Global, interfabric and encapsulation headers are developed to allow routing by conventional Fibre Channel switch devices in the backbone fabric and simplify Fibre Channel router routing. Phantom domains and devices must be developed for each of the fabrics being interconnected. Front phantom domains are present at each port directly connected to a fabric. Each of these is then connected to at least one translate phantom domain. Zoning is accomplished by use of a special LSAN zoning naming convention. This allows each administrator to independently define devices are accessible. | 03-19-2009 |
20090080439 | SIMPLE, RELIABLE, CORRECTIONLESS COMMUNICATION MECHANISM - A server interconnect system includes a first server node operable to send and receive messages and a second server nodes operable to send and receive messages. The system further comprises a first interface unit in communication with the first server node and a second interface unit in communication with the second server node. The first interface unit has a first set of message send registers and a first set of message receive registers. Similarly, the second interface unit has a second set of message send registers and a second set of message receive registers. The server interconnect system also includes a communication switch that receives and routes a message from the first or second server nodes when either of the first or second registers indicates that a valid message is ready to be sent. A method implemented by the server interconnect system is also provided. | 03-26-2009 |
20090080440 | Method and Apparatus for Establishing and Managing Diameter Associations - The invention includes a method and apparatus for establishing DIAMETER associations between nodes of a network. The invention uses a DIAMETER application server disposed between DIAMETER nodes in order to establish DIAMETER associations between nodes and, further, to provide DIAMETER traffic load balancing using established associations. A method includes receiving a DIAMETER connection establishment request from an originating node requesting an association with a destination node, terminating the DIAMETER connection establishment request, obtaining respective DIAMETER associations for the originating node and the destination node, linking the obtained DIAMETER associations, and storing the linked DIAMETER associations. The DIAMETER association for a node may be obtained by identifying a node associated with the DIAMETER connection establishment request, determining if an association exists for the identified node, and retrieving the association from memory if an association exists for the identified node, retrieving the association from memory, or, if an association does not exist for the identified node, establishing the association. | 03-26-2009 |
20090080441 | TRAFFIC LOCALIZATION WITH PROXY MOBILITY - A method and nodes are provided for localizing traffic between communication nodes receiving service from a same network. A local mobility anchor informs media access gateways providing access to two communication nodes of each other's addresses. Traffic exchanged between the two communication nodes connected to the same network via these media access gateways are routed directly between the gateways, bypassing the local mobility anchor. | 03-26-2009 |
20090080442 | CONSERVING POWER IN A MULTI-NODE ENVIRONMENT - A coordinated mechanism to conserve power in a multi-node environment is disclosed. A multi-node environment may comprise multiple individual computer systems coupled by a network or, a shared memory architecture multiprocessors, or many-core computers. The power management features of the processor, platform elements, and the devices may be used to conserve power in a multi-node environment. A master node may determine the task and slave nodes required to perform the task and may wake-up the slave nodes required to perform the task while causing the other slave nodes to enter or continue in the sleep-state. The slave nodes, which are woken in-turn may determine the components of the slave nodes required for performing the assigned task and may cause other components to enter a sleep-state. | 03-26-2009 |
20090086739 | BROADCAST MESSAGING IN PEER TO PEER OVERLAY NETWORK - Broadcast messages are efficiently directed to nodes of an overlay network. Broadcast messages include an End ID parameter specifying the range of key values for nodes that should receive the broadcast message. Each node of an overlay network maintains a list of finger nodes and their respective key values. Upon receiving a broadcast message, a node assigns a finger node a new End ID value based upon the End ID value of the broadcast message or the key value of an adjacent finger node. The node compares a finger node's new End ID value with the finger node's key value to determine whether to forward the broadcast message to that finger node. A broadcast message forwarded to a finger node includes an End ID parameter equal to the new End ID value determined for the finger node. Nodes can aggregate response messages from its finger nodes. | 04-02-2009 |
20090103549 | TELECOMMUNICATION AND MULTIMEDIA MANAGEMENT METHOD AND APPARATUS - The present invention is directed to a method for transmitting data over a network. The method includes ascertaining at a first node the need to transmit one or more data streams from the first node to a second node over the network, the one or more data streams including time-based media that is generated either locally or remotely on the network. The method also includes ascertaining at the first node a timeliness preference for reviewing the one or more data streams by one or more recipients respectively. The ascertained timeliness preference for each one of the data streams is either (a) time-sensitive where at least one recipient of the one data stream has indicated an intent to review the one data stream in a near real-time mode as received by the recipient over the network while the time-based media of the one data stream is being generated or (b) less-than time-sensitive. In accordance with the method, one of several transmission techniques is used to transmit the data streams, depending on the ascertained timeliness preference of each data stream. Either a first transmission technique is used for the less-than time-sensitive preference data streams or a second transmission technique is used for data streams with the time-sensitive preference. The first technique uses a larger first packetization interval, which is defined as the amount of time based media contained in each packet, compared to the second packetization interval used by the second technique. | 04-23-2009 |
20090103550 | IP network system - There is provided an IP network system. The IP network system includes: a plurality of relays making up a ring network; a source host for transmitting a packet and connected to the ring network; and a destination host which conducts a packet communication with the source host through the ring network. Each of the relays is operable to transfer received packets containing a transfer direction information to the destination host through a right-handed route of the ring network and through a left-handed route of the ring network, based on the transfer direction information. | 04-23-2009 |
20090109980 | METHOD AND SYSTEM TO USE, SHARE AND MANAGE DIGITAL CONTENT BY ASSIGNING MAC AND IP ADRESS TO EACH DEVICE AND PERIPHERAL - The invention shows a method for connecting and sharing content over a plurality of devices, and over a plurality of networks public and private while respecting the content's Digital Rights by implementing a software layer (software alternately integrated into hardware component) that will assign a mac address and an ip address to each device and peripherals and where content can be assign to specific devices inside a network, and can be accessed directly, shared remotely, wireless, or physically connected. The software layer also integrates drivers, players, codec's that can be updated dynamically in order to keep them updated. This software layer can also “virtualizes” peripherals, devices or group of peripherals and devices into single addressable group of components that will act like one. | 04-30-2009 |
20090109981 | Out-of-band management for broadband over powerline network - A management system for broadband over power lines is disclosed, using wireless communications interfaced with broadband over power lines management components to establish a wireless out-of-band system management network. | 04-30-2009 |
20090116496 | SYNCHRONIZING PORTIONS OF A DATABASE WITH DIFFERENT DATABASES ON DIFFERENT NODES OF A NETWORK - Techniques are disclosed for synchronizing a database related to a first node in a network with multiple nodes. Each node includes a database different from a database on a different node. An inquiry control message is sent to each node in a candidate set of one or more nodes on the network, which are different from the first node. In response to the inquiry control message, the first node receives a first set of one or more messages from a particular node different from the first node. The first set indicates a portion from the database of the particular node. The portion is relevant for the first node. A particular portion of a first database for the first node is derived from the first set of messages. The particular portion is less than all of the first database. These techniques allow the first node to derive its full database from multiple adjacent nodes. | 05-07-2009 |
20090129395 | METHOD, COMMUNICATION NETWORK, AND CONTROL UNIT FOR THE CYCLICAL TRANSMISSION OF DATA - A method transmits data on a transmission path to which a control unit and several nodes are connected. The control unit cyclically outputs data in the form of telegrams to the transmission path, thereby controlling the transmission process in order to continuously output telegrams during the entire transmission cycle time taking the transmission standard into account. The nodes exchanges data with the telegrams when passing through. Further the control unit subdivides the transmission cycle into a number of subcycles having the same length, the control unit transmitting at least one communication telegram in each subcycle into which a first node may write data for a second node located downstream in the transmission path into the communication telegram when passing through. | 05-21-2009 |
20090129396 | System and Method for Processing Settlement Information in a Network Environment Including IMS - A scheme for processing charging information in a network environment including an Internet Protocol (IP) Multimedia Subsystem (IMS) network. A component is provided for including a suitable a Multi-purpose Internet Mail Extensions (MIME) type with respect to identifying a settlement information payload for transferring in a communication protocol message to a recipient disposed in the network environment. An indicator is provided for identifying at least one version with which a body part of the communication protocol message containing the settlement information payload is compatible. | 05-21-2009 |
20090129397 | CLUSTER BRING-UP IN A DISTRIBUTED TOPOLOGY LIVENESS SYSTEM - A method is provided for establishing clusters in a distributed data processing environment having a plurality of nodes. The frequency of messages sent for the purpose of cluster formation is selected based on ranking of the nodes. Higher ranking nodes transmit such messages more frequently than lower ranking nodes. Lower ranked nodes thus are provided with an opportunity to join a cluster without first having to transmit their own messages to effectuate the joining. | 05-21-2009 |
20090135834 | Technique For Identifying RTP Based Traffic In Core Routing Switches - A technique for identifying RTP based traffic in routers and switches is disclosed. In one embodiment, a method of identifying RTP based traffic in routers and switches, includes receiving IP packets including a UDP header and a second header located substantially after the UDP header, generating statistical parameters by inspecting predetermined sequence of bits at predetermined offsets in the second header of each received IP packet for a predetermined number of IP packets, and determining whether the IP packet is an RTP based IP packet by comparing the generated statistical parameters to predetermined characteristics. The method also includes pre-filtering the received IP packets to allow only the IP packets comprising the UDP header and the second header to reach an RTP detection engine. | 05-28-2009 |
20090135835 | ASYMMETRIC PACKET SWITCH AND A METHOD OF USE - The present invention relates to a packet switch and a packet switching method. An example embodiment of the present invention comprises at least three network ports, at least one instrument port, a mux-switch, a packet switch fabric, and an address table. The embodiment updates the address table to include the source address of each ingress packet of each network port and associate the source address with that network port. The mux-switch routes the ingress packet traffic of each network port according to the identity of the network port so that at least a copy of the packet traffic of one of the network ports is routed to an instrument port. The packet switch fabric routes the packets from the instrument ports to the network ports according the destination address of the packet and the identity of the network port that is associated with the destination address as recorded in the address table. | 05-28-2009 |
20090135836 | COLLECTOR DEVICE AND SYSTEM UTILIZING STANDARDIZED UTILITY METERING PROTOCOL - A device-agnostic collector is capable of accepting information pushed from a node for aggregation and subsequent transmission to the head end server. As a receiver of pushed information, the device-agnostic collector does not require information about the type of meter at the node or the type of data structures transmitted by the node. | 05-28-2009 |
20090135837 | METHOD OF COMMUNICATING PACKET MULTIMEDIA TO RESTRICTED ENDPOINTS - A method, performed in a network element, for communicating packet multimedia data between a first endpoint and a second endpoint, the method comprising the machine-implemented steps of receiving an outbound multimedia data packet; determining if the outbound multimedia data packet originated from a first endpoint that is logically behind a security device; determining and storing information identifying a logical pinhole in the security device, wherein the logical pinhole is associated with expected inbound multimedia data packets directed to the first endpoint; performing an action that keeps the logical pinhole open during all of a communication session between the first endpoint and the second endpoint; and forwarding inbound multimedia data packets directed from the second endpoint to the first endpoint via the logical pinhole. | 05-28-2009 |
20090154473 | METHOD AND SYSTEM FOR INDICATING A TRANSITION IN RATE AND/OR POWER CONSUMPTION UTILIZING A DISTINCT PHYSICAL PATTERN ON ONE OR MORE IDLE CHANNEL(S) - An Ethernet network may comprise multi-rate link partners that may be coupled via an Ethernet link. The Ethernet link may comprise a plurality of channels wherein one or more may be silent and/or idle channels set to a low(er) power that may enable energy efficiency. Silent channels may be utilized for transmitting signals comprising one or more distinct physical patterns for controlling data rate transitions. For example, symbols may be utilized for generating the distinct physical patterns. The distinct physical patterns may communicate a new data rate, when to transition the data rate, which channel(s) may bear the data rate transition and/or a method for implementing the data rate transition. The method may comprise activating or suspending a data traffic channel, modifying a signal constellation, modifying PAM levels and/or adjusting inter-frame gap. The new data rate may be determined based on past traffic and/or expected traffic on the network link. | 06-18-2009 |
20090154474 | SERVER APPARATUS - The present invention has an object to provide a server apparatus capable of accessing a terminal apparatus connected via an IP network to a router from an externally provided terminal apparatus in a simple and firm manner without previously performing complex setting operation. | 06-18-2009 |
20090154475 | Transport of aggregated client packets - The invention relates to a method for transmitting one or more client signals via a packet transport network. According to the method, packets of the one or more client signals are received at an ingress node of the network. Timing information characterizing the timing of the received packets is determined and the received packets are mapped into a container. The container and the timing information are transmitted via the network. At an egress node of the network, the packets are extracted from the container and the packets are timed for further transmission based on the transmitted timing information. | 06-18-2009 |
20090154476 | OVERLAY NETWORK SYSTEM WHICH CONSTRUCTS AND MAINTAINS AN OVERLAY NETWORK - An overlay network system comprises an overlay network composed of a plurality of nodes and a plurality of sub-overlay networks each of which is composed of a subset of the plurality of nodes and which are hierarchized. The overlay network is managed as a 0th-level sub-overlay network at the highest hierarchical level. Each of the plurality of sub-overlay networks is allocated a sub-overlay network ID whose number of bits corresponds to the hierarchical level of the network. The high-order one or more bits in the sub-overlay network ID also indicate the sub-overlay network ID of a sub-overlay network at the high hierarchical level corresponding to the number of the one or more bits. | 06-18-2009 |
20090154477 | METHOD FOR FORWARDING PACKETS A RELATED PACKET FORWARDING SYSTEM, A RELATED CLASSIFICATION DEVICE AND A RELATED POPULARITY MONITORING DEVICE - The present invention relates to a method and related system and related devices for forwarding packets of a plurality of multimedia streams where the packets of the plurality of multimedia streams being forwarded from a multimedia source towards a plurality of multimedia endpoints over a communications network, where the method comprises a step of classifying the packets of the plurality of multimedia streams based on the usage of each of the multimedia streams. | 06-18-2009 |
20090161680 | GATEWAY APPARATUS, PACKET FORWARDING METHOD, AND PROGRAM - The present invention provides a gateway apparatus and a packet forwarding method for rewriting the AP header of a forwarded packet without terminating a TCP connection between a client and a server. For that purpose, the gateway apparatus in accordance with the present invention uses the conversion section | 06-25-2009 |
20090180483 | RING-OF-CLUSTERS NETWORK TOPOLOGIES - In a ring-of-clusters network topology, groups of slave devices are accessed in parallel, such that the latency around the ring is proportional to the number of clusters and not proportional to the number of integrated circuits. The devices of a cluster share input and output ring segments such that packets arriving on the input segment are received and interpreted by all the devices in a cluster. In other embodiments, none, some or all but one slaves per cluster are asleep or otherwise disabled so that they do not input and interpret incoming packets. Regardless, in all embodiments, the slaves of a cluster cooperate, potentially under the controller's direction, to ensure that at most one of them is actively driving the output segment at any given time. The devices may be addressed through a device ID, a cluster ID, or a combination thereof. Embodiments of the invention are suited to exploit multi-chip module implementations and forms of vertical circuit stacking. | 07-16-2009 |
20090185570 | SYSTEM FOR SETTING AN AD-HOC NETWORK FOR TERMINAL AND METHOD OF CONTROLLING THE SAME - A system and method for setting an ad-hoc network in a terminal are provided. The system includes a storage unit for storing a critical value of acceleration of the terminal, an acceleration sensor for measuring the acceleration of the terminal to provide a value of the measured acceleration, and a transmission frame processor for controlling transmission of a Media Access Control (MAC) frame for setting the network depending on whether the value of the acceleration measured by the acceleration sensor exceeds the critical value of acceleration pre-stored in the storage unit. The system performs Radio Frequency (RF) control on the terminals, each of which must operate as a host and a router in the ad-hoc network, using the acceleration sensor, thereby preventing use of unnecessary resources and reducing an amount of unnecessarily broadcast frames. | 07-23-2009 |
20090190599 | Sampling Rules for Information Dissemination - Sampling rules for information dissemination are described which may be applied in a system containing a number of nodes arranged into groups. A target address is selected using one of two methods: selection of an address from the entire address space of the system and selection of an address from a part of the address space which corresponds to set of groups of nodes. The set of groups of nodes is updated when information is successfully disseminated to a node at a target address selected using the first of the two methods. Rules to determine which of the two methods are used for any particular selection operation are also described. | 07-30-2009 |
20090190600 | RELAYING DEVICE, NETWORK SYSTEM, AND NETWORK SYSTEM CONTROLLING METHOD - The first relaying device uses the first port (the second relaying device) for the first priority in the first selecting mode, and uses a port other than the second port (the third relaying device) for the second priority. The first relaying device uses the first port for the first priority and uses the second port for the second priority, in the second selecting mode. In a case where the selecting mode is the first selecting mode, the power mode of the third relaying device is the first power mode wherein the power consumption is relatively small. In a case where the selecting mode is the second selecting mode, the power mode of the third relaying device is the second power mode wherein the power consumption is relatively high. | 07-30-2009 |
20090196300 | METHOD FOR FORWARDING DATA PACKETS AND COMMUNICATION NETWORK HAVING FLOODING TRANSPORT PROPERTIES - A method of forwarding data packets in a communication network includes the following steps: a) generating a stream of data packets at a first subscriber; b) adding to each of the data packets in the stream a recipient individualizing information to form individualized data packets; c) forwarding the individualized data packets to a first repeater node; d) flooding the individualized data packets from the first repeater node to any further subscriber connected to the first repeater node; e) flooding the individualized data packets to any further repeater node connected to the first repeater node; f) flooding the individualized data packets in any further repeater node analogous to the steps d) and e); g) connecting any possible further subscriber of the stream of individualized data packets to a repeater node selected from a group containing the first repeater node and any further repeater nodes and g) enabling only those of the any possible subscribers to access a content of the individualized data packets when able to identify as authorized subscriber by knowledge of the recipient individualizing information added to the data packets. | 08-06-2009 |
20090196301 | Methods, systems and apparatus for monitoring and/or generating communications in a communications network - A module for use in a communications network in which a plurality of signals are transmitted between respective first and second nodes, the module having an engine for receiving the plurality of signals over the network, for extracting protocol data therefrom and for providing the extracted protocol data to an analyser; and a processor for controlling operation of the engine and analyser. The invention also provides an apparatus for generating communications, systems including the module and/or the apparatus, and corresponding methods. | 08-06-2009 |
20090207849 | COMMUNICATION SYSTEM - The invention provides a communications system with few transmission collisions. The communications system is provided with a rhythm node, which rhythm nodes transmit synchronized upstream transmission instigation messages, upon receipt of which dominant nodes perform upstream transmissions sequentially and after their predetermined standby times. The rhythm node transmits synchronized downstream transmission instigation messages, upon receipt of which tonic nodes perform downstream transmissions sequentially and after their predetermined standby times. Transmissions of upstream transmission instigation messages and downstream transmission instigation messages are synchronized. Transmissions are efficient and without collisions because individual nodes perform transmissions in sequence rather than instantaneously. | 08-20-2009 |
20090213861 | Reliable Link Layer Packet Retry - Communication over a computer network with a node having a first port with a point-to-point link connection to a second node having a second port. The first port transmits to the second port a reliable link layer (RLL) packet over the link. The RLL packet comprises a first RLL header and a first data packet, the first RLL header preceding the first data packet, the first RLL header comprising an RLL start-of-frame (SOF) character and an RLL packet sequence number (PSN). If the first port receives an RLL acknowledgment control packet from the link, it acknowledges receipt of the first data packet, and the first port does not retain the first data packet in the buffer. If the first port does not receive the RLL acknowledgment packet from the link, acknowledging receipt of the first data packet, the first port re-transmits from the buffer the first data packet. | 08-27-2009 |
20090219939 | Transporting Packets - A method and network node for transporting IP packets in an IP network. The IP packets are received at a first network node, which separates the packets into a plurality of streams. The packets of each stream share an IP header in common, which denotes a second network node as a destination. The first and second nodes negotiate a connection on which packet multiplexing is available. The first node then merges packets from separate streams and sends a merged packet to the second node. | 09-03-2009 |
20090225760 | SIP-HTTP APPLICATION CORRELATOR - Systems and methods according to the present invention facilitate communications between devices which utilize different signaling protocols. A gateway can analyze incoming messages, in a first protocol such as SIP, to identify an application instance to which the messages should be routed. The messages can then be converted into another protocol and forwarded to the identified application. | 09-10-2009 |
20090232146 | SYSTEM COMPRISING NODES WITH ACTIVE AND PASSIVE PORTS - A data processing system comprising a plurality of interconnected nodes ( | 09-17-2009 |
20090238191 | TOPOLOGY ARRANGEMENT FOR ACHIEVING RELIABLE COMMUNICATION IN WIRELESS AUTOMOTIVE NETWORKS - A wireless network arrangement includes an enclosure having a hindrance to wireless communication. The hindrance includes a fixed barrier and/or a space for accommodating a moveable barrier. At least three wireless electronic nodes are wirelessly and communicatively coupled to each other. A broadcast range of the nodes is greater than a largest dimension of the enclosure. The hindrance is disposed between a first one of the nodes and a second one of the nodes. The at least three nodes are positioned within the enclosure such that a wireless signal communication path wirelessly and communicatively couples the first one of the nodes to the second one of the nodes. The communication path is non-intersecting with the hindrance. The communication path passes through at least a third one of the nodes. The communication path is formed exclusively of a plurality of joined linear segments. Opposite ends of each linear segment are disposed at corresponding ones of the nodes. | 09-24-2009 |
20090238192 | In-band DPI application awareness propagation enhancements - Various exemplary embodiments are a method and related device and computer-readable medium including one or more of the following: receiving a packet sent from the source node to the destination node; associating the packet with an active flow by accessing information in the packet; performing deep packet inspection (DPI) to identify an application associated with the active flow; associating application-identifying information with the packet; forwarding the packet including the application-identifying information towards the destination node; and performing application-specific processing at a downstream device on at least one packet belonging to the active flow, the downstream device identifying the application associated with the active flow by extracting the application-identifying information from the packet. | 09-24-2009 |
20090245262 | METHOD TO OPERATE A WIRELESS NETWORK HAVING A PREDICTABLE AND STABLE PERFORMANCE - A method for operating a wireless network having a predicable and stable network performance. The method includes controlling output distribution of nodes in the network to adapt to traffic changes in the network, distributing power control to adapt to environmental changes in the network, and providing traffic sensitive routing to adapt to topology changes in the network. The method also includes converging to set points based on the controlling of output distribution, the distributing of power control, and the providing of traffic sensitive routing. | 10-01-2009 |
20090245263 | APPARATUS AND METHOD FOR TRANSMITTING PACKETS IN A PACKET SWITCHED NETWORK - An apparatus includes means for transmitting a packet, through one of a plurality of pseudo wires, from a PW ingress node thereof to a PW egress node thereof. Each of the plurality of pseudo wires is a communication path for transmitting a packet between a pair of end nodes included in three or more nodes communicably connected via a tunnel in a packet switched network. The PW ingress node is one of the pair of end nodes from which the packet comes into the one of the plurality of pseudo wires, and the PW egress node is the other one of the pair of end nodes from which the packet goes out thereof. The apparatus further includes means for extracting a packet transmitted through the one of the plurality of pseudo wires from among packets being transmitted through the tunnel. | 10-01-2009 |
20090252172 | SYSTEM AND METHOD FOR SCHEDULING RESERVATION REQUESTS FOR A COMMUNICATION NETWORK - A process for scheduling reservation requests among a plurality of nodes on a network, includes examining a level of network communication activity of a first node to determine whether the first node is active; allocating a reservation request to the first node, but only if the first node is determined to be active; and repeating the process of examining and allocating for one or more subsequent nodes on the network. In one embodiment, the process can utilize thresholds to determine whether a network device is active and the thresholds can be based on, for example, recent network activity for the node being evaluated. | 10-08-2009 |
20090252173 | Method For Improving Efficiency Of Redundancy Protocols - A method for improving efficiency of redundancy protocols used in a network is provided. The network comprises a first router running a program instance of a router redundancy protocol in a master state at a first interface and a dynamic protocol at a second interface, and a second router running another program instance of the router redundancy protocol in a backup state at a first interface and the dynamic protocol at a second interface. The program instance at the second router takes over the roles of the program instance at the first router during a failure of the first router. The method comprises establishing an online status of the first router, initiating a routing convergence process by the dynamic protocol at the first router, and taking over the roles from the program instance at the second router by the program instance at the first router when the routing convergence process has ended. | 10-08-2009 |
20090252174 | MESSAGE IDENTIFICATION METHOD AND A RELAY NODE USED BY THE METHOD - A technology providing a message identification method that can accurately identify a message for reserving the resources of a new path when a path change occurs in a network and the like is disclosed. According to the technology, a step of a relay node | 10-08-2009 |
20090252175 | SYSTEM, METHOD AND PROGRAM FOR DISTRIBUTED EVENT DETECTION - A distributed event detection system for detecting a complex event by a distributed detection process, includes a plurality of broker nodes for routing events and a route node for distributing the complex event, wherein the route node comprises a detection formula decomposing unit which decomposes a complex event detection formula for detecting the complex event into a plurality of complex sub-event detection formulae; a sub-route node assignment unit which assigns a broker node as a sub-route node with respect to each of the complex sub-event detection formulae decomposed by the detection formula decomposing unit; and a complex event detecting unit which detects the complex event based on a complex sub-event detected by the sub-route node assigned by the sub-route node assignment unit. | 10-08-2009 |
20090268742 | SESSION RELAY DEVICE AND SESSION RELAY METHOD - A session relay device which can reliably send a data packet resent from a source to a destination without the need for reconfiguring and dividing a segment is supplied. Session relay device | 10-29-2009 |
20090274157 | METHOD AND APPARATUS FOR HIERARCHICAL ROUTING IN MULTIPROCESSOR MESH-BASED SYSTEMS - A method and apparatus for hierarchical routing in mesh systems. The method may include splitting | 11-05-2009 |
20090274158 | Efficient Broadcast of Data in a Communication Network - A system (and a method) are disclosed for reliably disseminating a state of a node in a large network consisting of nodes with constrained resources. The system comprises a process embodied by a state machine comprised of an advertise state, a request state, and a share state. The system processes input events, mutates its internal state, and outputs side effects. The outputs from one node in the network may become inputs events to one or more other nodes in the network. Viral dissemination is an emergent behavior across the nodes in a network that all independently and continuously perform these input processings, state mutations, and output side effects. | 11-05-2009 |
20090279553 | PROXY NODE DISCOVERING METHOD, AND RELAY NODE USED IN THE METHOD, AND, NODE DISCOVERING METHOD, AND FIRST NODE, SECOND NODE AND RELAY NODE USED IN THE METHOD - A technology is disclosed that can provide a proxy node discovering method, a relay node used in the method, and the like, the method in which a proxy can be decided even when a local technology is not present between a data transmitter and the proxy or between an application and the proxy. The technology includes steps in which a first node | 11-12-2009 |
20090279554 | DEVICE WITH ETHERNET SWITCH FUNCTION AND SINGLE ETHERNET CONNECTOR - A Local Area Network (LAN) device is provided that includes an integrated switching function and a single network port. More specifically, the single network port of the LAN device may be used to provide communications over two different channels to/from two different external network devices. Thus, the LAN device may be utilized as an intermediary network device in a bus or chain network configuration even though it only comprises a single network port. | 11-12-2009 |
20090285223 | Method and System for Communicating Information Between a Switch and a Plurality of Servers in a Computer Network - A method and system are disclosed for communicating information between a switch and a plurality of servers in a computer network. In accordance with exemplary embodiments of the present invention, a first server constructs an original state of an information packet for transmitting client information to a client on a connection between the client and the server through the switch. The first server modifies a header of the information packet to include computer network information for use by the switch. The first server transmits the modified information packet to the switch. The switch extracts the computer network information from the modified information packet. | 11-19-2009 |
20090290588 | METHOD OF SELECTING NETWORK PATH AND COMMUNICATION SYSTEM - A method of selecting a network path for a network coding communication includes initializing a length of each of links; searching for an independent path from a source node to one of target nodes based on the length of each of the links; multiplying a predetermined factor to the length of each of the links used in the independent path; repeating the searching and the multiplying for all the target nodes; extracting the links and the nodes used in the independent path; generating a subgraph with the links and the nodes extracted at the extracting; and selecting the network path based on the subgraph. | 11-26-2009 |
20090296719 | Method for Configuring an Optical Network - A network model for the planning and/or the provisioning of traffic flows in a communication network includes nodes interconnected with each other by links according to a given network topology. The network model uses a graph defined by arc objects storing information related to both the links and adjacent nodes thereof. | 12-03-2009 |
20090296720 | Transmitting apparatus and transmitting method - A transmitting apparatus obtains cross-connect information on an input side and an output side, reserves the information as a cross-connect for management shift, adds object information formed of that cross-connect information and others to a signaling message for transmission and reception, and also updates the reserved cross-connect for management shift to shift path management. | 12-03-2009 |
20090304009 | ACCESS NETWORK NODE AND METHOD FOR ACCESS NETWORK NODE - A method for an access network node, and the access network node, to provide a user device access to a service enabled by an IMS network, comprising the steps of:
| 12-10-2009 |
20090310612 | Global Communications Ring Backbone - Embodiments of a global communications ring backbone ( | 12-17-2009 |
20090310613 | METHOD AND SYSTEM FOR INTERMEDIATE NODE QUALITY OF SERVICE NEGOTIATIONS - Disclosed are a method and system for an intermediate node, which negotiates a Quality of Service (QoS) contract with two or more secondary nodes, to maintain a record of previous contract agreements to use as the basis for future contracts and to select the negotiation order with the secondary nodes based on a configurable rule set. The intermediate node selects the secondary node which is deemed to be (predicted as) most restrictive to begin QoS negotiations. The intermediate node dynamically creates for a specific user a new QoS profile to begin the QoS negotiations based on current system loading and historical QoS precedents. | 12-17-2009 |
20090323699 | System And Method For Intelligent Signal Routing In A Television Production Studio - A system for signal routing in a television production studio includes a core router operatively coupled to a plurality of peripheral routers, each of the plurality of peripheral routers having an associated control system, and a core router control system coupled to the core router and to coupled to the plurality of peripheral routers, the core router control system configured to allow any peripheral router to communicate with any other peripheral router through the core router and irrespective of the control system associated with each peripheral router. | 12-31-2009 |
20090323700 | METHOD OF DETERMINING A ROUTING PATH - The invention concerns a method of determining a routing path in a peer-to-peer overlay network (N), and a network node ( | 12-31-2009 |
20090323701 | ROUTING ENGINE FOR TELECOMMUNICATIONS NETWORK - A system for automated installation of a communication line using an optimal route between a source location and a destination location is disclosed. The system includes a routing engine providing an automated design process for rendering the optimal route. The routing engine utilizes a routing algorithm to select the optimal route from a graph of capacity links defining a plurality of possible routes between the source and destination locations. If, at any time during the design process, the optimal route or capacity links defining the optimal route are detected as unavailable for any reason, the routing engine re-initiates the design process and thereafter selects a new optimal route based upon a new capacity graph built without the previously unavailable capacity link. Once designed, the available optimal route is provided to a command and control engine, which, in turn, manages the installation of the communication line using the optimal route. The command and control engine manages the process for assigning the optimal route in the provisioning system. | 12-31-2009 |
20090323702 | ROUTING ENGINE FOR TELECOMMUNICATIONS NETWORK - A system for automated installation of a communication line using an optimal route between a source location and a destination location is disclosed. The system includes a routing engine providing an automated design process for rendering the optimal route. The routing engine utilizes a routing algorithm to select the optimal route from a graph of capacity links defining a plurality of possible routes between the source and destination locations. If, at any time during the design process, the optimal route or capacity links defining the optimal route are detected as unavailable for any reason, the routing engine re-initiates the design process and thereafter selects a new optimal route based upon a new capacity graph built without the previously unavailable capacity link. Once designed, the available optimal route is provided to a command and control engine, which, in turn, manages the installation of the communication line using the optimal route. The command and control engine manages the process for assigning the optimal route in the provisioning system. | 12-31-2009 |
20100002709 | Systems and Methods for Network Routing Using Virtual Network Node Locations - Systems and methods for routing packets using node virtual locations are disclosed. Such a virtual location may be determined, for example, by determining a geographic location that is central to other nodes with which the node can communicate. In certain embodiments, a node's virtual location may more accurately represent an approximate center point of a node's communication range. In one exemplary embodiment, a node's virtual location is an average of the geographic locations of radio nodes with which the node is in communication. | 01-07-2010 |
20100008368 | Method for selecting nodes in a network - Given a set of network nodes B that are sought to be monitored, and a set of potential monitoring nodes, a subset M of the monitoring nodes is chosen that insures monitoring each node b in B with a pair of nodes m | 01-14-2010 |
20100014527 | PACKET RING NETWORK SYSTEM, PACKET FORWARDING METHOD AND NODE | 01-21-2010 |
20100014528 | SCALABLE FLOW TRANSPORT AND DELIVERY NETWORK AND ASSOCIATED METHODS AND SYSTEMS - A Flow Transport and Delivery Network (FTDN) supports delivery and transport of flows to destination nodes over parallel overlay networks. Overlay nodes executing overlay processes create and maintain one or more overlay networks. A plurality of sites are connected to each other via the parallel overlay networks with each site comprising one or more transit routers that route the flows to the destination nodes. | 01-21-2010 |
20100020810 | Link Services in a Communication Network - In a communication network, links in a transmission path between source and destination terminals are sequentially switched to an operational state in response to a command or a group of commands for transmitting data prior to completion of assembling the data. Each node in the transmission path independently monitors transmission of data. After transmitting the data, the links are selectively switched to pre-determined power saving states. | 01-28-2010 |
20100020811 | Content replacement by PID mapping - A method and apparatus for content substitution, consistent with certain embodiments of the present invention involves receiving data representing content, the data having at least first and second packet identifiers (PIDs) associated with first and second portions of content. The content having the first PID is placed into a data stream. An initiation flag is received indicating initiation of a PID mapping operation. The content having the second PID is then mapped to the first PID and the mapped content is placed into the data stream. A termination flag is received indicating termination of the PID mapping operation at which point the process returns to placing content having the first PID into the data stream. The content substitution process can be used to replace advertisements, provide multiple plots, multiple endings, multiple views as well as other applications. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract. | 01-28-2010 |
20100027550 | Content replacement by PID mapping - A method and apparatus for content substitution, consistent with certain embodiments of the present invention involves receiving data representing content, the data having at least first and second packet identifiers (PIDs) associated with first and second portions of content. The content having the first PID is placed into a data stream. An initiation flag is received indicating initiation of a PID mapping operation. The content having the second PID is then mapped to the first PID and the mapped content is placed into the data stream. A termination flag is received indicating termination of the PID mapping operation at which point the process returns to placing content having the first PID into the data stream. The content substitution process can be used to replace advertisements, provide multiple plots, multiple endings, multiple views as well as other applications. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract. | 02-04-2010 |
20100027551 | METHOD AND SYSTEM FOR RESTRICTING A NODE FROM COMMUNICATING WITH OTHER NODES IN A BROADCAST DOMAIN OF AN IP (INTERNET PROTOCOL) NETWORK - Method and system for restricting a first node in a broadcast domain of an IP (Internet Protocol) network from communicating with one or more other nodes. Each of the first node and the one or more other nodes has a respective translation table that maps an IP address to a respective physical address of all nodes with which the first node and the one or more other nodes have communicated. Embodiments of the invention describe obtaining communicated data including address resolution messages and accessing an address resolution table representative of address resolution activity in the network. Responsive to the communicated data indicating that the first node is communicating with other nodes, restricting the first node from communicating by generating and conveying a restricting address resolution message using information stored in the address resolution table, the restricting address resolution message including a substitute physical address. | 02-04-2010 |
20100034204 | PACKET RING NETWORK SYSTEM, PACKET TRANSFER METHOD AND INTERLINK NODE - A packet ring network system includes PHY selection circuits ( | 02-11-2010 |
20100034205 | COMMUNICATION NETWORK SYSTEM, PATH CALCULATION DEVICE, AND COMMUNICATION PATH ESTABLISHMENT CONTROL METHOD - In an MPLS or GMPLS network, links for hops of a communication path and adaptation to be implemented on the border of management domains or layers are automatically appropriately selected based on a service type or a requirement for maintenance. First, a unit that appends an identifier of a service to be provided and an attribute of the service to a communication path establishment control message, and requests path establishment is installed in a source node. Secondly, a unit that determines a requirement for maintenance of the communication path and adaptation on the basis of the service identifier and/or service attribute is installed in each node. Thirdly, maintenance attributes of network resources are compared with the requirement for maintenance in order to determine links and nodes through which the communication path passes. The determined links, nodes, and adaptation are designated as action parameters for a switching unit and/or interface unit. | 02-11-2010 |
20100034206 | DATA STORAGE SYSTEM IN COMMUNICATION NETWORK AND DATA INFORMATION PROCESSING METHOD - The present invention discloses a data storage system in a communication network, which enables distributed storage of data. The system includes front end nodes, storage nodes, super nodes and management nodes. The operation units are located in the front end nodes, the super nodes or the storage nodes and each adapted to operate a first data GUID by a preset fixed offset to derive a second data GUID, to determine, from loop link information obtained from the management node and the second data GUID, a super node with a node identifier closest to the second data GUID, and to forward a service request carrying the second data GUID and a backup flag to the determined super node. The invention further discloses a data information processing method using the system. | 02-11-2010 |
20100040069 | Routing system and method with OSPF area zero split into a two level hierarchy for route calculation - A method and system for routing traffic in an IP network using OSPF protocols and including core and hub routers in area zero. The core and hub routers are assigned different node signatures depending on whether the router is a core router or a hub router and link signatures match the node signatures. Internode traffic (core to core, hub to core, and hub to hub) is configured with routing algorithms separately for node and link network segments for which node and link signatures include core signatures as well as those of the internode pair selected. The OSPF routing for the separate network segments is then used to route traffic over the network. An IP network so configured will not route core traffic over hub links during periods of core element failure or downtime, and suffer packet loss. | 02-18-2010 |
20100040070 | NODE DEVICE AND METHOD FOR DECIDING SHORTEST PATH USING SPANNING TREE - Provided are a node device and a method for deciding a shortest path using a spanning tree. The node device includes: a node division unit dividing the node device into sub-nodes as many as the number of nodes connected to the node device when the node device operates an edge node that is located at an end of a backbone network and is in charge of reformatting and routing frames; a spanning tree generation unit generating as many spanning trees as the number of sub-nodes, wherein each of the spanning trees comprises a shortest path to reach the other edge nodes constructing the backbone network from each of the sub-nodes; and a first path decision unit deciding a shortest path from a source node to a predetermined destination node, as a path to be used, based on the spanning trees that are generated by the spanning tree generation unit. The shortest path that is obtained based on the plurality of spanning trees is used as a path to be used such that throughput of traffic is 3 times and 1.5 times larger than in existing STP and SPB, respectively, and the transmission delay is smaller than in existing STP and SPB. In addition, packet loss is smaller than in STP and SPB, and the node device and the method for deciding a shortest path using a spanning tree are robust to the unbalanced traffic. | 02-18-2010 |
20100040071 | COMMUNICATION SYSTEM - A communication system for performing communications on a network, including: a user terminal; and an edge node disposed at an edge of a provider domain and having a transfer control portion for controlling forwarding of packets forwarded from an originating user terminal or packets forwarded from another edge node. When definitions of important flow packets are set in the edge node, the transfer control portion establishes a connection for transfer of important flow packets between an edge node with which the originating user terminal is connected and an edge node with which a destination user terminal is connected. | 02-18-2010 |
20100040072 | FRAME SWITCHING DEVICE AND ADDRESS LEARNING METHOD - A frame switching device includes a plurality of ports sending a sending frame and receiving a receiving frame; an address entry memory storing an address entry; a flooding processor executing flooding process; a flooding determination unit determining whether the flooding occurrence for the address satisfies a predetermined condition; a notification transmitting unit transmitting a searching frame; a notification receiving unit for receiving a predetermined notification for the address entry related to the address in flooding occurrence from an other frame switching device; and an address entry registration unit registering the address entry in the address entry memory. | 02-18-2010 |
20100046527 | Latency Equalization for Interactive Network Applications - A network configuration that supports latency-equalization (LEQ) routing by effectively “storing” packets on communication links, rather than at end points. A suitable network configuration is found by (i) identifying a candidate pool of routers through which the participating client terminals and application servers can exchange packets intended for LEQ routing and (ii) analyzing the delay inventory corresponding to the network paths connecting the client terminals and application servers, through those routers. Based on the analysis, M routers from the candidate pool are selected to serve as hub nodes. Each participating client terminal is assigned m of these M hub nodes and, thereafter, directs and receives its packets intended for LEQ routing through one of these m hub nodes. | 02-25-2010 |
20100054261 | SELECTIVE SESSION INTERCEPTION METHOD - A method for intercepting data of a network session passing between a first node and a second node on a data network, comprising the steps of: (i) providing an interceptor on a third node of the network; (ii) monitoring data passing between the first node and the second node; (iii) synchronizing the network data between the interceptor and the first and second nodes; (iv) creating a first socket on the interceptor for communicating with the first node and a second socket on the interceptor for communicating with the second node, and (v) intercepting the data so that data flowing between first and second nodes passes through the interceptor. | 03-04-2010 |
20100054262 | METHOD AND APPARATUS FOR SETTING COMMUNICATION PATHS IN A NETWORK - Two path setting sides are determined between a pair of nodes in a network, and two path setting messages are created. The two path setting messages each includes information on a path switch default direction, a wait-to-restore timer value, and a mode identifier identifying a revertive mode. Then the two different communication paths are concurrently set between the pair of nodes by transmitting concurrently the created two path setting messages between the pair of nodes. In the case of the revertive mode, a communication path set on a side identified by the path switch default direction is operated as a working path either in an initial state or when no faults have occurred during a time period indicated by the wait-to-restore timer value after recovery of the fault on the first side. | 03-04-2010 |
20100054263 | MULTICHANNEL RING AND STAR NETWORKS WITH LIMITED CHANNEL CONVERSION - A ring communication network according to an embodiment of the present invention includes a plurality of nodes in which a single one of the nodes is configured for full channel conversion and the remaining nodes, other than the single node, are configured for no channel conversion. Links with no more than W channels couple the nodes. The ring communication network also may include N nodes and links connecting the nodes for carrying data in W channels such that N≧2 log | 03-04-2010 |
20100054264 | MPLS TUNNEL IDENTIFICATION METHOD AND DEVICE - According to an aspect of the invention, an MPLS tunnel identification method includes: establishing MPLS tunnels with an opposing node by distributing an MPLS tunnel label; and determining an MPLS tunnel to be associated with a pseudo wire corresponding to a pseudo wire label among the MPLS tunnels when the pseudo wire label is assigned from the opposing node thereby to notify identification information of the MPLS tunnel together with identification information of the pseudo wire to the opposing node. | 03-04-2010 |
20100054265 | METHOD AND DEVICE OF MPLS NETWORK TRAFFIC SWITCHING - A method of MPLS network traffic switching is provided herein. The method includes these steps: receiving a message indicative of creating a new LSP successfully, and generating a new uplink forwarding entry and a new downlink forwarding entry according to the message; storing the new uplink forwarding entry, and configuring the new downlink forwarding entry; configuring the new uplink forwarding entry upon completion of configuring the new downlink forwarding entry; and forwarding the traffic according to the new uplink forwarding entry and the new downlink forwarding entry. By ensuring the sequence of processing the events in the traffic switching process, the method reduces the probability of traffic interruption in the traffic switching process. A network node device for implementing MPLS network traffic switching is also provided herein. | 03-04-2010 |
20100061380 | Load Balancing across Multiple Network Address Translation (NAT) Instances and/or Processors - Disclosed are, inter alia, methods, apparatus, computer-storage media, mechanisms, and means associated with load balancing across multiple network address translation (NAT) instances and/or processors. N network address translation (NAT) processors and/or instances are each assigned a portion of the source address traffic in order to load balance the network address translation among them. Additionally, the address space of translated addresses is partitioned and uniquely assigned to the NAT processors and/or instances such that the identification of the assigned NAT processor and/or instance associated with a received translated address can be readily determined there from, and then used to network address translate that received packet. | 03-11-2010 |
20100061381 | Method to reduce IGP routing information - A system and method for routing traffic from an ingress provider edge router to an egress provider edge router that eliminates the need to share state information between the ingress provider edge router and a plurality of core routers in a core network. The ingress provider edge router and egress provider edge router are each coupled to at least two core routers among the plurality of core routers in the core network, the ingress provider edge router learning routes with a next hop equal to an IP address of the egress provider edge router through an internal border gateway protocol (iBGP). The ingress provider edge router balances traffic flows on uplinks between the ingress provider edge router and the at least two core routers coupled to the ingress provider edge router without knowledge of network topology in the core network. | 03-11-2010 |
20100061382 | METHOD, APPARATUS AND COMPUTER PROGRAM FOR PROCESSING A MESSAGE USING A MESSAGE PROCESSING NODE - There is disclosed a method, apparatus and computer program product for processing a message using a message processing node. A message is received at the message processing node and at least one parameter value is extracted from the message. An attempt is made to select a node from a library of pre-configured nodes by using the at least one parameter value and the message is processed using the selected node. In attempting to select a node, an attempt is made to locate a pre-configured node that is appropriate for the message received and responsive to being unable to locate such a pre-configured node, a new node is configured using any parameter values extracted from the message. | 03-11-2010 |
20100067532 | Communication Path Control System, Program, and Storage Medium Therefor - A communication path control system includes a storage device which stores data of paths between communication nodes; and a communication path selecting device which selects a path candidate for setting a new communication path among path candidates, each of which can be provided as a communication path between the communication nodes. Based on the data of paths, the communication path selecting device obtains MAX(PN) for each of the path candidates P | 03-18-2010 |
20100074262 | Method and Installation for Optimized Transmission of Data Between a Control Device and a Plurality of Field Devices - The invention relates to a method for optimized transmission of data between a control device and a plurality of field devices that are connected to one another via an IP-based communications network, wherein the data transmission is controlled using a Profinet protocol. The invention further relates to a control and data transmission installation ( | 03-25-2010 |
20100080236 | NEXT GENERATION AIRCRAFT RADIOS ARCHITECTURE (NGARA) - An aircraft radio architecture is provided. The aircraft radio architecture includes a processing subsystem, a network subsystem communicatively coupled to the processing subsystem, and a radio front end communicatively coupled to the processing subsystem via network connectivity and the network subsystem. The processing subsystem includes a storage and processing medium to hold and process aeronautical radio software. The network subsystem is housed in a common computing cabinet with the processing subsystem. The network connectivity is configured to send digital messages for commanding and reconfiguring the radio front end for different functions and modes of operation. | 04-01-2010 |
20100080237 | FIBRE CHANNEL PROXY - A fibre channel proxy proxies storage operations in a fibre channel storage network. A first set of fibre channel proxy ports are configured to receive storage operations from one or more initiators. A second set of fibre channel proxy ports are configured to forward the storage operations to one or more storage targets. Fibre channel port identifiers for the storage targets are used to communicate with the initiators during the storage operations over the first set of fibre channel proxy ports. Fibre channel port identifiers for the initiators are used to communicate with the storage targets during the storage operations over the second set of fibre channel proxy ports. This scheme allows the fibre channel to operate transparently in the fibre channel network. | 04-01-2010 |
20100085976 | ENFORCED ROUTING IN SWITCH - A method and system for enforcing routing in Fibre Channel Arbitrated Loop (FCAL) switch define a message route for an initiator to initiator message in a FCAL network. The message route is for the initiator to initiator message to traverse each selected switch device in the FCAL network. If the message received is an initiator to initiator message, the system and method force the message that is initiator to initiator message to adapt the defined message route. In this way, the initiator to initiator traffic is forced to traverse identified links in a switched network and can identify issues and problems associated in each of the links. | 04-08-2010 |
20100085977 | Optimized Dynamic Multipoint Virtual Private Network Over IPv6 Network - Method and apparatus including registering a first spoke router with a hub router, forwarding an Internet Protocol version Four (IPv4) data packet from the first spoke router to a second spoke router over an Internet Protocol version Six (IPv6) multipoint tunnel via the hub router, transmitting a binding information associated with the first spoke router from the hub router to the second spoke router, and establishing a direct communication path by the second spoke router with the first spoke router based on the received binding information are provided. | 04-08-2010 |
20100091778 | METHOD AND APPARATUS FOR IDENTIFYING LABEL DISTRIBUTION PROTOCOL FLAPPING EVENTS - A method and apparatus for identifying a Label Distribution Protocol (LDP) flapping event in a communication network are disclosed. For example, the method counts a total number of LDP session up events, a total number of LDP session down events, a total number of link up events, and a total number of link down events within a predetermined time interval. The method then determines an occurrence of a LDP flapping event using the plurality of total numbers. | 04-15-2010 |
20100091779 | Arrangement and Method Relating to Identification of Hardware Units - A switching node in a distributed transmission network. The node, which is assigned a unique switching node identity (SID) includes a number of switch ports for connection of a number of line boards with subscriber line ports. The node detects a request for an IP address from a line board and identifies the switch port on which the request is received. The node generates an extended IP address request message by adding information about the SID and the receiving switch port over which the IP address request was received. The node forwards the extended IP address request message to a control unit within the node or to an external switching control node. | 04-15-2010 |
20100098090 | METHOD FOR ELECTING AGGREGATOR NODES IN A NETWORK - A method for electing aggregator nodes in a network, wherein the network includes a plurality of sensor nodes to measure data, and at least one of the sensor nodes functioning as aggregator node to aggregate sensored data obtained by at least a subset of the sensor nodes, the network further including at least one sink node to collect data aggregated by the aggregator nodes, the method including: establishing pairwise secret keys between a current aggregator node and each sensor node of the subset of sensor nodes; at each of the sensor nodes of the subset, choosing a random number and encrypting the random number using the established key; providing a communication chain between the sensor nodes of the subset and summing the encrypted random numbers of all sensor nodes of the subset; and determining a new aggregator node on the basis of the resulting sum according to a predefined calculation scheme. | 04-22-2010 |
20100098091 | COMMUNICATION SYSTEM, COMMUNICATION APPARATUS AND TERMINAL ACCOMMODATION APPARATUS - A communication system, a communication apparatus and a terminal accommodation apparatus which use a metallic subscriber line and are a high-speed and inexpensive are provided. The communication system includes a plurality of terminal accommodation apparatuses | 04-22-2010 |
20100103940 | Rapid Dissemination of Bulk Information to Widely Dispersed Network Nodes - Bulk information is transferred to nodes in a communication network having a plurality of widely dispersed nodes. The information can be an image, content, or configuration information. The information is uni-cast to a selection of nodes by a central node or server, to seed the information at certain nodes in the network. The information is then distributed by these seed nodes to every other node in the network. A first algorithm selects which nodes should be seeded with information by the central node. A second algorithm distributes information in the network on a query basis. | 04-29-2010 |
20100103941 | Data Collection from CPE Devices on a Remote LAN - Methods, systems, and computer-readable media for collecting data from CPE devices located on a remote LAN are provided. Communication is established over a WAN with a gateway attached to the LAN. The gateway is then used to enumerate the CPE devices on the LAN. A firewall pinhole is created in the gateway for each CPE device on the LAN, and communication is established through the pinholes to the CPE devices to collect the desired data. | 04-29-2010 |
20100103942 | LABEL SWITCHED PATH NETWORKING - A network arranged to implement label switched paths, comprising: an ingress label edge router (LER), atleast one label switching router (LSR), and an egress LER, in which the ingress LER is connected to the egress LER via one or more of the LSRs. In said network the ingress LER is arranged to transmit, in use, a path message for setting up a bidirectional label switched path (LSP) from the ingress LER to the egress LER via at least one LSR in response for a request for such an LSP. The path message is transmitted over the path of the LSP to be created, in which the path message comprises a first parameter indicative of the bandwidth to be assigned to data traversing the LSP in a first, downstream, direction from ingress LER to egress LER and a second parameter indicative of the bandwidth to be assigned to data traversing the LSP in an opposite, upstream, direction, in which the upstream and downstream bandwidths are different. | 04-29-2010 |
20100111092 | RING CONNECTION CONTROL CIRCUIT, RING SWITCHING HUB, RING ETHERNET SYSTEM, AND RING CONNECTION CONTROLLING METHOD - If either of the MAC processing units in one of the ring connection control circuits receives a MAC frame that includes control information for the redundancy control process related to one of the subrings from that subring, then output of the relevant MAC frame to the transfer processing unit is restricted and the relevant MAC frame is output to the STP processing unit. | 05-06-2010 |
20100118877 | COMMUNICATIONS SWITCHING ARCHITECTURE - Presently described is a system and method for switching multimedia data communications, including but not limited to Voice over IP (VoIP) telephony, cable TV, digital audio and video. The system utilizes a single, integrated device to provide all PacketCable-compliant functionality, including enhanced user privacy, compliance with CALEA, E911 and other mandated services not available in conventional distributed PacketCable systems. High speed and efficient, low cost operation are provided by means of an optimized data unit encapsulation scheme for internal switching and routing. A proprietary fiber optic backplane and removable optical connectors are used to enable lightspeed internal communications hot-swapping of components. Furthermore, the present system is extensible to all forms of digital data switching and is secure, resistant to Denial of Service attacks, and fault-resilient. | 05-13-2010 |
20100118878 | METHOD AND APPARATUS FOR NON-DISRUPTIVE CALL MODIFICATION - A method and system for changing the extent of data plane resources controlled by a control plane for a network connection which spans a contiguous set of nodes controlled by existing network control resources is disclosed. This is done in a non-disruptive manner. This typically involves two steps: i) Creating a new set of control plane resources for said network connection such that said data plane resources are shared with said existing network control resources; and ii) then terminating the existing network control resources such that said data plane resources are fully transferred to the new set of control plane resources without disrupting said network connection. The existing network control resources can be either a control plane resource or a non control plane resource. An example of a non control plane resource is network management software (e.g., an OSS (Operation Support System)), which forms part of the Management Plane. It should be noted that this does not need to be done for a complete end-to-end connection, but rather can be executed for the portion of the end-to-end connection which is to be controlled by the control plane. | 05-13-2010 |
20100124230 | TERMINAL APPARATUS AND PROGRAM - An apparatus transmits reservation information including a contents-ID identifying the contents and a terminal-ID identifying the apparatus that transmits the reservation information to the apparatus determined by the contents-ID, receives the reservation information transmitted from the apparatus that accepts the reservation operation and updates a reservation terminal list that associates the contents-ID and the terminal-ID, verifies whether the acquired contents have defects, transmits a search-request having the contents-ID identifying the contents judged that have defects to the apparatus determined by the contents-ID, receives the search-request transmitted from the apparatus judged that have defects, retrieves the terminal-ID registered in association with the contents-ID of the search-request from the reservation terminal list, transmits a search-result having the acquired terminal-ID, receives a search-result from the apparatus to which the search-request is transmitted, and acquires recovery data of the contents that have defects from the apparatus identified by the terminal-ID of the search-result. | 05-20-2010 |
20100128732 | RSTP PROCESSING SYSTEM - The invention can achieve a recovery time that satisfies the demands of real-time transmission processing by performing, in an extremely short time period, an RSTP process in a network, which is configured in a ring topology and wherein a plurality of IEEE 802.3 compliant nodes is connected via prescribed transmission lines, using hardware to execute processes related to the physical layer and the data link layer of the OSI reference model—without software processing. The RSTP processing unit of each node: receives BPDU data, which is received from the network by one of two PHY units and stored in a BPDU send/receive buffer of a corresponding MAC unit that is connected to that PHY unit, via a BPDU data bus that is connected to that MAC unit; decodes the received BPDU data; performs a prescribed process; transfers the BPDU data, via the BPD data bus that is connected to the other MAC unit, to the other BPDU send/receive buffer; and transmits that BPDU data from the PHY unit connected to the other MAC unit to the network. | 05-27-2010 |
20100142538 | M2M data router - A router receives data packets from a remote M2M device and routes all or a portion of the data to one or more servers for further processing. Routing is determined based on the application layer data (data or data type) within the packet. For example, in a GPS tracking device, the data packet (or certain data within the packet) is routed to a first server when the data is of a first type or according to specific rule governing routing based upon some attribute. | 06-10-2010 |
20100142539 | PACKET PROCESSING INDICATION - A network, network devices, and methods are described for packet processing indication. A method includes tunneling a packet from a first network device to a second network device associated with a first checking functionality. The second network device has an address different than an original destination address of the packet. The method also includes return-tunneling the packet from the second network device to the first network device with an indication of whether the packet was processed by the first checking functionality. The method includes tunneling the packet from the first network device to a third network device associated with a second checking functionality in response to the indication being that the packet was not processed by the first checking functionality. The third network device has an address different from the original destination address of the packet. | 06-10-2010 |
20100142540 | EFFICIENT DATA TRANSMISSION WITHIN MOCA - Embodiments may be disclosed herein that provide systems, devices, and methods of operating a Multimedia over Coax (MoCA) network. One such embodiment is a method comprising: dedicating a portion of a MAP cycle prior to a MAP packet to reservation requests and small data packets; and dedicating a portion of the MAP cycle after the MAP packet to data traffic. | 06-10-2010 |
20100142541 | COMMUNICATION SYSTEM - A media gateway is configured to include a subscriber loop interface circuit, and TDM data-IP packet convert modules # | 06-10-2010 |
20100142542 | PERVASIVE REALTIME FRAMEWORK - A pervasive realtime framework supports the execution of realtime software applications with high-level functions that significantly reduce the effort and time needed to develop realtime software applications in a new operating environment paradigm in which realtime connections between network nodes are pervasive. The pervasive realtime framework handles the complex tasks of connecting to communicants, virtual areas, and other network resources, as well as switching those connections in response to user inputs and thereby enables software application developers to focus on developing high-level realtime software application functionality. | 06-10-2010 |
20100150161 | METHODS AND SYSTEMS FOR AUTOMATIC TRANSPORT PATH SELECTION FOR MULTI-HOMED ENTITIES IN STREAM CONTROL TRANSMISSION PROTOCOL - The present disclosure provides methods and systems for automatic transport path selection for multi-home entities in Stream Control Transmission Protocol (SCTP). The present invention provides systems and methods for directing data transfer between applications and devices residing on different computers or devices using a dynamic path selection algorithm for multi-homed network entities (using SCTP). When an application or device requests to transfer data to another application or device, the dynamic path selection algorithm selects the most efficient path for data transfer. The decision to select the best network path is based upon the dynamic network conditions, such as, for example, congestion window (CWND), round trip time (RTT), and the like, and/or provisioning information. | 06-17-2010 |
20100150162 | Network System and Audio Signal Processor - In the case of forming an audio network system in which a plurality of processors each having two sets of transmission I/Fs and reception I/Fs are connected and a TL frame generated by a master node and including a plurality of storage regions for audio signals circulates among the processors in each constant period to transport audio signals the among processors, the system is configured such that when a transmitted TL frame does not return to the reception I/F on the forward side but returns to the reception I/F on the backward side in a single mode of transmitting the TL frame to the forward side and circulating the TL frame through one transmission route, the system shifts to a twin mode of transmitting and circulating TL frames through two transmission routes. | 06-17-2010 |
20100158021 | SYSTEMS AND METHODS FOR PHYSICAL LAYER ("PHY") CONCATENATION IN A MOCA NETWORK - Systems and methods for concatenating messages in MoCA devices that are connected via a coax network are provided. One embodiment of a system according to the invention includes a home network having a plurality of nodes. The network is implemented over coaxial cable. The network includes a plurality of networked nodes. A transmitter of at least one of the networked nodes is configurable to transmit a concatenated burst. The concatenated burst includes a preamble, a first payload frame and a second payload frame. The first payload frame and the second payload frame are separated by a cyclic prefix of a first symbol of the second payload frame. | 06-24-2010 |
20100158022 | SYSTEMS AND METHODS FOR PROVIDING A MoCA IMPROVED PERFORMANCE FOR SHORT BURST PACKETS - Systems and methods for reducing the latency and for increasing throughput for MoCA devices that are connected via a coax network are provided. One method according to the invention includes, in a network having a plurality of network modules, each of the plurality of network modules being connected to a coax backbone, communicating over the coax backbone between the plurality of network modules. The method further includes a requesting the use of short burst messages. The method further includes responding to the requesting by constructing a short burst message with a single channel equalization section and reducing the number of bits per hertz in the transmission constellation. The resulting messages can be received with an acceptable error rate while making more efficient use of the MoCA network. | 06-24-2010 |
20100165995 | ROUTING FRAMES IN A COMPUTER NETWORK USING BRIDGE IDENTIFIERS - Methods, apparatus, and products for routing frames in a network using bridge identifiers, wherein the network includes a plurality of bridge nodes. At least one of the bridge nodes operates as an ingress bridge node through which frames are received into the network. At least one of the bridge nodes operates as an egress bridge node through which frames are transmitted out of the network. One of the bridge nodes receives, from the ingress bridge node, a frame for transmission to a destination node. The destination node connects to the network through the egress bridge node. The frame includes an ingress bridge identifier and an egress bridge identifier. The bridge that received the frame then routes the frame to the egress bridge node through which the destination node connects to the network in dependence upon the ingress bridge identifier and the egress bridge identifier included in the frame. | 07-01-2010 |
20100165996 | SYSTEM AND METHOD FOR EXCHANGING DATA BETWEEN A FIRST DATA PROCESSING SYSTEM AND A SECOND DATA PROCESSING SYSTEM VIA AN AT LEAST PARTLY PUBLIC COMMUNICATION NETWORK - Communication system for exchanging data, via a communication network at least partly accessible to the public, between a first data processing system and a second data processing system, includes a first data processing system adapted to communicate according to a communication protocol, wherein the first data processing system is linked via a first coupling to the communication network at least partly accessible to the public, and a second data processing system, includes at least one data processing system, adapted to communicate according to the communication protocol, wherein the second data processing system is linked via a second coupling to the communication network at least partly accessible to the public, characterized in that at least one of the couplings comprises a data connection inaccessible to data traffic according to the communication protocol. | 07-01-2010 |
20100165997 | PATH SWITCHING METHOD, COMMUNICATION SYSTEM, COMMUNICATION DEVICE, AND PROGRAM - When switching every path which uses as a relay point a communication device including a removal target resource, to another path having a route not passing through the removal target resource, a maintenance person transmits a removal preparation request specifying the removal target resource to the relay point communication device. Upon receiving the removal preparation request, the communication device detects a path identifier and a start point communication device of each path passing through the removal target resource, and transmits a path switching request specifying the path identifier and the removal target resource, to the start point communication device. Upon receiving the path switching request, the communication device computes a route of another path not passing through the removal target resource and having the same start point and end point as those of the identified path, and after setting the other path having the computed route, disconnects the identified path. | 07-01-2010 |
20100165998 | COMMUNICATION NODE, AND RING CONFIGURATION METHOD AND RING ESTABLISHMENT METHOD IN COMMUNICATION SYSTEM - A plurality of communication nodes are one-to-one connected to each other by Ethernet (registered trademark) which is duplicated with a normal-system ring and with a standby-system ring. The communication node includes an A port, a B port, and a communication processor that performs a process of receiving a frame output from the B port and a process of transmitting the frame from the normal-system ring from the B port when the communication is normal. When other communication node performs a loop-back process due to communication abnormality, the communication node performs only a process of forwarding a frame input from the standby-system ring in the B port without receiving the frame and performs a process of transmitting the frame from the A port to the standby-system ring. | 07-01-2010 |
20100165999 | METHOD OF COMMUNICATION BETWEEN A SOURCE NODE AND A DESTINATION NODE BOTH BELONGING TO A VEHICULAR NETWORK - A method of communication between a source node in motion and a destination node. The method includes the following steps implemented by the destination node: receiving a packet sent by the source node, said packet including current mobility information relating to the source node; and, for routing at least one response packet intended for the source node: predicting a location geographical area of the source node from the current mobility information relating to the source node contained in said packet received therefrom beforehand, the geographical area thus predicted purportedly being a destination geographical area; at least one step of sending to the destination geographical zone another packet containing said response packet and the destination geographical zone and, if appropriate, passing in transit through at least one intermediate node of a vehicular network. | 07-01-2010 |
20100183016 | SYSTEM AND METHOD FOR A CROSS CHANNEL DATA LINK - A node comprises a host computer operable to execute application tasks and to transmit data; a local time-triggered Ethernet switch operable to enforce temporal constraints on time-triggered data; and a time-triggered Ethernet controller coupled to the local time-triggered Ethernet switch and operable to be coupled to a time-triggered Ethernet switch in each of a plurality of other control nodes. The time-triggered Ethernet controller is further operable to communicate with the plurality of other control nodes to synchronize a local clock to establish a global time base and to provide a signal to the host computer for the host computer to synchronize execution of the application tasks by the host computer with the execution of application tasks in each of the plurality of other control nodes | 07-22-2010 |
20100183017 | Network System, Node Device, Data Distribution Method, Information Recording Medium, and Program - A distribution request sending unit ( | 07-22-2010 |
20100189110 | Multipath data communication - A multipath data communication network structure in which probing middle-boxes send periodical probe messages through their different interfaces and subsequent routers map the probe messages through their randomly selected interfaces until each probe message arrives at a destination, engages to a loop or meets a time-to-live limit. The probing middle boxes select a random interface for each probe message and furnish their routable identification and a temporary random number correlated to the selected interface to each probe messages. Subsequent multipath routers select a random outgoing interface and random forwarding state descriptor (FSD) and temporarily correlate the selected random outgoing interface with the FSD and add the FSD to the probe message. The probe messages provide different destinations with various hidden paths. Each hidden path enables forwarding of packets from probing middle-boxes to the destination without identifying any routable address en-route to the destination. The destination then provides a data source with the hidden path. Each multipath network element only store their mappings related to the paths for limited term so that each path expires and vanishes after the term. Attackers are not issued a new path and thus denial of service attacks are shortly stopped. | 07-29-2010 |
20100189111 | STREAMING DIRECT INTER-THREAD COMMUNICATION BUFFER PACKETS THAT SUPPORT HARDWARE CONTROLLED ARBITRARY VECTOR OPERAND ALIGNMENT IN A DENSELY THREADED NETWORK ON A CHIP - A computer-implemented method, system and computer program product for arbitrarily aligning vector operands, which are transmitted in inter-thread communication buffer packets within a highly threaded Network On a Chip (NOC) processor, are presented. A set of multiplexers in a node in the NOC realigns and extracts data word aggregations from an incoming compressed inter-thread communication buffer packet. The extracted data word aggregations are used as operands by an execution unit within the node. | 07-29-2010 |
20100189112 | COMMUNICATION SYSTEM, COMMUNICATION NODE, AND PACKET SCHEDULING METHOD - Provided is a communication system in which a transmission path between communication nodes is multiplexed. A communication node transmitting packets decides the order of the packets to be transmitted through each transmission path on the assumption that an event that causes a state change to the transmission path occurs upon the start of the packet transmission, such that the packet reception order is not reversed at a communication node that receives the packets. | 07-29-2010 |
20100189113 | LINK FAILURE RECOVERY METHOD AND APPARATUS - A method of routing packets across a packet switched network domain, comprising a multiplicity of nodes. Each node comprises an ingress interface and an egress interface. For each destination node a default and a detour branching are defined, each specifying a route to the destination node. For each two-edge connected node the default and detour branchings do not share a common ingress interface. Each node operates as an intermediate node receiving a packet at an ingress interface, identifying an egress interface based upon the ingress interface upon which the packet is received and the packet destination, forwarding the packet via that egress interface if the connected link is available and, if the connected link is not available, forwarding the packet via an alternative egress interface associated with said detour branching if the packet was received at an ingress interface associated with said default branching or dropping the packet if the packet was received at an ingress interface associated with said detour branching. | 07-29-2010 |
20100189114 | NETWORK COMMUNICATION NODE - The invention addresses reducing time taken to obtain destination MAC addresses or alleviating the workload of manually setting MAC addresses in physical ports for duplicate PtP connections in WAN. A physical port is provided with functionality that, when transmitting a data frame received by the transmission block in the physical port, copies the content of the source MAC address field in the received data frame to the destination MAC address field, selects a destination MAC address randomly, or specifies a fixed value which has been set beforehand as the destination MAC address. The port is also provided with functionality that performs receive processing on a data frame after being received by the reception block without inspecting the destination MAC address field in the MAC header. Thereby, the time to obtain addresses is reduced or the setting workload is lessened. | 07-29-2010 |
20100189115 | EDGE NODE REDUNDANT SYSTEM IN LABEL SWITCHING NETWORK - In a label switching network, in normal times, packet transfer is performed using a protection-target label switching path set between a primary edge node device and a remote edge node device. Then, when a failure occurs in the primary edge node device, a secondary edge node device takes over the label switching path session from the primary edge node device and operates as the start-point node or the end-point node of the protection-target label switching path, to continue packet transfer using a backup label switching path. | 07-29-2010 |
20100195659 | Switch And/Or Router Node Advertising - A first of a plurality of intermediate routing devices is operable to advertise to and/or receive status information from remaining one(s) of the intermediate routing devices. The intermediate routing devices may store and/or analyze the advertised and/or received status information and may make routing decisions based on it. The first routing device may advertise status information for itself and/or for one or more other intermediate routing devices. Data may be routed based on type of data, service level and/or priority associated with the data. The advertised and/or received status information comprises current status information, predicted status information and/or past status information which may be based on one or more of port status, CPU utilization, memory utilization, quality of service (QoS), bandwidth utilization, bandwidth availability, traffic load, congestion, number of connections handled and capability to provide a particular level of service. | 08-05-2010 |
20100195660 | RING TYPE ETHERNET SYSTEM, RING TYPE SWITCH, RING CONNECTION CONTROL CIRCUIT, RING TYPE ETHERNET SYSTEM CONTROL METHOD, RING TYPE SWITCH CONTROL METHOD AND RING CONNECTION CONTROL METHOD - Ring type switches | 08-05-2010 |
20100202462 | DYNAMICALLY TRANSITIONING STATIC NETWORK ADDRESSES - In an embodiment, an apparatus comprises one or more processors; logic coupled to the one or more processors for execution and configured to perform receiving, from a second computer, a request for information about a first address of a customer premises equipment (CPE) device and including a second address of the second computer; determining that an address record of the first address identifies a third address, which is different from the second address, for a termination unit associated with the CPE device; in response to the determining: causing the generating and sending of one or more updates of inter-domain routing protocol information for the CPE device; updating the address record by storing the second address in a location that identifies the termination unit that is associated with the CPE device. | 08-12-2010 |
20100202463 | COMMUNICATIONS SYSTEM FOR AN UNDERWATER FLUID EXTRACTION FACILITY - A system for enabling communication between an underwater fluid extraction facility and a remote location comprises a fibre-optic cable connected between the facility to the remote location, signal transmission means at the remote location for transmitting signals to the fibre-optic cable, a distribution hub in the facility for receiving signals from the other end of the cable and at least one secondary hub located at the facility in communication with the distribution hub. Communication between the facility and the remote location is effected using a Local Area Network. Preferably Ethernet signalling is used throughout the network. | 08-12-2010 |
20100202464 | METHOD AND APPARATUS FOR PRELOADING PACKET HEADERS AND SYSTEM USING THE SAME - A packet header preloading apparatus comprises at least a packet detector, at least a packet header buffer and at least a data dispatcher. The at least a packet detector is configured to detect an operation of a packet direct memory access controller storing at least a packet into a main memory. The at least a data dispatcher is configured to read a header of the at least a packet from the main memory and to temporarily store the header in the at least a packet header buffer. | 08-12-2010 |
20100202465 | NETWORK MANAGEMENT STATION, NETWORK CONTROL SYSTEM, AND NETWORK MANAGEMENT METHOD - The present invention enables dynamic route switching according to link quality, while maintaining the quality of a plurality of routes. According to quality information received from a second network control entity, if the control unit of a network management station has determined that the quality of communication over a particular link has degraded, the control unit assigns a link whose current throughput satisfies a bandwidth required for a service defined in the service contract and whose response time satisfies minimum response time defined in the service contract to each service in descending order of priority. | 08-12-2010 |
20100202466 | INTER-ROUTER COMMUNICATION METHOD AND MODULE - A system and method of inter-router communication is described. The system and method include a routing protocol communication, configured to be sent between a plurality of routers on a network, and having a data plane update packet sent with a route update packet. The data plane update packet includes routing attributes corresponding to information export protocol signatures. A signature recognition module may be located on at least one of the routers in the network, and can store and recognize data packet signature patterns located in at least a portion of a payload of the data plane update packet. A data plane filter module can also be located on at least one of the routers, and can handle data packets according to filtering rules for specific data packet signature patterns. | 08-12-2010 |
20100208739 | METHOD FOR SELECTING RELAY IN WIRELESS BROADCAST AD HOC NETWORKS - The method of the invention is implemented in ad hoc communications network employing at least two-hop routing and wherein each node in the network employs an omnidirectional send/receive capability. Each node keeps a near neighbour database (NND) updated by receiving of messages. Each Othernode in the network, the message of which was received by Mynode in a time period T, is a candidate for becoming a relay for transmitting Mynode's messages. The probability of an Othernode to become a relay for Mynode is higher for a larger amount of candidates Othernode has in its NND. The probability for the Othernode to become a relay is higher the larger its distance from Mynode. | 08-19-2010 |
20100208740 | Communication Apparatus and Communication System - A communication apparatus includes a first storage portion storing an address control table registering a MAC address which each of a plurality of communication devices connected to the same local area network has, a comparison portion distinguishing each of the registered MAC addresses by comparing the MAC addresses corresponding to the plurality of communication devices registered in the address control table sequentially in a bit-by-bit manner until the MAC addresses can be distinguished from each other and a control portion determining whether or not data transmitted in the local area network is acquired on the basis of a comparison result. | 08-19-2010 |
20100208741 | TECHNIQUE FOR ENABLING TRAFFIC ENGINEERING ON CE-CE PATHS ACROSS A PROVIDER NETWORK - In one embodiment, Traffic Engineering (TE) is configured on a provider edge device to customer edge device (PE-CE) link extending from a provider edge device (PE) in a provider network to a customer edge device (CE) in a customer network. TE information regarding the TE-configured PE-CE link is conveyed from the PE to one or more other nodes in the provider network. TE information regarding one or more other TE-configured PE-CE links is received from one or more other nodes. A TE database (TED) is expanded to include information for the one or more other TE-configured PE-CE links. TE is applied to a customer edge device to customer edge device (CE-CE) path using at least some of the information for the one or more other TE-configured PE-CE links included in the TED. | 08-19-2010 |
20100220733 | Communication Structure for Solar Inverters - There is described a communication structure for at least two solar inverters, having a transmission medium by means of which each of the at least two solar inverters is connected to a communication network with a first group of the solar inverters each being connected via an LAN interface to the communication network, and with a further group of the solar inverters being connected to the first group via serial interfaces. Two different network types are therefore provided with the first being suitable for standard LAN technologies with rapid data transmission over short distances, and with the second being suitable for interference-insensitive data transmission over long distances. | 09-02-2010 |
20100220734 | Multifabric Communication Using a Backbone Fabric - A Fibre Channel router used to join fabrics. EX_ports are used to connect to the fabrics. The EX_port joins the fabric but the router will not merge into the fabric. Ports in the Fibre Channel router can be in a fabric, but other ports can be connected to other fabrics. Fibre Channel routers can be interconnected using a backbone fabric. Global, interfabric and encapsulation headers are developed to allow routing by conventional Fibre Channel switch devices in the backbone fabric and simplify Fibre Channel router routing. Phantom domains and devices must be developed for each of the fabrics being interconnected. Front phantom domains are present at each port directly connected to a fabric. Each of these is then connected to at least one translate phantom domain. Zoning is accomplished by use of a special LSAN zoning naming convention. This allows each administrator to independently define devices are accessible. | 09-02-2010 |
20100226377 | Communication System, Node, Terminal and Communication Method and Program - It is possible to increase the communication system transmission capacity flexibly and at low cost in accordance with a communication system traffic amount. A terminal connected to a plurality of networks distributes a plurality of frame segments generated by dividing a single frame to the plurality of networks connected to the local terminal transmits them. Further, the terminal reconstructs the original frame from the plurality of frame segments generated by dividing the single frame. It should be noted that each of the frame segments contains division configuration information indicating how the frame has been divided (the number of divisions and the order of the frame segments) and also contains information required for performing MAC address learning for determining the path to the destination terminal. | 09-09-2010 |
20100226378 | COMMUNICATION CONTROL DEVICE AND COMMUNICATION CONTROL METHOD - In a communication system of a subscriber extension line system, there is provided a communication controller whereby the load of an unnecessary process to be applied on a communication controller relating to a destination of a mobile telephone is eliminated and the processing efficiency for communication control is enhanced. In a D-RNC which controls the communication of the mobile telephone and which is commonly connected with an S-RNC, the mobile telephone moves while maintaining the communication with the S-RNC. When the mobile telephone enters a cell relating to the D-RNC, the control data is transmitted or received between the S-RNC and the node for managing the mobile telephone. There are also provided: an IP address/UDP port number for RNSAP, reading/setting section | 09-09-2010 |
20100226379 | Policy control method and system for layer two devices - A policy control method for layer two devices is disclosed. Said method includes: after the Resource and Admission Control Subsystem (RACS) generates the policy of layer two device, said policy of layer two device is sent down to the IP border point; said IP border point notifies said policy of layer two device to layer two device. A policy control system for layer two devices is disclosed. Said system comprises RACS, layer two devices and IP border point. After generating the policy of layer two devices, said RACS is used to send said policy of layer two device down to IP border point. The IP border point is used to notify the policy of layer two device to layer two device. The layer two device is used to receive and perform the policy of layer two device. By employing said method and system, the policy control for layer two device is easy to be operated and realized, the maintenance is simple, and the cost of maintenance is reduced. | 09-09-2010 |
20100232436 | A Multi-Hop Communication Method, a Multi-Hop Communication Terminal and Communication Program - The degradation of the communication characteristics and the throughput of the entire network can be improved. The failures of sending and receiving are reduced and the transmission time is reduced. In a multi-hop communication method how the source terminal | 09-16-2010 |
20100232437 | METHOD AND NODE FOR TRANSMITTING DATA OVER A COMMUNICATION NETWORK USING NEGATIVE ACKNOWLEDGMENT - A method of transmitting data over a communication network using negative acknowledgment is presented. In the method, a stream of data packets is transmitted from a first node of the network to a second node of the network. All but at least two of the stream of data packets is successfully received at the second node, wherein the data packets that are not successfully received are not located sequentially within the stream of data packets. A status packet is transmitted from the second node to the first node, wherein the status packet includes an indication of each of the data packets that were not successfully received. In response to receiving the status packet at the first node, the data packets that were not successfully received at the second node are retransmitted from the first node to the second node in response to receiving the status packet. | 09-16-2010 |
20100232438 | METHOD AND NODE FOR EMPLOYING NETWORK CONNECTIONS OVER A CONNECTIONLESS TRANSPORT LAYER PROTOCOL - A method of establishing a network connection between two nodes of a communication network via a connectionless transport layer communication protocol is presented. In the method, a plurality of data packets is exchanged between a first node and a second node. Each of the data packets comprises a header and a payload formatted according to the connectionless protocol. The connectionless protocol payload of each of the data packets includes a separate header comprising a first port indicator for the first node and a second port indicator for the second node. The separate header of at least one of the data packets also includes an indication to establish a connection between the first node and the second node. In response to the exchange of data packets, the first and second nodes establish the connection, wherein the first port indicator and the second port indicator are associated with the established connection between the nodes. | 09-16-2010 |
20100238939 | INTERMEDIATE NODE DEVICE, METHOD OF CONTROLLING INTERMEDIATE NODE DEVICE, AND NETWORK SYSTEM - An intermediate node device, a method of controlling an intermediate node device, and a network system are provided. The intermediate node device may receive a data packet from an upper intermediate node device and generate a first acknowledgement (ACK) message and a second ACK message with respect to the received data packet. Also, the intermediate node device may transmit the first ACK message to the upper intermediate node device, and transmit the second ACK message to an upper intermediate node device which is separated by a predetermined number of hops. | 09-23-2010 |
20100238940 | ASCERTAINING PRESENCE IN WIRELESS NETWORKS - One of many aspects of the invention relates to an ad hoc network in which inbound messages are communicated from an originating node to a gateway node via a plurality of intermediate nodes. In this respect, a method performed by an intermediate node in communicating the inbound message to the gateway node includes: maintaining a routing table; and using the routing table, selecting a node for use as the next hop by determining whether a maximum number of allowable hops for an inbound message is exceeded by using such node, and comparing a preference of using such node to preferences of using other known nodes by which the maximum number of allowable hops would not be exceeded. Another aspect includes sending a “leave” message when an intermediate node leaves the ad hoc network, whereby the intermediate node is removed from similar routing tables maintained by other intermediate nodes. | 09-23-2010 |
20100238941 | PACKET TRANSMISSION APPARATUS, LINE INTERFACE UNIT, AND CONTROL METHOD FOR PACKET TRANSMISSION APPARATUS - A packet transmission apparatus includes: a plurality of communication ports; a switch for switching packets; a storage unit which stores a plurality of queues for respectively holding packets to be output from the plurality of communication ports; and a stop signal generating unit. The stop signal generating unit generates a stop signal for stopping packets directed to one of the communication ports from being input into the switch, if the amount of packets held in the queue for the one communication port is equal to or larger than a certain first threshold value, and if the sum of the amounts of packets held in the plurality of queues is equal to or larger than a certain second threshold value. | 09-23-2010 |
20100246586 | SYSTEMS AND METHODS FOR RETRANSMITTING PACKETS OVER A NETWORK OF COMMUNICATION CHANNELS - Systems and methods for transmitting packets over a network of communication channels are provide. A system according to the invention may include first and second nodes in communication with a coax backbone. The first node may further include a retransmission buffer. The system may also include a network access coordinator operative to coordinate access of the nodes to the coax backbone. In a time period at least one first packet is transmitted by the first node to the second node. The first packet may include an indication that retransmission service is applied. The first packet may also include a indication of the length corresponding to the packet. If, during the first time period the packet is not received by the second node, the second node is operative to send a retransmission request to the network access coordinator. | 09-30-2010 |
20100254392 | MANAGING TRANSMISSIONS AMONG NODES COMMUNICATING OVER A SHARED COMMUNICATION MEDIUM - A method is provided for managing transmissions among nodes communicating over a shared communication medium. The method includes: transmitting a frame from a sender node to a plurality of receiver nodes, the frame including at least a portion of a data packet and control information associated with accessing the communication medium; transmitting over the communication medium information indicating an end of a time window allocated for transmission of acknowledgement signals to the sender node from at least some of the plurality of receiver nodes; assigning each of a plurality of time slots in the time window to different subsets of the plurality of receiver nodes; and for a given receiver node, transmitting an acknowledgement signal from the given receiver node to the sender node during a time slot assigned to the given receiver node, the acknowledgement signal responsive to at least the frame. | 10-07-2010 |
20100254393 | Communication System - A communication system is provided having a plurality of FlexRay network nodes by which respective user data packets are provided in an IP data packet format or an Ethernet data packet format, and having a FlexRay bus system, by whose physical layer data are transmitted between the FlexRay network nodes. The IP data packet format or the Ethernet data packet format each having a plurality of bit positions. The FlexRay network nodes are set up such that contents of the bit positions of the user data packets are each converted onto corresponding signals of the physical layer of the FlexRay bus system. | 10-07-2010 |
20100260189 | TRANSFERRING DATA AMONG NODES ON A NETWORK - Techniques for transferring data among nodes on a network are disclosed. Some example methods include a downloader-initiated random linear network coding algorithm. A downloading node may be aware of the chunks of original data held by neighboring nodes, and the downloading node can request linear combinations of chunks from the neighboring nodes that are linearly independent of any linear combinations of chunks already held by the downloading node. | 10-14-2010 |
20100260190 | Method and system for data transmission - A method, system and program for transmitting a data stream in a network of interconnectable end-user nodes comprising a source node, a plurality of recipient nodes and a plurality of further nodes, wherein each end-user node executes a communication client application. The method comprises: the source receiving a command to transmit the data stream to the plurality of recipients; selecting from the plurality of further nodes at least one relaying node to relay the data stream between the source node and the plurality of recipients; the source establishing a connection to the at least one relaying node; the at least one relaying node establishing a connection to each of the plurality of recipients; transmitting the data stream from the source to the at least one relaying node; and transmitting the data stream from the at least one relaying node to the plurality of recipients. | 10-14-2010 |
20100260191 | Optimising communications - A method of transmitting a data stream to end-user nodes of a network, and a corresponding communication system, program, and distribution system for distributing the program. The method comprises: for each of a plurality of possible combinations of routes of the stream to a plurality of consuming end-user nodes, evaluating a utility function for each of the consuming end-user nodes, the utility function being dependent on route and defining a quantitative measure of end-user benefit that would be experienced at the respective end-user node by consumption of the stream; for each of the plurality of possible combinations of routes, determining an overall utility value based on the respective evaluation of the utility functions of each of the plurality of consuming end-user nodes; and selecting a preferred combination of routes for the stream based on the overall utility values of the different possible combinations. | 10-14-2010 |
20100260192 | Optimising communications - A method, system and program for routing a data stream amongst a plurality of network nodes including at least a plurality of end-user nodes. The method comprises: establishing a plurality of routes for the stream to a plurality of consuming end-user nodes, including at least one route via one or more relaying nodes; at each of a plurality of optimising nodes, executing an optimisation algorithm to determine a respective routing modification by evaluating a routing criterion with respect to a collection of end-user nodes which share information with the respective optimising node and determining a change in the routing criterion that would result from one or more potential routing modifications. The different optimising nodes' collections of end-user nodes are at least partially coincident such that each optimising node can determine a different routing modification with respect to at least some of the same end-user nodes. | 10-14-2010 |
20100265955 | CROSS LAYER ROUTING (XRP) PROTOCOL - In one aspect, a method includes receiving a packet at a first node, the first node comprising a processor, determining, at the first node, whether a destination node of the packet is within a zone of the first node, using, at the first node, an on-demand routing protocol to route data from the first node to the destination node if the destination node is outside the zone of the first node and using a network topology, stored at the first node, to route the packet from the first node to the destination node if the destination node is within the zone of the first node. | 10-21-2010 |
20100278184 | Method of Processing Event Notifications and Event Subscriptions - A method of processing event subscriptions in a telecommunications or data network comprising a plurality of nodes organized in clusters, in multiple layers. Each cluster has a cluster leader. The method comprises maintaining by each node a routing table comprising a list of nodes in its cluster and a repository of event subscriptions; forwarding an ascending subscription by a node to all nodes within its cluster and to its cluster's leader; forwarding a descending subscription to all nodes of all layers that the node is a leader and adding a received event subscription to the event subscriptions repository and associating said subscription with a node, which forwarded it. | 11-04-2010 |
20100278185 | METHOD FOR REDUCING THE REQUIRED MEMORY CAPACITY OF SWITCHES BY USING FICTIVE SOURCE MAC ADDRESSES - The present invention relates to an access node for an access network. The access node is arranged to receive uplink data packets from a plurality of network devices. Each data packet comprises a source MAC address related to the network device being the source of the data packet. The access node is arranged to alter the source MAC address in the received uplink data packets to a fictive source MAC address common for at least a subset of said network devices. The present invention also relates to a method for controlling data packet traffic in an access node. | 11-04-2010 |
20100284411 | SYSTEMS AND METHODS FOR PROVIDING A MULTI-CORE ARCHITECTURE FOR AN ACCELERATION APPLIANCE - The present solution is related to a method for distributing flows of network traffic across a plurality of packet processing engines executing on a corresponding core of a multi-core device. The method includes receiving, by a multi-core device intermediary to clients and servers, a packet of a first flow of network traffic between a client and server. The method also includes assigning, by a flow distributor of the multi-core device, the first flow of network traffic to a first core executing a packet processing engine and distributing the packet to this core. The flow distributor may distribute packets of another or second flow of traffic between another client and server to a second core executing a second packet processing engine. When a packet for the flow of traffic assigned to the first core is received, such as a third packet, the flow distributor distributes this packet to the first core. | 11-11-2010 |
20100303080 | Method and System for Caching IP Network Topology - In accordance with one embodiment of the present disclosure, a system for caching network traffic includes an interface configured to receive traffic from a plurality of nodes communicating in a network, a processor coupled to the interface and configured to identify each of the plurality of nodes communicating in the network, and a database. The database includes a node object dimension table that includes an entry for each identified node. Each entry in the node object dimension table includes a node identification and an address for locating the node in the network. The database also includes a communication fact table that includes an entry for each communication in the network. Each entry in the communication fact table includes a source node identification that includes the node identification for the source node, a communication identification, and a destination node identification that includes the node identification for the destination node. | 12-02-2010 |
20100303081 | COMMUNICATION SYSTEM AND METHOD FOR FORWARDING A PACKET AMONG A PLURALITY OF EDGE ROUTERS - A communication system is configured to include a plurality of edge nodes each coupled to a user network, and a plurality of point-to-point links each coupling a pair of edge nodes. Any pair of edge nodes is coupled via a point-to-point link included in the plurality of point-to-point links. When transmitting a first packet from a first user network coupled to a first edge node, to a second user network coupled to a second edge node, the first edge node creates a second packet by adding an ingress node identifier identifying the first edge node to the first packet received from the first user network. The second packet is forwarded among the plurality of edge nodes via point-to-point links, based on the ingress node identifier in the second packet and forwarding control information held in the each of the plurality of edge nodes. | 12-02-2010 |
20100303082 | Self-Routed Layer 4 Packet Network System and Method - The embodiment discloses a connection oriented packet network using an MPLS-type label switching technology. The network uses a very fast hardware-oriented self-routing protocol that can expose a path right-of-way and program a connection between a calling and called party at wire speed. The embodiment requires no provisioning and is well suited for mobile and ad-hoc networks. The system and method taught can be applied to other data networks where performance guarantees are important. | 12-02-2010 |
20100309922 | PROTECTING DATA INTEGRITY IN AN ENHANCED NETWORK CONNECTION - The integrity of a data stream transmitted over a network is protected by adjusting the sequence number, the port number, or another field of a data packet field, for a number of data packets so that the data packets will be considered either valid or invalid by a downstream receiving device. Data packets that have such a field adjusted can be thought of as being rotated outside of a valid range or window, as defined for a network connection. This field of a rotated data packet can be further adjusted, through de-rotation or re-rotation, for various applications. Downstream devices can thus respond to the data packets depending on the state of the rotation. | 12-09-2010 |
20100322256 | USING DISTRIBUTED TIMERS IN AN OVERLAY NETWORK - The present invention extends to methods, systems, and computer program products for using distributed timers in an overlay network. Embodiments of the invention can be used to replicate timers within an overlay network and can be used to make progress towards completing a portion of work within the overlay network based on a replicated timer. Accordingly, embodiments of the invention can be used to increase the availability of timer data as well as compensate for node failures within an overlay network. | 12-23-2010 |
20100322257 | SENSOR NODE FOR USING ASYNCHRONOUS MAC - Provided is a Media Access Control (MAC) technology that may improve a data transmission performance in an asynchronous sensor network. The MAC technology may increase a waked-up time interval of a reception node to thereby continue to receive traffic from a transmission node, and change a frequency band where data is transmitted and received to thereby reduce occurrence of collision. Also, when the wake-up time interval of the reception node is similar to a wake-up time of a neighboring node, the wake-up time interval of the reception node may be moved to another time interval, thereby improving the data transmission performance. | 12-23-2010 |
20100329266 | System and a Method for Resource Access Control - The present invention discloses a system and a method for resource access control. In the system, a resource access control function entity comprises path selection function means, which is configured to set a QoS policy and select a path meeting the QoS requirement for a service flow based on set QoS policy. In the present invention, by adding the path selection function means and selecting the path using the path selection function means, the x-RACF has the QoS policy based function of path selection and resource control for the service flow accessing to an access network, and thus the QoS guarantee capability of the NGN service is strengthened. | 12-30-2010 |
20100329267 | DATA PROCESSING APPARATUS, DATA PROCESSING METHOD, AND COMPUTER-READABLE STORAGE MEDIUM - A data processing apparatus includes an input unit to input data and processing modules. The processing modules may be connected as part of a ring-shaped data transfer path to transfer data in one direction. Each processing module includes a communication unit configured to implement a first data processing path and a setting path and a processing unit configured to process data received by the communication unit. When using switching data to switch the processing modules performing on the first data processing path to the processing modules performing on the setting path, the switching data is processed on the first data processing path. | 12-30-2010 |
20100329268 | Overlay Network Node And Overlay Networks - An overlay network node ( | 12-30-2010 |
20110002338 | Sleep-Mode Control Information Processing Device, Storage Medium and Sleep-Mode Control Method - An information processing device, comprising: a traffic control unit configured to regularly check whether packets are transmitted to an adjacent node and received from the adjacent node; and a sleep determination process unit configured to determine whether there is a possibility that packets are transmitted to the adjacent node when no packet is transmitted to the adjacent node and received from to the adjacent node, and to transmit a sleep OK notice to the adjacent node indicating that the adjacent node shift to a sleep mode when the sleep determination process unit determines that there is a low probability that packets are transmitted to the adjacent node. | 01-06-2011 |
20110038378 | TECHNIQUES FOR USING THE NETWORK AS A MEMORY DEVICE - Techniques for using the network as a memory device are provided. Network packets continue to circulate on a network using the network communication channel as a memory device. Nodes of the network are configured to selectively copy, use, verify, modify, create, and purge the network packets using file management semantics. | 02-17-2011 |
20110044345 | SYSTEM AND METHOD FOR EXECUTING DISTRIBUTED SOFTWARE - A system for executing distributed software under hard real-time conditions comprises a plurality of nodes and a communication channel. Nodes are allowed to transmit data across the communication channel within time windows relative to repetitive communication time intervals of the communication channel, wherein a number of bytes transmitted within the communication time windows may vary from communication time window to communication time window. The data may be transmitted as a message comprising a representation of an identifying tag and a representation of the data. Also a number of bytes representing respective tags may vary from communication time interval to communication time interval. | 02-24-2011 |
20110051733 | System and Method for Direct Communications Between FCoE Devices - Disclosed is an improved mechanism for direct communications and frame routing between FCoE devices within an Ethernet network supporting FCoE protocols. In particular, the methods and systems disclosed herein enable direct communications from one FCoE device to another without going through any intermediary such as an FCF (FCoE Forwarder) that is designed to route traffic between FCoE devices according to the current FCoE standards. This is accomplished by registering the Ethernet MAC address of an FCoE device in a name server via certain objects presently used in an FIP fabric login request, e.g., Port_Name or Node_Name, and other standard-specified objects and functionalities without requiring any changes to the existing FCoE and FC standards. | 03-03-2011 |
20110051734 | ENERGY EFFICIENT CONTROL OF DATA LINK GROUPS - Where parallel links between network devices are aggregated into link groups to support the transport of associated data streams, the link groups can be managed in an energy efficient manner by defining each link group as consisting of a primary link and one or more secondary links. The primary link in a link group remains enabled at all times but the secondary links are enabled only when needed and are disabled when no longer needed, minimizing power consumption for the secondary links (and the link group). | 03-03-2011 |
20110051735 | DYNAMIC LOAD BALANCING USING VIRTUAL LINK CREDIT ACCOUNTING - Methods and apparatus for dynamic load balancing using virtual link credit accounting are disclosed. An example method includes receiving, at a network device, a data packet to be communicated using an aggregation group, the aggregation group including a plurality of virtual links having a common destination. The example method further includes determining a hash value based on the packet and determining an assigned virtual link of the plurality of virtual links based on the hash value. The example method also includes reducing a number of available transmission credits for the aggregation group and reducing a number of available transmission credits for the assigned virtual link. The example method still further includes communicating the packet to another network device using the assigned virtual link. | 03-03-2011 |
20110058561 | Apparatus and method for transmitting/receiving packet in dual modem mobile communication terminal - An apparatus and a method for transmitting/receiving a packet in a dual modem mobile communication terminal support data communication using both a host modem and a slave modem by additionally driving the slave modem when packet traffic is heavy. In the method for transmitting/receiving, at a host modem, a packet in a mobile communication terminal that includes the host modem and a slave modem, when a packet is received under a state where only the host modem is driven, it is determined whether a buffer count of the host modem is greater than a reference value. When the buffer count of the host modem is greater than the reference value, the slave modem is additionally driven and the received packet is provided to the slave modem. | 03-10-2011 |
20110069712 | FAULT-TOLERANT, FRAME-BASED COMMUNICATION SYSTEM - A packet-switched, fault-tolerant, vehicle communication internetwork ( | 03-24-2011 |
20110069713 | METHODS AND APPARATUS FOR ADVERTISING A ROUTE FOR TRANSMITTING DATA PACKETS - Method and apparatus for advertising a route for transmitting data packets in a network. A first network element obtains a metric indicative of a cost for routing packets from the first network element to a second network element. The first network element compares the obtained metric with a metric received in a route advertisement message advertising a second route towards the second network element. The first network element sends route advertisement messages, advertising a first route towards the second network element through said first network element, only if the obtained metric indicates a lower cost than a received metric. When two or more network elements are advertising routes towards the same destination, the invention provides a solution allowing an optimized usage of transmission resources between these network elements and said destination. | 03-24-2011 |
20110075672 | Methods, Systems, and Products for Providing Communications Services - Methods, systems, and products provide communications services. A request for communications service is received at a service provider and a best-value scenario is determined. Packets of data are subcontracted to another service provider to receive a subcontracted processing service. A result of the subcontracted processing service is incorporated in the best-value scenario, and the communications service is provided to fulfill the request for communications service. | 03-31-2011 |
20110085556 | APPARATUS AND SYSTEM FOR AGGREGATING CAPTURED NETWORK TRAFFIC - Methods, systems, computer-readable media, and devices for aggregating sets of received captured network traffic by a network captured traffic distribution device communicatively coupled to a plurality of network captured network traffic distribution devices arranged in a stacked topology are described. Systems for aggregating captured network traffic may include a source of captured network traffic, a plurality of stacked network captured traffic distribution devices arranged in a stacked topology such that each network captured traffic distribution device is communicatively coupled via a communication link with at least one additional stacked network captured traffic distribution device, and an external device. In some embodiments, one or more of the stacked network captured traffic distribution devices, source, and/or external device may operate at locations that are geographically disperse from one another. | 04-14-2011 |
20110090912 | Steering Data Communications Packets Among Service Applications With Server Selection Modulus Values - Steering data communications packets for transparent, bump-in-the-wire data processing among multiple service applications; the service applications executing on servers organized in groups, each server in a server group executing an instance of a same service application, including selecting an instance of each of the service applications to process a packet; identifying a server selection value for each packet as a single integer value that yields server selection modulus values that identify each instance of each of the service applications to process the packet; and steering, by the switches in dependence upon the server selection modulus values, each packet to each instance of each of the service applications to process the packet. | 04-21-2011 |
20110090913 | APPARATUS AND METHOD OF CONTROLLING LSP OF RSVP-TE PROTOCOL USING LABEL WITH AVAILABILITY OF END-TO-END RANGE - Provided are a method and apparatus of controlling a Label Switched Path (LSP) of a Resource Reservation Protocol-Traffic Engineering (RSVP-TE) protocol, which may define an available label in an End-to-End range when a label is not changed by transit nodes, and is determined only by an external management system or a manager, or an ingress node or an egress node, thereby more simply and effectively operating the RSVP-TE protocol, and removing limitations in functions of nodes such as path calculating. | 04-21-2011 |
20110096786 | PAIRED NODE CONTROLLERS - In at least some embodiments, an apparatus comprises a pair of node controllers, each of the node controllers having a different processor assigned thereto. Each node controller is operable to selectively switch processor requests received from its assigned processor to the other node controller and to selectively switch responses to the processor requests to the other node controller. | 04-28-2011 |
20110096787 | RELAY METHOD, RELAY DEVICE, COMMUNICATION SYSTEM, AND COMPUTER PROGRAM - The present invention enables accurate simulation of the state of communication over a communication network in which a communication channel of different communication characteristic is set for each protocol and session, such as a VoIP network built in a multi-vendor environment, and evaluation of communication quality of communications between IP phones, etc. over a supposed communication network. A relay device for relaying packet communications between a plurality of communication devices is used, and the relay device sets a virtual processing unit as an initial process so that it corresponds to the packet transmission direction and/or attribute, based on the contents of a received packet specified by a control protocol, and relays communications of packets after the initial process, based on the packet loss rate and delay time distribution indicated by communication state information associated with the processing unit. | 04-28-2011 |
20110103390 | SERIALIZED ENFORCED AUTHENTICATED CONTROLLER AREA NETWORK - A system comprises a plurality of nodes; and a hub that is communicatively coupled to each of the plurality of nodes via a plurality of point-to-point links, wherein a priority-based arbitration scheme is used by the plurality of nodes and the hub to communicate over each of the plurality of point-to-point links. When the hub determines that one or more of the plurality of nodes is each transmitting a message having an identification field comprising a first sub-field and a second sub-field, the hub uses the first sub-field to select which node's message should be forwarded to the other nodes based, at least in part, on the priority-based arbitration scheme and forwards the selected node's message as it is received to the other nodes, continuing with the second sub-field of the selected node's message. | 05-05-2011 |
20110103391 | SYSTEM AND METHOD FOR HIGH-PERFORMANCE, LOW-POWER DATA CENTER INTERCONNECT FABRIC - A system and method are provided that support a routing using a tree-like or graph topology that supports multiple links per node, where each link is designated as an Up, Down, or Lateral link, or both, within the topology. The system may use a segmented MAC architecture which may have a method of re-purposing MAC IP addresses for inside MACs and outside MACs, and leveraging what would normally be the physical signaling for the MAC to feed into the switch. | 05-05-2011 |
20110110378 | Method and Apparatus for Communications Traffic Breakout - Various methods for communications traffic breakout are provided. One example method comprises generating packets for transmission from a first source of a client device via a bearer service between the client device and a server, and generating packets for transmission from a second source of the client device via the bearer service. The example method also includes directing transmission of packets from the first and second sources via the bearer service to a middlebox. The middlebox may be configured to forward packets from the first source to the server via the bearer service, and breakout, from the bearer service, packets from the second source and route the packets from the second source to a separate network. Similar and related example methods and example apparatuses are also provided. | 05-12-2011 |
20110122877 | HIGH DEFINITION VIDEO/AUDIO DATA OVER IP NETWORKS - The system transmits High Definition (HD) video/audio data, e.g. a JPEG2000-compressed video stream multi-channel audio stream, over a packet switching network, e.g. an Ethernet or IP network. Both the transmitter unit VTB and the receiver unit VRB feature a modular structure consisting of a base module or baseboard common to both units and one or more exchangeable adapter cards attached to or inserted into the baseboards to perform selected functions. The basebord is unitary, i.e. identical for both the VTB and the VRB; its components are activated depending upon the baseboard being in a VTB or a VRB. Each card is unique and earmarked and serves a specific purpose, e.g. for video coding and decoding, SMPTE processing, clocking/re-clocking, audio embedding/extraction. Upon inserting a card into a baseboard, the earmark is identified and the baseboard configured as transmitter or receiver baseboard. Functions in the baseboard can be implemented in Field Programmable Gate Arrays (FPGAs) and the network management, configuration, and/or control of the transmitting and/or receiving processes be performed by a softcore processors. This inventive combination of modular hardware/software results in a cost-effective, reliable, and fast system for transmitting large data volumes over packet switching networks. | 05-26-2011 |
20110122878 | METHOD OF PERCOLATION NETWORKING ARCHITECTURE FOR DATA TRANSMISSION AND ROUTING - The present invention relates to a new network architecture and its data transmission method based on percolation. The disclosed network architecture is a server-free and router-free network structure, wherein efficient routing can be operated with percolations based on the six degrees of separation theory in small world network modeling. An information transmission will be divided into two phases: routing phase and data transmission phase. In the routing phase, probe packets will be transmitted and forwarded in the network thus path selections are performed based on small-world strategy. In the second phase, the information will be encoded and transmitted using the paths selected at the first phase. In such a way, an efficient routing and data transmission mechanism can be built which allow us to construct a low-cost, flexible and ubiquitous network. | 05-26-2011 |
20110134926 | EDGE ROUTING USING CONNECTION REGIONS - A computer system identifies a source node that is to be connected to a target node, where the target node is connected to the source node using an edge that links a connection region associated with the source node to a candidate connection region of the target node. The computer system identifies candidate connection region constraints that place restrictions on where the candidate connection regions can be positioned on the target node and determines, based on the identified candidate connection region constraints, the position of each candidate connection region relative to the target node. At least two of the candidate connection regions are disconnected so that an edge's connection to the target node can change between the disconnected connection regions. The computer system also visually represents the position of each of the candidate connection regions of the target node. | 06-09-2011 |
20110134927 | METHOD FOR TRANSMITTING EXTENDED PROTOCOL MESSAGE TO CONTROL SUBSCRIBER SERVICES OF CONNECTION-ORIENTED ETHERNET - In order to transmit an extended protocol message for the purpose of controlling a service of a connection-oriented Ethernet including a plurality of nodes, when an LSP (Label Switched Path) generation request message is received, a path message including an object for delivery of upstream service frame information and an object modified for the transmission of traffic information of a service frame for downstream traffic policing is generated, the path message including the LSP generation request message. When a second node, one of the plurality of nodes, receives the path message from the first node, it generates a reservation (RESV) message including an object added for the transmission of a downstream service frame information and an object modified for the transmission of traffic information of a service frame for upstream traffic policing in response to the LSP generation request message. | 06-09-2011 |
20110134928 | TRANSMITTING A PACKET - Provided are a method, system, and program for selecting one of a plurality of adapters to use to transmit a packet. A packet is generated by a protocol driver having connection information in a packet header. A determination is made as to whether there is one value in a table for the connection information. The packet and the determined value are forwarded to a network driver in response to determining that the table has one value for the connection information. The network driver uses the forwarded value to determine one of a plurality of adapters to use to transmit the packet over a network. | 06-09-2011 |
20110142055 | MANAGING DATA TRANSFER IN A NETWORK ENVIRONMENT - A method for managing data transfer in a network environment, the method is provided. The method comprises receiving a request to transfer first data from a first source in a source domain comprising a plurality of sources to a first target in a target domain comprising a plurality of targets. If the first source is configured to transfer data in a first mode or if the first source is configured to transfer data in a second mode and the first data has previously been transferred to the target domain, a signature of the first data is transferred to the first target instead of the first data. If the first source is configured to operate in the second mode and the first data has not previously been transferred to the target domain, the first data is transferred to the first target. | 06-16-2011 |
20110142056 | Selecting A Path Through A Network - In a method for selecting a path through a network of nodes from a source device to a destination device, per hop behaviors (PHB) of the nodes is identified and a path entropy for a plurality of candidate paths through the network between the source device and the destination device are derived based upon the PHBs of the nodes. In addition, one of the plurality of candidate paths is selected to communicate data from the source device to the destination device based on the path entropies of the plurality of candidate paths. | 06-16-2011 |
20110149978 | NETWORK SYSTEM USING PATH HEALTH INFORMATION FOR PATH SELECTION - A network system employs path health information to select an acceptable path between a source node and destination node within an information handling system (IHS) and/or between a source node within one IHS and a destination node within another IHS. One or more switches may connect these two IHSs together. The network system accesses the path health information to determine the availability of paths for communicating between nodes. | 06-23-2011 |
20110158242 | TRANSPORTING OBJECT PACKETS IN A NESTED SYSTEM LANDSCAPE - Described are methods and systems related to transporting one or more object packets present in a nested hierarchy of one or more system landscapes. The object packets available for transporting from source systems to target systems present in the nested hierarchy of the system landscapes is identified. A transport request is generate for a collection of object packets of each source system in the nested hierarchy of the system landscapes. The transport requests are aggregated to render a nested transport collection. The nested transport collection is transported within the nested hierarchy of the system landscapes. The nested transport collection is deployed to assign the transport requests present in the nested transport collection to the target systems present in the nested hierarchy of the system landscapes. | 06-30-2011 |
20110158243 | METHOD OF DATA TRANSMISSION, DATA TRANSMITTING APPARATUS, AND NETWORK SYSTEM - A method of data transmission that includes: transmitting first data to be transferred in a synchronous packet using a second asynchronous packet having priority higher than that of a first asynchronous packet; and requesting transmission of second data following the first data using the second asynchronous packet after a lapse of a certain time from the transmission of the second asynchronous packet. | 06-30-2011 |
20110164621 | COMMUNICATION METHOD FOR RELAY NODE AND NEXT NODE OF THE RELAY NODE FOR NETWORK CODING - Provided is a communication method of a relay node for network coding, including determining one of a plurality of nodes included in a mesh network as a relay node to perform network coding; determining, by the relay node among the plurality of nodes, nodes capable of participating in the network coding; and performing the network coding with respect to the nodes capable of participating in the network coding. | 07-07-2011 |
20110170550 | NETWORK NODE AND LOAD DISTRIBUTION METHOD FOR NETWORK NODE - A network node includes: a plurality of network modules in which virtual nodes are installed; and a switch module being a starting point of a star connection when the network modules are connected in the star connection. Each network module includes: a physical interface connecting the network module to an outside network; and a network virtualization unit carrying out, with respect to data arriving in the physical interface, a destination search based on keys extracted from information of the data to determine whether the destination is a virtual node installed in a network module that includes the physical interface at which the data arrived or a virtual node installed in a network module that is connected by way of the switch module, and transmitting the data to a virtual node mounted in either network module in accordance with the determination result. | 07-14-2011 |
20110188506 | Distributed Master Election - A transmitting node in a telecommunications network, wherein data are distributed into one or more data storage groups (DSG), and wherein data related to a DSG is replicated into a plurality of data storage elements (DS) distributed along one or more nodes of the network. The transmitting node includes a network interface through which a bi-directional connection is established with a plurality of other nodes in a transport layer of the network, and from which messages are sent to the plurality of other nodes comprising an operational state matrix (OSM), which includes information held by the transmitting node about the operational state of the replicas of the DSs of each DSG. The transmitting node includes a memory for storing data. The transmitting node includes a processing unit which forms a list of the plurality of other nodes as having an answer pending of the node in the memory. The network interface receives an OSM from at least some of other nodes which are interpreted by the processing unit as answer messages from the list of the plurality of other nodes to the messages sent by the network interface, and which indicates that an OSM information exchange with the plurality of the other nodes is complete. The processing unit decides a node hosting the master DS replica of each DSG based on the OSM information exchange. The processing unit detects changes in a view of the world (VOW) which includes an accumulated set of OSMs with respect to each DSG hosted by the transmitting node. The network interface sends messages comprising changes in the VOW to the other nodes. | 08-04-2011 |
20110200051 | ETHERNET NETWORK SYNCHRONIZATION SYSTEMS AND METHODS - The present disclosure relates to Ethernet synchronization systems and methods that combines Synchronous Ethernet (Sync-E) and Precision Time Protocol (PTP) IEEE 1588 algorithms. The present invention includes systems and methods for Ethernet networks and node configurations that include a set of rules on node placement, such as Boundary Clock (BC) nodes and Sync-E nodes, a clock selection algorithm, a holdover algorithm, and the like. Advantageously, the present invention provides an architecture that allows practical and real-world useful clock propagation through placement of BCs and Sync-E nodes for best performance. Practical experience and theoretical design are embodied in the present invention to define a very specific set of rules on how to build a network capable of providing accurate and reliable synchronization. The present invention includes clock selection that unifies Sync-E and 1588 algorithms. | 08-18-2011 |
20110206053 | Hierarchical Network Topology - A network including a hierarchical structure of nodes is described. The structure of nodes includes n layers including n−1 layers of switch nodes and 1 layer of computational nodes. Each layer in the structure can include m | 08-25-2011 |
20110211583 | APPARATUS, METHOD, MANUFACTURE, AND SYSTEM FOR PROVIDING NETWORK SERVICES FROM BUILDING BLOCKS - A method and apparatus for communicating over a network is provided. The method includes obtaining building block codes, where the building blocks codes are capable of being used together to provide an end-to-end service. The building block codes are sent to each appropriate building block controller, where each building block controller is associated with a corresponding network node. Upon receiving a first packet of a connection for the first end-to-end service, a determination as to which network nodes of the plurality of network nodes should be used as network hops for the connection, and as to, for each network node that should be used as a network hop for the connection, which building block codes should be used by the building block controller corresponding to the network node. These determinations are communicated to each of the appropriate building block controllers. | 09-01-2011 |
20110216776 | METHOD AND APPARATUS FOR ASYNCHRONOUS ORTHOGONAL FREQUENCY DIVISION MULTIPLE ACCESS - A method of transmitting orthogonal frequency division multiple access signals includes transmitting a first stream of data from a first node of a network. The first stream includes a preamble and payload. A second stream of data is transmitted from a second node of the network. The second stream includes a preamble and payload, and the second stream has a shorter total length than the first stream. The transmission of the second stream starts at essentially the same time as the transmission of the first stream. A third stream of data is transmitted from the second node of the network. The third stream includes a preamble and payload. The transmission of the third stream begins at the end of the payload of the second stream and prior to the end of the transmission of the remainder of the payload of the first stream. | 09-08-2011 |
20110222548 | SYSTEMS AND METHODS FOR PROVIDING DISTRIBUTED PACKET LOSS CONCEALMENT IN PACKET SWITCHING COMMUNICATIONS NETWORKS - A communications system ( | 09-15-2011 |
20110228788 | ALTERNATE DOWN PATHS FOR DIRECTED ACYCLIC GRAPH (DAG) ROUTING - In one embodiment, a node “N” within a computer network utilizing directed acyclic graph (DAG) routing selects a parent node “P” within the DAG, and, where P is not a DAG root, may determine a grandparent node “GP” as a parent node to the parent node P. The node N may then also select an alternate parent node “P′” that has connectivity to GP and N. N may then inform P and P′ about prefixes reachable via N, and also about P′ as an alternate parent node to P to reach the prefixes reachable via N. Also, in one embodiment, P may be configured to inform GP about the prefixes reachable via N and also about P′ as an alternate parent node to P to reach the prefixes reachable via N, and P′ may be configured to store the prefixes reachable via N without informing other nodes about those prefixes. | 09-22-2011 |
20110235646 | METHOD AND APPARATUS FOR DETERMINING PROPAGATION DELAY IN A NETWORK - A propagation delay in the transmission of a frame from an initiator node to a peer node is determined by initially identifying a frame number and byte offset of a first incoming frame from the peer node at a time when the initiator node outputs a portion of a transmitted frame. The portion of the transmitted frame may be the first byte of a sub-frame within the transmitted frame. At the peer node, the frame number and byte offset of a second frame to be supplied to the initiator node is identified at a later time when the frame portion transmitted by the initiator node is received by the peer node, and such information is transmitted to the initiator node. Thus, since the frames output and received by the initiator node are typically of fixed duration, the frame number and byte offset of the incoming frame represent the time when the initiator node outputs the frame portion (a transmit time). In addition, the frame number and byte offset of the second frame represents the time at which the frame portion is received by the peer node (a receive time). Accordingly, by comparing the frame numbers and byte offsets of the first and second frames received from the peer node, a difference between transmit and receive times or propagation delay can be obtained. | 09-29-2011 |
20110243141 | System of User Devices - A system comprising: a first user device and at least a second user device for a same user, at least one of the first and second user devices being a household media appliance, and each being installed with a respective instance of a communication client application for conducting voice or video calls over a packet-based network. Each instance is associated with a same user identifier identifying said same user, a first of said instances is associated with a first sub-identifier, and a second of said instances is associated with a second sub-identifier. The instances are configured so as, during an ongoing call conducted over a first network connection established based on said user identifier and the first sub-identifier, after the call has been answered, to establish a second network connection based on said user identifier and the second sub-identifier and to switch the call to the second network connection. | 10-06-2011 |
20110243142 | INGRESS AND EGRESS SWITCH WHICH DETERMINES SERVICES RELATED TO AN INCOMING PACKET - Virtual machine environments are provided in the switches that form a network, with the virtual machines executing network services previously performed by dedicated appliances. The virtual machines can be executed on a single multi-core processor in combination with normal switch functions or on dedicated services processor boards. Packet processors analyze incoming packets and add a services tag containing services entries to any packets. Each switch reviews the services tag and performs any network services resident on that switch. This allows services to be deployed at the optimal locations in the network. The network services may be deployed by use of drag and drop operations. A topology view is presented, along with network services that may be deployed. Services may be selected and dragged to a single switch or multiple switches. The management tool deploys the network services software, with virtual machines being instantiated on the switches as needed. | 10-06-2011 |
20110243143 | SWITCH WITH PACKET SERVICES PROCESSING - Virtual machine environments are provided in the switches that form a network, with the virtual machines executing network services previously performed by dedicated appliances. The virtual machines can be executed on a single multi-core processor in combination with normal switch functions or on dedicated services processor boards. Packet processors analyze incoming packets and add a services tag containing services entries to any packets. Each switch reviews the services tag and performs any network services resident on that switch. This allows services to be deployed at the optimal locations in the network. The network services may be deployed by use of drag and drop operations. A topology view is presented, along with network services that may be deployed. Services may be selected and dragged to a single switch or multiple switches. The management tool deploys the network services software, with virtual machines being instantiated on the switches as needed. | 10-06-2011 |
20110243144 | NETWORK ARCHITECTURE WITH DISTRIBUTION OF PACKET SERVICES TO VARIOUS SWITCHES - Virtual machine environments are provided in the switches that form a network, with the virtual machines executing network services previously performed by dedicated appliances. The virtual machines can be executed on a single multi-core processor in combination with normal switch functions or on dedicated services processor boards. Packet processors analyze incoming packets and add a services tag containing services entries to any packets. Each switch reviews the services tag and performs any network services resident on that switch. This allows services to be deployed at the optimal locations in the network. The network services may be deployed by use of drag and drop operations. A topology view is presented, along with network services that may be deployed. Services may be selected and dragged to a single switch or multiple switches. The management tool deploys the network services software, with virtual machines being instantiated on the switches as needed. | 10-06-2011 |
20110243145 | METHOD TO ACCURATELY AND SECURELY DETERMINE PROPAGATION DELAY AND DISTANCE BETWEEN SENDING AND RECEIVING NODE IN PACKET NETWORK USING CUT-THROUGH APPROACH AND PACKET NETWORK NODE FOR EXECUTING THE METHOD - A method and system for measuring a distance between nodes in a packet network are provided. The system and method include measuring and storing a departure time of a ping packet sent from a source node to a destination node, sending a response packet with respect to the ping packet from the destination node to the source node, cutting through the ping packet or response packet to a successive node or the destination node without an intermediate node delay, computing a round-trip time by measuring an arrival time of the response packet at the source node and measuring the distance between the nodes, based on the round-trip time and speed of the ping packet. | 10-06-2011 |
20110249678 | DYNAMIC MODULATION SELECTION - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for transmitting data. In one aspect, a method obtains a baseline data rate for transmissions from a node that are received over a channel of a power line communications system and a set of available modulation techniques for the node. The set of available modulation techniques can include at least two modulation techniques with which the node is configured to encode data that are transmitted over the channel. Using the set of available modulation techniques, a modulation technique that is capable of providing at least the baseline data rate with at least a threshold confidence for the node is selected. In turn, data is provided to the node specifying the selected modulation technique. | 10-13-2011 |
20110249679 | METHOD FOR IMPLEMENTING FAST REROUTE - A method for implementing FRR comprising_starting up an upper layer protocol software to manage and configure a FRR route; an upper layer protocol software sending down a active next hop of the FRR; a driver writing an IP address of the FRR into an ECMP table and creating a software table to record correspondence between a FRR group and ECMP group; informing the driver of a prefix address of a subnet route and the index of the FRR group, and the driver finding the index of the ECMP group, and writing information of the subnet route and the index of the ECMP group into hardware; an upper layer protocol software informing the driver of the index of the FRR and an IP address of a new standby next hop; the driver looking up for the index of the ECMP group, and updating the next hop address of the ECMP group. | 10-13-2011 |
20110249680 | RECEPTION APPARATUS FOR VPN OPTIMIZATION BY DEFRAGMENTATION AND DEDUPLICATION AND METHOD - A reception apparatus for optimizing a virtual private network operates by defragmenting and deduplicating transfer of variable sized blocks. A large data object is converted to a plurality of data paragraphs by a fingerprinting method. Each data paragraph is cached and hashed. The hashes are transmitted from a primary apparatus. Only data paragraphs which are not previously cached at satellite are received. The data object is integrated from stored and newly transmitted data paragraphs and transmitted to its destination IP address. | 10-13-2011 |
20110255546 | CLOCK FOR A NODE OF A PACKET-SWITCHED NETWORK, AND ASSOCIATED SYNCHRONISATION METHOD - A method for synchronising a plurality of clocks ( | 10-20-2011 |
20110255547 | INFORMATION PROCESSING APPARATUS AND OPERATION METHOD THEREOF, COMPUTER PROGRAM, AND STORAGE MEDIUM - In an information processing system in which a plurality of modules are connected to a ring bus, data transfer efficiency is enhanced by deleting an unnecessary packet from the ring bus. This invention relates to an information processing system in which a plurality of modules that execute data processing are connected to a ring bus. More particularly, this invention relates to a ring bus operation technique that allows efficient data transfer by monitoring a flag of a packet, and removing an unnecessary packet from the ring bus. | 10-20-2011 |
20110261825 | OpenFlow COMMUNICATION SYSTEM AND OpenFlow COMMUNICATION METHOD - An OpenFlow switch controls transmission and reception of a packet according to a flow entry. Each of the flow entries contains a matching condition showing a communication flow of the packet and an action showing processing on the packet. An OpenFlow controller generates a registration flow entry which is stored in a flow table of a specific OpenFlow switch arranged on a route of the communication flow. An encapsulated packet is generated by relating the registration flow entry and an ordinary packet. The specific OpenFlow switch extracts the registration flow entry from the encapsulated packet in response to the reception of the encapsulated packet to produce a new flow entry and executes the action shown in the new flow entry. | 10-27-2011 |
20110268126 | INFORMATION COMMUNICATION SYSTEM, NODE DEVICE, INFORMATION COMMUNICATION METHOD AND COMPUTER READABLE STORAGE MEDIUM - A node device of an information communication system using an overlay network formed by a plurality of the node devices connected via a network, the node device comprises a reception unit configured to receive a control message for controlling the information communication system or content data transmitted and received among the plurality of node devices in the information communication system, a relay unit configured to relay the control message or the content data received by the reception unit to another one of the node devices, and a control unit configured to control the relay unit to relay the control message in preference to the content data. | 11-03-2011 |
20110274113 | SYSTEM AND METHOD FOR PROVIDING NOTIFICATION OF A CHANGE IN PATH CONDITION - An approach is provided for notifying a change in path condition. A change in condition of a label switched path connecting a first node and second node is detected. A notification message is generated for transmission to the first node. The notification message specifies information related to the detected change according to a predetermined format that can be processed by the first node. | 11-10-2011 |
20110280246 | COMMUNICATION SYSTEM, COMMUNICATION METHOD, COMMUNICATION TERMINAL DEVICE, CONTROL METHOD THEREOF, AND PROGRAM - A communication system includes a plurality of communication terminals including a first communication terminal to broadcast a route request message to a third communication terminal via a second communication terminal, the second and third communication terminals create a route to the first communication terminal. The second and third communication terminals include a route creation device for creating a plurality of the routes to the first communication terminal by broadcasting the route request message to each terminal included in the plurality of terminals to duplicatively receive the route request message. The second and third terminals further include a route management device for storing and managing the plurality of routes. The second and third terminals further include a route management device that establishes one of the created routes as a communication route to the first communication terminal. | 11-17-2011 |
20110286463 | HIGH PERFORMANCE HARDWARE LINKED LIST PROCESSORS - In one embodiment, a reassign command is received for reassigning a first node identified by a first global identifier (GID) from a first context identified by a first context ID (CID) to a second context identified by a second CID, the first and second contexts representing first and second linked lists, respectively. A walk-the-chain (WTC) command having the first GID and the first CID is issued to a first linked list processor. The first linked list processor is configured to access one or more nodes of the first context in an attempt to dequeue the first node from the first context. An enqueue command having the first GID and the second CID is issued to a second linked list processor. The second linked list processor is configured to insert the first node to the second context. The first and second linked list processors are cascaded to form a pipeline. | 11-24-2011 |
20110286464 | TRAIN COMMUNICATION SYSTEM AND TRAIN COMMUNICATION METHOD - A train communication system includes a communication relay device that is installed in each vehicle and a communication terminal device that is connected to the communication relay device. The communication relay device acquires vehicle information indicating an in-formation position of a vehicle in which the communication relay device is installed. The communication terminal device refers to a correspondence table that defines a correspondence relationship between vehicle information and communication identification information, and determines communication identification information to be provided to the communication terminal device, based on vehicle information obtained from the communication relay device. | 11-24-2011 |
20120002675 | PROVIDING A BUFFERLESS TRANSPORT METHOD FOR MULTI-DIMENSIONAL MESH TOPOLOGY - In one embodiment, the present invention includes a method for determining whether a packet received in an input/output (I/O) circuit of a node is destined for the node and if so, providing the packet to an egress queue of the I/O circuit and determining whether one or more packets are present in an ingress queue of the I/O circuit and if so, providing a selected packet to a first or second output register according to a global schedule that is independent of traffic flow. Other embodiments are described and claimed. | 01-05-2012 |
20120002676 | TRANSMISSION SYSTEM, TRANSMISSION APPARATUS, DESTINATION MANAGEMENT APPARATUS - A transmission system including: transmission apparatuses; and a destination management apparatus including: first ports which are coupled to the transmission apparatuses; and a first processor configured to manage an address entry which indicates a relation between the first port which receives the frame from among the first ports and a transmission source address included in the frame; and to transfer the frame received by one of the first ports, to the first port in association with the transmission destination address from among the first ports based on the address entry, wherein one of the transmission apparatuses including: second ports which are coupled to another transmission apparatus in the network; a third port which is coupled to the destination management apparatus; and a second processor configured to transmit the frame received by one of the second ports only to the third port. | 01-05-2012 |
20120014388 | Path selection method, information processor, network system, and path selection program - A path selection method, an information processor, a network system, and a path selection program are provided which rapidly determine a path that has no loop when determining the path by using a control server to probabilistically select a pass node. A network having a plurality of paths from a source to a destination is controlled. A node forming the path is selected on the basis of a node-to-node transfer probability, and in the case where the selected node is a node that has already been passed through on the path, the transfer probability is reset such that the selection of the node is suppressed. | 01-19-2012 |
20120020361 | Switch network system, controller, and control method - A controller has an entry control block and a flow table setting block. In a case where an action of a target entry in a flow table is to be changed to “forwarding of a reception packet to the controller”, the entry control block forecasts a load when packets matching the target entry are forwarded to the controller. If the load exceeds a permissible value, the entry control block repeats entry division processing until the load becomes within the permissible value. In the entry division processing, the entry control block divides the target entry into a plurality of post-division entries, divides the match condition of the target entry into a plurality of conditions, and sets respective match conditions of the plurality of post-division entries to the plurality of conditions. The flow table setting block instructs a switch to set the plurality of post-division entries in the flow table. | 01-26-2012 |
20120020362 | PARTITIONING OF DIGITAL OBJECTS FOR TRANSMISSION - Disclosed are systems and/or apparatuses of transmitting digital objects to a destination. In particular, disclosed are systems and/or apparatuses of facilitating bidding for the business of forwarding digital objects in a data transmission network. | 01-26-2012 |
20120020363 | System and Method for Routing Internet Traffic Over Internet Links - An apparatus and method for routing IP traffic in real time from at least one network user to a plurality of internet links. Embodiments include assigning different ranks to different internet links based on network monitoring. In one embodiment, a system for routing traffic includes an route optimizer to generate routing instructions using financial costs of routing data packets on the internet links, traffic condition information associated with the internet links, types of data of the incoming data packets, and levels of service assigned to the types of data of incoming data packets. In another embodiment, a method to generate a routing instruction uses delay data for each of the internet links, the type of data of the incoming data packet, and a level of service assigned to the type of data of the incoming data packet. | 01-26-2012 |
20120033673 | SYSTEMS AND METHODS FOR A PARA-VITUALIZED DRIVER IN A MULTI-CORE VIRTUAL PACKET ENGINE DEVICE - The present invention is directed towards methods and systems for communicating packets between network interface hardware of a multi-core device and a plurality of virtualized packet processors executed by one or more cores of the multi-core device. A first virtualization domain on the device may receive a packet via the network interface hardware. The first virtualization domain may comprise a privileged domain having access to the hardware. The system may communicate the packet to a queue for a virtualized packet processor from a plurality of virtualized packet processors and executing within a second virtualization domain on a core. The second virtualization domain may not have direct access to the network interface hardware. The packet processor may determine that the queue includes a difference between a number of packets read from and written to the queue. The packet processor may process the packet from the queue responsive to the determination. | 02-09-2012 |
20120033674 | DYNAMIC ESTABLISHMENT OF VIRTUAL CIRCUITS MULTISEGMENT PSEUDOWIRES - The present invention provides a technique for automatically establishing a virtual circuit from one edge device to another through a core network. The virtual circuit may comprise one or more pseudowire segments. These pseudowire segments extend between adjacent edge and core devices within the core network. Pseudowire segments through the core network are automatically stitched together as a setup message is forwarded from a first edge device to a second edge device through the core network. A virtual circuit is established in one direction, and packets are forwarded in an opposite direction. With the present invention, a virtual circuit comprising any number of pseudowire segments, as well as two attachment circuits, may be established in an automatic and efficient manner upon being initiated by the first edge device. | 02-09-2012 |
20120039339 | COMMUNICATION APPARATUS, RELAY APPARATUS, AND COMMUNICATION CONTROL METHOD - A relay apparatus including: a plurality of communication interfaces; and a processor configured to detect a collision, at which a second communication interface receives a second control packet group from a second communication apparatus while a first communication interface receives one of a first data packet group and a first control packet group from a first communication apparatus, the second control packet group being used to reserve a transmission of a second data packet group during a constant period later than a present frame by one frame out of a frame string representing an operation period of the second communication apparatus, and a communication interface of the second control packet group matching a communication interface of one of the first data packet group and the first control packet group; and transmit a collision occurrence notification to the second communication apparatus. | 02-16-2012 |
20120044940 | FLOODING-BASED ROUTING PROTOCOL HAVING AVERAGE-RATE AND BURST-RATE CONTROL - An enhanced, flooding-based routing protocol is described that provides burst-rate and average-rate flow control. A routing device comprises a network interfaces configured to send and receive packets over a layer-two (L2) communication medium. A flooding-based link state routing protocol executes on a processor of the routing device to maintain network topology information for a network and establish an adjacency with a peer router over the layer-two (L2) communication medium. A database of the routing device stores a minimum packet interval and a credit specified by the peer router for the adjacency. When sufficient credit has been allocated to the L2 communication medium, a scheduler of the router dequeues link state messages from an outbound packet queue and floods each of the link state messages to the L2 communication medium while maintaining at least the specified minimum packet interval between each of the plurality of link state messages. | 02-23-2012 |
20120044941 | DATA TRANSMISSION SYSTEM, DATA TRANSMISSION METHOD, AND DATA TRANSMISSION DEVICE - A source device includes a transmission unit selecting at least one destination device among a plurality of devices for transmitting data to the selected at least one destination device through a multiport switch and serial buses. The transmission unit includes a transmission ratio determination unit determining, when a plurality of destination devices are selected, a ratio of data transmitted among the selected plurality of destination devices within 1 cycle based on a reception rate of the selected plurality of destination devices. A destination device includes a reception unit receiving data from a source device through the multiport switch and serial buses. | 02-23-2012 |
20120044942 | SEMICONDUCTOR SYSTEM, RELAY APPARATUS, AND CHIP CIRCUIT - Highly efficient and low latency network transmission in consideration of a difference in the traffic characteristic and a memory access load which changes moment by moment is realized. A relay device transmits data on a networked communication bus between a bus master and a memory. The relay device includes a delay time processor for obtaining information on processing delay time in other relay devices located on a plurality of transmission routes on which the data is transmitted; and a low latency route selector for selecting a memory and one of transmission routes to the memory, among the plurality of transmission routes, based on obtained information on the processing delay time regarding the plurality of transmission routes. | 02-23-2012 |
20120057600 | COOPERATIVE REROUTING - IP Fast Reroute is used as an enabler for cooperative transmission. The combination of IP Fast Re-Route and cooperative transmission reduces the quantity of operations requiring change to another alternative path, particularly in mobile wireless networks characterized by high mobility. | 03-08-2012 |
20120069850 | NETWORK PACKET STEERING VIA CONFIGURABLE ASSOCIATION OF PACKET PROCESSING RESOURCES AND NETWORK INTERFACES - Methods and systems are provided for steering network packets. According to one embodiment, a dynamically configurable steering table is stored within a memory of each network interface of a networking routing/switching device. The steering table represents a mapping that logically assigns each of the network interfaces to one of multiple packet processing resources of the network routing/switching device. The steering table has contained therein information indicative of a unique identifier/address of the assigned packet processing resource. Responsive to receiving a packet on a network interface, the network interface performs Layer 1 or Layer 2 steering of the received packet to the assigned packet processing resource by retrieving the information indicative of the unique identifier/address of the assigned packet processing resource from the steering table based on a channel identifier associated with the received packet and the received packet is processed by the assigned packet processing resource. | 03-22-2012 |
20120093163 | METHOD OF CONTROLLING ACCESS OF DEVICES TO COMMUNICATION MEDIUM IN DISTRIBUTED NETWORKS - Method of controlling the access of devices to the communication media in distributed networks of CSMA (Carrier Sense Multiple Access) type is characterized by that each time before the packet transmission attempt, if the communication medium is detected to be idle, the prespecified fixed time interval equal to the minimum interpacket space is timed out during which the random numbers of time slots defining the order of media access are selected from the fixed number of slots of equal width using the pseudorandom number generator in every node where the probability of a selection of a particular slot is geometric with a characteristic parameter defined as the ratio of the probability of a selection of a given slot to the probability of a selection of the next slot, which changes from zero to one as a discrete function of the state of the node's counter, and after that the time interval of random delay corresponding to the selected random is assigned. After the minimum interpacket space the phase of known sequential priority access is started and subsequently, the random delay assigned previously is timed out and at the same time the state of the communication medium is sensed again, and if the communication medium is still sensed idle, it is made available to the node with the lowest number of the slot randomly selected. After completing a given packet reception, the states of the counters in all the nodes in a given network segment are increased by the increment defining the number of expected packets that will be generated in a result of the reception of the transmitted packet reduced by one, and next, the cycle is repeated. During the data packet transmission the collisions are detected optionally in the communication medium by the collision detectors, and next, the states of the counters are changed in the nodes with the use of the corresponding control signals obtained from the collision detectors, and in case the communication medium is detected to be idle after the time equal to the sum of the minimum interpacket space and the time delay defined by the prespecified fixed maximum number of slots, the states of the counters in all the nodes in a given network segment are decreased by one with the use of the control signals obtained from the communication medium state detectors. | 04-19-2012 |
20120093164 | Method and Apparatus for Generating Constraint Route - A method and an apparatus for generating a constraint based routing are disclosed in the present invention. The method includes: when computing a routing with a constraint condition, directly computing paths from a head node to a tail node of the routing, and comparing the paths that are computed with the constraint condition of the routing, and adding one or more paths which satisfy the constraint condition of the routing to a result set of routing computation. The present invention further discloses a corresponding apparatus, which includes a path calculation module, a comparison module and a storage module. With the present invention, when a routing query request with constraint conditions is processed, phenomena of omission or error can be avoided, thereby ensuring the correctness of the routing calculation result. | 04-19-2012 |
20120093165 | METHOD AND NODE DEVICE FOR NEGOTIATING ASSOCIATED CHANNEL CAPABILITY BETWEEN NODES - The present invention includes: receiving a Path message that is sent by an upstream node and carries an ACH capability of the upstream node; creating a new Path message and sending the new Path message to a downstream node, where the new Path message includes the ACH capability of the upstream node; receiving a Resv message that is sent by the downstream node and carries information about an ACH capability of the downstream node; and creating a new Resv message and sending the new Resv message to the upstream node, where the new Resv message includes the ACH capability of the downstream node. In the embodiments of the present invention, the ACH capability can be negotiated between nodes on an LSP so that a node on the LSP can know an ACH capability of another node, which avoids loss or erroneous forwarding of a special packet transmitted on an ACH. | 04-19-2012 |
20120106556 | COMMUNICATION TECHNIQUE IN NETWORK INCLUDING LAYERED RELAY APPARATUSES - This method includes: obtaining first data including identifiers of selected computers for invocation of parallel processes among plural computers connected to lowest-layer relay apparatuses in a network including relay apparatuses in plural layers, wherein the network includes paths between a relay apparatus in a first layer and plural relay apparatuses in a second layer that is an immediately upper layer than the first layer; and selecting, for each of the selected computers and from network identifiers for respective communication routes, network identifiers to be used for communication with other selected computers so as to avoid coincidence of communication routes between the selected computers for which a same difference value is calculated between identification numbers, wherein the network identifiers are associated in advance with an identifier of each of the plural computers and are used for routing in the network, and the identification numbers are assigned for ordering the selected computers. | 05-03-2012 |
20120106557 | DYNAMIC NETWORK IDENTITY ARCHITECTURE - In an embodiment, a method is provided. The method of this embodiment provides receiving indication of an event at a platform operating in shared address mode, the platform having an auxiliary entity, in response to the indication of the event, switching operation of the platform to multi address mode by acquiring a second address, and assigning the second address to the auxiliary entity, and receiving one or more packets directed to the second address. | 05-03-2012 |
20120120961 | Method, Device, and System for Selecting Route Discovery - Embodiments of the present invention provide a method, device, and system for selecting route discovery, to enable flexible selection of a route discovery method. The method includes: determining the amount of data to be transmitted; selecting, according to the amount of data to be transmitted, symmetric path route discovery or asymmetric path route discovery; and transmitting a selection result to other nodes. | 05-17-2012 |
20120134363 | METHOD AND APPARATUS FOR USING A GOSSIP PROTOCOL TO COMMUNICATE ACROSS NETWORK PARTITIONS - A computing device sends a message to a destination node. Upon failing to receive a message response from the destination node, the computing device sends a query to a plurality of additional nodes, wherein the query causes the additional nodes to attempt to communicate with the destination node and to forward the query to other additional nodes if the attempt to communicate with the destination node fails. Further, the computing device receives a query response from an additional node of the plurality of additional nodes, the query response indicating that the additional node can communicate with the destination node, and uses the additional node as a proxy for communicating with the destination node. | 05-31-2012 |
20120134364 | SWITCHES AND A NETWORK OF SWITCHES - A switch includes at least one input configured to receive data and at least two outputs configured to send data to at least two further switches in a network via at least two output links. Each output link has a known hop value. The switch further includes a direction determinator that determines a routing direction for the data from information identifying a relative location of the switch in the network and information identifying a destination of said data. A distributor within the switch processes the routing direction and direction information about each output link in order to select one of said at least two outputs for outputting said data. The selection that is made prioritizes output links for selection which have relatively higher known hop values. | 05-31-2012 |
20120134365 | METHOD AND NETWORK DEVICE FOR ASSOCIATED CHANNEL CAPABILITY NEGOTIATION - A method for Associated Channel (ACH) capability negotiation includes: receiving a first label mapping message; judging whether the first label mapping message carries ACH capability information of a first node; if the first label mapping message carries the ACH capability information of the first node, generating a second label mapping message, where the second label mapping message carries the ACH capability information of the first node; and sending the second label mapping message to an upstream node. The method may be applied in a Multi-Protocol Label Switching (MPLS) network, and may be used for distribution and negotiation of ACH capabilities of a network device. | 05-31-2012 |
20120134366 | PHYSICAL LAYER MANAGEMENT SYSTEM - An Ethernet outlet senses the presence of an Ethernet signal and transmits an Ethernet ID signal in response to the restoration of an Ethernet signal that was interrupted. The sensing circuit is designed to have no detrimental effect on Ethernet signals. Using this system, the locations of Ethernet outlets and network endpoint devices connected to the outlets can be determined following the interruption and reestablishment of network communications. Outlets according to the present invention can be used in copper-based networks or in networks having fiber optic components. | 05-31-2012 |
20120155475 | Dynamic Routing Metric Adjustment - In one embodiment, one or more routing update parameters may be set for and propagated to nodes of a directed acyclic graph (DAG) in a computer network, the routing update parameters indicative of when to perform a corresponding routing update operation. A decision node (e.g., a root node of the DAG, application in a head-end, etc.) may gather network statistics of the DAG during operation based on the routing update parameters, and may accordingly determine at least one adjusted routing update parameter based on the gathered network statistics. This adjusted routing update parameter may then be propagated to the nodes of the DAG, such that the nodes operate according to the (adaptively) adjusted routing update parameter. | 06-21-2012 |
20120155476 | CLOCK RECOVERY IN A SYSTEM WHICH TRANSPORTS TDM DATA OVER A PACKET-SWITCHED NETWORK - An ingress TDM network segment ( | 06-21-2012 |
20120155477 | MULTI HOP ROUTING APPARATUS AND MULTI HOP ROUTING METHOD - Disclosed is a multi hop routing apparatus, including: a receiving unit that receives multi hop routing messages; a parsing unit that parses the received multi hop routing messages; and a control unit that performs a control to determine a routing path using a hop count value and a link quality indicator (LQI) value included in the parsed multi hop routing message. | 06-21-2012 |
20120155478 | Method and Apparatus for a Software Programmable Intelligent Network - A reservation request is received for a data transport session. The reservation request contains a requested class of communication service through the asynchronous network. The state of the network along the route is then preferably determined and at least one end-to-end route through the network is obtained. The route is based on the requested class of communication service and the state of the network. The data transport session is then controlled, such that data is forced to travel along at least one route through the asynchronous network. This is preferably done by controlling multiple data controllers dispersed along the at least one route by mapping specific data protocols to specific routes, or mapping specific data protocols to specific ports in each data controller. If a state of the asynchronous network indicates that the route cannot transport data in conformity to the class of communication service, then the route is changed to a backup route through the network. | 06-21-2012 |
20120163389 | TECHNIQUES FOR SELECTING PATHS AND/OR TRUNK PORTS FOR FORWARDING TRAFFIC FLOWS - Techniques that offer enhanced diversity in the selection of paths (e.g., ECMP paths) and/or ports from ports associated with trunks for forwarding data traffic. In one embodiment, one or more functions are used to generate a result. A first portion of the generated result may be used as an index (e.g., ECMP index) for selecting a path (e.g., an ECMP path) from multiple possible paths for forwarding a packet. A second portion of the generated result, different from the first portion, may be used as an index (trunk index) for selecting an output port from multiple output ports associated with a trunk for forwarding a packet. In this manner, selected portions of the generated result may be used as indices, one for selecting a path and another for selecting a trunk port for forwarding packets such that the two indices are not the same and are not dependent upon one another. | 06-28-2012 |
20120163390 | METHOD AND APPARATUS FOR PATH COMPUTATION ELEMENT AND ROUTING CONTROLLER COOPERATION - A system, method, and node for a Routing Controller (RC) to obtain from a Path Computation Element (PCE), network resource path metrics across a plurality of domains in a communication network in which each domain includes a plurality of Border Nodes (BNs). The RC sends to the PCE, a first message requesting a first path computation between each pair of BNs. The first message contains a maximum metric-value that a path computation must not exceed for a Path Computation Client (PCC) to consider the path computation acceptable. The RC then sends a second message requesting the PCE to compute a subsequent path computation for each BN pair for which the first path computation did not exceed the maximum metric-value. The second message contains a minimum metric-value that a path metric must exceed for the PCC to consider the path metric acceptable. The RC then receives the computed subsequent path computation. | 06-28-2012 |
20120170585 | METHODS AND APPARATUS FOR STANDARD PROTOCOL VALIDATION MECHANISMS DEPLOYED OVER A SWITCH FABRIC SYSTEM - An apparatus includes a destination edge device configured to receive a first validation packet according to a switch fabric validation protocol. The destination edge device is configured to validate multiple data paths through a distributed switch fabric from a source edge device to the destination edge device based on the first validation packet. The destination edge device is configured to send, in response to receiving the first validation packet, a second validation packet to a peripheral processing device. The destination edge device is also configured to send the second validation packet according to a validation protocol different from the first validation protocol. | 07-05-2012 |
20120170586 | Transmitting Data to Multiple Nodes - Methods and systems for transmitting data, including transmitting a series of packets of data to multiple nodes, each of the multiple nodes being configured to return an acknowledgement of receipt of one or more of the packets of data, and reducing a size of a current packet of data in response to a time to receive an acknowledgment for a previous packet of data being greater than a threshold time. | 07-05-2012 |
20120189014 | 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. | 07-26-2012 |
20120189015 | MANAGING DATA TRANSFER IN A NETWORK ENVIRONMENT - A method for managing data transfer in a network environment, the method is provided. The method comprises receiving a request to transfer first data from a first source in a source domain comprising a plurality of sources to a first target in a target domain comprising a plurality of targets. If the first source is configured to transfer data in a first mode or if the first source is configured to transfer data in a second mode and the first data has previously been transferred to the target domain, a signature of the first data is transferred to the first target instead of the first data. If the first source is configured to operate in the second mode and the first data has not previously been transferred to the target domain, the first data is transferred to the first target. | 07-26-2012 |
20120201250 | METHOD, APPARATUS AND SYSTEM FOR IMPLEMENTING MULTI-PARTY COMMUNICATION - Embodiments of the present invention relate to the field of communication technologies and disclose a method, an apparatus, and a system for implementing multi-party communication to extend application of a traversal technology in the multi-party communication. A method for implementing multi-party communication includes: sending a communication request to a first node through a forwarding node on a network layer; and receiving the communication connection request sent by the first node, and setting up a communication connection with the first node. The method, apparatus, and system provided in the embodiments of the present invention are applicable to multi-party communication that requires traversal. | 08-09-2012 |
20120201251 | PATH CONTROL MANAGEMENT SYSTEM AND METHOD OF SETTING PATH USING THE SAME - A first path control management system of a first domain calculates a path in the first domain and transmits information of a connection node in the first domain to connect to a second domain to a second path control management system of the second domain. The second path control management system of the second domain calculates a path in the second domain and transmits a connection node of the second domain to connect to the first domain to the first path control management system. The first path control management system of the first domain and the second path control management system of the second domain receive information of connection nodes of the second domain and the first domain, respectively, thereby connecting a path between the first domain and the second domain. | 08-09-2012 |
20120207172 | BACKUP SYSTEM AND METHOD FOR NETWORK DATA COMMUNICATIONS - A system and method for coupling a communications device to a primary communications network having a first communications format and to a secondary communications network having a second communications format. The system and method can comprise a first port configured for connecting to the communications device, a second port configured for connecting to the primary communications network and facilitating the communication of the data between the primary communications network and the communications device through the first port, and a third port configured for connecting to the secondary communications network and facilitating the communication of the data between the secondary communications network and the communications device through the first port. | 08-16-2012 |
20120207173 | ADDRESS TRANSLATION DEVICE, ADDRESS TRANSLATION METHOD, AND COMPUTER PRODUCT - An address translation device includes a receiver that receives a packet that is from a communication apparatus on a private network to a communication apparatus on a global network; an address determiner that determines whether a destination address of a first packet received by the receiver matches a destination address of a second packet that was received before the first packet; a translator that when the address determiner makes a determination of no matching, translates a source private address of the first packet to a source global address that has been allocated to the second packet; and a transmitter that transmits the first packet that has been translated by the translator. | 08-16-2012 |
20120213229 | Method and Apparatus for an Expandable Switching Element - An embodiment of the invention may comprise pairing a first switching module with a second switching module such that the first switching module is enabled to switch signals received via its first input ports and its second input ports to its first output ports and second output ports, wherein the signals received by the first input ports of the first switching module are communicated from the first output ports of the second switching module, and the signals communicated by the first output ports of the second switching module are signals received by the second input ports of the second switching module and forwarded to the first output ports of the second switching module. | 08-23-2012 |
20120219005 | AGGREGATING COMMUNICATION CHANNELS - Techniques, systems and apparatus are described for implementing an inter-channel ring interface in a communication device. A communication device can include communication channels to carry data at respective first data throughputs. An inter-channel ring interface connects at least some of the communication channels in a ring configuration to form an aggregated group of channels that operates as a single channel at a second data throughput. | 08-30-2012 |
20120219006 | System Apparatus and Method for Interconnecting TDM and Frame/Packet Communication Networks - An interconnection between fully synchronous networks and next-generation frame communications networks is disclosed. A means of bidirectional frame format conversion between a synchronous multiplexing system and a logical multiplexing system is provided, along with a method of transmitting data between different networks on a path as if it were being transmitted in the same network. Further, when converting network control information in an STM network into data suitable for a packet network, even across the boundary of a synchronous multiplexing system and a logical multiplexing system, a unified communication management means is provided over the whole path. | 08-30-2012 |
20120224585 | COMMUNICATION METHOD, INFORMATION PROCESSING APPARATUS AND COMPUTER READABLE RECORDING MEDIUM - A communication method may store by a source node transmission data to be transmitted to destination nodes, create by the source node buffer information to be used by the destination nodes for receiving the transmission data, and transmitting by the source node the buffer information to the destination nodes by a first communication method that makes a multi-destination delivery using a barrier synchronization in which the destination nodes are synchronized by receiving synchronization signals from each of the destination nodes. The method may receive by the destination nodes, respectively, the transmission data using the buffer information by a second communication method that makes a one-to-one communication. | 09-06-2012 |
20120224586 | GRAPHICAL USER INTERFACE (GUI) FOR ADMINISTERING A NETWORK IMPLEMENTING MEDIA AGGREGATION - A graphical user interface (GUI) is disclosed that allows a user to identify routers, communities, residents and media aggregation managers existing on a network. The user may interactively select a path that includes two media aggregation managers and at least one router. The GUI predicts scheduled bandwidth utilization along the selected path for a variety of residents wishing to communicate across the path. The GUI may be utilized for initializing all media aggregation managers on the network along with provisioning each of the routers on the selected path. The GUI provisions all of the routers and initializes all of the media aggregation managers on the selected path simultaneously in order to accomplish the predicted schedule of usage provided by the GUI to the user and force all communication packets communicated between the residents to travel along the selected path. | 09-06-2012 |
20120230341 | MULTI-THREADED PROCESSING WITH HARDWARE ACCELERATORS - Described embodiments process multiple threads of commands in a network processor. One or more tasks are generated corresponding to each received packet, and the tasks are provided to a packet processor module (MPP). A scheduler associates each received task with a command flow. A thread updater writes state data corresponding to the flow to a context memory. The scheduler determines an order of processing of the command flows. When a processing thread of a multi-thread processor is available, the thread updater loads, from the context memory, state data for at least one scheduled flow to one of the multi-thread processors. The multi-thread processor processes a next command of the flow based on the loaded state data. If the processed command requires operation of a co-processor module, the multi-thread processor sends a co-processor request and switches command processing from the first flow to a second flow. | 09-13-2012 |
20120236869 | DATA NETWORK ELEMENTS, CROSSBARS, AND METHODS PROVIDING COUPLING BETWEEN REMOTE PHY AND MAC DEVICES - A crossbar may be coupled between a plurality of PHY devices configured to provide physical layer functions according to an Open Systems Interconnection, OSI, model and a plurality of MAC devices configured to provide data link layer functions according to the OSI model. First data couplings may be provided through the crossbar between the plurality of PHY devices and the plurality of MAC devices during a first time period. Second data couplings may be provided through the crossbar between the plurality of PHY devices and the plurality of MAC devices during a second time period, with the first and second data couplings being different. Related network elements, interfaces, and networks are also discussed. | 09-20-2012 |
20120243546 | MULTIMEDIA DATA RECORDING/REPRODUCING DEVICE - An audio data capturing device captures packetized multimedia data transmitted through a transmission path from a stage unit, and converts the packetized multimedia data to original audio data. A storage section stores the data. An audio data delivery section packetizes audio data stored in the storage section and transmits it to the mixer through the transmission path. A path switching control section performs switching-control among the stage unit, the mixer, the audio data capturing section and the audio data delivery section. | 09-27-2012 |
20120250694 | CENTRALIZED TRAFFIC SHAPING FOR DATA NETWORKS - A communication system comprises a plurality of nodes and a switch having a plurality of ports, each port coupled to one of the plurality of nodes. At least one of the plurality of nodes is configured to transmit a first unregulated flow of frames associated with a first virtual link to a first port of the plurality of ports of the switch. The switch is configured to regulate the first unregulated flow of frames by buffering frames of the first unregulated flow in a first input queue associated with the first virtual link, applying traffic shaping parameters associated with the first virtual link to the frames in the first input queue associated with the first virtual link, and outputting the first regulated flow of frames to one or more output queues associated with one or more output ports based on the first virtual link. | 10-04-2012 |
20120250695 | HITLESS NODE INSERTION FOR ETHERNET NETWORKS - A novel and useful hitless node insertion mechanism for configuring a new node to be inserted into an Ethernet network. The mechanism comprises pre-configuring the new node into a partially configured state, disconnecting a network link where the new node is to be inserted and connecting the new node to at least one end of the disconnected link. All data traffic received from neighboring nodes is then blocked and fake signal failure (SF) messages are generated and sent if Ethernet Ring Protection (ERP) messages are detected. An in-band management port is then selected and a configuration from a Network Management System (NMS) is received. Once configuration of the said new node is complete, the new node is set to a fully configured state. | 10-04-2012 |
20120250696 | Soft Preemption For Minimizing Preemptions In A Network - In an embodiment, a method is disclosed for minimizing soft preemptions of LSPs. Upon receiving a reservation message for an LSP whose requested bandwidth that exceeds the available bandwidth of downstream links, a network node may select a set of LSPs for soft preemption and share the selection with other nodes along their paths, both upstream and downstream. By coordinating the selection of LSPs to soft-preempt among nodes on the path, fewer LSPs may require soft preemption, which may result in minimizing excessive network disruptions, and thus, allowing the network to function more efficiently. | 10-04-2012 |
20120257631 | SYSTEMS AND METHODS FOR STOPPING AND STARTING A PACKET PROCESSING TASK - A method of packet processing by a network switch appliance includes receiving a first packet at a first network port of the network switch appliance, determining a first workload at the network switch appliance at a first time instant, performing a task to process the first packet when the first workload is below a first prescribed threshold, and passing the first packet to an instrument port at the network switch appliance. A method of packet processing by a network switch appliance includes receiving a first packet at a first network port of the network switch appliance, determining a first resource at the network switch appliance at a first time instant, performing a task to process the first packet when the first resource is above a first prescribed threshold, and passing the first packet to an instrument port at the network switch appliance. | 10-11-2012 |
20120257632 | METHOD, COMBINER AND SYSTEM FOR TRANSMITTING SIGNALS - Methods and apparatus are provided for receiving AISG protocol signals sent by one or more local devices and adding corresponding labels to the AISG protocol signals, where the labels are used to identify mapping relationships between the local devices that send the AISG protocol signals and peer devices. The AISG protocol signals to which the labels have been added are packed into data packet and sent to a peer combiner through a shared feeder. The peer combiner unpacks the data packet and sends the AISG protocol signals to corresponding peer devices according to the labels added to the AISG protocol signals. | 10-11-2012 |
20120263184 | BASEBAND ETHERNET EXTENDER - A baseband Ethernet extender includes a first transmission device and a second transmission device. The first transmission device and the second transmission devices form therein at least one first baseband Ethernet connection unit and at least one second baseband Ethernet connection unit, respectively. The second baseband Ethernet connection unit is electrically connected through at least one twisted pair cable assembly to the first baseband Ethernet connection unit. Each twisted pair cable constituting the twisted pair cable assembly is electrically connected, at least at one end thereof, to a baseband signal compensation unit. Such an arrangement allows an Ethernet baseband signal to be transmitted to a distance exceeding 100 meters. | 10-18-2012 |
20120269198 | 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. | 10-25-2012 |
20120307830 | SYSTEM AND METHOD FOR A COMMUNICATIONS ACCESS NETWORK - A system and method are provided for providing access communications between customer locations and a core network service edge. Access flows are handled as carrier-tagged flows through a packet switched network comprising network elements that interpret and manipulate carrier tag values associated with traffic-bearing data frames. | 12-06-2012 |
20120307831 | SYSTEMS AND METHODS FOR PROVIDING A MoCA IMPROVED PERFORMANCE FOR SHORT BURST PACKETS - Systems and methods for reducing the latency and for increasing throughput for MoCA devices that are connected via a coax network are provided. One method according to the invention includes, in a network having a plurality of network modules, each of the plurality of network modules being connected to a coax backbone, communicating over the coax backbone between the plurality of network modules. The method further includes a requesting the use of short burst messages. The method further includes responding to the requesting by constructing a short burst message with a single channel equalization section and reducing the number of bits per hertz in the transmission constellation. The resulting messages can be received with an acceptable error rate while making more efficient use of the MoCA network. | 12-06-2012 |
20120307832 | METHOD AND APPARATUS FOR SELECTING BETWEEN MULTIPLE EQUAL COST PATHS - Each equal cost path is assigned a path ID created by concatenating an ordered set of link IDs which form the path through the network. The link IDs are created from the node IDs on either set of the link. The link IDs are sorted from lowest to highest to facilitate ranking of the paths. The low and high ranked paths are selected from this ranked list as the first set of diverse paths through the network. Each of the link IDs on each of the paths is then renamed, for example by inverting either all of the high node IDs or low node IDs. After re-naming the links, new path IDs are created by concatenating an ordered set of renamed link IDs. The paths are then re-ranked and the low and high re-ranked paths are selected from this re-ranked list as the second set of diverse paths. | 12-06-2012 |
20120320923 | REDIRECTING TRAFFIC VIA TUNNELS TO DISCOVERED DATA AGGREGATORS - In one embodiment, a data aggregator discovery (DAD) message may be distributed by an associated data aggregator, the DAD message identifying the initiating data aggregator, and comprising a recorded route taken from the data aggregator to a receiving particular node as well as a total path cost for the particular node to reach a root node of the DAG through the recorded route and via the data aggregator. The receiving particular node determines a path cost increase (PCI) associated with use of the data aggregator based on the total path cost as compared to a DAG-based path cost for the particular node to reach the root node via the DAG. If the PCI is below a configured threshold, the particular node may redirect traffic to the data aggregator as source-routed traffic according to the recorded route. The traffic may then be aggregated by the data aggregator, accordingly. | 12-20-2012 |
20120320924 | COORDINATED BACK-OFF MECHANISM FOR PATH SELECTION IN HYBRID COMMUNICATION NETWORKS - A coordinated back-off mechanism for automatic path selection for minimizing race conditions in hybrid communication networks is disclosed. A network device determines a stream medium utilization associated with packet streams for each priority class and network interface of a plurality of communication devices (including the network device). For each priority class and network interface, the communication devices are ranked according to the stream medium utilization. In response to determining that a medium utilization of a network interface exceeds a corresponding medium utilization threshold, the network device determines whether one of its network interfaces originates a packet stream with the greatest stream medium utilization value for a selected priority class. If so, path selection operations are executed to reduce the medium utilization associated with network interface below the medium utilization threshold. Otherwise, a back-off period is calculated based on the ranking associated with the network device for the selected priority class. | 12-20-2012 |
20120320925 | METHOD AND APPARATUS FOR TRANSMITTING/RECEIVING MEDIA CONTENTS IN MULTIMEDIA SYSTEM - A method and an apparatus of transmitting media content in a multimedia system are provided. The method includes determining a transmission unit for transmitting at least one multimedia source related to the media content, generating a data stream including header information and the at least one multimedia source according to the determined transmission unit, and transmitting the data stream through a communication network. | 12-20-2012 |
20120327942 | COMMUNICATION NETWORK SYSTEM - A communication network system including a plurality of nodes disposed on a communication bus, and where each of the nodes is capable of transitioning between a normal operation mode and a low electricity consumption mode. The communication network system controls only a required node, in order to communicate with such required node, by transitioning the required node from the low power mode to the normal operation mode. To control the mode of the required nodes, a controlling node keeps a signal change state of the communication bus for a period that is longer than a normal communication frame length. The required node determines whether the period of the signal change state is longer than a threshold of the required node itself, to output a wakeup signal to a control circuit. | 12-27-2012 |
20120327943 | Media Transmission Over a Data Network - A new approach towards transmitting media across a network is disclosed. In an embodiment, the sender prioritizes the data to be sent from a pool of candidate data, and sends it under some bandwidth constraint. The pool of candidate data reflects the present state of the media, and certain data may be discarded without being sent if it becomes irrelevant to the present state of the media. The receiver sends feedback regarding what data is received by it, which may be used for choosing candidate data, or for prioritizing it. | 12-27-2012 |
20130003742 | 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. | 01-03-2013 |
20130003743 | SELECTIVE ROUTING TO GEOGRAPHICALLY DISTRIBUTED NETWORK CENTERS FOR PURPOSES OF POWER CONTROL AND ENVIRONMENTAL IMPACT - In general, this disclosure describes techniques of selecting routes for network packets through a computer network based, at least in part, on electrical power procurement arrangements of devices in the computer network. A computing system includes a hardware processor and a database storing power procurement profiles. Each of the power procurement profiles stores data indicating an arrangement between an operator of one or more of routing devices to procure electrical power from a utility company for facilities in which the routing devices are located. The power procurement profiles are mapped to ranges of network addresses associated with the facilities for retrieval of the power procurement profiles for the routers based on the network addresses assigned to the routers. | 01-03-2013 |
20130003744 | COMMUNICATION NODE APPARATUS, COMMUNICATION SYSTEM, AND METHOD FOR SELECTING DESTINATION RECEPTION INTERFACE USED THEREFOR - Provided is a communication node apparatus that can attempt optimal utilization of a communication resource of a communication interface mounted on each node apparatus. A communication node apparatus (transmission node apparatus | 01-03-2013 |
20130003745 | INFORMATION SYSTEM, CONTROL DEVICE, METHOD OF MANAGING VIRTUAL NETWORK, AND PROGRAM - An information system includes a plurality of forwarding nodes having a packet processing unit that performs processing of a received packet using a processing rule conforming to the received packet; and a control device causing plurality of forwarding nodes to operate as a virtual network by setting a processing rule in the forwarding nodes. The control device includes a virtual network path information storage unit that stores a correspondence relationship between the virtual network and a forwarding path configured by the forwarding nodes; and a virtual network control unit that identifies a virtual network affected by a change in a state of any forwarding node among the plurality of forwarding nodes, by referring to the virtual network path information storage unit. | 01-03-2013 |
20130010800 | METHOD AND APPARATUS FOR REDUCING DELAYS IN A PACKETS SWITCHED NETWORK - A method and device for reducing delays of communication packets that comprise: providing a plurality of data frames belonging to different communication sessions conveyed along respective communication channels; providing protection data for protecting at least one of these data packets; and multiplexing one or more of the data frames into a second communication packet. This second communication packet comprises protection data for protecting at least one first data frame that had already been transmitted in a first communication packet that preceded the transmission of the second communication packet; the protection data is attached to a second data frame comprised in that second communication packet; the protection data is operative to protect a first data frame comprised in the first communication packet; and wherein each of the first and second data frames belongs to a different communication session. | 01-10-2013 |
20130016727 | METHOD FOR TRANSMISSION OF INFORMATION BETWEEN NODES OF A NETWORK AND NETWORK USING SAID METHOD - A method for communication between nodes (UR | 01-17-2013 |
20130016728 | Optimising Communications - A method, system and program for routing a data stream amongst a plurality of network nodes including at least a plurality of end-user nodes. The method comprises: establishing a plurality of routes for the stream to a plurality of consuming end-user nodes, including at least one route via one or more relaying nodes; at each of a plurality of optimising nodes, executing an optimisation algorithm to determine a respective routing modification by evaluating a routing criterion with respect to a collection of end-user nodes which share information with the respective optimising node and determining a change in the routing criterion that would result from one or more potential routing modifications. The different optimising nodes' collections of end-user nodes are at least partially coincident such that each optimising node can determine a different routing modification with respect to at least some of the same end-user nodes. | 01-17-2013 |
20130022049 | IDENTIFYING NODES IN A RING NETWORK - Methods, systems and data structures for determining a token master on a ring network are provided. According to one embodiment, determining a token master on a ring network includes receiving a packet containing a network token at a first node on the network. If the network token does not arrive within a preselected timeout period, generating an arbitration token. If the packet contains an arbitration token, determining if the arbitration token was modified by a higher priority node of the network and if not, setting the first node as a token master and converting the arbitration token to a packet transmission token. Arbitration tokens are used to identify a token master that is responsible for generating a packet transmission token onto the network, whereas the packet transmission token authorizes a transmitting node that has most recently received the packet transmission token to transmit locally generated packets onto the network. | 01-24-2013 |
20130022050 | DISTRIBUTED FABRIC PROTOCOL (DFP) SWITCHING NETWORK ARCHITECTURE - A switching network includes an upper tier including a master switch and a lower tier including a plurality of lower tier entities. The master switch includes a plurality of ports each coupled to a respective one of the plurality of lower tier entities. Each port includes a plurality of virtual ports each corresponding to a respective one of a plurality of remote physical interfaces (RPIs) at the lower tier entity coupled to that port. Each port also includes a receive interface that, responsive to data traffic from a particular lower tier entity, queues the data traffic to the virtual port that corresponds to the RPI on the particular lower tier entity that was the source of the data traffic. The master switch further includes a switch controller that switches data traffic from the virtual port to an egress port from which the data traffic is forwarded. | 01-24-2013 |
20130022051 | SYSTEMS AND METHODS FOR HANDLING A MULTI-CONNECTION PROTOCOL BETWEEN A CLIENT AND SERVER TRAVERSING A MULTI-CORE SYSTEM - The present application is directed towards systems and methods for handling a multi-connection protocol communication between a client and a server traversing a multi-core system. The multi-connection protocol comprises a first connection and a second connection, which may be used respectively for control communications and data communications. Because different cores in the multi-core system may handle the first connection and second connection, the present invention provides systems and methods for efficiently coordinating protocol management between a plurality of cores. | 01-24-2013 |
20130028265 | UPDATE OF A CUMULATIVE RESIDENCE TIME OF A PACKET IN A PACKET-SWITCHED COMMUNICATION NETWORK - It is disclosed a method for updating a cumulative residence time of a synchronization packet received at a node of a packet-switched communication network. The cumulative residence time is equal to a cumulative sum of residence times of the packet at nodes interposed between a further node which has generated the packet and the node. The node comprises an ingress circuit and an egress circuit. The method comprises: receiving the packet at the egress circuit from the ingress circuit; at a timestamp generator of the egress circuit, generating a timestamp; at the egress circuit, calculating a virtual timestamp based on the timestamp and on an estimated variable delay that will be undergone by the packet due to buffering in a buffer located downstream the timestamp generator; and, at the egress circuit, using the virtual timestamp for updating the cumulative residence time, before transmitting the packet to a still further node. | 01-31-2013 |
20130034103 | System and Method for Finding Segments of Path for Label Switched Path Crossing Multiple Domains - An apparatus comprising a path computation element (PCE) associated with a domain in a network and configured to find a segment of a Multiprotocol Label Switching (MPLS) Traffic Engineering (TE) Label Switched Path (LSP) that crosses a plurality of domains in the network using a Constraint Shortest Path First (CSPF) algorithm or a reverse CSPF algorithm that computes a plurality of shortest paths in the domain of which the segment is selected, wherein the CSPF algorithm or the reverse CSPF algorithm is selected to reduce the number of shortest path computations in the domain based on the number of starting nodes and ending nodes that are considered for computing the shortest paths in the domain. | 02-07-2013 |
20130034104 | Packet Broadcast Mechanism in a Split Architecture Network - A method and system is implemented in a network node that functions as a controller for a domain in a split architecture network. The domain comprises a plurality of flow switches, where the plurality of flow switches implement a data plane for the split architecture network and the controller implements a control plane for the split architecture network that is remote from the data plane. The method and system configure the plurality of flow switches to efficiently handle each type of broadcast packet in the domain of the split architecture network without flooding the domain with the broadcast packets to thereby reduce a number of broadcast packets forwarded within the domain. | 02-07-2013 |
20130034105 | CASCADING ROUTING QUERIES - The present invention relates to systems and methods for performing queries in a cascading logic routing grid comprised of an array of interconnected nodes and at least one root node. At a first root node, one or more adjacent nodes are selected to process a query. The selection is based on the capabilities of the nodes and parameters of the query. Once the nodes are selected, a query is transmitted from the first root node to at least one of the one or more selected nodes. Upon completion of processing the query, a response is received at the first root node from at least one of the one or more selected nodes. The response comprises specifications for routing data. Based on the specifications for routing data received in the response, routing instructions are formed at the first root node. | 02-07-2013 |
20130034106 | LOOKUP CLUSTER COMPLEX - A packet processor provides for rule matching of packets in a network architecture. The packet processor includes a lookup cluster complex having a number of lookup engines and respective on-chip memory units. The on-chip memory stores rules for matching against packet data. Each of the lookup engines receives a key request associated with a packet and determines a subset of the rules to match against the packet data. As a result of the rule matching, the lookup engine returns a response message indicating whether a match is found. | 02-07-2013 |
20130034107 | STATE-BASED FILTERING ON A PACKET SWITCH APPLIANCE - A packet switch appliance includes a plurality of ports. One of the plurality of ports is configured to operate as a network port connected to a packet-switching network. Another of the plurality of ports is configured to operate as a first instrument port connected to a network instrument. To filter packets, one or more packets or copies of packets received through the first network port are examined prior to the packets or copies of packets being sent out the first instrument port to determine a current state of a state-based protocol, which includes a plurality of potential states. A filter is created or modified for the first network port or the first instrument port based on the determined current state of the state-based protocol. | 02-07-2013 |
20130051397 | CREDIT FLOW CONTROL SCHEME IN A ROUTER WITH FLEXIBLE LINK WIDTHS UTILIZING MINIMAL STORAGE - A method includes receiving flits forwarded from an upstream router into a first input virtual channel (VC) associated with an input port. The flits are associated with packets originated from a first Intellectual Property (IP) core and forwarded to a second IP core. The flits are stored in a VC storage associated with the first input VC. The method further includes performing link width conversion based on a width of the flits being different from a width of an output port. Link width conversion includes accumulation of the flits when the width of the output port is wider and unpacking of the flits when the width of the output port is narrower. Credits are generated based on the flits being forwarded from the first input VC to the output port. The credits are sent to the upstream router to enable receiving more flits from the upstream router. | 02-28-2013 |
20130058348 | DISTRIBUTED NETWORK CONTROL SYSTEM WITH ONE MASTER CONTROLLER PER MANAGED SWITCHING ELEMENT - A network control system for managing several switching elements. The network control system includes first and second controllers for generating data for managing first and second sets of switching elements. The first controller is further for serving as a master controller of the first set of switching elements. The second controller is further for serving as a master controller of the second set of switching elements. The master controller for a particular set of switching elements is the only controller that is allowed to propagate data to the particular set of switching elements data for managing the particular set of switching elements. | 03-07-2013 |
20130058349 | Systems and Methods for Routing Data in a Network - A method for routing data in a network including a plurality of nodes connected by links, the method includes collapsing first and second rings of the nodes together, for each of the nodes in the network, determining a shortest path tree to each of the other nodes in the network, and for data sourced from a particular one of the nodes in the network, blocking the link or links not included in the shortest path tree determined for the particular one of the nodes. Also, a system for routing data through a network having a plurality of nodes connected by links, includes a ring collapsing module for collapsing first and second rings of the nodes together, a shortest path tree calculation module for determining, for each of the nodes, a shortest path tree to each of the other nodes in the network, and a link blocking module for blocking the link or links not included in the shortest path tree determined for data sourced from a particular one of the nodes. | 03-07-2013 |
20130058350 | NETWORK CONTROL APPARATUS AND METHOD FOR PORT ISOLATION - Some embodiments provide a method for managing a logical switching element that includes several logical ports. The logical switching element receives and sends data packets through the logical ports. The logical switching element is implemented in a set of managed switching elements that forward data packets in a network. The method provides a set of tables for specifying forwarding behaviors of the logical switching element. The method performs a set of database join operations on the tables to specify in the tables that the logical forwarding element drops a data packet received through a first logical port when the data packet is headed to a second logical port different than the first logical port. | 03-07-2013 |
20130058351 | USE OF TUNNELS TO HIDE NETWORK ADDRESSES - For a managed network including first and second managed switching elements that implement logical data path sets, some embodiments provide a method that establishes, from the first managed switching element, a network tunnel through a network to the second managed switching element. The network includes a set of unmanaged switching elements. Through the network tunnel, the network forwards logical network data to the set of unmanaged switching elements for the set of unmanaged switching elements to forward to the second managed switching element. The logical network is hidden from the set of unmanaged switching elements when the logical network data is forwarded through the tunnel. | 03-07-2013 |
20130058352 | METHOD AND DEVICE FOR FORWARDING DATA PACKETS - The method for forwarding data packets in position based routing of data from a source node (S) to at least one destination node (D) of a mesh network ( | 03-07-2013 |
20130064249 | METHOD AND SYSTEM FOR MANAGING COMMUNICATION PORTS - Embodiments of the present invention are directed to a communication system that enables transmitting control signals between communication devices connected with a communication cable. The control signals are either to activate a visual indicator associated with the second port or to request a unique identification number and the signals are transmitted without changing the voltage polarity between the control wires. The communication cable may include at one end a connector having a control circuitry, a visual indicator and a unique identification number. | 03-14-2013 |
20130070772 | COAXIAL CABLE DISTRIBUTION OF CATV AND WIRELESS SIGNALS - A system and method for distributing signals from a first communications network and a second communications network to a location, including a base transceiver station configured to receive a signal from the first communications network and convert the signal into an RF signal for transmission to a mobile terminal, the RF signal having an RF frequency above a threshold frequency, and a coupling module configured to: receive the RF signal from the base transceiver station and receive a data signal from the second communications network, the data signal having an RF frequency below the threshold frequency; combine the RF signal and the data signal into a combined signal with the RF signal and data signal each retaining their respective frequencies; and provide the combined signal over a coaxial cable link to the location. | 03-21-2013 |
20130070773 | NETWORK SYSTEM AND METHOD FOR DETERMINING NETWORK PATH - Provided is a network system and a method for determining a network path, the network system including a plurality of extension units, each containing dualized basic units and dualized extension Ethernet modules, a first ring network connected by a first basic unit and a plurality of first extension Ethernet modules, and a second ring network connected by a second basic unit and a plurality of second extension Ethernet modules, wherein the first extension Ethernet module or the second extension Ethernet module transmits or receives data along a network path determined by judging, by the first extension Ethernet module or the second extension Ethernet module, if the first ring network is connected to the second extension Ethernet module using an intrinsic number of each extension Ethernet module. | 03-21-2013 |
20130077633 | COMMUNICATION SYSTEM AND ITS DEVICE - A transmission device uses transmission delay time of reciprocation with the terminal and time information of the transmission device to create a correction value of time information of the terminal and transmits it to the terminal. The terminal includes expected arrival time information based on the time information of the terminal and the correction value received from the transmission device in a frame transmitted to the transmission device. The transmission device compares reception time of the frame with the expected arrival time information in the frame. If they match, the time information of the terminal synchronizes with the time information of the transmission device. If they do not match, the transmission device transmits a new correction value to the terminal. The terminal transmits a frame including expected arrival time information using the new correction value to the transmission device. | 03-28-2013 |
20130089101 | CREDIT-BASED NETWORK CONGESTION MANAGEMENT - A switching network includes first, second and third switches coupled for communication, such that the first and third switches communicate data traffic via the second switch. The first switch is operable to request transmission credits from the third switch, receive the transmission credits from the third switch and perform transmission of data traffic in reference to the transmission credits. The third switch is operable to receive the request for transmission credits from the first switch, generate the transmission credits and transmit the transmission credits to the first switch via the second switch. The second switch is operable to modify the transmission credits transmitted by the third switch prior to receipt of the transmission credits at the first switch. | 04-11-2013 |
20130114610 | VIRTUAL FAULT TOLERANT ETHERNET APPLIANCE AND METHOD OF OPERATION - An apparatus includes at least one processing unit configured to execute a virtual network appliance and a virtual machine. The virtual network appliance includes a virtual NIC driver configured to transfer packets to and from a physical port of the apparatus. The virtual network appliance also includes an internal network interface configured to transfer the packets to and from the virtual machine through a hypervisor. The virtual network appliance further includes an aggregator configured to transfer the packets between the virtual NIC driver and the internal network interface. | 05-09-2013 |
20130114611 | Method and Apparatus for Efficient Transmission of Information to Multiple Nodes - A system and method to reduce the number of data transmissions between nodes in a network is described. In one embodiment, a system and method for reducing the amount of ACK and NAK traffic in a network is described. | 05-09-2013 |
20130121338 | COMMUNICATION NETWORK SYSTEM, PATH CALCULATION DEVICE, AND COMMUNICATION PATH ESTABLISHMENT CONTROL METHOD - In an MPLS or GMPLS network, links for hops of a communication path and adaptation to be implemented on the border of management domains or layers are automatically appropriately selected based on a service type or a requirement for maintenance without the necessity of complicating a control sequence. First, a unit that appends an identifier of a service to be provided and an attribute of the service to a communication path establishment control message, and requests path establishment is installed in a source node. Secondly, a unit that determines a requirement for maintenance of the communication path and adaptation on the basis of the service identifier and/or service attribute is installed in each node. Thirdly, maintenance attributes of network resources are compared with the requirement for maintenance in order to determine links and nodes through which the communication path passes. | 05-16-2013 |
20130148666 | COMMUNICATION SYSTEM, CONTROLLER, NODE CONTROLLING METHOD AND PROGRAM - A configuration of a communication system that is able to effect packet forwarding in accordance with an intended forwarding path even in an environment where a node represented by a Layer-2 switch (L2SW) and a node represented by an OpenFlow switch exist together, is provided. The communication system includes a first node, such as a Layer-2 switch, a plurality of second nodes, equivalent to the OpenFlow switches, and a controller. The controller causes the first node to receive a destination learning packet from one of the second nodes lying on the downstream side of the first node on a preset packet forwarding path. The destination learning packet has a node lying on the downstream side of the first node as a transmission source, so that the controller causes the first node to perform a packet forwarding operation in accordance with the packet forwarding path. | 06-13-2013 |
20130148667 | COMMUNICATION SYSTEM, CONTROL APPARATUS, COMMUNICATION METHOD, AND PROGRAM - When calculating a forwarding path for a packet, a control apparatus determines a second node on the exit side of the packet forwarding path and an output port thereof. Next, the control apparatus sets in a second node located upstream of the first node on the packet forwarding path a packet handling operation for writing flow identification information associated with the output port in a packet header field not to be referred to when the first node forwards the packet and rewriting address information in the packet header such that the packet arrives at the second node on the exit side, and then causing the packet to be forwarded. A packet handling operation for causing the packet with the flow identification information given thereto to be transmitted from the port associated with the flow identification information is set in the second node on the exit side. | 06-13-2013 |
20130156040 | PREDICTIVE SYNCHRONIZATION FOR CLUSTERED DEVICES - A method and system is provided for a scalable clustered system. The method and system may handle asynchronous traffic as well as session backup. In the method and system, a home cluster member having ownership of a local session predicts designation of a an other cluster member to receive a packet associated with the local session and sends appropriate state information or forwarding instruction to the other network member. | 06-20-2013 |
20130163601 | 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. | 06-27-2013 |
20130163602 | FLOW-BASED PACKET TRANSPORT DEVICE AND PACKET MANAGEMENT METHOD THEREOF - Disclosed is a packet managing method of a packet forwarding device. The packet managing method includes receiving a packet; extracting flow information from the packet; searching a flow entry associated with the packet; and requesting the flow entry associated with the packet to a controller when a searching operation of the flow entry is failed. The request on the flow entry associated with the packet is not transferred within a reference time. | 06-27-2013 |
20130170498 | ETHERNET FOR AVIONICS - An avionics switched Ethernet network. A plurality of synchronized interconnected system nodes each includes an avionics module arranged to periodically provide a set of data messages. Each message includes a set of data variables. A network module couples the avionics module to the network. The network module includes a network interface unit arranged to provide for transmission of data packets including a number of the data messages from the avionics module. The network module of each system node includes a transmission control unit arranged to control the network interface unit to perform scheduled transmissions of the data packets. The transmission control unit is provided with access to a memory module. Each of the plurality of time-slots is statically allocated a predetermined number of data packets, each including a predetermined subset of data messages from the set of data messages. | 07-04-2013 |
20130182713 | STATE MANAGEMENT USING A LARGE HASH TABLE - Systems, methods, and devices are provided for managing state lookup data in a hash table. A network device handling incoming and outgoing packets may implement a state management hash table with a number of buckets selected such that an average number of open network socket connections associated with each bucket is between about 0 and about 10. The hash table may implement fine-grained locking by associating a separate lock with each bucket, thereby allowing for parallel state management threads to access multiple buckets of the hash table simultaneously. | 07-18-2013 |
20130182714 | REDUNDANCY OF NETWORK SERVICES IN RESTRICTED NETWORKS - Methods, systems, and devices are described for managing virtual network services provided to a network. Network services may be provided to a client network having a first network fabric at a self-contained network services system implementing a number of redundant instances of a network service application. The self-contained network services system may have a second network fabric. The second network fabric may be adapted to distribute network service tasks received from the client network which are associated with the network service application among the redundant instances of the network service application. | 07-18-2013 |
20130188649 | Communication Session Processing - Measures for use in processing communication sessions in a telecommunications network are provided. Each communication session has a signalling path spanning a plurality of devices including one or more intermediate network devices and at least two endpoint devices, the signalling path comprising a plurality of signalling segments, each segment being between two devices in the plurality of devices. A first signalling message, comprising a first identifier associated with the communication session, is received via a first signalling segment for a communication session. At least part of the first identifier is transformed using a deterministic encryption algorithm to generate a second identifier. A second signalling message, comprising the second identifier, is transmitted via a second signalling segment for the communication session to associate the second identifier with the communication session. | 07-25-2013 |
20130195112 | COMMUNICATION SYSTEM, POLICY MANAGEMENT APPARTATUS, COMMUNICATION METHOD, AND PROGRAM - Authentication apparatus authenticates user using host connected to forwarding node. Policy management apparatus holds access control policy for identifying host under access control using identifier of forwarding node or identifier of user, and links identifier of host under access control and identifier of forwarding node to which host is connected, or identifier of host under access control and identifier of user using host. Forwarding node transmits to policy management apparatus identifier of host connected to own forwarding node and identifier of own forwarding node. Authentication apparatus transmits to policy management apparatus identifier of host connected to forwarding node and identifier of user. Policy management apparatus refers to access control policy and, if host connected to forwarding node is under access control, notifies content of access control to control apparatus as access control list. Control apparatus generates processing rule in accordance with access control list and sets generated processing rule in forwarding nodes. | 08-01-2013 |
20130201992 | INFORMATION PROCESSING SYSTEM AND INFORMATION PROCESSING APPARATUS - A control unit included in an information processing system determines, on the basis of information indicative of interface units and path information indicative of communication paths through a plurality of relay apparatus, whether or not the number of communication paths for access from the interface units to a node is greater than the number of the interface units. When the number of the communication paths is greater than the number of the interface units, the control unit controls the plurality of relay apparatus so as to block a part of the communication paths. | 08-08-2013 |
20130215901 | Flow Control Using a Local Event Ring In An Island-Based Network Flow Processor - An island-based network flow processor (IB-NFP) integrated circuit includes islands organized in rows. A configurable mesh event bus extends through the islands and is configured to form a local event ring. The configurable mesh event bus is configured with configuration information received via a configurable mesh control bus. The local event ring involves event ring circuits and event ring segments. In one example, a packet is received onto a first island. If an amount of a processing resource (for example, memory buffer space) available to the first island is below a threshold, then an event packet is communicated from the first island to a second island via the local event ring. In response, the second island causes a third island to communicate via a command/push/pull data bus with the first island, thereby increasing the amount of the processing resource available to the first island for handing incoming packets. | 08-22-2013 |
20130223454 | Delegate Forwarding and Address Resolution in Fragmented Network - A method for forwarding data within a virtual network instance comprising a plurality of end nodes using a designated forwarding node, wherein the method comprises maintaining a plurality of complete forwarding information for all of the end nodes within the virtual network instance, receiving a data packet destined for any of the end nodes in the virtual network instance, and forwarding the data packet based on the forwarding information, wherein the virtual network instance comprises a plurality of end nodes, and wherein the designated forwarding node is directly connected to some of the end nodes within the virtual network instance. | 08-29-2013 |
20130250961 | VIRTUAL SUBPORT DATA TRAFFIC MANAGEMENT - A network element includes an ingress interface, a VSP queue, and a switch fabric (SWF). The ingress interface includes a first virtual subport (VSP) and a second VSP. The first VSP is configured to receive data traffic. The VSP queue is coupled to the second VSP such that data traffic transmitted to the VSP queue is transmitted from the network element via the second VSP. The SWF is configured to receive data traffic from the first VSP, determine whether an intended recipient of the data traffic is associated with the second VSP, and hairpin the data traffic to the VSP queue when the SWF determines that the intended recipient is associated with the second VSP. | 09-26-2013 |
20130250962 | METHOD AND APPARATUS FOR LABEL DISTRIBUTION - The present invention provides a method for label distribution, including: receiving a Label Distribution Protocol packet that contains a first label and is distributed by a downstream node, in which the first label belongs to a downstream logical topology; searching for a second label that corresponds to the first label and belongs to an upstream logical topology, in which the upstream logical topology and the downstream logical topology are different logical topologies; and distributing, when an upstream node belonging to the upstream logical topology exists in a neighboring node, the second label to the upstream node. The present invention also provides a node device. Using the method or device disclosed in the present invention, a label may cross different logical topologies during distribution, so that in a newly established logical topology, it is not necessary to upgrade all common nodes, thereby reducing the cost for establishing the new logical topology. | 09-26-2013 |
20130250963 | RSVP-TE MP2MP Solution - An apparatus comprising a processor configured to store a first upstream label in a forwarding table upon receipt of a first message encapsulating the first upstream label from a first adjacent node, store a first downstream label in the forwarding table upon receipt of a second message encapsulating the first downstream label from a second adjacent node, send a third message encapsulating a second downstream label to the first adjacent node, send a fourth message encapsulating a second upstream label to the second adjacent node; and forward data received from a plurality of adjacent nodes over a MP2MP LSP using at least a portion of the labels stored in the forwarding table, wherein each adjacent node is associated with only one upstream label and only one downstream label, and wherein the maximum state complexity of the forwarding table is linear relative to the number of adjacent nodes. | 09-26-2013 |
20130259053 | SWITCH, INFORMATION PROCESSING APPARATUS, AND COMMUNICATION CONTROL METHOD - A PCIe switch stores therein a first identifier used by a CPU to identify a device, a second identifier that is a common identifier to identify the device in a network formed among a plurality of switches that connect the CPU to the device, and a destination of an access request to the device in an associated manner. When having received an access request from the CPU, the PCIe switch identifies a second identifier and a destination that are associated with a first identifier included in the access request. After that, the PCIe switch adds the identified second identifier to the access request, and transmits the access request with the second identifier added to the identified destination. | 10-03-2013 |
20130259054 | COMMUNICATION STATION, COMMUNICATION CONTROL PROGRAM, AND COMMUNICATION NETWORK SYSTEM - There is provided with a communication station including: a receiving unit, a determining unit, a transmitting unit and a reachability testing unit wherein the receiving unit receives a packet from a network in which a plurality of communication stations are interconnected, the determining unit determines whether the receiving unit receives a first packet in which a transmission source address is an address of a first communication station, the transmitting unit transmits a reply request packet to request a reply to the first communication station, and the reachability testing unit omits for the transmitting unit to transmit the reply request packet when the first packet is received before the transmitting unit transmits the reply request packet. | 10-03-2013 |
20130259055 | RECONFIGURABLE BRANCHING UNIT FOR SUBMARINE OPTICAL COMMUNICATION NETWORKS - Methods and systems for optical communication in a submarine network are provided. An input signal is received from a terminal at a reconfigurable branching unit (BU), wherein the BU enables bidirectional transmission between any two terminals, and the input signal is demultiplexed into at least one individual waveband or wavelength using at least one demultiplexer. Each demultiplexed waveband is passed through optical switches, with corresponding optical switches for the same demultiplexed waveband provided for transmission in the reverse direction. Independent per-waveband switching is performed using a demultiplexer-switch-multiplexer (DSM) architecture. Each demultiplexed waveband is multiplexed at each output port using at least one multiplexer to combine signals from different sources, and combined signals are transmitted to a destination terminal. | 10-03-2013 |
20130266020 | Establishing Tunnels Between Selective Endpoint Devices Along Communication Paths - In one embodiment, an intermediary device situated along a communication path between two endpoint devices may receive communication packets sent along the communication path. If the intermediary device receives a connection-initiating packet having a customization indicator and a connection-acknowledgement packet having a customization indicator, then the intermediary device may install a bypass rule. | 10-10-2013 |
20130287035 | Packet Flow Offload to Remote Destination with Routing Bypass - A network utilizes centralized control for the transport of a packet flow to a destination via an intermediary network. The network identifies the intermediary network best suited for offloading the packet flow and then develops a routing policy based on Multiprotocol Label Switching or other circuit-switching type techniques. This ensures that the packets of the packet flow are automatically forwarded to a peering router connected to the identified intermediary network, and ensures that the peering router automatically outputs the packets of the packet flow to the identified intermediary network in a manner that bypasses autonomous routing decisions by the routers of the network. | 10-31-2013 |
20130308650 | COMMUNICATION SYSTEM, NODE, CONTROL SERVER, COMMUNICATION METHOD AND PROGRAM - A packet contains an array of processing operations that are to be performed by a node. Each node in a data forwarding network performs the processing it has to perform in accordance with the array of the processing operations contained in the packet (FIG. | 11-21-2013 |
20130315253 | Lossless Connection Failover for Single Devices - The WAN optimization devices delay ACK until the ACK is actually received from the target while opening up the TCP window. When the ACK is received and forwarded, the TCP window is reduced in size. If there are mirrored WAN optimization devices, the original WAN optimization device sends the datagram across the WAN and at the same time sends the datagram to the mirroring WAN optimization device. When the mirroring WAN optimization device ACKs the mirrored datagram, the original WAN optimization device ACKs the host. When the ACK across the WAN is received, the mirroring WAN optimization device gets the ACK forwarded and deletes the mirrored datagram. On a loss of a device, the TCP connection transitions to the mirroring WAN optimization device, which closes the LAN TCP window and transmits all un-ACKed data. Then upon success the mirroring WAN optimization device reopens the LAN TCP window. | 11-28-2013 |
20130315254 | REAL-TIME PACKET TRANSFORMS TO AVOID RE-TRANSMISSIONS - There exists a need to reduce re-transmission delays in real time feeds (such as video) by sending the packet with sufficient repair/recovery information inside the packet container so the relaying stations and/or the receiving devices can fix errors in transmission by perusing the contents of the packet and the repair information, and modify the packet and then relay it. By providing the relaying station the ability to fix the error, retransmission of the packet is avoided along each relay station along the network path from source to destination and also by receiving devices that would otherwise request a re-transmission. This application teaches a method so real time streams (e.g. video) may be more efficiently transported over a CSMA based network. | 11-28-2013 |
20130315255 | SIGNALING OF ATTACHMENT CIRCUIT STATUS AND AUTOMATIC DISCOVERY OF INTER-CHASSIS COMMUNICATION PEERS - In an embodiment, a method of signaling status at a routing device is provided. In this method, the routing device establishes an inter-chassis control plane channel session with a remote routing device. Here, the routing device and the remote routing device are linked to a multi-homed routing device. The routing device then synchronizes with the remote routing device by way of the inter-chassis control plane channel session to identify a state of a link from the routing device to the multi-homed routing device. The state of the link is thereafter advertised by way of Border Gateway Protocol (BGP). Additionally, a method of discovering inter-chassis communication peers via BGP between the first and remote routing devices is provided. | 11-28-2013 |
20130322454 | Multipath effectuation within singly contiguous network fabric via switching device routing logic programming - Each of a network fabric controller device and a network fabric forwarder devices includes network connecting hardware and network managing logic. The network connecting hardware of the devices connects them to a singly contiguous network fabric including switching devices that route data between initiator nodes and target nodes and that have routing logic programmable by the controller device. The controller device does not directly route the data themselves. The network managing logic of the devices effects multipaths for transmission of the data through the singly contiguous network fabric from the initiator node to the target nodes via programming of the routing logic of the switching devices. | 12-05-2013 |
20130322455 | SWITCH SYSTEM AND METHOD FOR OPERATING A SWITCH - A method for operating a switch is provided. The switch shares a resource between a plurality of thunderbolt (TB) hosts and at least a TB device, and includes a plurality of non-transparent bridges. The method includes steps of establishing a memory address mapping between each the non-transparent bridge and the TB device; providing a plurality of protocol-converting media for the plurality of TB hosts, wherein each the protocol-converting medium is converted between a first protocol and a second protocol; and causing the plurality of protocol-converting media to be converted between the first protocol and the second protocol simultaneously so as to allow the resource to be shared between the plurality of TB hosts and the TB device simultaneously. | 12-05-2013 |
20130322456 | COMMUNICATION DEVICE, A CONTROL DEVICE, AND A NON-TRANSITORY COMPUTER READABLE MEDIUM - A communication device transmits a first packet to a first device via a network device, and receives a second packet from the first device. A transmission time between the communication device and the first device is calculated using time indicated by the communication device when the communication device transmitted the first packet, time indicated by the first device when the first device received the first packet, time indicated by the first device when the first device transmitted the second packet, time indicated by the communication device when the communication device received the second packet. A size of the first packet is set so that wait time of the first packet at the network device is within predetermined period. The wait time is calculated by assuming that a third packet transmitted from a second device is inputted to the network device before the first packet is inputted to the network device. | 12-05-2013 |
20130329742 | Criteria for Identifying Network Frames - Disclosed are various embodiments of a network switch for storing a prefix address and a mask corresponding to the prefix address, the prefix address and the mask each representing a binary value, the mask representing a number of significant bits of an address beginning with a most significant bit. The network switch obtains a network frame via one of a plurality of network interfaces, the network frame comprising a network address in a header of the network frame, the network address being a binary value representing a physical address of a network interface device. The network switch determines a truth value associated with a comparison of a mask number of bits of the prefix and network addresses, the truth value indicating an equivalence of the comparison. In response to the truth value, the network switch may initiate at least one action associated with the network frame. | 12-12-2013 |
20130329743 | END-TO-END FIBRE CHANNEL OVER ETHERNET - In one embodiment, a Fibre Channel over Ethernet (FCoE) proxy point (FPP) that is connected to one or more end-point devices is coupled to one or more other FPPs, and to a FCoE control and management plane (F-CMP) server. The FPP provides data plane functionality. The F-CMP server provides control plane functionality. At least some control and management traffic received at the FPP is proxied between the F-CMP server and the one or more end point devices connected to the FPP. FCoE traffic received at the FPP from the one or more end point devices connected to the FPP is transmitted to the one or more other FPPs without the FCoE traffic traversing the F-CMP server. The transmitting is performed by data plane functionality of the FPP operating under directions from the control plane functionality of the F-CMP server. | 12-12-2013 |
20140016648 | COMMUNICATION CONTROL SYSTEM, SWITCH NODE AND COMMUNICATION CONTROL METHOD - In a switch node connected with an external control server, a high functional service protocol processing can be realized by utilizing a multi-route compatible switch and a network interface (NW I/F), which are prescribed by the PCI express. Specifically, in a system which is provided with a switch node and a control server, a plurality of CPUs having a great deal of memories and a plurality of extended NW I/Fs are connected by a multi-route compatible PCI express switch, to configure a switch port of the plurality of extended NW I/Fs. Load distribution transfer processing to the plurality of CPUs from the network interfaces is made possible. | 01-16-2014 |
20140023083 | METHOD AND APPARATUS FOR EXCHANGING MESSAGES - A method and an apparatus for communicating with a second apparatus. The apparatus includes a controller and a transceiver for exchanging a predetermined number of data fields between the apparatuses by transmitting and receiving frames having one or more data fields and including in each frame a field indicating which data fields the apparatus has not yet received successfully. | 01-23-2014 |
20140023084 | REDUCING POWER CONSUMPTION IN A FAT-TREE NETWORK - A method for communication includes configuring a multi-level fat-tree network to include at least three levels of switches, including multiple modules arranged externally in a tree topology. Each module contains a respective group of the switches arranged in an internal tree extending over at least two of the levels of the network. A subset of the modules is selected to be active in carrying the communication traffic. The network is operated so as to convey communication traffic among the switches via the active modules, while the modules that are not in the selected subset remain inactive. | 01-23-2014 |
20140036925 | COMPRESSING DATA PACKET ROUTING INFORMATION USING BLOOM FILTERS - In one embodiment, a Transit Information Bloom Filter (TIBF) signal component is generated for use with a routing protocol control message, the TIBF signal component identifying at least one parent node for a corresponding routing topology. The TIBF signal component is encoded in a generated Bloom filter. The parameters of the generated Bloom filter are based at least on one parent node to be encoded and a desired false positive rate for the Bloom filter. The address for each parent node is also encoded in the Bloom filter. | 02-06-2014 |
20140044134 | DUPLICATE MAC ADDRESS DETECTION - Various systems and methods for detecting media access control (MAC) address conflicts are described herein. An indication to create a virtual machine on the host device is received at a host device of a plurality of host devices. A MAC address to assign to the virtual machine is identified, and a message is transmitted to at least one of the plurality of host devices, with the message including the identified MAC address. The MAC address is assigned to the virtual machine in the absence of a response from the at least one of the plurality of host devices indicating a potential conflict with the MAC address. | 02-13-2014 |
20140050222 | DATA TRANSFER OPTIMIZATION THROUGH DESTINATION ANALYTICS AND DATA DE-DUPLICATION - There are provided methods and systems for transferring requested data over a node chain from a source node to a destination node through at least two intermediate nodes. A method includes identifying, at a file system level, at each of the at least two intermediate nodes, prior data previously sent to or received from a subsequent node in the node chain that matches at least a portion of the requested data. The method also includes transmitting, to the subsequent node, at least one pointer to the prior data and a reconstruction recipe for reconstructing the requested data at the subsequent node based on at least the at least one pointer, when the prior data matches at least the portion of the requested data. The method further includes transmitting, to the subsequent node, other portions of the requested data previously unsent to or un-received by the subsequent node. | 02-20-2014 |
20140050223 | Method and System for Creating Software Defined Ordered Service Patterns in a Communications Network - A software defined network service (SDNS) node for altering a logical flow of data packets in a network to accommodate predetermined ordered service chains, comprising a receiver configured to receive an encapsulated data packet comprising a tag via a encapsulated tunnel from another SDNS node, wherein the tag identifies an ordered service chain or a next hop in the ordered service chain, a processor coupled to the receiver and configured to decapsulate the encapsulated data packet, and a transmitter coupled to the processor and configured to forward the decapsulated data packet to a service device attached to the SDNS node when the processor determines, based on the tag, that a service on the service device should be applied to the data packet. | 02-20-2014 |
20140050224 | PROVIDING A BUFFERLESS TRANSPORT METHOD FOR MULTI-DIMENSIONAL MESH TOPOLOGY - In one embodiment, the present invention includes a method for determining whether a packet received in an input/output (I/O) circuit of a node is destined for the node and if so, providing the packet to an egress queue of the I/O circuit and determining whether one or more packets are present in an ingress queue of the I/O circuit and if so, providing a selected packet to a first or second output register according to a global schedule that is independent of traffic flow. Other embodiments are described and claimed. | 02-20-2014 |
20140064287 | SYSTEM AND METHOD FOR SUPPORTING DISCOVERY AND ROUTING DEGRADED FAT-TREES IN A MIDDLEWARE MACHINE ENVIRONMENT - A system and method can support discovering and routing in a fabric with a plurality of switches. The system allows one or more switches in the fabric to be tagged with a switch role. Then, a subnet manager in the fabric detect the switch role that is associated with the one or more switches. Furthermore, a routing algorithm can be applied on the fabric based on the detected switch role associated with the one or more switches. | 03-06-2014 |
20140064288 | SYSTEM AND METHOD FOR STORING/CACHING, SEARCHING FOR, AND ACCESSING DATA - A system for persistently maintaining data using a network for data packets is provided. The system includes a transmission medium associated with the network, a plurality of switches operatively connected to the transmission medium. Each switch has an intelligent network controller adapted for delivering the data packets to a device operatively connected to the intelligent network controller in response to a request for the data packets from the device and further adapted for re-transmitting unexpired data packets over the network. | 03-06-2014 |
20140064289 | RELAY DEVICE AND CONNECTOR - To provide a relay device capable of increasing the number of connected nodes in a bus-type network, and a connector providing the relay device. An ASC | 03-06-2014 |
20140086254 | NETWORK DEVICE - A network device may comprise storage media configured to store traffic, instructions for a lookup engine, a map manager, a traffic forwarder, and a map. The map may comprise rules associating IPv4 and IPv6 addresses. The traffic forwarder may be configured to forward outbound traffic to the second device. The lookup engine may comprise instructions to cause the processor to check the map to determine whether the map comprises a rule associating the second address of the second device and the first address of the first device. If so, the instructions may cause the processor to forward the inbound traffic from the second device to the first device. If the map does not comprise this rule, the instructions may cause the processor to send a query to a second network device asking whether the second network device comprises a rule associating the first and second address. | 03-27-2014 |
20140092911 | Method and System for Routing Information in a Network - A method and system for determining an optimal route from a node to a given sink node in a network is described. Sink node periodically transmits routing information containing an indicator of recency. This indicator of recency is periodically updated. Routing information is received by a plurality of nodes in the network. Each node receiving routing information compares the indicator of recency contained in the routing information with an indicator of recency stored at the node to determine whether the received routing information is more recent than the stored routing information. An optimal route to the sink node is determined based on this comparison. Each node also periodically transmits routing information based on stored routing information to other nodes. | 04-03-2014 |
20140098820 | CENTRALIZED CONTROL AND MANAGEMENT PLANES FOR DIFFERENT INDEPENDENT SWITCHING DOMAINS - A network includes a first switching domain having a distributed fabric comprised of interconnected standalone switches. The standalone switches communicate with each other in accordance with a packet-based distributed fabric protocol. A second switching domain has a plurality of cell-based switches in communication with a cell-based switch fabric. The cell-based switches communicate with each other through the cell-based switch fabric in accordance with a cell-based distributed fabric protocol. One of the cell-based switches is coupled by a communication link to one of the standalone switches of the first switching domain. The second switching domain includes a server device coupled to one of the cell-based switches. The server device is configured with logic to process control packets for the standalone switches in accordance with the packet-based distributed fabric protocol and control packets for the cell-based switches in accordance with a protocol that is different from the packet-based distributed fabric protocol. | 04-10-2014 |
20140105216 | NETWORK DEVICES WITH FEATURE PEER NETWORK LOGIC - A device receives a service graph of feature peers for a packet of an application flow. The feature peers are associated with a network and the service graph includes an ordered set of the feature peers and forwarding requirements for the ordered set of the feature peers. The device generates forwarding instructions based on the service graph. The forwarding instructions include instructions to forward the packet to the ordered set of feature peers. The device provides the forwarding instructions to network devices of the network. The network devices forward the packet of the application flow to the ordered set of feature peers based on the forwarding instructions. | 04-17-2014 |
20140112348 | TRAFFIC FLOW MANAGEMENT WITHIN A DISTRIBUTED SYSTEM - Various methods and systems are provided for traffic flow management within distributed traffic. In one example, among others, a distributed system includes egress ports supported by nodes of the distributed system, cut-through tokens (c-tokens) including an indication of eligibility of the corresponding egress port to handle cut-through traffic, and a cut-through control ring to pass the c-tokens between the nodes. In another example, a method includes determining whether an egress port is available to handle cut-through traffic based upon a corresponding c-token, claiming the egress port for transmission of at least a portion of a packet, and routing it to the claimed egress port for transmission. In another example, a distributed system includes a first node configured to modify an eligibility indication of a c-token before transmission to a second node configured to route at least a portion of a packet based at least in part upon the eligibility indication. | 04-24-2014 |
20140112349 | OVERLAY SERVICES IN COMMUNICATION NETWORKS - In one embodiment, a method includes receiving a packet from a first host at a first edge device, the packet comprising a layer 3 address of a second host in communication with a second edge device, using the layer 3 address of the second host to receive a layer 2 address and a location identifier for the second host from a database accessible from a core network, the database comprising a mapping of layer 3 host addresses to layer 2 host addresses and location identifiers, and storing a mapping of the layer 2 address to the location identifier at the first edge device for use in forwarding packets to the second host. The first edge device is in communication with the second edge device in an overlay network defined by the edge devices interconnected by the core network. An apparatus and logic are also disclosed herein. | 04-24-2014 |
20140126577 | NETWORK COMMUNICATION NODE COMPRISING A PLURALITY OF PROCESSORS FOR PROCESSING LAYERS OF COMMUNICATION AND ASSOCIATED NODE - In one embodiment, a network communication node receives data and includes a plurality of processors aimed at processing data at a given layer of communication so as to route them towards a given destination. The node determines at least one layer of communication for processing the received data. The node selects a given number of processors to process the data according to the determined layer of communication, switches the selected processors in an active mode to process the determined layer of communication applied to the received data, and switches the selected processors in low consumption mode once processing carried out | 05-08-2014 |
20140140348 | MULTI-HOP ERROR RECOVERY - Methods, apparatus and network architectures relating to the use of a Hop-by-Hop packet forwarding technique using “stepping stone” switches. The network architectures include use of stepping stone switches interspersed with non-stepping stone switches such as conventional network switches comprising network elements such switches, routers, repeaters, etc. The stepping stone switches are configured to route packets as multiplexed flows along tunneled sub-paths between stepping stone switches in a hop-by-hop manner with error recovery, as opposed to conventional routing under which packets are routed from a source to a destination using an arbitrary path or along a (generally) lengthy flow-based path. Accordingly, packets from a source endpoint are routed to a destination endpoint via multiple sub-paths connecting pairs of stepping stone switches, with each sub-path traversing one or more conventional switches and constituting a logical Hop in the Hop-by-Hop route. | 05-22-2014 |
20140140349 | FAULT-TOLERANT, FRAME-BASED COMMUNICATION SYSTEM - A packet-switched, fault-tolerant, vehicle communication internetwork ( | 05-22-2014 |
20140161130 | NON-BROADCAST MULTIPLE ACCESS INVERSE NEXT HOP RESOLUTION PROTOCOL (INHRP) - The present invention is a method and apparatus for obtaining information transmitted between a source station and a destination station in a non broadcast multiple access network. A connection between the source station and a server for the destination station is established. The server has a cache containing the information. The source station transmits a request packet having parameters relating to the information to the server. The source station receives a reply packet containing the information from the server. The reply packet matches the parameters of the request packet. | 06-12-2014 |
20140185621 | ENERGY MANAGEMENT FOR COMMUNICATION NETWORK ELEMENTS - A method of managing data flow may include assigning, along a communication route, a predetermined total energy consumption limit for a network adaptor having a first and a second network adaptor port card, whereby the route transmits data between a first and a second node within the network. Along the route, a total energy consumption value for the network adaptor is determined based on the transmitted data. The assigned total energy consumption limit is compared with the determined total energy consumption value of the network adaptor. The transmitted data is determined as being data of a known duration and data of an unknown duration based on the comparing resulting in the determined total energy consumption value exceeding the assigned total energy consumption limit. The data of a known duration is transferred from the first network adaptor to the second network adaptor and the first network adaptor is powered off. | 07-03-2014 |
20140192817 | Virtual link aggregation using state machine - Physical links between an access switch and a pair aggregation switches are aggregated into a virtual link aggregation group (vLAG). Each aggregation switch is a local switch to itself and a remote switch to the other aggregation switch. Each aggregation switch maintains a state machine including initialization, local-up, remote-up, and formed states. In the initialization state, the physical link between the access switch and each aggregation switch is down, and the vLAG is down. In the local-up state, just the physical link between the access switch and the local switch is up, and the vLAG is down. In the remote-up state, just the physical link between the access switch and the remote switch is up, and the vLAG is down. In the formed state, the physical link between the access switch and each aggregation switch is up, and the vLAG is up. | 07-10-2014 |
20140204952 | METHOD AND APPARATUS FOR EXCHANGING DATA SIGNALS OVER A PLURALITY OF DOMAINS IN A HOME NETWORK - A method for receiving data signals transmitted over a plurality of domains in a network includes receiving a first data signal at a first physical interface connected to a first domain from among the plurality of domains; receiving a second data signal at a second physical interface connected to a second domain from among the plurality of domains; combining the first data signal and the second data signal to produce a combined signal; and extracting transmitted data from the combined signal. The first data signal and the second data signal are instances of a common original data signal, transmitted over the first domain and the second domain, respectively, and having undergone physical signal degradation associated with the first domain and the second domain, respectively. | 07-24-2014 |
20140219285 | NETWORK SYSTEM - A network system includes a signaling network configured to perform signaling information exchange with client nodes, determine a data information transfer route, and generate setting information, and a data network configured to construct the data information transfer route according to the setting information from the signaling network and perform data exchange between the client nodes. | 08-07-2014 |
20140233575 | Method for Scalable Routing in Content-Oriented Networks - A method for routing content, comprising receiving an interest packet from a first face, wherein the interest packet comprises a content name field populated with a first content name, a destination field, and a broadcast flag field set to broadcast, wherein the broadcast field indicates whether the first face has previously received a request having the first content name, and receiving a data packet from a second face, wherein the data packet comprises a content name field populated with a second content name, a source field populated with the identity of a source of data associated with the second content name, and a data field populated with the data associated with the second content name. | 08-21-2014 |
20140233576 | SYSTEM AND METHOD FOR ENABLING G.HN NODES TO SUPPORT 1905.1 RELAYING (MAC RELAYING) WHILE SUPPORTING LEGACY G.HN RELAYING ACCORDING TO THE G.HN STANDARDS - A device including a first node configured to communicate, over a first connection, with a second node and a third node in a network. The first node includes a first network layer associated with a first communication domain. The first communication domain corresponds to the first connection. A second network layer is associated with the first communication domain and a second communication domain. The first communication domain and the second communication domain are different. The first network layer is configured to receive, from the second node, a data packet to be relayed to the third node, in a first mode, forward the data packet to the third node, and in a second mode, selectively provide the data packet to the second network layer. The second network layer is configured to, in the second mode, forward the data packet to the third node. | 08-21-2014 |
20140233577 | COMMUNICATION SYSTEM, CONTROL APPARATUS, AND CONTROL METHOD THEREOF - A communication system includes: a plurality of nodes; a first node transmitting a request for a processing rule for processing a first packet; and a control apparatus including a first unit determining a first processing rule corresponding to the first packet in response to the request and preliminarily determining a second processing rule corresponding to a second packet that relates to the first packet and a second unit notifying the first node of the first processing rule and notifying at least one of the plurality of nodes of the second processing rule. | 08-21-2014 |
20140241371 | PACKET DISTRIBUTION SYSTEM, CONTROL DEVICE AND CONTROL METHOD - A packet distribution system includes: a first transfer device that is placed on a boundary of a core network and near first and second terminal devices; a second transfer device that is placed on the boundary of the core network and near a content distribution device; and a control device that, when a first content packet is distributed to the first terminal device, a distribution request packet is transmitted from the second terminal device, and a second content packet newly distributed from a content distribution device to the second terminal device is detected by the second transfer device, causes the second transfer device to abandon the second content packet based on control information included in the second content packet, and causes the first transfer device to copy the first content packet distributed to the first terminal device, to the second terminal device. | 08-28-2014 |
20140241372 | Constructing A Topology-Transparent Zone - A network node used to construct a topology-transparent zone (TTZ). The network node may obtain a TTZ identifier (ID) that is uniquely associated with a TTZ. Additionally, the network node may obtain a first link that couples the network node to a second network node that is also assigned the TTZ ID and a second link that couples the network node to a third network node that is not assigned the TTZ ID. The network node may generate a router information (RI) link-state advertisement (LSA) that indicates whether the network node is a TTZ edge node or a TTZ internal node and that indicates the TTZ associated with the TTZ. The network node may distribute the RI LSA to the second network node that is also assigned the TTZ ID using the first link. | 08-28-2014 |
20140241373 | SYSTEMS, METHODS, AND DEVICES FOR ADAPTIVE COMMUNICATION IN A DATA COMMUNICATION NETWORK - Disclosed herein are devices, systems, methods, and computer-program products for multiplexing data from multiple transport protocols in computing. Dynamic, reliable, secure and scalable systems and methods are disclosed for onboarding multiple device types onto a network. Novel systems and methods are provided for resolving communication for durable and transient data transfer from multiple device types on a network without requiring software agents, and for mitigating security vulnerability by restricting the operation ports on networks when communicating with multiple heterogeneous device types. Systems and methods described herein provide solutions for dynamically onboarding heterogeneous device types on the network used in pervasive and ubiquitous computing, without requiring software agents on the devices or subscribers. Some solutions encompass systems and methods for multiplexing data from multiple transport protocols using a dynamic dispatcher software assembly that identifies incoming patterns of data for routing to its dynamic reconfigurable corresponding processing logic in the processing module. | 08-28-2014 |
20140247831 | Method for Transmitting Messages in a Communication Network - A method is disclosed for transmitting messages in a communications network with at least three communications nodes. At least one communications node always remains active and stores messages sent by a second communications node. If the second communications node switches to an idle state, the caching node is informed thereof by means of a sleep-event and takes over the sending of the messages for this node. By means of a wake-up event, the caching node obtains information that the second node has switched back into the active state and ceases sending the stored messages. Further nodes, which likewise can switch to the idle state at any time and possibly not receive messages sent by the second node during their own idle phase, thus do not notice anything about the idle state of the second node and operate on the assumption of an up-to-date status in the network at all times. | 09-04-2014 |
20140254600 | TRANSMISSION SYSTEM, TRANSMISSION APPARATUS, AND TRANSMISSION METHOD - A transport system comprises a transport apparatus, which is used to construct a transport network using MPLS-TP; and a control apparatus for establishing a path in the transport network. The transport apparatus is coupled to a transfer apparatus, which is used to construct a transfer network using a network protocol different from an MPLS-TP protocol and uses the network protocol to establish a path in the transfer network in an autonomous distributed manner. The control apparatus and the transfer apparatus use the network protocol of the transfer network to transmit/receive, via the transport apparatus, control messages for controlling the transfer network. The transport apparatus avoids notifying the transfer apparatus of the fact that the control apparatus is not in a normal state, in a case where the path established in the transport network is determined as the normal state, even the control apparatus is determined as the abnormal state. | 09-11-2014 |
20140254601 | DATA PROCESSING APPARATUS, DATA PROCESSING METHOD, AND COMPUTER-READABLE STORAGE MEDIUM - A data processing apparatus includes an input unit to input data and processing modules. The processing modules may be connected as part of a ring-shaped data transfer path to transfer data in one direction. Each processing module includes a communication unit configured to implement a first data processing path and a setting path and a processing unit configured to process data received by the communication unit. When using switching data to switch the processing modules performing on the first data processing path to the processing modules performing on the setting path, the switching data is processed on the first data processing path. | 09-11-2014 |
20140269735 | SYSTEM AND METHOD FOR AGGREGATING PSEUDOWIRES - Systems, methods, architectures and/or apparatus for implementing Multi-Segment Pseudo Wire (MS-PW) arrangements in an efficient and scalable manner. | 09-18-2014 |
20140269736 | Transmission of Data Over a Low-Bandwidth Communication Channel - Disclosed herein are various systems and methods that may improve the transmission of data over low-bandwidth communication channels in an electric power delivery system. Devices communicating across a low-bandwidth communication channel may implement several approaches, according to various embodiments disclosed herein, to reduce the data transmitted across the low-bandwidth communication channel and to prioritize the transmission of time-sensitive and/or more important information with respect to other data. Various embodiments disclosed herein may inspect packets to be transmitted across a low-bandwidth communication channel in order to identify high priority data. High priority data may be time-sensitive information, and accordingly, transmission of such data may be prioritized over other data in order to reduce transmission latency of the higher priority data. | 09-18-2014 |
20140269737 | SYSTEM, METHOD AND APPARATUS FOR LSP SETUP USING INTER-DOMAIN ABR INDICATION - A system, method and apparatus for causing network routers such as Area Border Routers (ABRs) to perform an ERO expansion in response to ERO expansion trigger indicia included within an RSVP Path message. | 09-18-2014 |
20140269738 | INDEFINITELY EXPANDABLE HIGH-CAPACITY DATA SWITCH - A data switch for a packet data switch includes switching nodes connected to each other in an interconnecting matrix, providing a multiplicity of data paths between an incoming data or telecom port and an outgoing data or telecom port of the data switch. The interconnecting switching nodes can achieve high capacity data switching by providing a partial switching solution at each node, distributing the switching load. A switching protocol for interconnecting switching nodes allows data packets to be selectively passed from any incoming port on an interconnecting switch node to any interconnecting switching node or outgoing port connected to it. In at least one example, the switching protocol has mechanisms in it to provide for the duplicating of the contents of the data packet and pass them to multiple interconnecting switching nodes or outgoing ports. | 09-18-2014 |
20140269739 | HIGH AVAILABILITY SERVER CONFIGURATION WITH N + M ACTIVE AND STANDBY SYSTEMS - A switch may be configured with multiple zones to provide access to an external storage to certain processing systems. For example, the switch may be configured with two zones, in which a first zone configuration provides access to the external storage for a first processing system and a second zone configuration provides access to the external storage for a second processing system. Thus, the switch may provide high availability of the external storage and allow seamless transition from one computer system to another computer system. | 09-18-2014 |
20140286343 | METHODS AND SYSTEMS FOR TRANSMITTING PACKETS THROUGH NETWORK INTERFACES - A method carried out by a first communications device for transmitting data packets, wherein the first communications device comprises a plurality of network interfaces. Data packets are transmitted through a first network interface when a first condition is satisfied, and through a second network interface when a second condition is satisfied. In one of the embodiments, the plurality of network interfaces are classified into a plurality of groups of network interfaces according to a first group of conditions, and the first network interface and second network interface belong to two different groups of network interfaces. | 09-25-2014 |
20140286344 | DISTRIBUTED CONNECTION ESTABLISHMENT AND RESTORATION - Connection constraints are flooded using an extension to a routing protocol being used to control forwarding on network. Nodes maintain topology and connection database and calculate routes for connections based on the constraints. If a node is on a calculated route for a connection it will install forwarding state for the connection. Since each node has a consistent view of the network topology and has been provided with the constraints associated with the connection, each node on the network will calculate the same route for the connection. When a failure occurs, the nodes will calculate restoration paths for the connections on a network-wide priority basis to enable restoration paths to be created for the affected connections without requiring the restoration paths to be signaled. Time-stamps are used to allow events to be applied by nodes in a consistent order regardless of the order in which they arrive. | 09-25-2014 |
20140307741 | PROCESSING REQUESTS FOR SERVICES IN A SERVICE REQUEST AT A RECEIVING CONTROLLER AND PROCESSING CONTROLLER IN A SWITCH - Provided are a computer program product, system, and method for processing requests for multiple services in a service request. A receiving controller, comprising one of a controlling forwarder or a data forwarder, receives a service request for a service from an originating device node. The receiving controller forwards an internal service request to a processing controller providing response information for the service request. The processing controller comprises a data forwarder when the receiving controller comprises the controlling forwarder or comprises the controlling forwarder when the receiving controller comprises one of the at least one data forwarder. The processing controller processes the internal service request to generate response information requested by the service request and forwards a reply including the response information to the receiving controller, which forwards the response information in a reply to the service request to the originating device node. | 10-16-2014 |
20140307742 | COMMUNICATION SYSTEM, CONTROL DEVICE, FORWARDING NODE, AND CONTROL METHOD AND PROGRAM FOR COMMUNICATION SYSTEM - A communication system includes a plurality of forwarding nodes that process a received packet in accordance with a processing rule that determines a matching rule matching a packet and a process to be applied to a packet conforming with the matching rule; and a control apparatus that controls the forwarding nodes using control information. The control apparatus includes a tunnel establishing unit that determines forwarding path(s) for the respective control information for each of the forwarding nodes, and transmits to the forwarding nodes a tunnel establishing message including a processing rule for forwarding the control information to be set in the forwarding nodes in each of the forwarding paths. The respective forwarding nodes give and receive control information with regard to the control apparatus, by holding processing rules for forwarding the control information included in the tunnel establishing message. | 10-16-2014 |
20140307743 | METHOD AND APPARATUS FOR AUTOMATED SUBSCRIBER-BASED TDM-IP CONVERSION - An automated conversion method and apparatus are provided to automatically detect the type of an incoming signal (e.g., SONET or Ethernet signal) at a site and to encapsulate outgoing data, or not, based on that detection to facilitate conversion to new infrastructure (e.g., TDM to Ethernet). The automatic detection can be achieved by alternating a search for a first or second protocol signals (e.g., a SONET signal or Ethernet signal) received after a loss of signal or other similar event. Diagnostics of any prior valid transmission are retained in case the disruption was due to transmission quality problem rather than a change in the transmission protocol (e.g., SONET to Ethernet). An FPGA can have firmware configured as necessary to support either an IP or TDM configuration when change is detected in the format of the signal arriving at the optical port of the premises device. | 10-16-2014 |
20140314096 | CONTROLLING ROUTING DURING SCHEDULED NODE DOWNTIME - In one embodiment, a first node in a shared-media communication network may receive a message indicated a scheduled downtime of a second node located between the first node and a destination. The first node may determine whether to perform a search for an alternate route toward the destination. In response to determining to perform the search, the first node may perform the search for an alternate route toward the destination for use at least during the scheduled downtime. | 10-23-2014 |
20140334494 | HARDWARE HASH TABLE VIRTUALIZATION IN MULTI-PACKET PROCESSOR NETWORKING SYSTEMS - Techniques for virtualizing hardware hash tables in a networking system are provided. In one embodiment, the networking system can maintain a plurality of virtual hash tables corresponding to a plurality of hardware hash tables in the networking system. For each hardware hash table and its corresponding virtual hash table, the networking system can intercept operations directed to the hardware hash table and apply the intercepted operations to the virtual hash table. The networking system can then selectively install and/or uninstall virtual hash table entries to/from the hardware hash table in view of the operations. | 11-13-2014 |
20140348175 | Moca Packet Aggregation - Embodiments may be disclosed herein that provide systems, devices, and methods of operating a Multimedia over Coax (MoCA) network. One such embodiment is a method comprising: aggregating packets, including at least control packets and acknowledgement packets, with other packets. | 11-27-2014 |
20140362864 | TRANSMITTING APPARATUS, TRANSMITTING METHOD, AND STORAGE MEDIUM - Reduction of the processing cost of reconstructing data at a receiving apparatus in multipath transmission is aimed at. A transmitting apparatus for transmitting data using a plurality of communication paths includes a determination unit configured to determine whether to cause a communication path for transmitting a first data unit and a communication path for transmitting a second data unit to be different, or to transmit a third data unit including the first data unit and the second data unit through one communication path among the plurality of communication paths, and a transmitting unit configured to transmit data included in the third data unit through a communication path determined by the determination unit. | 12-11-2014 |
20140369359 | COMMUNICATION DEVICE AND COMMUNICATION CONTROL METHOD - A communication device is included in an ad hoc network in a reactive routing scheme. The communication device includes a receiving unit, a selecting unit, and a transfer control unit. The receiving unit receives a route request frame including overall quality information on routes through which the route request frame has passed. The selecting unit selects a route request frame to be transferred to another communication device based on the quality information, from the route request frames received by the receiving unit through a plurality of routes. The transfer control unit transfers the route request frame selected by the selecting unit to the another communication device, and discards the route request frame when a quality value indicated by the quality information of the route request frame is smaller than a predetermined reference value. | 12-18-2014 |
20140376556 | SELECTIVELY REFRESHING ADDRESS REGISTRATION INFORMATION - Facilitating communications within a processing environment. Inbound traffic and outbound traffic on one or more virtual interfaces of the processing environment are monitored for a predefined amount of time. Based on the monitoring, a determination is made as to whether for a selected component of a virtual interface of the one or more virtual interfaces an inbound frame has been received but an outbound frame has not been transmitted for the predetermined amount of time. Based on determining that the inbound frame has been received but the outbound frame has not been transmitted, a generated outbound frame is forwarded to cause address registration information for the virtual interface to be refreshed. | 12-25-2014 |
20140376557 | MODULAR DECOUPLED CROSSBAR FOR ON-CHIP ROUTER - Layout-aware modular decoupled crossbar and router for on-chip interconnects and associated micro-architectures and methods of operation. A crossbar and router architecture called MoDe-X (Modular Decoupled Crossbar) is disclosed that supports 5-port routing for use in 2D mesh interconnects and is implemented through use of decoupled row and column sub-crossbar modules in combination with feeder wiring and control logic that enables routing between ports on the row and column sub-crossbar modules. The corresponding MoDe-X router supports 5-port routing between various router input and output port combinations while reducing both router area and power consumption when compared with a conventional 5×5 crossbar design and implementation. The MoDe-X micro-architecture can be configured to support both single and dual local port injection configurations. | 12-25-2014 |
20150030033 | REDIRECTING TRAFFIC VIA TUNNELS TO DISCOVERED DATA AGGREGATORS - In one embodiment, a data aggregator discovery (DAD) message may be distributed by an associated data aggregator, the DAD message identifying the initiating data aggregator, and comprising a recorded route taken from the data aggregator to a receiving particular node as well as a total path cost for the particular node to reach a root node of the DAG through the recorded route and via the data aggregator. The receiving particular node determines a path cost increase (PCI) associated with use of the data aggregator based on the total path cost as compared to a DAG-based path cost for the particular node to reach the root node via the DAG. If the PCI is below a configured threshold, the particular node may redirect traffic to the data aggregator as source-routed traffic according to the recorded route. The traffic may then be aggregated by the data aggregator, accordingly. | 01-29-2015 |
20150043592 | TERMINAL APPARATUS AND METHOD OF CONTROLLING TERMINAL APPARATUS - A terminal apparatus included in a contents centric network and a communication method thereof are provided, the communication method including receiving an interest packet regarding a specific content from an external terminal apparatus, adjusting a window size of the interest packet based on at least one of a requesting frequency of the specific content corresponding to the interest packet and a communication status, and after adjusting the window size, transmitting the interest packet to surrounding terminal apparatuses. | 02-12-2015 |
20150063360 | High Availability L3 Gateways for Logical Networks - Some embodiments provide a method for a network controller in a network control system that manages a plurality of logical networks. The method receives a specification of a logical network that includes a logical router. The method selects at least two host machines to implement a routing table for the logical router from several host machines designated for hosting logical routers. The selected host machines include a designated master host machine for the routing table. The method generates data tuples for provisioning a set of managed forwarding elements that implement the logical network to send data packets that require processing by the routing table to the selected host machines. The data tuples specify an order for the selected host machines with the designated master host machine as the first host machine in the specified order. | 03-05-2015 |
20150063361 | COMPUTER SYSTEM AND COMMUNICATION ROUTE CHANGING METHOD - A computer system of the present invention includes a controller; a plurality of switches configured to carry out relay processing of a reception, packet based on a flow entry set by said controller; and a plurality of storage systems. The controller changes the flow entry of each of the plurality of switches based on resource data acquired from the plurality of storage systems, to change the storage system of the plurality of storage systems as an access destination of a client terminal. Thus, The whole network system can be managed and used without being conscious of each of the plurality of storage systems and the situation of the whole network. | 03-05-2015 |
20150063362 | Method and Switching Unit for the Reliable Switching of Synchronization of Messages - The invention relates to a method for the reliable switching of synchronisation messages in a distributed computer system consisting of a number of node computers, wherein the management of a transparent clock conforming to IEEE Standard 1588 is supported, wherein a switching unit consists of four separate FCUs, specifically an input system EIN, two independent switching systems VER1 and VER2, and an output system AUS, and wherein a message arriving at EIN from a transmitting node computer is forwarded immediately in unmodified form from EIN directly to the two independent switching systems VER1 and VER2, and wherein VER1 provides the event of the arrival of the message with a timestamp, analyses the message and switches said message to (an) output port(s) associated with an address field of the message, and wherein VER1 opens the message and modifies a TIC field within the message in order to determine the delay period of the message in VER1, and wherein VER1 closes the message again by re-calculating a CRC field of the modified message and forwarding the closed message to AUS, and wherein VER2 provides the event of the arrival of the message with a timestamp, analyses the message and switches said message to the output port(s) associated with the address field of the message, and wherein VER2 opens the message and modifies the TIC field within the message in order to determine the delay period of the message in VER2, and wherein VER2 closes the message again by re-calculating the CRC field of the modified message and forwarding the closed message to AUS, and wherein AUS checks whether the content of the message delivered from VER1 matches the content of the message delivered from VER2, and wherein AUS checks whether the interval between the moment of receipt of the message delivered from VER1 and the moment of receipt of the message delivered from VER2 is smaller than a first interval determined a priori, referred to hereinafter as the interval_1, and whether the absolute value of the difference of the delay values stored in the two TIC fields is smaller than a second interval known a priori, referred to hereinafter as the interval_2, and wherein, in the case that one of these checks is negative, AUS interrupts the transmission of the message that is outbound via the addressed output ports or changes the outbound message in such a way that each message receiver identifies the incoming message as faulty. | 03-05-2015 |
20150071294 | APPARATUS AND METHOD FOR DESIGNING A COMMUNICATION NETWORK PREVENTING OCCURRENCE OF MULTIPLE FAILURES - An apparatus generates plural communication-route candidates corresponding to a requested communication channel by combining first transmission-paths providing connections between particular nodes in a network and second transmission-paths providing connections between three or more nodes in the network, where the first transmission paths are accommodated in plural communication cables together with the second transmission paths. The apparatus holds a table indicating first and second association relationships, where the first association relationship associates the first transmission paths with communication cables that accommodate the first transmission paths and are provided at opposite ends of each of the first transmission-paths, and the second association relationship associates the second transmission paths with communication cables accommodating the second transmission paths. The apparatus determines, by referring to the table, from among the plural communication-route candidates, a communication-route candidate that uses a same communication cable multiple times, and excludes the determined communication-route candidate from the plural communication-route candidates. | 03-12-2015 |
20150071295 | ON-DEMAND MEDIUM TO LOW TRANSMISSION POWER CHANNEL SWITCHING IN COMPUTER NETWORKS - In a multiple interface, low power and lossy network comprising a plurality of nodes, a low transmission power and medium transmission power topology are defined for the network and a channel-hopping schedule is defined for the devices operating in each topology. A sender determines that data is capable of being transmitted via a link on the low transmission power topology. The sender determines the transmission parameters for the transmission of the data over the link on the low transmission power topology and determines a low transmission power channel for transmission of the data. The sender transmits the determined channel and the transmission parameters to the receiver. The sender transmits the data via the determined channel in the low transmission power topology. | 03-12-2015 |
20150078391 | AIR-CONDITIONING SYSTEM AND RELAY DEVICE - In an air-conditioning system, an outdoor unit and an indoor unit communicate through a relay device, including a plurality of communication ports; a plurality of communication networks having logical connection relationships with the respective communication ports; and a plurality of nodes having logical connection relationships with the respective communication networks. The plurality of nodes are each associated with one of the outdoor unit and the indoor unit. Among the plurality of nodes, a certain node is set as a first node, and another certain node different from the first node is set as a second node. The relay device executes transfer processing of transferring a communication frame from the first node to the second node, and then if the relay device does not receive a reception acknowledgment signal from the second node, limits a number of re-transmission times when the relay device re-transfers the communication frame to the second node. | 03-19-2015 |
20150092784 | COMMUNICATION SYSTEM, COMMUNICATION DEVICE, STORAGE MEDIUM, AND COMMUNICATION METHOD - An example communication system, including: a plurality of devices that form a mesh-type network, each of the plurality of devices performing communication from a source device to a destination device, directly or by relaying via one or more other devices, and at least one of the plurality of devices including a selecting unit, that selects a communication route from the source device to the destination device according to a first restriction with regard to a relay value indicative of the number of communication routes that each device is able to relay. | 04-02-2015 |
20150098475 | HOST TABLE MANAGEMENT IN SOFTWARE DEFINED NETWORK (SDN) SWITCH CLUSTERS HAVING LAYER-3 DISTRIBUTED ROUTER FUNCTIONALITY - According to one embodiment, a system includes a switch controller in communication with a plurality of switches in a switch cluster via a communication protocol, at least one switch in the switch cluster being configured to connect to a host, wherein the switch controller is configured to: maintain a Layer-3 (L3) host table configured to store entries including address information for hosts connected directly to the switch cluster, apply a policy to all existing entries in the L3 host table, and remove one or more existing entries according to the policy in order to reduce a number of entries in the L3 host table. In other embodiments, systems, computer program products, and methods for managing a L3 host table in software defined network (SDN)-based switch clusters having L3 distributed router functionality are presented. | 04-09-2015 |
20150131670 | METHODS AND APPARATUS FOR CENTRALIZED VIRTUAL SWITCH FABRIC CONTROL - In some embodiments, an apparatus comprises a processing module, disposed within a first switch fabric element, configured to detect a second switch fabric element having a routing module when the second switch fabric element is operatively coupled to the first switch fabric element. The processing module is configured to define a virtual processing module configured to be operatively coupled to the second switch fabric element. The virtual processing module is configured to receive a request from the second switch fabric element for forwarding information and the virtual processing module is configured to send the forwarding information to the routing module. | 05-14-2015 |
20150146735 | PACKET FORWARDING IN A STAR STACKING SYSTEM - A stacking port extension member receives a packet, forwards the packet according to a destination port number of the packet when a destination forwarding chip identifier (ID) of the packet is a local forwarding chip ID, determine whether the packet is transmitted to a lower-level stacking port extension member when the destination forwarding chip ID of the packet is not the local forwarding chip ID, forward the packet according to a configured forwarding relationship towards the lower-level stacking port extension member when it is determined that the packet is transmitted to the lower-level stacking port extension member, and otherwise, directly forward the packet through a locally configured uplink second-level stacking port. | 05-28-2015 |
20150146736 | MULTI-TENANT SYSTEM, SWITCH, CONTROLLER AND PACKET TRANSFERRING METHOD - A multi-tenant system is realized by the Tunneling protocol. The multi-tenant system includes a server apparatus on which a virtual machine with tenant identification data operates; an equipment whose tenant identification data cannot be recognized; a plurality of switches configured to transfer a packet based on flow entries; and a controller configured to set the flow entries to the switches. The plurality of switches includes a first switch connected with the server apparatus and a second switch connected with the equipment. The second switch rewrites the header of the packet sent from and received by the equipment based on an address translation table. Thus, the equipment becomes available. | 05-28-2015 |
20150146737 | TECHNIQUE FOR COMMUNICATION IN AN INFORMATION-CENTERED COMMUNICATION NETWORK - A communication method is provided, which is implemented by a routing device in an information-centered communication network. The method includes the following steps to process a request relative to a data segment from a given stream, the request being routed on a link of the routing device: checking that an input bit rate for said link is higher than a threshold, the input bit rate for the link corresponding to that which is necessary for the device to receive, by using the link, a set of data segments corresponding to pending requests; and timing the request to be routed. The threshold may correspond to the bit rate available on this link at the device input, or the input bit rate may be determined for pending requests related to data segments from the given stream, and the threshold may correspond to a fair bit rate, for example. | 05-28-2015 |
20150312142 | Propagating a Flow Policy by Control Packet in a Software Defined Network (SDN) Based Network - Propagating a flow policy within a software defined network (SDN) includes sending a route path request for a flow from a first forwarding node to an SDN controller of the SDN, receiving route path information specifying a route path for the flow from the SDN controller, and generating, using a processor of the first forwarding node, a control packet including the route path. The control packet is communicated from the first forwarding node to a second forwarding node. | 10-29-2015 |
20150312173 | SYNCHRONIZING OUT-OF-SYNC ELEMENTS IN A DISTRIBUTED FIBRE CHANNEL FORWARDER - Techniques are provided for synchronizing, in a distributed Fibre Channel fabric or a distributed FCoE fabric in which FC frames are encapsulated in Ethernet frames, a controlling FCoE forwarder (cFCF) with the FCoE data-plane forwarder (FDF). The operation includes entering a recovery mode at the FDF. The FDF is modified based on a route distribution message provided by the cFCF which includes fabric-provided MAC addresses (FPMAs). The FDF notifies the cFCF of differences between the FPMAs supplied by the route distribution message with the FPMAs known by the FDF. The FDF leaves the recovery mode and sends an acknowledgement to the cFCF. | 10-29-2015 |
20150319070 | METHODS AND APPARATUSES FOR ABSTRACTING FILTERS IN A NETWORK VISIBILITY INFRASTRUCTURE - Embodiments of the invention disclose methods for managing visibility filters in a plurality of network visibility infrastructure elements of a visibility network such that these network visibility infrastructure elements and their filters are managed as a network and filter configuring, packet replication, and redundancy are implemented efficiently from a centralized filter control module. | 11-05-2015 |
20150334010 | ROUTE MAPPING AT INDIVIDUAL NODES OF A CLUSTER SERVER - Each compute node of a cluster compute server generates and maintains route information for routing messages to other nodes of the server. Each compute node identifies the other nodes connected to a fabric interconnect and generates, based on a set of routing constraints, routes to each of the other nodes. Each compute node communicates messages to other nodes of the server via the generated routes. Because the routes are generated at each compute node the processing load to generate the routes is distributed among the compute nodes. | 11-19-2015 |
20160021028 | COMMUNICATION SYSTEM, CONTROL APPARATUS, FORWARDING NODE, CONTROL METHOD AND PROGRAM - A plurality of forwarding nodes includes: a topology holding unit that holds as first topology information connection relationship between an own node and at least part of the group of nodes; a topology notification unit that notifies a node(s) adjacent to the own node among the group of nodes of the first topology information; and an in-band communication unit that notifies a control apparatus of the first topology information. The control apparatus includes: a topology configuration unit that generates second topology information by combining a plurality of pieces of the first topology information notified by the plurality of forwarding nodes; and an in-band control unit that derives a path from the control apparatus to the plurality of forwarding nodes based on the second topology information and establishes a control channel for controlling the plurality of forwarding nodes along the derived path. | 01-21-2016 |
20160036690 | DISTRIBUTING NON-UNICAST ROUTES INFORMATION IN A TRILL NETWORK - The present invention discloses a method for processing non-unicast routes information in a TRILL network and a corresponding RBridge, wherein the RBridge has a neighbor relation with a plurality of other RBridges in the TRILL network, and the RBridge is the RBridge which computes non-unicast routes information in the neighbor relation, and in the method, the RBridge executes steps of: sending an acknowledgement message to the plurality of other RBridges, wherein the acknowledgement message acknowledges that the RBridge is the RBridge which computes the non-unicast routes information; obtaining a network topology related to the non-unicast routes information in the TRILL network; computing the non-unicast routes information based on the network topology; and distributing the computed non-unicast routes information to the plurality of other RBridges. The method and the corresponding RBridge are capable of reducing consumption of CPU resource of RBridges in the TRILL network. | 02-04-2016 |
20160072897 | COMMUNICATION SESSION PROCESSING - Measures for use in processing communication sessions in a telecommunications network are provided. Each communication session has a signaling path spanning a plurality of devices including one or more intermediate network devices and at least two endpoint devices, the signaling path comprising a plurality of signaling segments, each segment being between two devices in the plurality of devices. A first signaling message, comprising a first identifier associated with the communication session, is received via a first signaling segment for a communication session. At least part of the first identifier is transformed using a deterministic encryption algorithm to generate a second identifier. A second signaling message, comprising the second identifier, is transmitted via a second signaling segment for the communication session to associate the second identifier with the communication session. | 03-10-2016 |
20160087918 | Converged Adaptive Compensation Scheme - Described is an apparatus which comprises: logic to convert output of at least one sensor to a digital sensing signal; a router coupled to the sensor, the router to receive the digital sensing signal and to map into circuit data; and one or more communication interfaces, coupled to the router, to forward circuit data to a circuit endpoint. Described is a method which comprises: providing one or more digital sensing signals from a plurality of sensors; receiving the one or more digital sensing signals; generating packets of data using the one or more digital sensing signals; and providing the packets of data to one or more destinations. | 03-24-2016 |
20160119188 | END HOST PHYSICAL CONNECTION ON A SWITCH PORT USING MULTIPLE ETHERNET FRAMES - Machine logic (for example, software) that performs the following steps: (i) providing a system including a first hypervisor and a first topology agent; (ii) running the topology agent on the hypervisor; (iii) dynamically creating a first unique address for the first topology agent; and (iv) storing the first unique address in a set of forwarding database (FDB) table(s) located on a set of network switch(es). Also, lightweight mechanisms on network switches for finding and/or clearing media access controller (MAC) addresses from FDB tables. | 04-28-2016 |
20160119252 | COMMUNICATION SYSTEM, COMMUNICATION METHOD, SERVER EQUIPMENT, AND COMMUNICATION EQUIPMENT - A server includes a plurality of network interfaces capable of communicating between the server and a plurality of communication apparatus which includes network ports capable of connecting a communication cable; a first unit specifying a pair of the network ports, which are connected via the communication cable, according to information related to connectivity of the network ports; and a second unit sending an instruction to the communication apparatus; wherein the instruction is to connect a first end of the communication cable to a first port corresponds to the specified port, and to connect a second end of the communication cable to a second port corresponds to the specified port. | 04-28-2016 |
20160127267 | Distributed Switch Architecture - A distributed switch architecture supports very high bandwidth applications. For instance, the distributed switch architecture may be implemented for cloud networks. The architecture scales by organizing traffic management components into tiled structures with distributed buffering. The tile structures are replicated and interconnected to perform transfers from ingress to egress using an interconnect bandwidth scheduling algorithm. Bandwidth scaling may be achieved by adding more tiles to achieve higher bandwidth. The interconnect in the architecture may be swapped out depending on implementation parameters, e.g., physical efficiency. | 05-05-2016 |
20160127268 | Network Arrangement and Method Prioritization of Real-Time Telegrams in a Convergent Network - A method for the prioritization of real-time telegrams in a convergent network, in particular in an industrial network and/or a “time-sensitive network” (TSN), wherein the convergent network has a central distribution infrastructure and a decentralized distribution infrastructure, and within the convergent network a service sends and/or receives real-time telegrams, and wherein the convergent network has a switching node forming a central network node for connection of central distribution infrastructure and decentralized distribution infrastructure, and which has a coupling port via which the switching node is connected to the decentralized distribution infrastructure, wherein the switching node has central network ports via which the switching node is integrated into the central distribution infrastructure, where real-time telegrams received at central network ports of the switching nodes are assigned a higher priority level than the real-time telegrams received at the coupling ports so as to provide efficient prioritization of real-time telegrams. | 05-05-2016 |
20160127274 | METHOD AND APPARATUS FOR REPLICATING NETWORK INFORMATION BASE IN A DISTRIBUTED NETWORK CONTROL SYSTEM WITH MULTIPLE CONTROLLER INSTANCES - A network control system that includes several controllers for managing several switching elements. Each controller includes a network information base (NIB) storage that stores data regarding the switching elements and a secondary storage for facilitating replication of at least a portion of data across the NIB storages of the different controllers. In some embodiments, the primary purpose for one or more of the secondary storage structures is to back up the data in the NIB. In these or other embodiments, one or more of the secondary storage structures serve a purpose other than backing up the data in the NIB. In some embodiments, the NIB is stored in system memory while the system operates for fast access of the NIB records. In some embodiments, one or more of the secondary storage structures are stored on disks which can be slower to access. | 05-05-2016 |
20160142342 | APPARATUS AND METHOD FOR FAST SEARCH TABLE UPDATE IN A NETWORK SWITCH - A network switch comprises a plurality of packet processing units configured to process a received packet through multiple packet processing stages based on search result of a table. The network switch further comprises one or more memory units configured to maintain the table to be searched and provide the search result to the packet processing units. The network switch further comprises a table managing unit configured to accept a plurality of rules on bulk update to the table specified by a control unit, and perform the bulk update on the table based on the rules specified by the control unit without the control unit accessing the table directly for the bulk update. | 05-19-2016 |
20160173356 | PROACTIVE DETECTION OF HOST STATUS IN A COMMUNICATIONS NETWORK | 06-16-2016 |
20160173550 | Custom Content Insertion | 06-16-2016 |
20160191418 | INDUSTRIAL CONTROL DEVICE AND METHOD FOR INSERTION AND REMOVAL OF A MODULE UNDER POWER WITHOUT INTERRUPTION - Disclosed is an industrial control device including a point-to-point backplane/point module architecture providing RIUP (Removal and Insertion Under Power) functionality where data communications between modules is maintained after the removal of a point module from the backplane. According to an exemplary embodiment, a backplane includes a plurality of bypass switches controlled by respective point modules, whereby data communicated bypass a removed point module interface and point-to-point data communications are provided to an inserted point module after an initial routine is executed by a microcontroller associated with the inserted point module. | 06-30-2016 |
20160192037 | COMPACT NETWORKING DEVICE FOR REMOTE STATIONS - A tower-mounted networking device facilitates deploying a remote station without having to build a custom station aside a radio tower. The networking device's chassis comprises a mounting bracket, which includes a curved contour for mounting the networking device on the radio tower. Also, the chassis can be resistant to weather intrusion, by not including a vent, to allow the networking device to be installed outdoors. The networking device can include a first power port coupled to an external connection line from a source external to the tower, such that the external connection line provides at least power to the networking device. The networking device can use the power to power a set of antenna mounted on the radio tower. The networking device can also relay a network connection between a pair of antennas, and/or between an antenna and a network connection to an Internet service provider. | 06-30-2016 |
20160205015 | SOFTWARE DEFINED NETWORK AND A COMMUNICATION NETWORK COMPRISING THE SAME | 07-14-2016 |
20160255046 | SELECTIVELY REFRESHING ADDRESS REGISTRATION INFORMATION | 09-01-2016 |
20160380835 | COMMUNICATION SYSTEM USING NETWORK - In a communication system having multiple nodes communicably connected via a network, at least two of the nodes each includes: a software-operated data generator that executes arithmetic processing using software to generate transmission data to be transmitted to another node; a data transmission unit that sends out the transmission data; a data accepting unit that accepts data transmitted from another node; a software-operated controller that executes arithmetic processing using software based on at least the data accepted by the data accepting unit to control hardware serving as a control target; and an interrupt accepting unit that accepts interrupt data generated by another node and, based on the accepted interrupt data, outputs a hardware control signal to the hardware serving as the control target or other hardware associated with the node such that the hardware is directly controlled based on the hardware control signal without via the software-operated controller. | 12-29-2016 |