Abstract:
The present invention is directed to a local network access architecture and method of providing local services that advantageously replaces portions of the physical hardwired local loop with a path that is software-defined.
Abstract:
The present invention is directed to a novel scalable packet-switched network routing method and system that utilizes modified traffic engineering mechanisms to prioritize tunnel traffic and non-tunnel traffic.
Abstract:
A system and method are disclosed for the repair of IP multicast sessions. A repair server polls multiple transmit servers to accumulate as many of the packets missing from the multicast session as possible. A network includes a source of multicast packets in a multicast session and a plurality of multicast recipients in that session. A repair server in the network provides the packets it receives to the recipients. The repair server includes a missing packet detector. There is a plurality of retransmit servers in the network buffering portions of the packets they respectively receive during the session. The repair server maintains an ordered list of the retransmit servers that are most likely to have buffered copies of packets missing from the session. When the repair server detects that there are packets missing from the session it has received, it uses the ordered list to sequentially request the missing packets from respective ones of the plurality of retransmit servers.
Abstract:
A honeypot architecture is disclosed with significant advantages over the prior art. Attacks are routed through a virtual private network to a honeypot system with limited controlled access to the public data networks.
Abstract:
In accordance with aspects of the invention, nulllow-levelnull caches can utilize source selection while non-authoritative sources can take advantage of rejuvenation to alleviate what the inventor refers to as nullage penaltynull and thereby reduce validation traffic.
Abstract:
Overlapped wireless LAN cells in a medium have an equal chance at establishing a session on the medium. A first member station in the first cell transmits a timing packet containing a timestamp value, which is received at a second member station in the second cell. This synchronizes member stations in the first and second cells to interrupt transmissions at a global channel release instant corresponding to the timestamp value. The member stations in the first and second cells then have the opportunity to contend for access to the medium following the global channel release instant, using a slotted CSMA/CA access method. Each of the member stations in the first and second cells has a superframe clock that is synchronized based on the timestamp value, thereby establishing a periodic global channel release instant during each of a plurality of periodic superframes. The member stations can then periodically interrupt transmissions at the periodic global channel release instant to contend for the medium. The periodic global channel release instant occurs at intervals that are sufficiently close to meet delay and jitter restrictions for time-critical voice and video applications.
Abstract:
An access method for periodic contention-free sessions (PCFS) reduces interference between overlapping first and second wireless LAN cells contending for the same medium. Each cell includes a respective plurality of member stations and an access point (AP) station. The access method for periodic contention-free sessions (PCFS) includes a fixed cycle time that reduces conflicts with PCFS from other cells. The PCFS from several cells are repeated in cycles of cycle period (CP), which is the contention-free period (CFP) of an access point times a factor that is a function of the number of overlapping cells. Periodic contention-free sessions (PCFSs) are generated, one from each overlapping cell. PCFS transmission attempts occur at the fixed specified time spacing following the start of the previous cycle. Each active AP sets a timer at CP and a PCFS is initiated when the timer expires. The timer is then reset to CP and this starts a new cycle. Contention transmissions are attempted by stations based on their assigned priority. If a channel is busy at the designated start time for transmitting a PCFS, the PCFS is shortened by the time lost. Interleaving PCFSs and CFSs reduces conflicts with CFSs from other cells. To lessen the contention between APs of different cells, each station's Network Allocation Vector (NAV) and Inter-BSS Network Allocation Vector (IBNAV) is updated by an increased value of the next CFS length, the increment being the inter-BSS contention period (IBCP). APs will attempt to access the channel during the IBCP only for transmitting a PCFS, while they will wait for the NAV and IBNAV expirations before attempting to transmit a CFS. Interleaving PCFSs and CFSs also enables maintaining quality of service (QoS).
Abstract:
An access point transmits a preemptive peg packet when it has no data to transmit in order to maintain the contiguity of its transmission timing position with respect to the timing position of other contention-free sessions (CFS) transmitted by other access points in an existing, periodic sequence. The cyclic prioritized multiple access (CPMA) method establishes the transmission timing position of contention-free sessions (CFS) between overlapping first and second wireless LAN cells contending for the same medium. Each cell includes a respective plurality of member stations. If an access point has no traffic, it will transmit a short, preemptive pegging packet and reset its backoff timer. In this manner, no gaps longer than the distributed coordination function (DCF) Interframe Space (DIFS) are left idle. This prevents other stations from using DCF contention to seize the channel, until all access points have completed one contention-free session (CFS) per periodic cycle.
Abstract:
A protocol framework for a Secure IP Access (SIA) method, and supporting components deployed on IP hosts and IP networks. Using this method, an IP host can establish a secure data channel within an IP network over an insecure shared link while requesting IP address and networking configuration parameters from the IP network. A system administrator can implement strong access control against various attacks that an edge IP network may have to face, such as a denial-of-service attack that exhausts assignable IP addresses. This is a lightweight, scalable, and backward-compatible solution that can improve security performance for public and corporate LANs having open access such as wireless access points and Ethernet jacks.
Abstract:
A method and system provide capacity-efficient restoration within an optical fiber communication system. The system includes a plurality of nodes each interconnected by optical fibers. Each optical fiber connection between nodes includes at least three channel groups with different priority levels for restoration switching in response to a connection failure. The system maintains and restores full-capacity communication services by switching at least a portion of the channel groups from a first optical fiber connection to a second optical fiber connection system based on the priority levels assigned to the channel groups. Service reliability is effectively maintained without incurring additional costs for dedicated spare optical fiber equipment by improving idle capacity utilization.