Time Optimized Communications

Abstract

A time optimizing communications system and method is provided because “loose lips sink ships”. Orders get “do by” parameters, “deliver by” times and may be broken into parts according to “do by” parameters, and/or by prioritization for delivery only when the recipient has the need-to-know. Time sensitive and most secret parts are communicated just in time, some data may be sent at randomized times that may bias traffic on communications infrastructure towards bandwidth optimization. Reducing risk of decryption by adversaries occurring quickly enough to frustrate the purposes of orders. Parts may be broken into data blocks and routed and/or stored randomly. An array of pointers records details of their creation and/or storage locations to provide a key for retrieving data blocks and/or reconstructing messages; timing is managed according to mission needs, and priorities. May also reduce peak demand on communications bandwidth.

1 . A time optimized communications method for sending electronic messages securely, comprising:
 breaking a whole electronic message into message parts;   attaching a delivery deadline for each message part;   sending the respective message parts through a network;   determining by a processor in the network, the delivery deadline for each message part; and   delivering each respective message part to a recipient by the delivery deadline for each message part.   
     
     
         2 . The method of  claim 1 , further comprising sending the respective message parts at random times through the network. 
     
     
         3 . The method of  claim 2 , further comprising delivering each respective message part at a random time and before the delivery deadline. 
     
     
         4 . The method of  claim 2 , further comprising sending each respective message part separately and randomly timed to be sent between a minimum time, and a maximum time range of possible send times, so that all message parts arrive at the recipient by the delivery deadline. 
     
     
         5 . The method of  claim 1 , further comprising sending the respective message parts through the network, out of order from an original order of the whole electronic message. 
     
     
         6 . The method of  claim 5 , further comprising delivering each respective message part at a random time and before the delivery deadline. 
     
     
         7 . The method of  claim 1 , further comprising breaking the whole electronic message into random sized message parts before attaching the delivery time to each message part. 
     
     
         8 . The method of  claim 1 , further comprising:
 determining by the processor, in a plurality of the message parts, time constraints for performing actions in each of the plurality of message parts, wherein each time constraint instructs the recipient of a time by which they must complete a task according to the whole electronic message; and   determining delivery of each of the plurality of message parts based on the time constraints.   
     
     
         9 . The method of  claim 1 , further comprising sending the respective message parts through random network paths to one or more temporary network repositories before delivering each respective message part to the recipient. 
     
     
         10 . The method of  claim 9 , further comprising delivering the respective message parts to the recipient through random network paths. 
     
     
         11 . The method of  claim 1 , further comprising:
 determining a priority level for each respective message part;   determining a bandwidth consumption at different times of a day for a bandwidth cycle associated with the network; and   sending the respective message parts through the network based on the priority level of respective message parts to balance out the bandwidth consumption throughout the day.   
     
     
         12 . The method of  claim 11 , further comprising time adjusting the sending of respective message parts distributing less urgent message parts into less used parts of the bandwidth cycle, and provide smoother flowing communications traffic over the network. 
     
     
         13 . The method of  claim 11 , further comprising:
 sending the respective message parts at random times through the network; and   determining the random times for each respective message part based on reducing a peak load on available bandwidth consumption for the bandwidth cycle.   
     
     
         14 . The method of  claim 1 , wherein the longer a range of time between a may send from time and a must deliver by deadline specified for a data block or part of a message, a transmission timing of message parts or data blocks may be shifted into a lowest possible part of a bandwidth load curve and which load curve is mitigated to lower overall peak values. 
     
     
         15 . The method of  claim 1 , wherein the shorter a period of time from the present to a maximum deliver by time specified for a data block or part of a message, the closer a send timing is shifted toward an instantaneous send time. 
     
     
         16 . The method of  claim 1 , further comprising attaching a priority parameter to respective message parts to resolve conflicts arising from timing collisions between orders. 
     
     
         17 . The method of  claim 1 , further comprising randomly storing the respective message parts among temporary repositories within the network. 
     
     
         18 . The method of  claim 17 , further comprising recording a sequence and locations of data blocks that comprise each respective message part into an array of pointers to the temporary repositories. 
     
     
         19 . The method of  claim 18 , further comprising:
 delivering the array of pointers to the temporary repositories to the recipient;   interrogating the temporary repositories for the sequence and locations of data blocks; and   reassembling the data blocks of the respective message parts.   
     
     
         20 . The method of  claim 1 , further comprising:
 breaking one or more of the respective message parts into data blocks;   maintaining the delivery deadline of each respective message with each data block;   delivering the data blocks to the recipient based on the delivery deadline.   
     
     
         21 . The method of  claim 20 , further comprising:
 sending the data blocks for a respective message to separate random temporary repositories in the network; and   wherein the step of delivering the data blocks to the recipient includes reassembling the data blocks into their respective message parts.