Work Files Saved Searches
   My Account                                                  Search:   Quick/Number   Boolean   Advanced   Derwent    Help   


 The Delphion Integrated View

  Buy Now:   Buy PDF- 127pp  PDF  |   File History  |   Other choices   
  Tools:  Citation Link  |  Add to Work File:    
  View:  Expand Details   |  INPADOC   |  Jump to: 
  Go to:  Derwent  
 Email this to a friend  Email this to a friend 
       
Title: US5740164: Traffic routing for satellite communication system
[ Derwent Title ]


Country: US United States of America

View Images High
Resolution

 Low
 Resolution

 
127 pages

 
Inventor: Liron, Moshe Lerner; Palo Alto, CA

Assignee: Teledesic Corporation, Kirkland, WA
other patents from TELEDESIC CORPORATION (710519) (approx. 10)
 News, Profiles, Stocks and More about this company

Published / Filed: 1998-04-14 / 1995-06-07

Application Number: US1995000481573

IPC Code: Advanced: H01Q 1/24; H01Q 1/28; H01Q 3/24; H01Q 3/26; H01Q 5/00; H01Q 15/02; H01Q 21/06; H04B 7/185;
Core: H01Q 1/27; H01Q 15/00; more...
IPC-7: H04L 12/56;

ECLA Code: H01Q1/24A1; H01Q1/24A1A1; H01Q1/28F; H01Q3/24; H01Q3/24B; H01Q3/26C; H01Q5/00C; H01Q15/02; H01Q21/06B3; H04B7/185S8; H04B7/185S12;

U.S. Class: Current: 370/316; 370/356; 370/394;
Original: 370/316; 370/356; 370/394;

Field of Search: 370/054,60,60.1,61,16,94.1,94.3,85.13,325,316,351,355,356,389,394,401,254,255 342/351,352 455/12.1,13.1,13.2,17,33.1,33.2,33.3,34.1 379/059,60

Priority Number:
1995-06-07  US1995000481573
1993-02-09  US1993000016204
1994-02-28  US1994000203140

Abstract: Methods and apparatus which route, control and manage traffic throughout a Satellite Communication System operating in low Earth orbit are disclosed. Voice, video and data traffic from terrestrial gateways (G) and from portable (P), mobile (M) or fixed (F) terminals are directed up through the constellation of satellites (S) and back down to destinations on Earth. The satellites provide continuous worldwide communication services while insuring uniform end-to-end transmission delays. The satellite network is highly adaptive to the constantly changing network topology, and will offer a synchronous circuit switched communication service that provides sequential delivery of user data, regardless of the type of the data transmitted. The network employs datagram switching, as opposed to conventional virtual circuit switching techniques. Packets associated with a single phone call do not necessarily travel along the same route, and consequently arrive at their common destinations at different times with a variable transmission delay. Packets (26) received from a portable (P), mobile (M) or fixed (F) terminal, from a satellite (S), or from a stationary gateway (G) are dispatched from an origin node (OUR-- NODE) to a destination node (DEST-- NODE) according to address instructions carried in the packet header (28). At each node, propagation delay vectors OUR-- DELAY-- EST [DEST-- NODE, ] are calculated using local computers. These delay vectors estimate a time delay which the packet (26) encounters in traveling from the origin node (OUR-- NODE) to the destination node (DEST-- NODE). An optimal route (opt-- link) is then selected from the set of calculated delay vectors, and the packet (26) is routed to the destination node (DEST-- NODE) via the pathway (opt-- link) that insures both the lowest end-to-end delay and the best overall traffic management of the network.

Attorney, Agent or Firm: Anglin & Giaccherini ;

Primary / Asst. Examiners: Olms, Douglas W.; Nguyen, Chau T.

INPADOC Legal Status: Show legal status actions          Buy Now: Family Legal Status Report

       
Related Applications: Go to Result Set: 1 patent(s) that list this one as related
Application Number Filed Patent Pub. Date  Title
US1993000016204 1993-02-09       
US1994000203140 1994-02-28       


       
Parent Case:

CROSS-REFERENCES TO RELATED PATENT APPLICATIONS
    The present application is a CIP of Ser. No. 08/016,204, filed Feb. 9, 1993 and now abandoned, and Ser. No. 08/203,140, filed Feb. 28, 1994, abandoned.

Family: Show 24 known family members

