← Back to Patent Explorer
US5631907A Expired / Lapsed US ⏱️ 0.0 years remaining

Reliable broadcast protocol structure for electronic software distribution

Assignee: Nokia of America Corp
•
Filing: 1995-12-13
•
Granted: 1997-05-20
•
Expires: 2015-12-13
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract According to this invention, the system prepares user data into blocks of manageable size prior to software distribution. A block is similar in principle to memory pages in a file management system and has a predefined size, sequential ordering, and layout from which the original information can be reconstructed. The broadcast protocol is enhanced to include a block identifier to identify where the receiver performs error detection and error correction on each block. Station receiving the data maintains a list of the identity of those blocks of data that it believes have not been received properly. With each retransmission, each work station attempts to receive and recover those blocks marked on its list. Advantageously, each transmitted block is encoded using forward error correction in order to further enhance the probability of proper reception of the data. Thus, a very high-speed broadcast system of data/software updates can be sent to many switching offices simultaneously with a guarantee of high accuracy of reception.

Inventors

  • 👤 Paul J. Guarneri
  • 👤 Thomas J. Killian
  • 👤 Venkata C. Majeti
  • 👤 Norman L. Schryer

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 17:52
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/55; H04L49/557; G; G06; G06F; G06F8/00; G06F8/60; G06F8/61; H04L12/00; H04L12/02; H04L12/16; H04L12/18; H04L12/1836; H04L49/10; H04L49/104; H04L49/105; H04L49/20; H04L49/201; H04L49/30; H04L49/3081; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L12/1863; H04L12/1877; H04L12/1881; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5603; H04L2012/5604; H04L2012/5608; H04L2012/5619; H04L2012/5638; H04L2012/564; H04L2012/5642

Claims Analysis

Total Claims: 22
Claim 1
Independent Claim 137 words
A method for packaging data for reliably transporting it from one system to another, said method comprising the steps of: sequentially transforming a source file into a plurality of blocks, said blocks being sequentially stored in a first matrix; creating a second matrix from said first matrix by appending a further matrix of blocks containing organizational information regarding said first matrix said second matrix comprising a plurality of rows of blocks and a plurality of columns of blocks; sequentially transporting each block in said second matrix by transporting one column of data from said column of blocks at a time; reassembling said transported columns of data into blocks to reform into said second matrix; and transforming said second matrix into said first matrix, and said blocks in said first matrix into a copy of said source file.
Claim 2
Independent Claim 137 words
A method for packaging data for reliably transporting it from one system to another, said method comprising the steps of: sequentially transforming a source file into a plurality of blocks, said blocks being sequentially stored in a first matrix; creating a second matrix from said first matrix by appending a further matrix of blocks containing organizational information regarding said first matrix said second matrix comprising a plurality of rows of blocks and a plurality of columns of blocks; sequentially transporting each block in said second matrix by transporting one column of data from said column of blocks at a time; reassembling said transported columns of data into blocks to reform into said second matrix; and transforming said second matrix into said first matrix, and said blocks in said first matrix into a copy of said source file.
Claim 3
Dependent Claim 65 words
A method in accordance with claim 1 wherein a third matrix is formed using forward error correction data appended to said second matrix, in rows of columns of blocks to couple with said rows and columns of blocks in said second matrix and used in said step of transforming said second matrix into said first matrix to correct errors introduced in said step of transporting.
Claim 4
Dependent Claim 19 words
A method in accordance with claim 1 wherein said data comprises operational code to be transported to multiple locations.
Claim 5
Dependent Claim 21 words
A method in accordance with claim 1 wherein said data comprises operational code to be transported across an asynchronous transport network.
Claim 6
Dependent Claim 15 words
A method in accordance with claim 1 wherein said blocks comprise asynchronous transport network cells.
Claim 7
Dependent Claim 17 words
A method in accordance with claim 1 wherein said first matrix comprises 235 columns and 40 rows.
Claim 8
Dependent Claim 17 words
A method in accordance with claim 1 wherein said second matrix comprises 235 columns and 48 rows.
Claim 9
Dependent Claim 17 words
A method in accordance with claim 2 wherein said third matrix comprises 235 columns and 48 rows.
Claim 10
Independent Claim 144 words
A system for packaging data for reliably transporting it from one system to another, said system comprising: means for receiving a source file and sequentially transforming said source file into a plurality of blocks, said blocks being stored in a first matrix having a predetermined number of rows and columns; means for appending a matrix of blocks containing organizational and destinational information to said first matrix to create a second matrix having said predetermined number of columns and a second predetermined number of rows; means for packing a transport medium by sequentially back one column of said blocks into said transport medium; means for transporting said data; means for reassembling said transported data into said second matrix; means for transforming said second matrix into said first matrix; and means for transforming said blocks in said first matrix into a copy of said source file.
Claim 11
Independent Claim 144 words
A system for packaging data for reliably transporting it from one system to another, said system comprising: means for receiving a source file and sequentially transforming said source file into a plurality of blocks, said blocks being stored in a first matrix having a predetermined number of rows and columns; means for appending a matrix of blocks containing organizational and destinational information to said first matrix to create a second matrix having said predetermined number of columns and a second predetermined number of rows; means for packing a transport medium by sequentially back one column of said blocks into said transport medium; means for transporting said data; means for reassembling said transported data into said second matrix; means for transforming said second matrix into said first matrix; and means for transforming said blocks in said first matrix into a copy of said source file.
Claim 12
Dependent Claim 26 words
A system in accordance with claim 9 further including means for forming a third matrix is formed using error correction data appended to said second matrix.
Claim 13
Dependent Claim 16 words
A system in accordance with claim 10 wherein said error correction data comprising forward error correction.
Claim 14
Dependent Claim 16 words
A system in accordance with claim 9 wherein said organizational and destinational information included files numbers.
Claim 15
Dependent Claim 17 words
A system in accordance with claim 9 wherein said organizational and destinational information includes software package identification.
Claim 16
Dependent Claim 16 words
A system in accordance with claim 9 wherein said organizational and destinational information includes sequence numbers.
Claim 17
Dependent Claim 18 words
A system in accordance with claim 9 wherein said organizational and destinational information includes transport cell identification information.
Claim 18
Dependent Claim 19 words
A system in accordance with claim 9 wherein said organizational and destinational information includes methods for encryption and decryption.
Claim 19
Dependent Claim 20 words
A system in accordance with claim 9 wherein said organizational and destinational information includes information regarding decompression of said data.
Claim 20
Dependent Claim 23 words
A system in accordance with claim 9 wherein said organizational and destinational information includes a broadcast addressing scheme to activate present receiving stations.
Claim 21
Dependent Claim 18 words
A system in accordance with claim 9 wherein said means for transporting said data comprises a satellite system.
Claim 22
Dependent Claim 19 words
A system in accordance with claim 9 wherein said means for transporting said data comprises an asynchronous transport network.

References Cited (Backward Citations)

US5153578A Cited
US5394397A Cited
US5390184A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-05-19 2000-11-18 2001-05-20 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-05-19 2004-11-18 2005-05-20 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-05-19 2008-11-18 2009-05-20 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag