Efficiency and resiliency enhancements for transition states...

Multiplex communications – Communication over free space

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S329000

Reexamination Certificate

active

07898993

ABSTRACT:
A method includes establishing an ad hoc network between at least a borrower and at least one lender of bandwidth and downloading requested data from a data source via the ad hoc network. The method further includes leaving the ad hoc network while maintaining some of the downloaded requested data. The method further includes reestablishing a connection to the data source for completing the downloading of the requested data.

REFERENCES:
patent: 5490201 (1996-02-01), Moberg et al.
patent: 6006084 (1999-12-01), Miller et al.
patent: 6035281 (2000-03-01), Crosskey et al.
patent: 6047268 (2000-04-01), Bartoli et al.
patent: 6366907 (2002-04-01), Fanning et al.
patent: 6396805 (2002-05-01), Romrell
patent: 6397061 (2002-05-01), Jordan et al.
patent: 6522735 (2003-02-01), Fortman et al.
patent: 6653933 (2003-11-01), Raschke et al.
patent: 6751196 (2004-06-01), Hulyalkar et al.
patent: 6763248 (2004-07-01), Odamura
patent: 6810428 (2004-10-01), Larsen et al.
patent: 6850764 (2005-02-01), Patel
patent: 6941378 (2005-09-01), Apostolopoulos et al.
patent: 6954616 (2005-10-01), Liang et al.
patent: 6954790 (2005-10-01), Forslöw
patent: 6961575 (2005-11-01), Stanforth
patent: 6975613 (2005-12-01), Johansson
patent: 6980511 (2005-12-01), Li
patent: 6990113 (2006-01-01), Wang et al.
patent: 7016375 (2006-03-01), Rosenberg et al.
patent: 7028096 (2006-04-01), Lee
patent: 7043225 (2006-05-01), Patel et al.
patent: 7058014 (2006-06-01), Sim
patent: 7058387 (2006-06-01), Kumar et al.
patent: 7065367 (2006-06-01), Michaelis et al.
patent: 7075890 (2006-07-01), Ozer et al.
patent: 7089301 (2006-08-01), Labio et al.
patent: 7130283 (2006-10-01), Vogel et al.
patent: 7174385 (2007-02-01), Li
patent: 7224964 (2007-05-01), Souissi et al.
patent: 7240015 (2007-07-01), Karmouch et al.
patent: 7257632 (2007-08-01), Zhang et al.
patent: 7274658 (2007-09-01), Bornstein et al.
patent: 7310641 (2007-12-01), Moore et al.
patent: 7340759 (2008-03-01), Rodriguez
patent: 7376747 (2008-05-01), Hartop
patent: 7401153 (2008-07-01), Traversat et al.
patent: 7440573 (2008-10-01), Lor et al.
patent: 7447656 (2008-11-01), Parthasarathy
patent: 7450517 (2008-11-01), Cho
patent: 7450949 (2008-11-01), Choksi
patent: 7460549 (2008-12-01), Cardei et al.
patent: 7463890 (2008-12-01), Herz
patent: 7489656 (2009-02-01), Guo et al.
patent: 7546342 (2009-06-01), Li et al.
patent: 7593333 (2009-09-01), Li et al.
patent: 2001/0029182 (2001-10-01), McCann et al.
patent: 2002/0053033 (2002-05-01), Cooper et al.
patent: 2002/0053082 (2002-05-01), Weaver et al.
patent: 2002/0058499 (2002-05-01), Ortiz
patent: 2002/0069278 (2002-06-01), Forslöw
patent: 2002/0102987 (2002-08-01), Souisse et al.
patent: 2002/0110110 (2002-08-01), Tiihonen et al.
patent: 2002/0120873 (2002-08-01), Salmivalli
patent: 2002/0122410 (2002-09-01), Kulikov et al.
patent: 2002/0141358 (2002-10-01), Requena
patent: 2002/0145978 (2002-10-01), Batsell et al.
patent: 2003/0068975 (2003-04-01), Qiao et al.
patent: 2003/0117978 (2003-06-01), Haddad
patent: 2003/0120594 (2003-06-01), Shaginaw et al.
patent: 2003/0137976 (2003-07-01), Zhu et al.
patent: 2003/0139180 (2003-07-01), McIntosh et al.
patent: 2003/0153338 (2003-08-01), Herz et al.
patent: 2003/0235174 (2003-12-01), Pichna et al.
patent: 2004/0006621 (2004-01-01), Bellinson et al.
patent: 2004/0029553 (2004-02-01), Cain
patent: 2004/0064351 (2004-04-01), Mikurak
patent: 2004/0128231 (2004-07-01), Morita
patent: 2004/0156312 (2004-08-01), Salonidis et al.
patent: 2004/0162871 (2004-08-01), Pabla et al.
patent: 2004/0165548 (2004-08-01), Backes
patent: 2004/0185777 (2004-09-01), Bryson
patent: 2004/0192204 (2004-09-01), Periyalwar et al.
patent: 2004/0260808 (2004-12-01), Strutt
patent: 2004/0264466 (2004-12-01), Huang
patent: 2005/0080872 (2005-04-01), Davis et al.
patent: 2005/0153725 (2005-07-01), Naghian et al.
patent: 2005/0157661 (2005-07-01), Cho
patent: 2005/0169209 (2005-08-01), Miu et al.
patent: 2005/0169257 (2005-08-01), Lahetkangas et al.
patent: 2005/0193221 (2005-09-01), Yoneyama
patent: 2005/0203834 (2005-09-01), Prieston
patent: 2005/0213503 (2005-09-01), Guo et al.
patent: 2006/0002326 (2006-01-01), Vesuna
patent: 2006/0085543 (2006-04-01), Hrastar et al.
patent: 2006/0095582 (2006-05-01), Nitya et al.
patent: 2006/0114853 (2006-06-01), Hasty et al.
patent: 2006/0126504 (2006-06-01), Meier et al.
patent: 2006/0167784 (2006-07-01), Hoffberg
patent: 2006/0176829 (2006-08-01), McLaughlin et al.
patent: 2006/0179143 (2006-08-01), Walker et al.
patent: 2006/0187858 (2006-08-01), Kenichi et al.
patent: 2006/0193295 (2006-08-01), White et al.
patent: 2006/0224502 (2006-10-01), McGowan
patent: 2007/0005797 (2007-01-01), Fontijn et al.
patent: 2008/0040481 (2008-02-01), Joshi et al.
patent: 2008/0167982 (2008-07-01), Leo et al.
patent: 0999662 (2005-05-01), None
patent: 9915960 (1999-04-01), None
patent: 03 037009 (2003-05-01), None
patent: 2004 001585 (2003-12-01), None
patent: 2006 004628 (2006-01-01), None
Non-final Office Action dated Dec. 23, 2008 in U.S. Appl. No. 11/755,806.
Final Office Action dated Jun. 3, 2009 in U.S. Appl. No. 11/755,806.
Final Office Action dated Jun. 9, 2009 in U.S. Appl. No. 11/755,806.
Non-final Office Action dated Oct. 19, 2009 in U.S. Appl. No. 11/755,788.
Qui et al.. “Bandwidth in Ad Hoc Networks: A Price-Based Approach,” 2003, IEEE, pp. 1-10.
Non-final Office Action dated Nov. 25, 2009 in U.S. Appl. No. 11/755,780.
Non-final Office Action dated Nov. 25, 2009 in U.S. Appl. No. 11/755,802.
D. Zhu et al., “QoS Aware Wireless Bandwidth Aggregation (QAWBA) by Integrating Cellular and Ad-hoc Networks.”, Oct. 2004.
D. Zhu et al., “Using Cooperative Multiple Paths to Reduce File Download Latency in Cellular Data Networks.”, Nov. 2005.
Non-Final Office Action dated Mar. 4, 2010 in U.S. Appl. No. 11/755,775.
Final Office Action dated Mar. 5, 2010 in U.S. Appl. No. 11/755,788.
Non-Final Office Action dated Mar. 22, 2010 in U.S. Appl. No. 11/755,782.
Non-Final Office Action dated Mar. 18, 2010 in U.S. Appl. No. 11/755,763.
Non-final Office Action dated Dec. 24, 2009 in U.S. Appl. No. 11/755,776.
Non-final Office Action dated Jan. 22, 2010 in U.S. Appl. No. 11/755,778.
Non-final Office Action dated Jan. 21, 2010 in U.S. Appl. No. 11/755,808.
Luo, Haiyun, Ramachandran Ramjee, Prasun Sinha, Li (Erran) Li, and Songwu Lu. “UCAN: A Unified Cellular and Ad-Hoc Network Architecture.” MobiCom '03, Proceedings of the 9th Annual International Conference on Mobile Computing and Networking. New York, NY, USA: ACM Press, 2003, pp. 353-367.
Office Action dated Jun. 4, 2010 in U.S. Appl. No. 11/755,780.
Office Action dated Jun. 22, 2010 in U.S. Appl. No. 11/755,776.
Office Action dated Jul. 12, 2010 in U.S. Appl. No. 11/755,808.
Notice of Allowance dated Jul. 13, 2010 in U.S. Appl. No. 11/755,778.
Notice of Allowance dated Jun. 9, 2010 in U.S. Appl. No. 11/755,802.
Notice of Allowance dated Aug. 16, 2010 in Application No. 11/755,763.
Notice of Allowance dated Aug. 25, 2010 in U.S. Appl. No. 11/755,780.
Office Action dated Sep. 14, 2010 in U.S. Appl. No. 11/755,788.
Office Action dated Sep. 15, 2010 in U.S. Appl. No. 11/755,782.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Efficiency and resiliency enhancements for transition states... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficiency and resiliency enhancements for transition states..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiency and resiliency enhancements for transition states... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2719178

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.