\U.S. UTILITY Patent A
`,..,, .
`"'
`0.1.P.E.
`
`'
`
`J!:ED ~€D-Q:A.
`
`· ..
`
`APPLICATION NO.
`09/756553
`
`CONT/PRIOR CLASS
`370
`
`SUBCLASS
`
`?ftyf
`
`ART UNIT
`266j
`
`EXAMINER
`
`' I
`/11/?( IV.
`
`ORIGINAL
`
`ISSUING CLASSIFICATION
`CROSS REFERENCE(S)
`
`SUBCLASS
`CL!'SS
`l/-01
`'371>
`INTERNATIONAL CLASSIFICATION
`
`CLASS
`3"'7C>
`
`SUBCLASS (ONE SUBCLASS PER BLOCK)
`
`D Continued on Issue Slip Inside File Jacket
`
`Print Fig.
`
`z
`
`CLAIMS ALLOWED
`Print Claim 'tor O.G.
`
`Total Claims
`
`NOTICE OF ALLOWANCE MAILED
`
`□ TERMINAL
`DISCLAIMER
`
`DRAWINGS
`
`Sheets Drwg.
`
`Figs. Drwg.
`
`(date)
`
`D The term of lhis patent
`subsequent to _____
`has been disclaimed.
`D The term of this patent shall
`not extend beyond the expiration date
`of U.S Patent. No. ____
`_
`
`(Assl•tsnt Examiner)
`
`(Dato)
`
`ISSUE FEE
`
`Amount Due
`
`Date Paid
`
`ISSUE BATCH NUMBER
`
`(Primary Examiner)
`
`(Dato)
`
`D The terminal _months
`of
`this patent have been disclaimed.
`
`(Legal lns1rumonts Examiner)
`
`WARNING:
`The information disclosed herein may be restricted. Unauthorized disclosure may be prohibited.by the United States Code Tille 35, Sections 122, 18.1 and 368.
`Possession outside the U.S. Patent & Trademark Office Is restricted to authorized employees and contractors only.
`FILED WITH: □ DISK (CRF) □ FICHE □ CD-ROM
`(Attached In pocket on rtghl Inside flap)
`
`Form PT0-436A
`(Rev, 6199)
`
`(FACE)
`
`EX 1002 Page 1
`
`

`

`ISSUE SLIP STAPLE AREA (for additional cross references)
`
`I
`
`POSITION
`
`!NITIALS
`
`IDNO.
`
`DATE
`
`FEE DETERMINATION
`0.1.P.E. CLASSIFIER
`FORMALITY REVIEW
`RESPONSE FORMALITY REVIEW
`
`,.-y-·
`'7111
`\k.
`
`x I c..1
`911k
`
`f:2_-~ ~o/
`n'J...-21 of
`r,J, /;:, A /..:JI
`
`II'
`
`INDEX OF CLAIMS
`................................. Rejected
`N ................................. Non-elected
`................................. Allowed
`
`I ................................. Interference
`(Through numeral) ... Canceled
`A ................................. Appeal
`................................. Restricted
`O ................................. Objected
`
`Clalm
`
`Date
`
`! 1 .g>
`
`;,, '
`
`-
`
`0:: 0
`101
`10:
`10:
`10
`10
`ho
`10 -l-+--+--+--.....,...i--,-,1--,,-jl-,-l,_..+..,.-I
`100
`109
`10
`. 111 .
`12 :
`11
`11 ·., \. _; k
`11
`• ' c: 1,
`, . 11
`.•
`,· •.
`
`~ ;:
`: ·, ·t ',·''
`' •. ·.~": ~ .. t
`' :<,, ;>, ~-' 'I:•
`:-, .
`. ·;'~' j,
`:·
`'·,,
`.. k_ '·•· ,~ .t.::-/~~ ·~·,~·-i;}~ !':~~ r;
`:/ ,,f ;".·,'. ,,:, · .' n
`. .' .• :: ,' :
`. _:· .. -'.:·• :21.-.. ·,r ·,.• .··
`·,: .-..
`;} · .. _:,_-;:.:;fie •,; ,.,.; ·
`·,- ,(
`
`t ..
`
`'\
`
`.'
`
`Date
`
`27 O
`28 O
`29 O
`30'
`31
`32
`33
`34
`35
`36
`
`45
`46
`47
`48
`49
`50
`
`..
`ftr'I: ••:
`
`Date
`
`Claim
`.;
`.5
`-
`Cl)
`'"
`'t:
`C
`0:: 0
`51
`52
`53
`54
`55
`56
`57
`58
`59
`60
`61
`62
`63
`64
`65
`66
`67
`+--l--t--,l--,r,-1t--,r-,t--,t-:1r-1
`68
`69
`..:."":
`+--+--t-iht-lt-lr-t-lr:-1r,
`70
`71
`72
`73
`74
`75
`76
`n
`78
`79
`80
`81
`82
`83
`84
`85
`86
`87
`88
`89
`90
`91
`92
`93
`94
`95
`96
`97
`98
`99
`nrn
`
`If more than 150 claims or 10 actions
`staple additional sheet here
`
`(LEFT INSIDE)
`
`· : I/}· ·_, 11 ~· ,,t•:-
`:: 11
`,:-··, .> 111 ·"
`• . .- ~l!O ,,
`,7.1 _;_:
`
`,
`
`·c
`
`•,
`
`1?'
`12
`129
`hXl
`31
`
`113
`13
`H:3
`n3
`3
`
`3
`14(
`14
`14
`
`h4
`
`EX 1002 Page 2
`
`

`