First Claim:
Show all 11 claims
What is claimed is:     1. A method of transporting each packet (26) of a message which includes a plurality of packets (26) from an origin node (OUR-NODE) to a destination node (DEST-NODE); said origin node (OUR-NODE) and said destination node (DEST-NODE) being located among a plurality of satellites (S) and among a plurality of stationary gateways (G) on the Earth; said method comprising the steps of:
  • (A.) receiving each said packet (26) at said origin node (OUR-NODE) synchronously transmitted from one of
    • a plurality of portable terminals (P),
    • a plurality of mobile terminals (M),
    • a plurality of fixed terminals (F),
    • said plurality of stationary gateways (G) and
    • said plurality of satellites (S);
      • each of said plurality of satellites (S) having aboard a fast packet switch (22);
  • each one of said plurality of packets (26) including a header (28) containing an address and a payload (30);
  • (B.) calculating a plurality of propagation delay vectors which estimate a time delay which said packet (26) would encounter in traveling from said origin node (OUR-NODE) to said destination node (DEST-NODE) over a plurality of links () using orbit position information about each node; said orbit position information being generated onboard each of said plurality of satellites (S); each of said plurality of satellites (S) traveling in low Earth orbits and constantly moving with respect to the Earth; said vectors using an algorithm in which
    • one of said plurality of propagation delay vectors in one of said plurality of links () between said origin node (OUR-NODE) and said destination node (DEST-NODE) is represented by a variable "OUR-DELAY-EST (DEST-NODE, )",
    • a current propagation time delay in one of said plurality of links () connecting said origin node (OUR-NODE) to a neighboring node (OUR-NEIGHBOR ()) is represented by a variable "LINK-PROP-DELAY ()",
    • a current link time delay for packet queuing, including time to be spent by said packet (26) in a link buffer awaiting transmission (Twait-in-q) and time for transmission (Ttx), is represented by a variable "LINK-Q-DELAY ()";
  • a least time delay for transmission of said packet (26) from a neighboring node (OUR-NEIGHBOR ()) to said destination node (DEST-NODE) determined by said neighboring node calculating a time delay of packet transmission over each link () from said neighboring node (OUR-NEIGHBOR ()) to said destination node (DEST-NODE), is represented by a variable "OUR-NEIGHBOR-DELAY-EST (DEST-NODE, OUR-NEIGHBOR ())";
  • said algorithm having the form
______________________________________
OUR-DELAY-EST (DEST-NODE, ) = LINK-PROP-DELAY () +
LINK-Q-DELAY()+OUR-NEIGHBOR-DELAY-EST(DEST-NODE,
OUR-NEIGHBOR());
______________________________________
  • (C.) selecting one of said plurality of propagation delay vectors (OUR-DELAY-EST (DEST-NODE, ) which constitutes a minimum time delay for forwarding said packet (26) from said origin node (OUR-NODE) to said destination node (DEST-NODE) and designating that selected propagation delay vector as an optimal link (opt-link); said optimal link having at least one next-node-in-path-to-destination;
  • (D.) selecting for said packet (26), at each said next-node-in-path-to-destination of said optimal link (opt-link), one of said plurality of propagation delay vectors (OUR-DELAY-EST (DEST-NODE, ) which constitutes a minimum time delay for forwarding said packet (26) from said next-node-in-path to said destination node (DEST-NODE) and designating that selected propagation delay vector as a next optimal link (opt-link);
  • (E.) routing said packet (26) from said origin node (OUR-NODE) asynchronously through said fast packet switch (22) aboard one of said plurality of satellites (S) to said destination node (DEST-NODE) via said optimal links (opt-link) between said fast packet switch (22) and said destination node (DEST-NODE); said fast packet switch (22) being capable of functioning as a sovereign, autonomous and independent switching node among said plurality of satellites (S) traveling in low Earth orbit;
  • (F.) repeating steps (A.) through (E.) for each one of said plurality of packets (26) until each said packet (26) reaches said destination node (DEST-NODE); and
  • (G.) sorting said plurality of packets (26) in said fast packet switch (22) at said destination node (DEST-NODE) to account for out-of sequence arrival and transmitting said packets (26) in a restored sequence to one of said portable terminals (P), mobile terminals (M) and fixed terminals (F).


Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

Forward References: Show 33 U.S. patent(s) that reference this one

       
U.S. References: Go to Result Set: All U.S. references   |  Forward references (33)   |   Backward references (3)   |   Citation Link

Buy
PDF
Patent  Pub.Date  Inventor Assignee   Title
Buy PDF- 43pp US4905233  1990-02 Cain et al.  Harris Corporation Multiple path routing mechanism for packet communications network
Buy PDF- 8pp US5187805  1993-02 Bertiger et al.  Motorola, Inc. Telemetry, tracking and control for satellite cellular communication systems
Buy PDF- 11pp US5410728  1995-04 Bertiger et al.  Motorola, Inc. Satellite cellular telephone and data communication system
       
Foreign References: None

Other Abstract Info: DERABS G1998-239397 DERABS G1998-250767 DERABS G1998-250767 DERABS G2000-498140

Inquire Regarding Licensing

Powered by Verity


Plaques from Patent Awards      Gallery of Obscure PatentsNominate this for the Gallery...

Thomson Reuters Copyright © 1997-2010 Thomson Reuters 
Subscriptions  |  Web Seminars  |  Privacy  |  Terms & Conditions  |  Site Map  |  Contact Us  |  Help