A routing solution for a global, space-based multimedia system

This paper focuses on the Teledesic satellite constellation, which is an attempt to provide high speed, multimedia networking connectivity to any location on the globe. Since the routers (satellites) are in constant motion, this venture is unique and leads to a one-of-a-kind data routing scheme. This concept is still in the design phase, with implementation still a few years away. However, several large companies and capital investors have already committed funds to this venture. Supporters are claiming a full operational capability in roughly 3 years. Our focus in this paper is to develop a routing algorithm for the Teledesic satellite constellation. The algorithm is conceptually developed and implemented using a software simulation. Our results, which indicate this algorithm is a viable solution to the routing problem, and our implementation details are presented below