Class / Patent application number | Description | Number of patent applications / Date published |
370393000 | Address concatenation | 23 |
20080317033 | Apparatus and method for requesting bandwidth allocation and allocating bandwidth in a communication system - A method and apparatus for requesting bandwidth allocation and allocating a bandwidth in response to the request in a communication system are provided, in which an mobile station detects a second CID requiring bandwidth allocation, the second CID being different from a first CID included in a MAC header, generates a grant management subheader including an order field and a bandwidth field, the order field being for writing a rank of the second CID in a CID list listing CIDs of the mobile station according to a predetermined criterion and the bandwidth field being for writing a bandwidth required for the second CID, concatenates the grant management subheader to the MAC header, and transmits the concatenated MAC header and grant management subheader to a base station to request bandwidth allocation for the second CID. | 12-25-2008 |
20090103542 | Efficiency Improvement For Shared Communications Networks - A technique for providing data unit concatenation in a shared communications network is disclosed. The technique establishes a distinction between a first address space and a second address space within one or more shared communications networks, such as a wireless local area network, in a telecommunications system. At a transmitter node, data units arriving from one or more source nodes are packaged together if they are intended a network accessible through a receiver and then are transmitted to the receiver node. During the transfer of data units across the telecommunications system, the addressing mechanism will use either source and destination nodes or transmitter and receiver nodes, depending on the address space relevant at the moment of transmission. The technique increases utilization efficiency, because overhead attributed to headers, acknowledgements and interframe gaps is reduced. | 04-23-2009 |
20100158013 | SYSTEMS AND METHODS FOR REDUCING LATENCY AND RESERVATION REQUEST OVERHEAD IN A COMMUNICATIONS NETWORK - Systems and methods for reducing reservation request overhead in a communications network in which devices are connected via a coax network are provided. A method for managing transmission of data over a MoCA network according to the invention may include monitoring data transmission requirements at a node on the network; generating statistics of the data transmission requirements; predicting transmission requirements from the statistics; and reserving future transmission opportunities in view of the predicted transmission requirements. | 06-24-2010 |
20110026529 | Method And Apparatus For Option-based Marking Of A DHCP Packet - A method and apparatus for processing a Dynamic Host Configuration Protocol (DHCP) packet in a trusted network are disclosed. The trusted network includes a plurality of trusted network devices and a trusted host. The DHCP packet is received at a network device of the trusted network. A port of the network device from which the DHCP packet was received is determined. An identifier associated with the port is determined. An option in the DHCP packet is marked by the network device using the identifier. The marked DHCP packet is transmitted along a forwarding path. | 02-03-2011 |
20110110374 | METHOD OF RECEIVING A DATA PACKET COMING FROM AN IPV4 DOMAIN IN AN IPV6 DOMAIN, AN ASSOCIATED DEVICE, AND ASSOCIATED ACCESS EQUIPMENT - A method of receiving a data packet from an IPv4 domain in an IPv6 domain, said data packet comprising an IPv4 destination address and a destination port number. The method comprises the following steps: constructing an IPv6 destination address by concatenating an operator prefix, said IPv4 address, and the destination port number; generating an IPv6 data packet from the IPv6 constructed destination address and the received IPv4 data packet; and routing the generated IPv6 data packet in the IPv6 domain using the IPv6 constructed destination address, said constructed address belonging to a range of IPv6 addresses routable to an interconnection equipment of the IPv6 domain with the IPv4 destination address. | 05-12-2011 |
20110110375 | METHOD OF RECEIVING A DATA PACKET IN AN IPV6 DOMAIN, AN ASSOCIATED DEVICE AND AN ASSOCIATED HOME GATEWAY - A method of receiving an IPv6 data packet in an IPv6 domain connected to an IPv4 domain, said packet comprising an IPv6 destination address and an IPv6 source address. The method comprises the following steps: identifying an IPv6 destination address constructed by concatenating an operator prefix, an IPv4 destination address, and a destination port number; if necessary, regularizing at least one address of the data packet and modifying the data packet; and routing the modified data packet to its destination. | 05-12-2011 |
20110128962 | METHOD FOR ROUTING OF MESSAGES WITHIN A DATA NETWORK - A data network includes a plurality of source nodes, at least one sink node, and at least one intermediate node, wherein routing of a reverse message from the sink node to a source node via at least one intermediate node is performed by the intermediate node using reverse path routing information data comprising a combination of source routing information data and transparent bridging information data, wherein the reverse path routing information data is constructed during propagation of a forward message from the source node to the sink node via the intermediate node. | 06-02-2011 |
20110292944 | FLY-BY AND ACK-ACCELERATED ARBITRATION FOR BROADCAST PACKETS - A method for administering transmission of a first type of packets and a second type of packets over a serial bus is disclosed. The method comprises: if there is a packet of a second type to be sent, then concatenating the packet of the second type to a plurality of packets of the first type and sending the plurality of packets of the first type followed by the concatenated packet of the second type; and if there is no packet of the second type to be sent, then concatenating a bogus ack packet to the plurality of packets of the first type and sending the plurality of packets of the first type followed by the concatenated bogus ack packet. | 12-01-2011 |
20120155474 | MESSAGING WITH FLEXIBLE TRANSMIT ORDERING - In one embodiment, a system includes a packet reception unit. The packet reception unit is configured to receive a packet, create a header indicating scheduling of the packet in a plurality of cores and concatenate the header and the packet. The header is based on the content of the packet. In one embodiment, a system includes a transmit silo configured to store a multiple fragments of a packet, the fragments having been sent to a destination and the transmit silo having not received an acknowledgement of receipt of the fragments from the destination. The system further includes a restriction verifier coupled with the transmit silo. The restriction verifier is configured to receive the fragments and determine whether the fragments can be sent and stored in the transmit silo. | 06-21-2012 |
20120257630 | INTERACTIVE HEADER COMPRESSION IN PEER-TO-PEER COMMUNICATIONS - Apparatus and methods for communicating messages between communication devices are disclosed. The method includes receiving, from a second communication device, a message with a compressed header and a compression token, the compression token replacing routing information compressed out of an original header of the message. The method also includes determining, using the compression token, whether the routing information is stored on a first communication device, and requesting, if the routing information is not stored on the first communication device, that the second communication device send the routing information to the first communication device. And the first communication device routes the message to a destination device based upon the routing information. | 10-11-2012 |
20120314711 | Header encoding for single carrier (SC) and/or orthogonal frequency division multiplexing (OFDM) using shortening, puncturing, and/or repetition - Header encoding for SC and/or OFDM signaling using shortening, puncturing, and/or repetition in accordance with encoding header information within a frame to be transmitted via a communication channel employs different respective puncturing patterns as applied to different portions thereof. For example, a first puncturing pattern is applied to a first portion of the frame, and a second puncturing pattern is applied to a second portion of the frame (the second portion may be a repeated version of the first portion). Shortening (e.g., by padding 0-valued bits thereto) may be made to header information bits before they undergo encoding (e.g., in an LDPC encoder). One or both of the information bits and parity/redundancy bits output from the encoder undergo selective puncturing. Moreover, one or both of the information bits and parity/redundancy bits output from the encoder may be repeated/spread before undergoing selective puncturing to generate a header. | 12-13-2012 |
20120320922 | SYSTEMS AND METHODS FOR PHYSICAL LAYER ("PHY") CONCATENATION IN A MULTIMEDIA OVER COAX ALLIANCE 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. | 12-20-2012 |
20130016724 | LINK LAYER PREEMPTION - Disclosed are various embodiments for frame preemption and fragmentation at the media access control (MAC) sublayer of the link layer or the MAC merge sublayer of the link layer. Traffic classes may be organized into preemptive traffic classes and non-preemptive traffic classes. Preemptable frames may be fragmented when a preemptive frame is to be transmitted. The fragmentation may be indicated through modification of the value of cyclic redundancy check (CRC) field in a predetermined way, through addition of a fragmentation trailer, and/or through other approaches. | 01-17-2013 |
20130089097 | Forwarding IPv6 Packets based on Shorter Addresses Derived from Their IPv6 Destination Addresses - In one embodiment, a packet switching device is configured to convert an Internet Protocol Version 6 (IPv6) destination address, of a received particular IPv6 packet, to a second, shorter destination address. This second destination address is then used to determine forwarding information for the received IPv6 packet, which is forwarded accordingly. In one embodiment, this second address is a 32-bit address, and in particular, an Internet Protocol Version 4 (IPv4) address. Thus, one embodiment can use the IPv4 forwarding infrastructure of a packet switching device for determining how to forward IPv6 packets. In a network according to one embodiment, packets are encapsulated in an IPv6 packet using an IPv6 destination address (that can be converted to an IPv4 address) of an egress edge packet switching device. Thus, core packet switching devices can forward IPv6 packets using IPv4 lookup operations. | 04-11-2013 |
20130235873 | TRACEBACK PACKET TRANSPORT PROTOCOL - Tokens identifying all of the physical routing devices, i.e., network nodes, through which a packet travels are recorded in a limited amount of space reserved in the header of the packet for such tokens. When insufficient space remains in the header of the packet for all tokens required to identify all physical routing devices through which the packet travels, sequences of multiple tokens are replaced with an abbreviation token representing the sequence. The sequence of tokens represented by an abbreviation token can also be abbreviation tokens, supporting recursive abbreviation of the token sequence in the header of the packet as needed to record the entire route of the packet through the network regardless of the limited space in the header for tracking the route of the packet. | 09-12-2013 |
20130250959 | COMMUNICATION PACKET CONVERSION - Techniques for converting communication packets in a network having multiple nodes are described herein. A node may receive communication packets from one or more neighboring nodes. Each communication packet may include control data and payload data. The node may extract the payload data and store the payload data for a time period. The node may determine whether to concatenate the extracted payload data of the communication packets (e.g., based on destinations to where each of the extracted payload data are to be sent, a supported data rate, an application type associated with the extracted payload data, etc.). The node may concatenate the extracted payload data of the communication packets and send the concatenated payload data to another node in a communication packet. | 09-26-2013 |
20130329740 | METHODS, SYSTEMS, AND COMPUTER READABLE MEDIA FOR ROUTING DIAMETER MESSAGES AT A DIAMETER SIGNALING ROUTER - According to one aspect, the subject matter described herein includes a method for routing Diameter messages. The method includes steps occurring at a Diameter signaling router (DSR) comprising a plurality of Diameter message processors. The method includes receiving a Diameter request message. The method further includes generating a hop-by-hop identifier for identifying a first Diameter message processor of the plurality of Diameter message processors. The method further includes incorporating the hop-by-hop identifier into the Diameter request message. The method further includes routing the Diameter request message to a first Diameter node. | 12-12-2013 |
20140056306 | MAC Aggregation With Message Multiplicity For Use In A Multi-Node Data Network - A MAC aggregation technique utilizing a large field addition operation is disclosed. The large field addition operation defines the addition of two or more MACs mod p, where the two or MACs may comprise constituent MACs or aggregate MACs, and where p is a prime number that is large relative to the size of the MACs. The disclosed MAC aggregation technique yields an aggregate MAC much shorter than the concatenation of constituent MACs while achieving security even in the case where constituent MACs may be aggregated in duplicate. | 02-27-2014 |
20140079071 | MESSAGING WITH FLEXIBLE TRANSMIT ORDERING - In one embodiment, a system includes a packet reception unit. The packet reception unit is configured to receive a packet, create a header indicating scheduling of the packet in a plurality of cores and concatenate the header and the packet. The header is based on the content of the packet. In one embodiment, a system includes a transmit silo configured to store a multiple fragments of a packet, the fragments having been sent to a destination and the transmit silo having not received an acknowledgement of receipt of the fragments from the destination. The system further includes a restriction verifier coupled with the transmit silo. The restriction verifier is configured to receive the fragments and determine whether the fragments can be sent and stored in the transmit silo. | 03-20-2014 |
20140140347 | TIE-BREAKING IN SHORTEST PATH DETERMINATION - A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network. | 05-22-2014 |
20140233572 | Handling Method and Device for Cell Concatenation - A handling method for cell concatenation, includes receiving a cell of a packet before a concatenation timeout period expires and before the total number of received cells of the packet reaches a concatenation number. The method further includes determining whether an end-of-packet cell of the packet is received. If the end-of-packet cell of the packet is received, the received cell of the packet is encapsulated into a first PWE3 packet. The first PWE3 packet is sent to an MPLS network. The present application relieves a limit of the concatenation number or the concatenation timeout period in a cell concatenation process of the packet so as to reduce a delay and a jitter of the packet caused by the cell concatenation. | 08-21-2014 |
20150124831 | METHODS AND SYSTEMS FOR ENCAPSULATING AND DE-ENCAPSULATING PROVIDER BACKBONE BRIDGING INSIDE UPPER LAYER PROTOCOLS - Methods and systems for encapsulating and de-encapsulating a customer frame component of a Provider Backbone Bridging header are provided. The customer frame component includes a customer local area network identifier and a customer destination address. The customer frame component can be received at an ingress port of a network device for transmission. Header information can be determined from the customer local area network identifier and the customer destination address. A key can be set in the header information to a predefined value for a Provider Backbone Bridging protocol. A backbone service instance identifier can be determined from the customer local area network identifier. The header information and backbone service instance identifier can be concatenated with the customer frame component to form a frame. The frame can be provided to an egress port of the network device for transmission, where the egress port is determined from the header information. | 05-07-2015 |
20160149747 | Port Number Extension Method and Switch - A port number extension method and a switch are provided. A first switch determines bits for identifying the first switch in a Media Access Control (MAC) address in an identifier (ID) of a specified bridge; calculates a bit for port number extension according to the bits for identifying the first switch; and combines the bit for port number extension and original bits for specifying a port, to obtain new bits for specifying a port. In this way, a problem that Spanning Tree Protocol (STP) port numbers are insufficient in a super virtual fabric with a massive quantity of ports is resolved. | 05-26-2016 |