Abstract: Techniques are generally disclosed for disseminating link state information to one or more nodes of a network of nodes, the network of nodes interconnected via a plurality of communication channels.

Abstract: An embodiment of a system and method that uses inline measurements to probe available bandwidth for a transmission control protocol, and adaptively sets a slow-start threshold according to the available bandwidth. The method includes initializing a congestion window “cwnd,” sending cwnd packets, estimating an available bandwidth for the cwnd packets. The congestion window cwnd is set to a higher number, and the higher number of further packets is sent if the available bandwidth is greater than a first threshold level. The available bandwidth is re-estimated for the higher number of the further packets, and a soft start threshold “ssthresh” is set to the re-estimated available bandwidth. A statistical measure is calculated for the re-estimated available bandwidth, and the congestion window cwnd is set equal to ssthresh if a ratio of the statistical measure to the re-estimated available bandwidth is less than a second threshold level.

Abstract: A method for delivering packets in a wireless communications system includes determining a cause of loss for a previously transmitted packet based on a packet acknowledgement corresponding to the previously transmitted packet, the packet acknowledgement including at least one of a wireless loss indicator and a congestion warning indicator for the wireless communications system. The method also includes adjusting a transmission parameter in a packet transmission protocol according to the cause of loss, and retransmitting the previously transmitted packet.

Abstract: Technologies are generally described for substantially maximizing capacity in a wavelength division multiplexing (WDM) passive optical network (PON). An “achievable rate region” may be defined as a set containing admissible traffic rates of a given WDM PON system such that a volume of an achievable rate region is proportional to a capacity of the network. Deriving the achievable rate region for a particular network, decisions may be made whether incoming traffic rate can or cannot be achieved for that network. Moreover, the achievable rate region may be used to construct a WDM PON utilizing a minimum number of wavelengths, a minimum number of lasers with narrowest tuning ranges, and a minimum number of receivers, thereby reducing a capital expenditure in building the PON system.

Abstract: Implementations and techniques for allocating bandwidth in a resilient packet ring network by a PI-type controller are generally disclosed.

Abstract: A technique to mitigate low rate Denial-of-Service (DoS) attacks at routers in the Internet is described. In phase 1, necessary flow information from the packets traversing through the router is stored in fast memory; and in phase 2, stored flow information is periodically moved to slow memory from the fast memory for further analysis. The system detects a sudden increase in the traffic load of expired flows within a short period. In a network without low rate DoS attacks, the traffic load of all the expired flows is less than certain thresholds which are derived from real Internet traffic analysis. The system can also include a filtering solution to drop attack packets. The filtering scheme treats the long-lived flows in the Internet preferentially, and drops the attack traffic by monitoring the queue length if the queue length exceeds a threshold percent of the queue limit.

Abstract: Techniques for managing resources in a point-to-multipoint (P2MP) network are disclosed. In some examples, a root station is adapted to transmit and receive network packets and leaf stations are adapted to transmit and receive the network packets from the root station. An electrical control system can be adapted to reduce an amount of time for the electrical control system to produce a steady state output and to define a maximum boundary for the output. The electrical control system may include feedback to control the root station based, at least in part, on the output of the electrical control system.

Abstract: Techniques of scheduling data packets are disclosed. For example, such data packet scheduling techniques may be employed to schedule data packets on wired and/or wireless networks. An example embodiment includes techniques for scheduling voice-over-Internet protocol data packets transmitted between a base station and a subscriber station on a WiMAX network.

Abstract: Techniques for managing resources in a point-to-multipoint (P2MP) network are disclosed. In some examples, a root station is adapted to transmit and receive network packets and leaf stations are adapted to transmit and receive the network packets from the root station. An electrical control system can be adapted to adjust a control error toward a zero value and adjust an output toward a steady state. The electrical control system may include feedback to control the root station based, at least in part, on the output of the electrical control system.

Abstract: A differential frame-based scheduling scheme is employed for input queued (IQ) switches with virtual output queues (VOQ). Differential scheduling adjusts previous scheduling based on a traffic difference in two consecutive frames. To guarantee quality of service (QoS) with low complexity, the adjustment first reserves some slots for each port pair in each frame, then releases surplus allocations and supplements deficit allocations according to a dichotomy order, designed for high throughput, low jitter, fairness, and low computational complexity.

