Abstract: Load balancing of 5G cellular networks is achieved by reducing network congestion utilizing two components of learning and optimization. First, a number of learning approaches including Linear Least Square Regression (LLSR), Auto Regressive Integrated Moving Average (ARIMA), and Multi-Layer Perceptron Deep Learning (MLPDL) are used to model either Physical Resource Block (PRB) or Packet Dedicated Control CHannel (PDCCH) utilization as a function of average connected user equipment and predict the number of average users corresponding to predefined thresholds of congestion in utilizing cellular towers. Then, an optimization problem is formulated to minimize 5G network congestion subject to constraints of user quality and load preservation. Three alternative solutions, namely Constrained Simulated Annealing (CSA), Block Coordinated Descent Simulated Annealing (BCDSA), and Genetic Algorithms (GA) are presented to solve the optimization problem.

Abstract: Optimal reduction of 4G LTE cellular network congestion utilizes two components of learning and optimization. First, an MLPDL learning approach is used to model cellular network congestion measured in terms of PRB utilization and predict 80% utilization as breakpoint thresholds of cellular towers as a function of average connected user equipments. Then, an optimization problem is formulated to minimize LTE network congestion subject to constraints of user quality and load preservation. Two alternative solutions, namely Block Coordinated Descent Simulated Annealing (BCDSA) and Genetic Algorithms (GA) are presented to solve the problem. Performance measurements demonstrate that GA offers higher success rates in finding the optimal solution while BCDSA has much improved runtimes with reasonable success rates.

Abstract: Optimal enhancement of 3G cellular network capacity utilizes two components of learning and optimization. First, a pair of learning approaches are used to model cellular network capacity measured in terms of total number of users carried and predict breakpoints of cellular towers as a function of network traffic loading. Then, an optimization problem is formulated to maximize network capacity subject to constraints of user quality and predicted breakpoints. Among a number of alternatives, a variant of simulated annealing referred to as Block Coordinated Descent Simulated Annealing (BCDSA) is presented to solve the problem. Performance measurements show that BCDSA algorithm offers dramatically improved algorithmic success rate and the best characteristics in utility, runtime, and confidence range measures compared to other solution alternatives.

Abstract: Optimal enhancement of 3G cellular network capacity utilizes two components of learning and optimization. First, a pair of learning approaches are used to model cellular network capacity measured in terms of total number of users carried and predict breakpoints of cellular towers as a function of network traffic loading. Then, an optimization problem is formulated to maximize network capacity subject to constraints of user quality and predicted breakpoints. Among a number of alternatives, a variant of simulated annealing referred to as Block Coordinated Descent Simulated Annealing (BCDSA) is presented to solve the problem. Performance measurements show that BCDSA algorithm offers dramatically improved algorithmic success rate and the best characteristics in utility, runtime, and confidence range measures compared to other solution alternatives.

Abstract: Optimal reduction of 4G LTE cellular network congestion utilizes two components of learning and optimization. First, an MLPDL learning approach is used to model cellular network congestion measured in terms of PRB utilization and predict 80% utilization as breakpoint thresholds of cellular towers as a function of average connected user equipments. Then, an optimization problem is formulated to minimize LTE network congestion subject to constraints of user quality and load preservation. Two alternative solutions, namely Block Coordinated Descent Simulated Annealing (BCDSA) and Genetic Algorithms (GA) are presented to solve the problem. Performance measurements demonstrate that GA offers higher success rates in finding the optimal solution while BCDSA has much improved runtimes with reasonable success rates.

Abstract: An apparatus is provided for implementation of an operational network planning system. The apparatus may receive importation of a unit task organization (UTO) and form waveform(s) based thereon. For each waveform, the apparatus may assign radio(s) to the waveform, present a set of questions that elicit a set of answers, and in response, receive a set of answers that describe a radio frequency environment of the waveform. The apparatus may automatically then populate a set of properties of the waveform based on the radio frequency environment described by the set of answers, and based on a number of the radio(s) assigned to the waveform. The apparatus may assign network addresses and routing protocol(s) across the radios assigned to the waveform(s), and generate a network design based on the waveform(s), and the above artifacts related thereto.

Abstract: An apparatus is provided for implementation of an operational network planning system. The apparatus may receive importation of a unit task organization (UTO) and form waveform(s) based thereon. For each waveform, the apparatus may assign radio(s) to the waveform, present a set of questions that elicit a set of answers, and in response, receive a set of answers that describe a radio frequency environment of the waveform. The apparatus may automatically then populate a set of properties of the waveform based on the radio frequency environment described by the set of answers, and based on a number of the radio(s) assigned to the waveform. The apparatus may assign network addresses and routing protocol(s) across the radios assigned to the waveform(s), and generate a network design based on the waveform(s), and the above artifacts related thereto.

