Patents by Inventor Mikael Degermark

Mikael Degermark has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Robust header compression in packet communications
    Patent number: 7453907
    Abstract: A technique for compressing header information to produce a compressed header portion of a data packet to be transmitted across a communication channel includes generating a checksum from the header information, and providing the checksum as the compressed header portion.
    Type: Grant
    Filed: April 28, 2004
    Date of Patent: November 18, 2008
    Assignee: Telefonktiebolaget L M Ericsson (PUBL)
    Inventors: Lars-Erik Jonsson, Krister Svanbro, Mikael Degermark
  • Re-use of static checksum information in header compression/decompression applications
    Patent number: 6820233
    Abstract: In packet communications that employ header compression/decompression, the computational complexity of checksum generation can be reduced by re-using static checksum information associated with header bits that do not change from header to header. The static checksum information can be used together with information about header bits that do change from header to header, in order to generate a desired checksum. The checksum can then be used to verify a reconstructed header produced from a compressed header by a header decompressor.
    Type: Grant
    Filed: January 2, 2001
    Date of Patent: November 16, 2004
    Assignee: Telefonaktiebolaget LM Ericsson
    Inventors: Ingemar Johansson, Krister Svanbro, Lars-Erik Jonsson, Hans Hannu, Stefan Hakansson, Mikael Degermark
  • Robust header compression in packet communications
    Publication number: 20040202167
    Abstract: A technique for compressing header information to produce a compressed header portion of a data packet to be transmitted across a communication channel includes generating a checksum from the header information, and providing the checksum as the compressed header portion.
    Type: Application
    Filed: April 28, 2004
    Publication date: October 14, 2004
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Lars-Erik Jonsson, Krister Svanbro, Mikael Degermark
  • Robust header compression in packet communications
    Patent number: 6754231
    Abstract: A technique for compressing header information to produce a compressed header portion of a data packet to be transmitted across a communication channel includes generating a checksum from the header information, and providing the checksum as the compressed header portion.
    Type: Grant
    Filed: June 18, 1999
    Date of Patent: June 22, 2004
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Lars-Erik Jonsson, Krister Svanbro, Mikael Degermark
  • Re-use of static checksum information in header compression/decompression applications
    Publication number: 20020026620
    Abstract: In packet communications that employ header compression/decompression, the computational complexity of checksum generation can be reduced by re-using static checksum information associated with header bits that do not change from header to header. The static checksum information can be used together with information about header bits that do change from header to header, in order to generate a desired checksum. The checksum can then be used to verify a reconstructed header produced from a compressed header by a header decompressor.
    Type: Application
    Filed: January 2, 2001
    Publication date: February 28, 2002
    Inventors: Ingemar Johansson, Krister Svanbro, Lars-Erik Jonsson, Hans Hannu, Stefan Hakansson, Mikael Degermark
  • Fast routing lookup system using complete prefix tree, bit vector, and pointers in a routing table for determining where to route IP datagrams
    Patent number: 6266706
    Abstract: In a method of IP routing lookup in a routing table, comprising entries of arbitrary length prefixes with associated next-hop information in a next-hop table, to determine where IP datagrams are to be forwarded, a representation of the routing table is stored, in the form of a complete prefix tree (7), defined by the prefixes of all routing table entries. Further, a representation of a bit vector (8), comprising data of a cut through the prefix tree (7) at a current depth (D), and an array of pointers, comprising indices to the next-hop table and to a next-level chunk, are stored. The bit-vector (8) is divided into bit-masks and a representation of the bit-masks is stored in a maptable. Then, an array of code words, each encoding a row index into the maptable and a pointer offset, and an array of base addresses are stored. Finally, the lookup is performed.
    Type: Grant
    Filed: April 17, 1998
    Date of Patent: July 24, 2001
    Assignee: Effnet Group AB
    Inventors: Andrej Brodnik, Mikael Degermark, Svante Carlsson, Stephen Pink
  • Robust header compression in packet communications
    Patent number: RE44233
    Abstract: A technique for compressing header information to produce a compressed header portion of a data packet to be transmitted across a communication channel includes generating a checksum from the header information, and providing the checksum as the compressed header portion.
    Type: Grant
    Filed: November 12, 2010
    Date of Patent: May 21, 2013
    Assignee: Telefonaktiebolaget L M Ericsson (Publ)
    Inventors: Lars-Erik Jonsson, Krister Svanbro, Mikael Degermark