Lucent Technologies Inc.

Alcatel Lucent

Alcatel-lucent USA Inc.

Clifford Eric Martin

Abraham Silberschatz

Rajeev R Rastogi

Stephen Michael Blott

Thomas J Richardson

Kevin R Curtis

Banu Rahime Ozden

Yuri J Breitbart

Michael C Tackitt

Peter M Winkler

Ben Jai

Minos N Garofalakis

Michael E Flaster

Eric Henry Grosse

Cuong Tran

Srinivasan Seshadri

Henry F Korth

Jose′ Carlos Brustoloni

Wee Teck Ng

Pudugramam S Narayanan

Anna Y Ginzburg

Methods and apparatus are provided for detecting unwanted traffic in one or more packet networks utilizing string analysis. Unwanted traffic received by a target victim, such as a malicious attack, is detected by maintaining a rule base identifying one or more string expressions; analyzing one or more error entries in a log file, the log file comprising one or more requests received by the target victim; determining if the one or more requests include a string that matches one or more of the string expressions in the rule base; and sending a denunciation message to a central filter if the one or more requests include a string that matches one or more of the string expressions in the rule base. The string expressions may comprise, for example, a string or a regular expression and can represent one or more resources that an attacker may attempt to access.

Methods and apparatus for detecting unwanted traffic in one or more packet networks utilizing string analysis

A payment system for accessing Internet content is located within an Internet service providers network. The system includes an access controller () and a payment authority (). When an end-user makes a request for a URL, the access controller terminates the request and determines whether the requested URL is one for which a charge for accessing the content referenced by that URL is required. That determination is made by comparing the requested URL with a set of rules that are supplied by all the content providers for which the service provider supports payment. If no match is found, the request is forwarded to the content provider. If a rule is found that matches the requested URL, the end-user is identified and the request is forwarded to the payment authority where a payment policy associated with the matched rule is applied. If the end-user fulfills the requirements of this payment policy, then access to the content is granted. The end-user may fulfill the requirements of the payment policy, for example, through a current subscription to a content provider's site, through an auto-payment agreement in which all charges of less than an agreed upon amount are automatically accepted, or by specifically accepting and agreeing to pay an indicated charge for accessing the requested content. In accepting any such payment arrangement, the end-user's account with the service provider is debited for the appropriate charge and the content provider's account is credited for the end-user's access.

Method and apparatus for the payment of internet content

A system for, and method of, retrieving network management data in a network and a network management station incorporating the system or the method. In one embodiment, the system includes: (1) an information querier, associated with a network management station, that develops a query for at least some network management data from a target agent in the network and assigns a path for a response from the target agent that is unique to the target agent and (2) a response receiver, associated with the information querier, that receives, via the path, the response from the target agent containing the at least some the network management data.

System and method for retrieving network management data from multiple network elements

An RF antenna grid design in which the antenna array is installed on a patch panel cover allows for the retrofitting of an RF antenna grid on existing patch panel based systems without disrupting network operation. An apparatus for determining connectivity between device ports on a patch panel and cable ends having corresponding RFID tags attached thereto comprises a patch panel having a plurality of device ports and a patch panel cover comprising a plurality of RFID antennas, where each of the RFID antennas comprises one or more protruding portions thereof, each of the protruding portions of the RFID antennas being in close physical proximity to one or more of the plurality of device ports when the patch panel cover is positioned in a fixed positional relationship to the patch panel (e.g., when the patch panel cover is 'attached' to the patch panel).

Patch panel cover mounted antenna grid for use in the automatic determination of network cable connections using RFID tags

An application programming interface (API) is described that allows creating or destroying one or more pairs of data structures for asynchronously passing between the operating system and a network application pointers to packet buffers mapped to both parties.

Application programming interface for network applications

Radio Frequency Identification (RFID) tags and an antenna grid are used for automatic determination of cable connections. An RF antenna grid is advantageously employed on a device having a plurality of device ports (e.g., cable connection points) which may, for example, be physically organized in a two-dimensional arrangement. Then, when RFID tags are fixed to one or more cable ends, it can advantageously be determined which of the one or more cables are connected to which of the ports on the device. The RF antenna grid may comprise a plurality of individual antennas which are advantageously multiplexed such that a single RFID reader can handle the sensing for all antennas. Also, opposing ends of a given cable may be advantageously provided with RFID tags having related ID codes such that connections which exist between two connected ports of the device may be easily and efficiently determined.

Method and apparatus for the automatic determination of network cable connections using RFID tags and an antenna grid

Duplicate processing at network operators is avoided by applying once-only processing at operators which are adjacent to either the source or destination host of a data packet. An operator is adjacent to a host if there exists a path between the operator and the host containing no other operators. In one embodiment, an operator determines that it is adjacent to a host if it receives a special broadcast data packet from the host. To ensure that no other operators receive the special broadcast data packet, the adjacent operator drops the packet. In another embodiment, operators determine whether they are adjacent to identified hosts by transmitting special ping packets to the hosts. If an operator receives a ping response from the host, the operator determines that it is adjacent to the host. To ensure that only adjacent operators receive ping responses, intervening operators drop special ping packets received from other operators.