Abstract: A method of multiple packet reception (MPR) using distributed time slot assignment (TDSA) in a multi-user network where receivers can detect two packets at the same time includes the steps of requesting information on slot assignment in a contention area, setting a frame length and acquiring a the slot assignment, selecting the assigned slot, and announcing and confirming information about the frame length and the assigned slot. The step of requesting information on slot assignment, setting a frame length and acquiring a slot assignment, and selecting the assigned slot are performed in a network where receivers can detect two packets at the same time, where time slots are assigned to nodes instead of links, where one-hop neighbors are assigned to different time slots since they may form a link together, while sharing one time slot with one of the two-hop neighbors in a non-interfering assignment.

Abstract: A Hybrid Cross-Layer Routing (HCLR) protocol designed and implemented based on the premise of being able to leverage a pair of proactive and reactive routing schemes in Mobile Ad Hoc Networks (MANETs) which is used to compensate against wireless link effects thereby allowing for making more intelligent routing decisions. Compared to standalone proactive or reactive routing protocols, HCLR provides a two-tier improvement logic by performing local on-demand search in an n-hop neighborhood utilizing a 2-tuple cross-layer routing metric. HCLR is implemented in a Linux Quagga suite and its performance improvements compared to OSPF MANET Designated Routing (MDR) through emulation studies is demonstrated.

Abstract: A method for multipacket communication in an asynchronous wireless system includes the steps of transmitting at least two packets of 2M digital signals from a plurality of transmitters without other transmission taking place within a predetermined number of symbol durations from each side of each packet. Each transmitter generates digital signals denoted as at least two super-symbols according to an Alamouti coding scheme corresponding to M symbols of first set of super-symbols in a first transmission interval and a second set of super-symbols in a second transmission interval. The received packets include inter-symbol interference of the super-symbols when imperfectly synchronized which expands the time interval of the received packets. A symmetric Alamouti structure for the received packets is generated by folding the expanded received signal on itself, multiplying by a factor of ?1, and decoding using the Alamouti structure for the received packets at each antenna of the receiver.

Abstract: A Hybrid Cross-Layer Routing (HCLR) protocol designed and implemented based on the premise of being able to leverage a pair of proactive and reactive routing schemes in Mobile Ad Hoc Networks (MANETs) which is used to compensate against wireless link effects thereby allowing for making more intelligent routing decisions. Compared to standalone proactive or reactive routing protocols, HCLR provides a two-tier improvement logic by performing local on-demand search in an n-hop neighborhood utilizing a 2-tuple cross-layer routing metric. HCLR is implemented in a Linux Quagga suite and its performance improvements compared to OSPF MANET Designated Routing (MDR) through emulation studies is demonstrated.

Abstract: A method of multiple packet reception (MPR) using distributed time slot assignment (TDSA) in a multi-user network where receivers can detect two packets at the same time includes the steps of requesting information on slot assignment in a contention area, setting a frame length and acquiring a the slot assignment, selecting the assigned slot, and announcing and confirming information about the frame length and the assigned slot. The step of requesting information on slot assignment, setting a frame length and acquiring a slot assignment, and selecting the assigned slot are performed in a network where receivers can detect two packets at the same time, where time slots are assigned to nodes instead of links, where one-hop neighbors are assigned to different time slots since they may form a link together, while sharing one time slot with one of the two-hop neighbors in a non-interfering assignment.

Abstract: A method for multipacket communication in an asynchronous wireless system includes the steps of transmitting at least two packets of 2M digital signals from a plurality of transmitters without other transmission taking place within a predetermined number of symbol durations from each side of each packet. Each transmitter generates digital signals denoted as at least two super-symbols according to an Alamouti coding scheme corresponding to M symbols of first set of super-symbols in a first transmission interval and a second set of super-symbols in a second transmission interval. The received packets include inter-symbol interference of the super-symbols when imperfectly synchronized which expands the time interval of the received packets. A symmetric Alamouti structure for the received packets is generated by folding the expanded received signal on itself, multiplying by a factor of ?1, and decoding using the Alamouti structure for the received packets at each antenna of the receiver.

Abstract: A replication method and system for a computer system having multiple database servers for at least one database, wherein database servers are provided with a unified view of the data content. The method includes the steps of establishing connections to said multiple database servers for communicating with said database servers; distinguishing between read and update query requests; and assigning queries to respective ones of said multiple database servers to preserve the consistency of the respective unified view of data of said multiple database servers in case of receiving update queries.

Abstract: A load balancing method and system for a transaction computer system having multiple database servers for at least one database, wherein database servers cooperate to provide a unified view of the data in the database. The method includes the steps of establishing connections to said multiple database servers for communicating with said database servers; and assigning transactions to respective ones of said multiple database servers to balance respective loads of said multiple database servers.

Abstract: A replication method and system for a computer system having multiple database servers for at least one database, wherein database servers are provided with a unified view of the data content. The method includes the steps of establishing connections to said multiple database servers for communicating with said database servers; distinguishing between read and update query requests; and assigning queries to respective ones of said multiple database servers to preserve the consistency of the respective unified view of data of said multiple database servers in case of receiving update queries.