Abstract: Techniques for partitioning and/or combining at least a portion of an optical network tree including one or more array waveguide gratings (“AWGs”) and fibers in wavelength division multiplexing (“WDM”) passive optical networks (“PON”) with cascaded AWGs are disclosed. Example methods include deriving the optimal positions for the AWGs to minimize fiber cost and then determining the arrangement of cascaded AWGs to minimize the total cost of AWGs and fibers. Determining the arrangement of cascaded AWGs may include recursive partitioning followed by recursive combination. An example recursive partition-combination based algorithm for optimizing a tradeoff between the AWG cost and the fiber cost is disclosed.

Abstract: Embodiments are directed toward a method for Behavior-based Traffic Differentiation (BTD) that initially receives incoming packets and performs traffic classification to determine the protocol of the incoming packets. In addition, BTD performs bandwidth division/allocation to further support traffic classification amongst non-TCP traffic such as UDP and ICMP. For TCP traffic, the method for BTD determines whether a TCP connection has been established and performs at least one of rate limiting, waiting time reduction for half-open connections, and incrementing backlog queue size when the TCP connection has not been established. If the TCP connection has been established successfully, the method for BTD further includes proactive tests for traffic differentiation which identify normal traffic, which is admitted, and attack traffic, which is dropped.

Abstract: Implementations and techniques for allocating bandwidth in a resilient packet ring network by a P-type controller are generally disclosed.

Abstract: An exemplary method of controlling communications includes determining a total congestion window size for a router device. An allocation of at least a portion of the determined total congestion window size to allocated at least one mobile station that communicates with the router device over a wireless link is determined based on the determined total congestion window size. The determined allocation is then reported to a source of a communication intended for the at least one mobile station.

Abstract: Technologies are generally described for network traffic scheduling in a wavelength division multiplexing (WDM) passive optical network (PON). Dynamic wavelength assignment and time allocation in hybrid WDM/TDM PONs with tunable lasers as optical light generators is accomplished by mapping the scheduling into a multi-processor scheduling problem with wavelength channels as machines and ONU requests as jobs. Wavelengths may be considered as parallel identical machines. Taking laser tuning time into consideration preemptive and non-preemptive scheduling with the objective of minimizing the latest job completion time is computed employing a number of heuristic algorithms. The algorithms compute two extreme cases of zero and infinity laser tuning time, respectively. Using the results from these two extreme cases, the heuristic scheduling schemes for the case of arbitrary laser tuning time yield close average latest job completion times for both schedule types.

Abstract: Sharing a resource may include the use of label values associated with information units presented to the resource. The label values may be determined based on, for example, arrival rates and/or committed flow rates. Criteria may be applied to label values to determine if the associated information units may be dropped.

Abstract: The invention enables the use of TCP protocol for reliable transport of data over a wireless network, resolving the problems associated with frequent packet loss. Additional benefits include delivery of significant performance improvement, bandwidth saving and backward compatibility compared to the wire-line TCP protocol, and contribution to power savings in wireless handsets and devices. To make the retransmission process more granular, transport layer segments are subdivided into sub-segments. The invention utilizes a split TCP based approach and produces a series of smaller-sized segments that share the same transport layer header. A NACK-based message exchange, a new header format and a special windowing protocol are used to achieve reliability, flow-control, and efficient buffer handling.

Abstract: Methods and apparatus provide for allocating bandwidth in a resilient packet ring (RPR), including: determining a relationship between an arrival rate A(n) as a function of a fairness rate Fk(n) of a kth node of the RPR over time; computing an estimate of a slope -M of the relationship A(Fk(n)) at time n; and computing a next fairness rate Fk(n+1) of the kth node as a function of the slope M at time n+1.

Abstract: The deterministic packet marking (DPM) method is based on marking packets with the partial address information of ingress interface only. The attack victim is able to recover the complete address(es) information after receiving several packets from a particular attacking host or hosts. The full path is not really essential for the traceback since it can be different for different packets for different reasons. In order to deal with fragmentation, it is required that the ID field (as well as some other fields) of all the fragments in a given series is the same. DPM randomly selects the marks from the pool, which is created at startup. The mark completely occupies the ID field in the IP packet header, as well as Reserved Flag. Since every single packet passing through the DPM-enabled interface is marked, the ID field of all the fragments of a series are ensured to be the same.

Abstract: Techniques are generally disclosed for disseminating link state information to one or more nodes of a network of nodes, the network of nodes interconnected via a plurality of communication channels.