Method and apparatus for applying once-only processing in a data network

Physical connectivity is determined between elements such as switches and routers in a multiple subnet communication network. Each element has one or more interfaces each of which is physically linked with an interface of another network element. Address sets are generated for each interface of the network elements, wherein members of a given address set correspond to network elements that can be reached from the corresponding interface for which the given address set was generated. The members of first address sets generated for corresponding interfaces of a given network element, are compared with the members of second address sets generated for corresponding interfaces of network elements other than the given element. A set of candidate connections between an interface of the given network element and one or more interfaces of other network elements, are determined. If more than one candidate connection is determined, connections with network elements that are in the same subnet as the given network element are eliminated from the set.

Determination of physical topology of a communication network

A network server stores database tables for use in resolving labels into network addresses as requested by a remote browser client. Each user has an associated address-table which stores user defined labels associated with network addresses. Users may access other user's address-tables if such other users grant authority to do so. Each user defines the address-tables to be searched, along with a search order, to be used when the user requests that a label be resolved into a network address. During address resolution, the server will resolve a received label into the network address associated with the label as defined by the first accessed address-table which contains the label. The search order as defined by the user may be overridden for a particular address resolution request by an appropriate user command. In various embodiment, the network addresses may be WWW addresses and electronic mail addresses.

Hierarchical data network address resolution

A cache management scheme is disclosed for buffering one or more continuous media files being simultaneously accessed from a continuous media server by a plurality of media clients. The continuous media server stores pages of data that will likely be accessed in a cache or buffer. The continuous media server implements a cache management strategy that exploits the sequential page access patterns for continuous media data, in order to determine the buffer pages to be replaced from the cache. The cache management strategy initially identifies unpinned pages as potential victims for replacement. Each unpinned page is evaluated by the continuous media server and assigned a weight. Generally, the assigned weight ensures that a buffer with a larger weight will be accessed by a client later in time than a buffer with a smaller weight. A page associated with a larger weight will be accessed later and hence, is replaced earlier. A current buffer list is preferably allocated to monitor the buffer pages associated with a given continuous media file. The current buffer list is a data structure pointing to a set of buffer pages in the cache buffer containing the currently buffered pages of the associated continuous media file. Each buffer page in the buffer cache is preferably represented by a buffer header. The current buffer list (CBL) data structure preferably stores, among other things, a pointer to the buffer pages associated with the CBL, identifier information for the CBL and related continuous media file, and information regarding the number of buffered pages associated with the CBL and number of clients currently accessing the associated continuous media file. The buffer header is a data structure containing information describing the state of the corresponding page. The buffer header preferably includes, among other things, a pointer to an actual area of the buffer cache storing a page of data, a number of pointers to create various relationships among the various pages in a CBL, and a fixed count indicating the number many of clients currently accessing the corresponding page of the continuous media file.

Cache management system for continuous media system

A request for transfer of data over a network is processed to obtain current values of network parameters such as aggregate network processing overhead and effective network bandwidth. In response to receipt of a data transfer request, the maximum size transport unit which can be sent over the network without packet loss is determined. The full maximum size transport unit is then sent over the network from, for example, a client to a server, in order to provide a measure of full size transport time. Similarly, a half size transport unit is sent over the network to provide a measure of half size transfer time. The fall and half size transfer times are then used to compute current values for the network processing overhead and effective network bandwidth parameters. The current values are processed to determine an internal buffer size to be allocated for use in receiving data transferred over the network in response to the request. The data transfer request is therefore processed in a manner which is substantially independent of the particular transmission protocol and medium used by the network, such that the techniques can be applied to any type of network.

Method and apparatus for delivery of data over a network based on

Bit error rate in holographic storage/reconstruction is reduced by 2-dimensionally dispersing symbols constituting codewords so that no two codeword-common symbols occupy a single row or column on the SLM display.

Holographic storage of digital data

Bit error rate of an output data stream, reconstructed from a holographic recording, is reduced by reducing the length of same-state pixels on the spatial light modulator.

Bit error rate reduction by reducing the run length of same-state pixels

Buffer space and disk bandwidth resources in a continuous media server are continuously re-allocated in order to optimize the number of continuous media requests which may be concurrently serviced at guaranteed transfer rates using on demand paging. Disk scheduling is provided to ensure that whenever an admitted request references a page of data, the page is available in a buffer for transfer to a client. Data for continuous media data files are stored on disk or held in the buffer to eliminate disk bandwidth limitations associated with concurrently servicing any number or combination of requests, provided buffer space is sufficient. Multiple requests for continuous media data files are selectively included in groups for servicing in order to provide that buffer and disk bandwidth requirements are maintained at a minimum and within available resource capabilities.

Growing community of inventors

Martinsville, NJ, United States of America

Clifford Eric Martin