`,
`
`39756S4
`
`r
`Name (PrlnO --
`PACKET FRAGMENTATION WITH NESTED INTERRUPTIONS
`
`The present
`transmission,
`data
`for multiplexing·of
`over
`a single
`channel.
`
`FIELD OF THE INVENTION
`invention
`relates
`generally
`and
`specifically
`to methods
`data
`streams
`with
`different
`
`to •high-speed
`and
`systems
`priorities
`
`at
`is
`
`in
`
`BACKGROUND OF THE INVENTION
`the
`of- methods
`are
`known
`in
`A number
`aggregating
`multiple
`physical
`links
`into
`a single
`channel
`between
`a
`transmitter
`and
`a
`receiver.
`split
`the
`transmitter
`into multiple
`streams,
`which
`transmitted
`over
`a respective
`one of
`the
`links.
`The
`receiver
`then
`reassembles
`the
`data
`original
`order.
`The
`use
`of multiple
`parallel
`advantageous
`in providing
`high
`channel
`bandwidth
`low-bandwidth
`links
`are
`available,
`and
`also
`network
`operators
`offering
`flexible
`data
`bandwidth
`on demand.
`this
`of
`transmission
`for multilink
`Standard
`methods
`Mode
`for
`both Asynchronous
`Transfer
`have been
`defined
`sort
`Protocol
`(IP)
`networks.
`The ATM
`(ATM) and
`Internet
`approach
`is
`described
`in
`document
`AF-PHY-0086.
`001,
`promulgated
`the ATM Forum
`(1999),
`entitled
`"Inverse
`by
`Multiplexing
`for ATM
`( IMA) Specification
`Version
`1.1."
`For
`IP networks,
`the
`"PPP Multilink
`Protocol"
`is described
`of
`al.
`by Sklower
`et
`in Request
`for Comments
`{RFC) 1990
`the
`Internet
`Engineering
`Task Force
`(IETF).
`Both
`of
`these
`documents
`incorporated
`herein
`by
`reference.
`are
`Fig.
`is
`a
`block
`diagram
`that
`1
`illustrates
`a system
`20
`for multilink
`data
`in accordance
`with
`the PPP Multilink
`Protocol,
`
`for
`art
`logical
`Data
`are
`each
`of
`physical
`into
`the
`links
`is
`when only
`assists
`rates
`and
`
`schematically
`communications
`as
`is
`known
`
`1
`
`EX 1002 Page 3
`
`

`

`39756S4
`
`•
`
`.
`
`- -·· -· ---------·-· ...
`
`.
`
`a
`
`30,
`36,
`
`art.
`the
`in
`a
`over
`data
`transmits
`22
`transmitter
`A
`receiver
`26.
`24
`to
`channel
`multilink
`24
`Channel
`physical
`multiple
`comprises
`links
`32.
`28 I
`A
`into
`38
`34,
`packets
`incoming
`40 breaks
`fragmenter
`physical
`different
`over
`the
`42 for
`transmission
`fragments
`links.
`Protocol
`receives
`a Multi
`link
`Each
`fragment
`42
`a fragment
`sequence
`number
`(SN),
`(MP) header
`that
`includes
`an
`ending
`bit
`(E).
`a beginning
`bit
`(B)
`and
`The SN
`is
`incremented
`for
`each
`fragment
`in
`the
`sequence.
`In
`the
`example
`shown
`in Fig.
`1, SN runs
`from 4
`to 13.
`Packet
`34
`is
`divided
`into
`fragments
`4-7,
`packet
`36
`into
`fragments
`8-10,
`and
`packet
`38
`into
`fragments
`11-13.
`The
`first
`B=l,
`fragment
`in
`while
`the
`each
`packet
`receives
`last
`segment
`E=l.
`Otherwise,
`B and E are
`zero.
`receives
`to
`set
`When a
`fragment
`an
`packet,
`B and E
`contains
`entire
`both
`are
`set
`to 1.
`in
`24
`channel
`42 over
`fragments
`22 sends
`Transmitter
`no
`is
`There
`their
`sequence
`numbers.
`order
`of
`the
`in
`will
`arrive
`assurance,
`however,
`that
`the
`fragments
`fragments
`may be
`order
`at
`receiver
`26,
`and
`some of
`the
`receiver
`2 6 waits
`lost
`entirely.
`reassembler
`44
`in
`A
`have
`packet
`arrived
`the
`until
`all
`of
`fragments
`in
`a given
`(Al though
`for
`the
`before
`rebuilding
`the
`entire
`packet.
`40 and
`reassembler
`sake
`of conceptual
`clarity,
`fragmenter
`44 are
`shown
`and described
`herein
`as distinct
`functional
`of
`blocks,
`the
`functions
`these
`blocks
`typically
`functions
`central
`by
`with
`carried
`out
`along
`other
`processing
`units
`(CPUs)
`in
`transmitter
`22 and
`receiver
`26,
`respectively.)
`If
`reassembler
`4 4 determines
`that
`any of
`the
`fragments
`the
`packet
`have
`been
`lost,
`the
`rest
`of
`the
`fragments
`the
`packet
`are
`discarded.
`
`are
`
`in
`in
`
`2
`
`EX 1002 Page 4
`
`

`

`••
`
`39756S4
`
`•
`
`for
`
`of
`
`a
`
`44
`reassembler
`fragments,
`lost
`detect
`to
`order
`In
`28,
`30 and 32
`all
`of
`links
`over
`the minimum
`track
`of
`keeps
`minimum
`is
`This
`recently
`received
`of
`the most
`SN.
`increase
`from
`to
`is
`identified
`in Fig.
`1 as M, which
`seen
`sequence
`over
`in
`to
`4
`to 5
`6 to 9 as
`fragments
`42 arrive
`arrives,
`the
`the
`links.
`Whenever
`an ending
`(E)
`fragment
`the
`SN of
`ending
`fragment
`against
`the
`reassembler
`checks
`SN of
`the
`ending
`fragment
`M. When Mis
`greater
`than
`the
`(SNd,
`and
`the
`remaining
`fragments
`in
`the
`packet
`to which
`the
`ending
`fragment
`belongs
`have
`not
`yet
`arrived,
`the
`are
`missing
`fragments
`considered
`to have
`been
`lost.
`All
`whose
`of
`the
`fragments
`sequence
`numbers
`are
`less
`or
`than
`if
`then
`to SNE are
`discarded.
`For
`example,
`the
`in
`equal
`scheme
`shown
`in Fig.
`1,
`the
`fragment
`with
`SN=S had
`failed
`when M=9,
`the
`ending
`to
`arrive
`at
`the
`receiver,
`then
`(SNE=7),
`which
`was
`previously
`fragment
`of
`packet
`34
`M > SNE.
`the
`All
`of
`received,
`would meet
`the
`criterion
`fragments
`belonging
`to
`packet
`34
`( SN=4,
`6 and
`7) would
`then
`be discarded.
`lost
`and
`reassembly
`method
`this
`In
`order
`that
`it
`is necessary
`to work properly,
`fragment
`detection
`of
`strictly
`in
`order
`the
`fragments
`send
`transmitter
`22
`each
`the
`fragments
`of
`numbers.
`All
`of
`their
`sequence
`packet
`must
`therefore
`sent without
`interruption
`before
`be
`the
`transmitter
`begins
`sending
`the
`fragments
`of
`the
`next
`packet.
`As
`result,
`when
`the
`ending
`fragment
`is
`received,
`the
`receiver
`is
`assured
`that
`all
`of
`the
`fragments
`in
`the packet
`have
`already
`been
`transmitted.
`If
`of
`SNE without
`all
`the
`fragments
`the
`M increases
`past
`packet
`having
`arrived,
`then
`can be
`safely
`assumed
`that
`one or more of
`the
`packets
`been
`lost.
`
`in
`
`it
`have
`
`3
`
`EX 1002 Page 5
`
`

`

`•
`
`39756S4
`
`•
`
`SUMMARY OF THE INVENTION
`to provide
`an object
`of
`the
`present
`invention
`is
`It
`methods
`improved
`and
`systems
`for
`fragmentation
`datagram
`and
`reassembly,
`particularly
`for
`multilink
`data
`transmission.
`the present
`of
`some aspects
`of
`object
`a further
`It
`is
`fragmentation
`support
`for
`enhanced
`to
`provide
`invention
`at multiple
`priority
`levels.
`and
`transmission
`of datagrams
`of
`the
`present
`invention,
`In preferred
`.embodiments
`transmitter
`and
`receiver
`exchange
`datagrams,
`data
`a
`data
`packets,
`over
`channel
`at multiple
`typically
`levels.
`The
`transmitter
`determines
`during
`priority
`whether
`each of
`the packets
`should
`be divided
`transmission
`for
`transmission
`to
`the
`receiver,
`depending
`into
`fragments
`traffic
`and
`priorities
`and
`other
`system
`on
`packet
`The
`receiver
`then
`reassembles
`the
`packets
`as
`conditions.
`based
`on
`information
`contained
`in
`the
`fragment
`necessary,
`The decision
`as
`to whether
`a packet
`should
`be
`headers.
`and
`in what manner
`is
`preferably
`made by
`the
`fragmented
`"on
`the
`fly."
`By
`contrast,
`prior
`art
`transmitter
`work with
`fixed
`fragment
`sizes
`and
`require
`transmitters
`decision
`to
`fragment
`or
`not
`to
`fragment
`the
`that
`the
`packets
`be made
`statically,
`before
`beginning
`operation.
`In
`particular,
`when
`the
`transmitter
`receives
`high-priority
`packet
`for
`transmission
`while
`in
`the midst
`of
`transmitting
`a
`lower-priority
`packet,
`the
`lower-priority
`preferably
`fragmented.
`The
`transmission
`of
`the
`lower-priority
`packet
`is
`interrupted
`send
`the
`high-priority
`packet
`fragments
`As
`a
`result,
`the
`order
`of
`transmission
`fragments
`need
`not
`follow
`the
`packet
`order
`in
`the
`packets
`were
`received
`by
`the
`
`a
`
`a
`
`of
`
`is
`packet
`the
`fragments
`in order
`to
`immediately.
`of
`the
`which
`
`4
`
`EX 1002 Page 6
`
`

`

`39756S4
`
`•
`
`the
`
`of
`
`by
`
`be
`
`and
`
`in
`
`transmitter.
`fragments
`of
`Transmission
`typically
`packet
`is
`lower-priority
`completed
`Priority
`packet
`has been
`sent.
`high-priority
`receiver
`headers
`enables
`the
`in
`the
`fragment
`the
`packets
`so as
`to
`reassemble
`interruptions,
`even when
`the
`fragments
`are
`not
`lost
`fragments
`the original
`packet
`sequence.
`in
`the order
`invention
`embodiments
`of
`the
`present
`Preferred
`transmission
`advantageous
`in
`multi
`link
`particularly
`enables
`the
`Use
`of
`present
`invention
`settings.
`transmitted
`such
`services,
`as voice,
`to be
`delay-sensitive
`delay
`over multilink
`channels
`that
`are
`also
`with minimal
`used
`to
`provide
`high-volume,
`delay-insensitive
`services,
`such
`as Web browsing
`and electronic
`mail.
`As noted
`above,
`the
`PPP Multilink
`protocol,
`like
`other
`datagram
`fragmentation
`methods
`known
`the
`requires
`that
`in
`art,
`fragments
`transmitted
`in
`packet
`Under
`such
`order.
`conventional
`methods,
`once
`the
`has
`begun
`transmitter
`sending
`fragments
`of
`a given
`packet,
`stop
`until
`it
`cannot
`the
`entire
`packet
`has been
`sent.
`Thus,
`the
`only way
`that
`a
`high-priority
`packet
`can
`be
`assured
`immediate
`is
`transmission
`discarding
`any
`low-priority
`packets
`whose
`transmission
`is
`in
`progress.
`The multi-priority
`approach
`of
`the
`present
`invention,
`however,
`allows
`transmitter
`to
`stop
`sending
`the
`low-priority
`packet
`middle,
`then
`to
`complete
`the
`transmission
`high-priority
`requirements
`have been
`serviced.
`is
`responsiveness
`to high-priority
`requirements
`important
`the
`presence
`of
`low-speed
`channels
`low-priority
`packets.
`In
`some
`pref erred
`invention,
`three
`or more
`
`the
`of
`the
`after
`information
`to
`identify
`and detect
`transmitted
`
`are
`
`the
`the
`in
`after
`added
`This
`especially
`and
`long,
`
`embodiments
`priority
`
`of
`levels
`
`the
`are
`
`present
`defined.
`
`5
`
`EX 1002 Page 7
`
`

`

`••
`
`39756S4
`
`•
`
`level
`packet
`
`can be
`a given
`at
`fragments
`of packet
`at
`any
`by another
`above,
`as described
`also
`are
`interruptions
`packet
`"Nested"
`by
`interrupted
`packet
`is
`a
`low-priority
`by
`interrupted
`is
`in
`turn
`packet,
`which
`the
`all
`of
`packet,
`following
`which
`completed.
`are
`of
`any number
`Substantially
`priorities
`can
`be
`supported
`without
`ability
`the
`receiver
`to
`reassemble
`all
`
`the
`
`of
`
`Transmission
`interrupted,
`higher
`level.
`supported,
`whereby
`a medium-priority
`a
`high-priority
`transmissions
`such
`nested
`compromising
`of
`the packets.
`therefore
`There
`is
`preferred
`embodiment
`for
`transmitting
`data
`receiving
`first
`priority;
`second
`receiving
`higher
`second
`priority,
`of
`the
`the
`transmission
`the
`first
`dividing
`including
`a first
`fragments,
`the
`transmitting
`fragments
`channel,
`beginning
`with
`the
`and
`a
`least
`at
`transmitting
`before
`channel
`the
`datagram
`over
`datagram.
`first
`fragment
`of
`the
`embodiment,
`In
`a preferred
`datagrams
`includes
`receiving
`and
`transmitting
`the
`fragments
`for
`the
`parallel
`physical
`of
`of parallel
`physical
`links
`
`first
`
`the
`
`second
`packets,
`distributing
`plurality
`plurality
`
`a
`
`a
`
`provided,
`the
`present
`of
`a channel,
`over
`datagram
`
`in
`
`for
`
`accordance
`invention,
`including:
`transmission
`
`a
`with
`a method
`
`at
`
`a
`
`for
`datagram
`first
`than
`the
`first
`datagram
`datagram
`fragment
`of
`the
`first
`
`a
`
`at
`before
`
`of
`
`transmission
`priority,
`completed;
`is
`a
`plurality
`into
`and a
`last
`fragment;
`first
`datagram
`over
`fragment;
`
`of
`fragment
`transmitting
`
`the
`
`second
`last
`
`the
`
`receiving
`Internet
`fragments
`transmission
`links,
`are
`
`and
`first
`the
`(IP)
`Protocol
`includes
`over
`wherein
`arranged
`so as
`
`a
`the
`to
`
`6
`
`EX 1002 Page 8
`
`

`

`•
`
`39756S4
`
`•
`
`of
`
`on
`
`of
`
`the
`Preferably,
`channel.
`logical
`single
`a
`constitute
`received
`second
`datagrams
`are
`and
`the
`first
`of
`fragments
`plurality
`connected
`to
`the
`receiver
`at
`a
`and
`reassembled
`Further
`preferably,
`links.
`physical
`of
`parallel
`an
`adding
`indication
`includes
`the
`fragments
`transmitting
`the
`the
`fragments
`of
`of
`to
`the
`fragments
`that
`transmission
`the
`transmission
`of
`by
`first
`datagram
`was
`interrupted
`the
`datagrams
`includes
`second
`datagram,
`and
`reassembling
`to
`the
`indication.
`reassembling
`the
`.packets
`responsive
`datagrams
`includes
`Most
`preferably,
`reassembling
`the
`detecting
`loss
`a
`fragment
`of one of
`the
`datagrams
`one of
`links,
`and discarding
`other
`fragments
`received
`the
`at
`the
`receiver
`responsive
`to
`indication.
`the
`the
`fragment
`Typically,
`transmitting
`least
`the
`at
`into
`datagram
`includes
`the
`second
`datagram
`dividing
`second
`fragments
`for
`transmission
`over
`the
`channel.
`multiple
`transmitting
`at
`least
`fragment
`of
`the
`Preferably,
`the
`second
`datagram
`includes
`interrupting
`transmission
`of
`the
`fragments
`of
`the
`first
`datagram
`until
`all
`fragments
`of
`the
`second
`datagram
`have
`been
`transmitted
`over
`the
`channel.
`Alternatively,
`transmitting
`at
`least
`the
`fragment
`of
`the
`second
`datagram
`includes
`interspersing
`transmission
`of
`the
`fragments
`of
`the
`first
`datagram
`with
`one or more
`fragments
`of
`the
`second
`datagram,
`subject
`to
`the
`first
`and
`second
`priorities.
`In a preferred
`second
`diagram
`the
`method
`includes
`the
`transmission
`at
`a
`third
`priority,
`before
`the
`last
`has been
`transmitted,
`and
`of
`the
`third
`datagram
`over
`
`embodiment,
`include
`first
`receiving
`priority,
`fragment
`transmitting
`the
`channel
`
`of
`fragments
`the multiple
`and
`fragments,
`and
`last
`for
`datagram
`a
`third
`second
`than
`the
`higher
`second
`datagram
`of
`the
`least
`a fragment
`at
`before
`transmitting
`
`7
`
`EX 1002 Page 9
`
`

`

`39756S4
`
`second
`one
`the
`
`datagram.
`fragment
`at
`least
`transmitting
`
`first
`of
`
`Preferably,
`of
`the
`third
`one
`fragment
`the
`last
`
`of
`fragment
`last
`the
`the
`at
`the
`transmitting
`least
`transmitting
`includes
`datagram
`datagram
`before
`third
`of
`the
`first
`datagram.
`of
`the
`fragment
`fragment
`the
`least
`at
`transmitting
`Preferably,
`number
`of
`a
`of
`includes
`interrupting
`transmission
`in order
`datagram,
`datagrams,
`including
`least
`the
`at
`datagram,
`the
`second
`to
`transmit
`at
`least
`fragment
`the
`the
`number
`indicating
`and
`adding
`a
`field
`fragment
`to
`the
`interrupted.
`has
`been
`of
`datagrams
`whose
`transmission
`the
`receiving
`includes
`Further
`preferably,
`the method
`at
`a receiver
`datagrams
`fragments
`of
`the
`and
`second
`first
`the
`datagrams
`connected
`to
`the
`channel,
`and
`reassembling
`indicating
`the
`from
`the
`fragments
`responsive
`to
`the
`field
`the
`datagrams
`number.
`Most
`preferably,
`reassembling
`a given
`value
`includes
`detecting
`loss
`of a fragment
`having
`of
`the number
`indicated
`by
`the
`field,
`and discarding
`other
`fragments
`received
`at
`the
`receiver
`with
`the
`given
`value
`of
`the number
`indicated
`by
`the
`field.
`into
`datagram
`first
`Preferably,
`dividing
`the
`deciding
`on division
`plurality
`of
`fragments
`including
`plurality
`of
`fragments
`the
`first
`datagram
`into
`the
`datagram.
`re~eiving
`the
`second
`responsive
`to
`in
`accordance
`There
`is
`also
`provided,
`present
`invention,
`preferred
`embodiment
`of
`the
`for
`transmitting
`data
`over
`a channel,
`including:
`second
`and
`a
`transmitter,
`coupled
`to
`receive
`first
`respective
`at
`datagrams
`for
`transmission
`over
`the
`channel
`priority
`second
`first
`and
`second
`priorities,
`wherein
`the
`the
`transmitter
`is
`higher
`than
`the
`first
`priority,
`and
`receives
`the
`second
`packet
`before
`transmission
`of
`
`the
`of
`
`with
`apparatus
`
`a
`
`the
`
`the
`
`8
`
`EX 1002 Page 10
`
`

`

`•
`
`39756S4
`
`•
`
`is completed,
`a plurality
`a
`last
`the
`first
`the
`first
`of
`the
`the
`
`the
`a
`
`first
`to divide
`and adapted
`first
`including
`of
`fragments,
`the
`to
`transmit
`fragment,
`and
`over
`the
`channel,
`datagram
`at
`and
`transmit
`fragment,
`second
`datagram
`the
`channel
`last
`fragment
`the
`first
`
`to
`over
`of
`
`the
`receive
`to
`reassemble
`and
`to
`second
`first
`and
`will
`be more
`description
`together
`
`the
`of
`fragments
`fragments
`the
`datagrams.
`fully
`understood
`of
`the
`preferred
`the
`drawings
`
`in
`
`with
`
`packet
`first
`datagram
`into
`fragment
`and
`fragments
`of
`beginning
`with
`least
`a
`fragment
`before
`transmitting
`datagram;
`and
`a
`receiver,
`the
`datagrams
`over
`so as
`to
`reconstruct
`The present
`the
`following
`from
`embodiments
`thereof,
`which:
`
`adapted
`channel
`the
`invention
`detailed
`taken
`
`9
`
`EX 1002 Page 11
`
`

`

`••
`
`39756S4
`
`•
`
`BRIEF DESCRIPTION OF THE DRAWINGS
`1
`is
`a
`block
`diagram
`that
`schematically
`Fig.
`a system
`for multilink
`data
`communications,
`illustrates
`the
`art;
`is known
`Fig.
`diagram
`block
`a
`is
`2
`for multilink
`data
`a system
`illustrates
`with
`a preferred
`embodiment
`accordance
`and
`invention;
`chart
`3 is a flow
`Fig.
`for
`reassembling
`a method
`communication
`channel,
`embodiment
`the present
`
`in
`
`of
`
`schematically
`that
`communications,
`of
`the
`present
`
`schematically
`that
`fragments
`packet
`in
`accordance
`invention.
`
`illustrates
`received
`over
`with
`a preferred
`
`as
`
`in
`
`a
`
`10
`
`EX 1002 Page 12
`
`

`

`39756S4
`
`..
`= :;:.
`
`of
`to
`58
`to
`
`DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS
`Reference
`is
`now made
`to
`Fig.
`2, which
`is
`a block
`diagram
`that
`schematically
`illustrates
`a
`system
`50
`for
`data
`transmission
`over multilink
`channel
`24,
`in accordance
`with
`a preferred
`embodiment
`the
`present
`invention.
`54.
`System
`50 comprises
`a
`transmitter
`52 and
`a
`receiver
`The
`transmitter
`comprises
`a packet
`source
`56 and a dynamic
`fragmenter
`with
`priority
`handling
`capability.
`58
`packets
`for
`Fragmenter
`58 divides
`input
`into
`fragments
`substantially
`the
`transmission,
`in
`a manner
`similar
`in
`40,
`shown
`In
`1.
`operation
`fragmenter
`Fig.
`transmitter
`however,
`of
`distinction
`the
`operation
`22,
`"on
`fragmenter
`is
`able
`to determine
`fly" whether
`It
`and
`how
`fragment
`a
`given
`packet.
`uses
`this
`of
`capability
`arrange
`the
`order
`of
`transmission
`the
`to
`fragments
`according
`to
`the priority
`levels
`of
`the packets,
`as
`described
`hereinbelow.
`Receiver
`54
`comprises
`and
`interruption
`handler
`60
`a
`reassembler
`62,
`their
`the
`restore
`fragments
`to
`proper
`order
`and
`the
`transmitted
`packets
`from
`the
`fragments.
`in
`shown
`are
`The particular
`functional
`blocks
`that
`54 are
`receiver
`2 as elements
`of
`transmitter
`52 and
`Fig.
`of
`conceptual
`selected
`for
`inclusion
`here
`for
`the
`sake
`part
`of
`the
`clarity.
`They
`represent
`only
`a
`small
`receiver
`in
`a
`functionality
`of
`such
`transmitter
`and
`actuality.
`The
`integration
`of
`these
`fragmentation
`and
`reassembly
`functions
`in
`actual
`transmitters
`and
`receivers
`the
`will
`be apparent
`to persons
`skill
`in
`art.
`By
`the
`of
`same
`token,
`such
`persons
`will
`appreciate
`the
`functions
`of
`fragmenter
`58 may be carried
`out
`by
`a CPU or other
`processor
`in
`the
`transmitter.
`the
`functions
`of
`interruption
`handler
`60 and
`
`that
`together
`Similarly,
`reassembler
`
`to
`
`the
`
`an
`which
`rebuild
`
`of
`
`11
`
`EX 1002 Page 13
`
`

`

`•
`
`39756S4
`
`•
`
`the
`in
`perform
`
`processor
`by a CPU or other
`out
`62 may be carried
`typically
`CPUs
`or
`processors
`receiver.
`These
`in
`the
`art.
`as well,
`as are
`known
`other
`functions,
`of
`packets
`58
`generates
`fragments
`Fragmenter
`different
`transmission
`priority
`levels.
`For
`example,
`priority,
`high
`packet
`may be
`a voice
`packet
`with
`mail
`another
`may be
`a portion
`of
`an
`electronic
`message
`with
`low priority.
`handler
`If
`the
`priority
`packet
`to
`receive
`fragments
`a
`high-priority
`transmitting
`fragmenter
`58 while
`the
`midst
`of
`low-priority
`interrupts
`packet,
`preferably
`it
`in
`transmission
`of
`the
`low-priority
`fragments
`enable
`send
`the
`high-priority
`ones.
`In order
`to
`to
`54
`reassemble
`fragments
`in
`the
`proper
`the
`detect
`any
`lost
`fragments,
`the
`fragmenter
`adds
`each
`fragment
`containing
`the
`following
`fields:
`
`of
`in
`
`with
`one
`while
`(e-mail)
`begins
`from
`a
`the
`to
`
`order
`receiver
`order
`and
`a header
`to
`
`•
`
`Sequence
`MP header
`• Offset
`fragment
`fragment
`specified
`needed)
`
`.
`
`number
`specified
`
`(SN)
`by
`
`index,
`- A running
`the PPP Multilink
`
`in
`as
`Protocol.
`
`the
`
`The
`( 0)
`within
`a given
`packet,
`in
`the
`by
`the Multi
`
`sequential
`packet.
`is
`
`0
`link
`
`number
`the
`For
`(and
`is
`
`zero
`Protocol
`
`each
`of
`beginning
`the
`B bit
`thus
`not
`
`(E)
`• Ending
`each
`packet,
`
`-
`as
`
`to E=l
`Set
`specified
`
`last
`the
`for
`by
`the Multilink
`
`fragment
`Protocol.
`
`in
`
`•
`
`Interruption
`lower-priority
`has
`interrupted.
`is
`given
`by
`supported
`by
`given
`packet
`
`level
`packets
`The
`number
`the
`fragmenter
`must
`have
`
`number
`
`The
`(I)
`a higher-priority
`that
`this
`of
`values
`of
`range
`of different
`priority
`58.
`All
`fragments
`same
`interruption
`
`the
`
`of
`packet
`field
`levels
`of
`level.
`
`a
`
`12
`
`EX 1002 Page 14
`
`

`

`39756S4
`
`•
`
`of
`
`a
`
`F,
`
`of
`sequence
`an
`presents
`I below
`Table
`the meaning
`50,
`in
`system
`transmitted
`packets
`The
`sequence
`fragment
`header
`of
`the
`and
`use
`having
`through
`packets,
`labeled
`of
`six
`consists
`priority
`levels.
`(arbitrary)
`different
`A, B, C
`Packets
`each
`divided
`and
`F are
`Packet
`D
`is
`intq
`two
`fragments.
`sent
`as
`a
`Eis
`three
`fragments,
`while
`packet
`divided
`into
`transmission
`of
`single
`fragment.
`As
`seen
`below,
`the
`then
`packet
`C;
`packet
`A
`is
`interrupted
`by packet
`B and
`D
`packet
`C
`is
`interrupted
`by
`packet
`D;
`and
`packet
`is
`nesting
`interrupted
`by
`packet
`giving
`three
`different
`levels.
`since
`both
`Packet
`C does
`interrupt
`packet
`B,
`the
`have
`same
`priority.
`Packet
`F
`arrives
`after
`transmission
`of packet
`A is
`finished.
`
`example
`illustrating
`fields.
`A
`
`E,
`not
`
`TABLE I
`
`Packet
`
`Priority
`
`SN
`
`Offset
`
`Ending
`
`A
`
`B
`
`B
`
`C
`
`D
`
`D
`
`E
`
`D
`
`C
`
`A
`
`F
`
`F
`
`0
`
`I
`I
`I
`IV
`IV
`VII
`IV
`I
`
`0
`VI
`VI
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`l
`
`1
`
`1
`
`1
`
`0
`
`1
`
`0
`
`1
`
`2
`
`3
`
`4
`
`5
`
`6
`
`7
`
`8
`
`9
`
`10
`
`11
`
`0
`
`0
`
`1
`
`0
`
`0
`
`l
`
`0
`
`2
`
`l
`
`1
`
`0
`
`l
`
`13
`
`Int.
`
`level
`
`0
`
`1
`
`l
`
`l
`
`2
`
`2
`
`3
`
`2
`
`1
`
`0
`
`0
`
`0
`
`EX 1002 Page 15
`
`

`

`•
`
`39756S4
`
`•
`
`a
`
`only
`
`the
`of
`embodiment
`simple
`relatively
`In
`interrupted
`packet
`is
`low-priority
`when a
`invention,
`of
`further
`fragments
`packet,
`no
`higher-priority
`packet
`are
`transmitted
`until
`transmission
`low-priority
`the
`higher-priority
`packet
`is
`completed.
`On
`the
`hand,
`in
`a more
`flexible
`embodiment,
`fragmenter
`continue
`transmitting
`fragments
`of
`the
`low-priority
`if
`there
`is
`time
`available
`while waiting
`for packet
`56
`to
`supply
`the
`remainder
`of
`the
`higher-priority
`In
`this
`latter
`embodiment,
`referring
`to
`the
`packets
`A and Bin
`the
`table
`above,
`it might
`to
`transmit
`fragment
`A ( 1)
`( the
`second
`fragment
`a
`A) before
`fragment
`B ( 1)
`if
`there
`is
`sufficient
`time
`between
`fragments
`B ( 0)
`and B ( 1) .
`In
`the
`embodiment,
`however,
`the
`fragment
`order
`given
`table
`is possible.
`illustrates
`schematically
`that
`chart
`a flow
`Fig.
`3 is
`out
`reassembly,
`carried
`packet
`a method
`for
`accordance
`interruption
`handler
`60 and
`reassembler
`62,
`in
`invention.
`with
`a preferred
`embodiment
`of
`the
`present
`54
`receives
`Each
`cycle
`of
`the method
`begins
`when
`receiver
`70.
`The
`step
`a new
`fragment,
`at
`a
`fragment
`reception
`fragments
`is
`minimum value, M, of
`the
`SN of
`the
`received
`step
`71,
`in
`-updated
`as
`appropriate,
`at
`an
`update
`for
`the PPP
`substantially
`the
`same manner
`as
`is
`called
`Multilink
`Protocol,
`and
`which
`is
`described
`in
`the
`Background
`of
`the
`Invention.
`The
`interruption
`handler
`whether
`receiver
`54 has
`received
`have
`not
`yet
`been
`reassembled
`step
`72.
`If
`so,
`the
`interruption
`all
`of
`these
`unreassembled
`ending
`
`present
`by a
`the
`of
`other
`58 may
`packet
`source
`packet.
`example
`be possible
`of packet
`gap
`in
`simpler
`in
`the
`
`of
`
`by
`
`by
`
`checks
`then
`any ending
`into
`a packet,
`handler
`fragments
`
`determine
`to
`fragments
`that
`at
`an ending
`cycles
`through
`in
`turn.
`For
`
`14
`
`0
`
`EX 1002 Page 16
`
`

`

`39756S4
`
`••
`
`of
`
`its
`
`(Ii)
`
`number
`sequence
`detected,
`fragments
`ending
`the
`each
`recorded
`{Oi) are
`and offset
`level
`interruption
`(SNd,
`an
`end
`processing
`values,
`at
`fragment
`as
`current
`ending
`other,
`non-ending
`fragments
`in processing
`step
`74,
`use
`for
`that
`have
`been
`received,
`as described
`below.
`The current
`of SNE for
`each
`these
`ending
`fragments
`is
`checked
`of
`value
`against
`the
`current
`value
`of M,
`at
`a
`fragment
`loss
`the
`current
`detection
`step
`76.
`If M is
`less
`than
`SNE,
`whether
`ending
`fragment
`is
`checked
`to determine
`it
`is
`the
`fragment
`most
`recently
`received
`by
`receiver
`74,
`at
`a new
`fragment
`detection
`step
`77.
`If
`so,
`normal
`packet
`reassembly
`continues,
`at
`a normal
`beginning
`fragment
`check
`step
`78.
`Otherwise,
`if
`the
`current
`ending
`fragment
`is not
`the most
`recently
`received
`fragment,
`the
`process
`continues
`72
`at
`to
`cycle
`through
`any
`other
`ending
`fragments
`step
`until
`it
`is
`done.
`After
`all
`of
`the
`unreassembled
`ending
`fragments
`have
`been
`checked,
`the
`process
`returns
`to
`receive
`next
`fragment
`at
`70.
`step
`the
`the
`checks
`60 next
`At
`78,
`interruption
`handler
`step
`yet
`not
`fragments
`that
`have
`been
`received
`but
`other
`current
`for
`reassembled
`into
`packets
`to
`determine,
`the
`has
`been
`fragment
`ending
`fragment,
`whether
`a beginning
`as
`the
`I 1 ,
`level,
`received
`with
`same
`interruption
`the
`that
`is
`SN8
`number
`ending
`fragment
`and with
`a
`sequence
`If
`no
`such
`beginning
`SNE of
`the
`ending
`packet.
`less
`than
`handler
`concludes
`that
`fragment
`is
`found,
`the
`interruption
`ending
`fragment
`has
`current
`the beginning
`fragment
`for
`the
`step
`72
`to
`check
`any
`not
`yet
`been
`received
`and
`returns
`to
`appropriate
`beginning
`further
`ending
`fragments.
`If
`an
`fragment
`has
`been
`received,
`however,
`the
`interruption
`handler
`then
`checks
`the
`number
`fragments
`that
`have
`been
`in
`the
`interruption
`level
`I 1
`
`of
`received
`
`with
`range
`
`15
`
`EX 1002 Page 17
`
`

`

`•
`
`39756S4
`
`•
`
`step
`checking
`packet
`a complete
`SNs and SNE, at
`between
`8 O. When
`the
`receiver,
`reached
`packet
`has
`the
`complete
`is
`wherein
`0 1
`0 1+1 such
`fragments,
`there
`should
`be exactly
`as noted
`above.
`ending
`fragment,
`the offset
`the
`current
`of
`the
`expected
`fragments
`have
`been
`Again,
`if
`all
`of
`not
`received,
`the process
`returns
`to
`step
`72.
`Otherwise,
`once
`the
`all
`of
`01+1 packets
`have
`arrived,
`they
`are
`passed
`to
`reassembler
`62
`for
`rebuilding
`of
`the
`packet,
`at
`a
`82 ..
`reassembly
`step
`On
`the
`other
`
`hand,
`
`when
`
`the
`
`interruption
`
`handler
`
`that M ~ SNE,
`76
`step
`finds
`it may be necessary
`embodiment"
`described
`In
`the
`"simple
`fragments.
`discard
`any higher
`interruption
`fragments
`at
`all
`(in which
`above
`transmission
`at
`a
`lower
`level must
`be
`transmitted
`before
`interruption
`level
`continue),
`any
`outstanding
`can
`I>
`fragments
`for which
`I 1 and SN<
`SNE are
`discarded,
`level
`an optional
`higher
`discard
`step
`83.
`These
`fragments
`are
`discarded
`because
`this
`embodiment,
`whenever
`it
`
`at
`
`in
`
`to
`
`at
`
`is
`
`it
`I 1 ,
`level
`interruption
`a given
`that M ~ SNE for
`found
`from
`been
`lost
`have
`also
`fragments
`necessarily
`means
`that
`before
`were
`transrni
`tted
`any higher-priority
`packets
`that
`been
`have
`not
`yet
`the
`current
`packet
`and
`ending
`in
`the
`"flexible
`reassembled.
`other
`hand,
`the
`On
`may
`alternate
`in
`embodiment,"
`the
`transmitter
`which
`and
`lower
`higher
`sending
`between
`fragments
`with
`of
`fragments
`discard
`levels,
`interruption
`this
`additional
`out.
`carried
`interruption
`with
`higher
`levels
`is not
`determines
`handler
`at
`step
`84,
`Next,
`the
`interruption
`belonging
`received
`whether
`a beginning
`fragment
`has
`been
`to
`the
`same packet
`as
`the
`current
`ending
`fragment.
`other words,
`the
`interruption
`handler
`determines
`whether
`beginning
`packet
`has been
`received
`with
`interruption
`level
`
`In
`a
`
`16
`
`EX 1002 Page 18
`
`

`

`•
`
`39756S4
`
`•
`
`is
`then
`
`less
`all
`level
`
`SNe:.
`than
`fragments
`are
`I 1
`
`of
`to
`
`beginning
`criteria
`checks
`the
`largest
`selection
`is
`thus
`ending
`packet.
`sequence
`at
`level
`therefore
`
`that
`SN8
`number
`a sequence
`I1 and with
`is
`found,
`fragment
`If no such beginning
`interruption
`that
`have
`been
`received
`with
`step
`86.
`discarded,
`at a packet
`discard
`or more
`two
`It
`may
`also
`occur
`that
`satisfy
`the
`fragments
`have been
`received
`that
`step
`84.
`In
`this
`case,
`the
`interruption
`handler
`determine
`which
`the beginning
`fragments
`has
`of
`at
`a beginning
`fragment
`sequence
`number
`SN8 ,
`SN
`step
`88.
`This
`beginning
`fragment,
`whose
`closest
`the
`sequence
`number
`SNe: of
`the
`current
`fragment,
`is
`chosen
`for
`use
`in
`reassembly
`of
`the
`Any
`fragments
`having
`interruption
`l.evel
`· I 1
`and
`number SN that
`is
`less
`than
`the
`largest
`SN8
`found
`belong
`I 1 cannot
`to
`the
`current
`packet,
`and are
`discarded,
`at an excess
`fragment
`discard
`step
`90.
`been
`has
`After
`the
`appropriate
`beginning
`packet
`number
`the
`the
`interruption
`handler
`finally
`checks
`found,
`been
`have
`that
`