Patents Issued in April 24, 2003
-
Publication number: 20030076808Abstract: A system and method for registering and deregistering a mobile computing device with a service node, comprising sending a registration request message upon connection to a network, receiving a temporary IP address for the network, sending a registration notification message to the service node, wherein said registration request message includes the temporary IP address, receiving an acknowledgement message from the service node indicating that the mobile computing device is registered with the service node, monitoring an activity level of the mobile computing device to determine when the mobile computing device has been idle for a predetermined period of time, and sending a deregistration message to the service node to deregister with the service node when said mobile computing device has been idle for said predetermined period of time.Type: ApplicationFiled: November 12, 2002Publication date: April 24, 2003Inventors: Peter Gerald McNiff, Michael Thomas Wilhoite
-
Publication number: 20030076809Abstract: A method of finding the address of a previously undiscovered client modem first detects the presence of a previously undiscovered client modem on a tree and branch network then uses an efficient method to discern the address for the newly discovered client modem. The method can be coupled with a group polling method for efficiently polling client modems that minimizes the time wasted by polling a modem without data to transmit. In group polling, a broadcast message is sent to all modems (or a selected subset of modems). Each modem requiring service responds with a short burst of energy in its predefined time slot. These time slot responses are recorded and then normal poll messages are sent out to only the modems requesting service. The disclosure contains variations of these methods. This abstract is provided for patent searches, and not as a limitation on the scope of the claims.Type: ApplicationFiled: July 25, 2002Publication date: April 24, 2003Applicant: coaXmedia, Inc.Inventors: Robert P. Basil, Stephane Dennis Jacques Chapeau, Bradley Richard Ree, John B. Terry, Dorothy Terry
-
Publication number: 20030076810Abstract: A method and system provides for efficient data throughput by efficiently re-sequencing received data packets at a remote station. The method and system assigns identification information to each received packet, and then re-sequences the received packets by putting the identification information in order. The disclosed method and system allows partial re-sequencing and partial transmission of received data packets, thereby reducing data transmission delay.Type: ApplicationFiled: September 29, 2001Publication date: April 24, 2003Inventors: Ramin Rezaiifar, Yongbin Wei
-
Publication number: 20030076811Abstract: A method in a terminal, a packet switched wireless connection between the terminal and a server being established. A user program is executed in the server and transmits output data for indication at the terminal via the connection. Input data at the terminal are transferred for temporary indication at the terminal and are stored in a buffer. The terminal transmits a set of input data to the user program from the buffer via the connection at a predetermined size of the set of input data. Data incoming from the server are transferred for indication at the terminal while replacing temporarily indicated data.Type: ApplicationFiled: October 4, 2002Publication date: April 24, 2003Inventor: Anders Ruland
-
Publication number: 20030076812Abstract: The disclosed invention is referred to a method for optimising the random access procedures in third generation CDMA cellular telephony systems. The particular embodiment of the example concerns a TD-SCDMA-TDD synchronous realization.Type: ApplicationFiled: October 23, 2002Publication date: April 24, 2003Inventor: Rosella De Benedittis
-
Publication number: 20030076813Abstract: The present invention is a method and a system for session establishment in a packet switched communication network.Type: ApplicationFiled: October 23, 2001Publication date: April 24, 2003Inventor: Markus Isomaki
-
Publication number: 20030076814Abstract: A network paging system and method implementing a Mobile IP protocol that allows transparent routing of IP datagrams sent by a Correspondent Node (CN) (any Internet node that wants to communicate with a Mobile Node) to a Mobile Node (MN) in the Internet is disclosed. The IP paging protocol disclosed is an extension to Mobile IP to allow dormant mode operation permitting conservation of battery power when not receiving/sending IP datagrams. The disclosed technique permits a mobile node to alternate between dormant and active modes to conserve its power resources. In the disclosed invention, the mobile node does not perform location updates as long as it is in dormant mode. In a preferred embodiment, the implement IP paging protocol is a Layer-3 protocol used to find the paging area, in which the MN is located and to alert MN to come out of dormant mode, whenever there is an incoming traffic.Type: ApplicationFiled: January 25, 2002Publication date: April 24, 2003Inventors: Sridhar Gurivireddy, Behcet Sarikaya, Vinod Kumar Choyi, Xiaofeng Xu
-
Publication number: 20030076815Abstract: A Voice over Internet Protocol (VoIP) network is described in which session state is maintained in access switches, but not signaling gateways which maintain transaction state only during pendency of a related transaction. The signaling gateway further provides transparent inter-operation between the VoIP network and non-IP networks, such as the PSTN, by means of a translator which directly translates messages between the networks.Type: ApplicationFiled: February 11, 2002Publication date: April 24, 2003Inventors: Frank William Miller, Aaron Jip Sipper
-
Publication number: 20030076816Abstract: An Automatic Route Selection (ARS) method and system for telephone calls. Routing is based upon a variety of factors using both digit analysis and table lookups. Calls are routed based on factors such as call type, call priority, and actual call costs defined in a rate table. With the present invention routing based on a variety of factors can be applied by the system administrator to achieve a cost efficient and cost-effective routing plan. An important factor that is used to route calls is the profile of the caller's history of usage. With a sliding window of recent calls, it is possible to estimate the expected hold time (duration) of a new call being placed in order to determine the most cost-effective route for that call.Type: ApplicationFiled: April 26, 2002Publication date: April 24, 2003Applicant: At Comm CorporationInventors: Peter Naranjo, David Y. Schlossman
-
Publication number: 20030076817Abstract: An apparatus and a method for an Internet telephone interface are provided. According to a method for making an Internet phone call using an IP address, a database of the IP address of a plurality of terminal connected to the Internet is made and when a first terminal requests the IP address of a second terminal the database is searched for the IP address of the second terminal and the IP address of the second terminal is provided to the first terminal so that the first terminal can make an Internet phone call to the second terminal.Type: ApplicationFiled: October 7, 2002Publication date: April 24, 2003Inventor: Myoung-tak Han
-
Publication number: 20030076818Abstract: In a network speaking for speaking with voice by exchanging voice packets 6 between a plurality of speaking terminals 3 connected with a communication network 2, a speaking quality monitoring unit 5 capable of computing speaking quality evaluation data is provided between the communication network and the speaking terminal, and the network speaking control unit 16 is provided with network speaking quality judging means 20, 22 for collecting speaking quality evaluation data computed by a plurality of the speaking quality monitoring units and computing and judging speaking quality of the communication network. The quality of the voice speaking exchanged between the speaking terminals can be judged without delay.Type: ApplicationFiled: October 21, 2002Publication date: April 24, 2003Inventors: Yoshihiro Miwa, Koji Ohbayashi, Kazuhiro Kashiwagi
-
Publication number: 20030076819Abstract: A plurality of Integrated Devices are provided with an Internet connection and a telephone number. The telephone number has associated telephone connectivity via a telephone line, such that the Integrated Devices can be connected to by dialing the associated telephone number via telephones on the Public Switched Telephone Network (PSTN). The Internet connection has an associated Internet protocol (IP) address which is dynamically assigned when one device calls the telephone number of a called device via the PSTN. The dynamically assigned IP address for a first one of the calling or called device is provided to the other device, which initiates an Internet connection between them by sending an Internet message to the dynamically assigned IP address of the first device. Local and intermediate proxy servers perform dynamic IP address management, providing privacy and security for user IP addresses and data transmissions.Type: ApplicationFiled: December 20, 2002Publication date: April 24, 2003Inventor: Harry E. Emerson
-
Publication number: 20030076820Abstract: Among other things, a signaling method is explained in which working data is transmitted between a circuit-switched data transmission network and a data packet transmission network. A signaling message (400) is established and transmitted, which clearly signals that a terminal of a data packet transmission network is involved in the data transmission.Type: ApplicationFiled: September 13, 2002Publication date: April 24, 2003Inventor: Klaus Hoffmann
-
Publication number: 20030076821Abstract: A multiplexer circuit, converting parallel data into serial data and synchronized with a clock signal, has a plurality of multiplexer cells that receive the parallel data. Each of the multiplexer cells has a first load, a plurality of first conductivity type transistors, and a level-changing circuit. The first conductivity type transistors are connected in series between a first power source line and a second power source line, and the level-changing circuit changes a connection node of adjacent first conductivity type transistors to a level of the first power source line.Type: ApplicationFiled: March 28, 2002Publication date: April 24, 2003Applicant: FUJITSU LIMITEDInventors: Hideki Takauchi, Kohtaroh Gotoh
-
Publication number: 20030076822Abstract: An off-load engine for processing a packet conveyed between a target and a network over a transport connection, the packet including a payload and a header. The engine includes a payload buffer, for holding data exchanged between the off-load engine, the network, and the target for inclusion in the payload, and a packet processor, for processing context of the transport connection.Type: ApplicationFiled: September 26, 2002Publication date: April 24, 2003Inventors: Rafi Shalom, Amit Oren
-
Publication number: 20030076823Abstract: The invention relates to a nonblocking switching network, comprising a plurality of input/output terminals (LI0 to LI15) for connecting a plurality of line terminator groups (LTG) for a plurality of data channels (BO) to be switched; and a time/space switching network (ZRKN). An input/output stage has a concentrator network (KN) with a concentrator/demultiplexer device (KT) which condenses/divides the plurality of data channels (BO) to be switched in the switching network. Said time/space switching network (ZRKN) consists of at least one n/n switching matrix (KM). This results in a 100% nonblocking switching network which is flexible and can be expanded modularly.Type: ApplicationFiled: October 21, 2002Publication date: April 24, 2003Inventors: Franz Lindwurm, Thomas Treyer, Marcel-Abraham Troost
-
Publication number: 20030076824Abstract: Data transmission system comprising a plurality of Local Area Networks (LANs) (10-1 to 10-4) interconnected by a hub (12) including the same plurality of LAN adapters (16-1 to 16-4) respectively connected to the LANs and a packet switch (14) comprising at least a packet switch module interconnecting all LAN adapters wherein a packet transmitted by any adapter to the packet switch includes a header containing at least the address of the adapter to which the packet is forwarded.Type: ApplicationFiled: December 28, 2001Publication date: April 24, 2003Applicant: International Business Machines CorporationInventors: Alain Benayoun, Patrick Michel, Gilles Toubol
-
Publication number: 20030076825Abstract: According to an embodiment of the present invention, a method is provided for automatic aggregation of a plurality of virtual paths emanating from a first switch. The method includes automatically discovering and identifying portions of the virtual paths that run parallel to one another, e.g., through the same set of switches up to a common terminating switch at which the paths diverge or terminate, as a candidate path set for aggregation, constructing a tunnel path along this set of paths all the way between the first switch and the terminating switch, and aggregating the parallel portions identified by the path set into the tunnel.Type: ApplicationFiled: August 1, 2001Publication date: April 24, 2003Applicant: International Business Machines CorporationInventor: Venkata Guruprasad
-
Publication number: 20030076826Abstract: A method, system and computer program product for reliably transmitting a frame. A transmitting node may be coupled to a plurality of destination nodes. The transmitting node may insert in a frame, e.g., multicast frame, to be transmitted to any two or more destination nodes coupled to the transmitting node two or more sequence numbers in the frame to be transmitted. The two or more sequence numbers may be associated with the two or more destination nodes. Upon transmitting the frame, the transmitting node may store a copy of the frame transmitted. Upon verifying that the frame has been delivered to each destination node to receive the frame, the memory associated with the transmitted frame may be released.Type: ApplicationFiled: October 23, 2001Publication date: April 24, 2003Applicant: International Business Machine CorporationInventors: Richard John Blasiak, David Wayne Cosby, Anthony Matteo Gallo, Sridhar Rao, Sonia Kiang Rovner, Frank Andrew Smoak, Colin Beaton Verrilli
-
Publication number: 20030076827Abstract: The invention relates to a method of controlling the service time of unicast cells and multicast cells in input modules of an asynchronous switching node which comprises n1 input modules and n2 output modules.Type: ApplicationFiled: October 16, 2002Publication date: April 24, 2003Applicant: ALCATELInventor: Michel Henrion
-
Publication number: 20030076828Abstract: The invention relates to a method of controlling the service time of copied multicast cells in input modules of an asynchronous switching node.Type: ApplicationFiled: October 16, 2002Publication date: April 24, 2003Applicant: ALCATELInventor: Michel Henrion
-
Publication number: 20030076829Abstract: The invention relates generally to data communication networks and more particularly to a method of bandwidth management in a multiservice connection-oriented network which uses one or more overlooking factors and one or more overbooking models. The method allows an edge node which has received a connection request to accurately determine the bandwidth available on a given link in the network, by ensuring that different overlooking models and different overbooking factors are normalized at the edge node.Type: ApplicationFiled: October 5, 2001Publication date: April 24, 2003Inventors: Sameh A. Rabie, Osama Aboul Magd
-
Publication number: 20030076830Abstract: In a packet transfer apparatus for transferring packets between first and second networks, a translated network address is assigned to a first node in the first network and having a first private network address when the first packet from the first node is transferred to a second node in the second network, and said translated network address is stored in an address management circuit associated with said first and second network addresses. Thereafter, address translation for realizing an NAT function is performed on subsequent packets transferred between the first and second nodes, by a dedicated hardware circuit and reference to the address management circuit, while performing processing for receiving the packets.Type: ApplicationFiled: March 22, 2002Publication date: April 24, 2003Applicant: Fujitsu LimitedInventor: Kazuya Asano
-
Publication number: 20030076831Abstract: A technique efficiently combines data and ordered transactions in a multiprocessor system having a plurality of nodes interconnected by a hierarchical switch. The technique further enables an ordered channel of the system to make progress in the presence of a blocked interface within the hierarchical switch. Specifically, the technique combines ordered components and unordered data components into common packets that are transmitted over an ordered channel of the system in the event that ordered and unordered components are generated simultaneously. The technique further allows, in the event that a combined packet in the ordered channel is stalled due to a data buffer dependency, the packet to be decomposed into an ordered component and an unordered data component wherein the ordered component remains in the ordered channel and the unordered data component is reassigned to the unordered data channel.Type: ApplicationFiled: March 21, 2001Publication date: April 24, 2003Inventors: Stephen R. Van Doren, Simon C. Steely, Madhumitra Sharma
-
Publication number: 20030076832Abstract: The present invention is drawn to a network device configured to prevent data misalignment of a data packet containing extra header bytes. The network device includes an ingress module having an input interface to receive data. A header detector configured to detect the header bytes of the cell and remove the header from the cell of the data packet is also provided on the network device. A counter determines whether the cell of the data packet contains a multiple of a predetermined bytes. If the counter determines that the cell of the data packet does not satisfy the multiple of the predetermined bytes, an insertion module inserts null bytes into the cell of the data packet to form a modified cell of the data packet. Then, an extraction module removes the null bytes from the modified cell of the data packet when the modified cell exits the network device.Type: ApplicationFiled: October 22, 2001Publication date: April 24, 2003Applicant: Broadcom CorporationInventor: Shih-Hsiung Ni
-
Publication number: 20030076833Abstract: Disclosed herein is a method for summarizing a default address of a PNNI (Private Network-Network Interface) lowest level node in an ATM (Asynchronous Transfer Mode) switching system. In the method, first, a database for storing prefix information, node information and reachable address information is constructed. Parameters inputted for creating an internal prefix is arranged to be adaptable to the system, a prefix information is generated by checking the validation and address system of the parameters inputted for creating the internal prefix, and the prefix information is registered in the prefix information database. An ATM end system address is generated by checking the validation and address system of parameters inputted for creating the node information. The node address of the node information is summarized up to the bit length of the internal prefix and the summarization of a default reachable address is performed by defining the internal prefix as the default reachable summarization address.Type: ApplicationFiled: March 12, 2002Publication date: April 24, 2003Inventors: Hyun Soon Shin, Sung Back Hong
-
Publication number: 20030076834Abstract: A system and method for adaptively assigning queue service weights to an ATM traffic management controller in order to reduce service weight update calculations. The implementation of a fair weighted queuing scheme on a network is divided into two functions: queue arbitration; and queue weight configuration. Queue arbitration is performed via a virtual time-stamped fair queuing algorithm. The queue weight configuration is performed via a reconfigurable weighted fair queuing controller wherein bandwidth requirements are calculated in response to connection setup and release values.Type: ApplicationFiled: July 11, 2002Publication date: April 24, 2003Inventor: Tom Davis
-
Publication number: 20030076835Abstract: A method and apparatus to configure a permanent virtual circuit (PVC) between a digital subscriber line (DSL) customer premise equipment (CPE) and a DSL access module (DSLAM) is described.Type: ApplicationFiled: October 23, 2001Publication date: April 24, 2003Inventor: Sven O. Lund
-
Publication number: 20030076836Abstract: The invention relates, inter alia, to a method according to which a connection is alternately established via a telecommunications network (11) or the internet (34). A user (TlnB) can thus be reached better.Type: ApplicationFiled: October 28, 2002Publication date: April 24, 2003Inventors: Peter Leis, Doris Sachsenweger, Mohammad Vizaei
-
Publication number: 20030076837Abstract: A system and method for providing a congestion optimized address resolution protocol (ARP) for a wireless ad-hoc network. The system and method enables a node in the wireless ad-hoc network to issue an ARP request without the need to broadcast the request to all of the nodes in the wireless ad-hoc network, to thus minimize radio traffic on the wireless ad-hoc network for handling the ARP request. The node includes an address resolution protocol module which is adapted to generate an ARP request for a media access control (MAC) address corresponding to an Internet protocol (IP) address, and a transceiver which is adapted to transmit the ARP request for delivery to an access point of a network portion, such as a core LAN of the network, without broadcasting the ARP request to a plurality of other nodes in the wireless ad-hoc network. The transceiver can transmit the ARP request to the access point directly or via other nodes in the wireless ad-hoc network.Type: ApplicationFiled: October 23, 2002Publication date: April 24, 2003Inventors: Eric A. Whitehill, Michael A. Ruckstuhl, Charles R. Barker
-
Publication number: 20030076838Abstract: A method of establishing Quality-of-Service (QoS) communications within a network proposes the encapsulation of a control message that facilitates QoS for an associated data flow, according to a protocol not implementing resource reservation, such as the User Datagram Protocol (UDP). The encapsulated control message is then propagated through the network on a routed path, while the associated data flow is propagated over a short-cut path through the network.Type: ApplicationFiled: June 29, 1998Publication date: April 24, 2003Inventors: JACK SHAIO, RAHUL KASRALIKAR
-
Publication number: 20030076839Abstract: A slave interface unit controls the exchange of data between a master processing unit and a plurality of slave processing units operating in the asynchronous transfer mode (ATM) of operation. The ATM slave interface unit has a receive unit and a transmit unit that exchange data cells and control signals with the ATM master processing unit. The receive unit and the transmit unit are coupled to a receive buffer storage unit and a transmit buffer storage unit, respectively. The receive buffer storage unit and the transmit buffer storage unit exchange data and control signals with the direct memory access unit. The ATM slave interface unit includes a configuration interface unit having a register that identifies the location in the data cell where the destination address is located and relates the destination address to the particular processing unit or memory location. The receive buffer unit uses the information in the register to determine the destination of the data cell.Type: ApplicationFiled: September 26, 2001Publication date: April 24, 2003Inventors: Martin Li, Jay B. Reimer, Shakuntala Anjanaiah, Natarajan Seshan, Patrick J. Smith
-
Publication number: 20030076840Abstract: Multiple traffic management nodes may be coupled with separate networks and with a connecting network. The traffic management nodes monitor and classify traffic passing through the connecting network. Current paths through the connecting network are identified and used to build detour paths through the connecting network using traffic management nodes as detour nodes. The detour paths may be shortened, thereby excluding the detour nodes from each detour path. The traffic management nodes and the detour paths may be used to create a traffic engineered system for traffic passing through the connecting network.Type: ApplicationFiled: October 18, 2001Publication date: April 24, 2003Inventors: Priya Rajagopal, Gerhard W. Gross
-
Publication number: 20030076841Abstract: A method of bypassing proxy settings of a computing device on a network wherein the proxy settings do not correspond to the network, the method comprising the steps of receiving a request from the computing device in the form of a DNS or IP address, determining if the request is directed to a proxy server and responding to the request with the identification of a proxy server associated with the network.Type: ApplicationFiled: October 22, 2001Publication date: April 24, 2003Inventors: Robert Boxall, Emir Mulabegovic
-
Publication number: 20030076842Abstract: Systems and methods are provided for managing communications between two or more ad-hoc networks in a communication system. The systems and methods may have flexible communication time sharing of one or more nodes taking part in two or more ad-hoc networks. For example, the communication scheduling function for a node shared by two or more ad-hoc networks is provided with a generic functional architecture such that it may be located in a number of different locations. In one embodiment, a Bluetooth communication system includes an inter-piconet scheduling function having a JUMP mode introduced to distinctly identify a node to its neighbors as being shared with multiple ad-hoc networks. The jump mode may have one or more methods for managing the inter-network communications that may include: (1) predetermined fixed starting point and length communication windows, (2) time points with flexible starting points and communication window length, and/or (3) random starting time and length communication windows.Type: ApplicationFiled: November 28, 2001Publication date: April 24, 2003Inventors: Per Johansson, Ulf Jonsson, Fredrik Alriksson, Niklas Johansson
-
Publication number: 20030076843Abstract: A method and apparatus for a messaging system (10) comprising a plurality of messaging nodes (14) at geographically distributed and publicly accessible locations, and a plurality of portable messaging units (16) configured to specific user accounts and including message composition, display and storage means. Communication between these portable messaging units (16) and the messaging system, including messaging with Internet addresses, requires that a portable messaging unit (40) be brought to the immediate physical proximity of a messaging node (20), so that a data exchange (90) may be conducted using simple communications equipment such as an infrared link. Messaging nodes (14) preferably include a plurality of docking ports (26) for conducting data exchanges (90) simultaneously with multiple portable messaging units (16).Type: ApplicationFiled: October 23, 2001Publication date: April 24, 2003Inventors: David Holbrook, Terence Sean Sullivan, Clifford Lardin
-
Publication number: 20030076844Abstract: The present invention provides for adaptive filters that have improved convergence, computational, and memory bandwidth proprieties. When applied to telecommunication applications, the present invention additionally provides for improved methods and systems of canceling echoes. In one embodiment of the adaptive filter of the present invention, a filter, preferably an adaptive finite impulse response (FIR) filter, of an appropriate length, N, is chosen. Once the filter is chosen, convergence is achieved using a convergence process. With convergence complete, the total energy of the filter coefficients is computed and two energy thresholds, a first energy threshold and a second energy threshold, are set relative to the computed total energy. Using the set energy thresholds, new filter coefficients are determined by relating the starting filter coefficient with the first energy threshold and the end filter coefficient with the second energy threshold.Type: ApplicationFiled: October 19, 2001Publication date: April 24, 2003Inventors: Mohammad Usman, Jon Laurent Pang, Amjad Luna, Imtinan Elahi
-
Publication number: 20030076845Abstract: According to the present invention, there is provided a data transfer system using mobile IP in which transfer interruption is not caused even if an MH moves between FNs. A MAC bridge connected between FNs includes means responsive to an address registration request issued by an AP, for storing a combination of a MAC address of the MH and a receiving port, in a filtering DB; means for registering a relation of association of an address of a terminal accommodated in an FN with a connection port of an FN in which the terminal is accommodated, in the filtering DB; and means for referring to the filtering DB on the basis of the destination address of a frame input to each port, and transferring the frame to a predetermined port on the basis of a relation of association of the address with a port identifier.Type: ApplicationFiled: October 18, 2002Publication date: April 24, 2003Applicant: KDDI CORPORATIONInventors: Hidetoshi Yokota, Toru Hasegawa
-
Publication number: 20030076846Abstract: An Ethernet Optical Area Network (EOAN) system, and methods for implementing and using such an EOAN system, are disclosed. The EOAN system may be used to improve the speed and reliability of data communications networks for small to medium-sized companies in metropolitan area networks. The EOAN system provides end-to-end Ethernet protocol, enabling professionals to have high-speed data communications in real time. The EOAN system may be generally utilized for improving data communications between branch offices, home offices, campuses, and remote sites for a wide variety of industries. The present invention preferably includes a fiber optic ring, Network Operation Center (NOC), NOC architecture components, existing client equipment, and one or more Free Space Optic (FSO) devices, microwave communication technology, and/or data switching platforms to implement high-speed Ethernet-based connections such as within a specified metropolitan area.Type: ApplicationFiled: October 24, 2001Publication date: April 24, 2003Inventors: Patrick Heinz, Christopher Scheper, David Leary
-
Publication number: 20030076847Abstract: One embodiment of the present invention provides a system for bypassing use of a protocol checksum during communications across a reliable network link. The system operates by configuring a communication system to bypass use of the checksum during communications across the reliable network link. When the system subsequently receives an outbound packet to be transmitted to a destination across the reliable network link, the system sends the outbound packet to the destination without computing the checksum for the outbound packet. In one embodiment of the present invention, upon receiving an inbound packet from a source across the reliable network link, the system accepts the inbound packet without re-computing the checksum, wherein re-computation of the checksum is required by the communication protocol to verify that the inbound packet was received without errors.Type: ApplicationFiled: October 23, 2001Publication date: April 24, 2003Inventor: Hsiao-Keng J. Chu
-
Publication number: 20030076848Abstract: An improved network device that controls throughput of packets received thereby, e.g., to downstream devices or to downstream logic contained within the same network device. The network device comprises a scheduler that schedules one or more packets of a selected class for throughput as a function of a weight of that class and weights of one or more other classes. The weight of at least the selected class is dynamic and is a function of a history of volume of packets received by the network device in the selected class. An apparatus for protecting against overload conditions on a network, e.g., of the type caused by DDoS attacks, has a scheduler and a token bucket mechanism, e.g., as described above. Such apparatus can also include a plurality of queues into which packets of the respective classes are placed on receipt by the apparatus. Those packets are dequeued by the scheduler, e.g., in the manner described above, for transmittal to downstream devices (e.g., potential victim nodes) on the network.Type: ApplicationFiled: April 26, 2002Publication date: April 24, 2003Inventors: Anat Bremler-Barr, Dan Touitou, Keren Horvitz, Rephael Tzadikario, Yehuda Afek
-
Publication number: 20030076849Abstract: A dynamic queue allocation and de-allocation mechanism for managing traffic flowing through a switching node. If a packet matches conditions of a particular QoS policy rule, a determination is made as to whether a queue associated with the matched QoS policy rule exists on an egress port that is to forward the packet. If such a queue does not exist, a determination is made as to whether enough resources are available for dynamically creating the queue according to the QoS action parameters of the matched QoS policy rule. If the new queue may not be created because of resource limitation, queues of lower priority existing on the port are reclaimed and their resources reassigned to the new queue.Type: ApplicationFiled: October 4, 2002Publication date: April 24, 2003Inventors: David Lynn Morgan, Stephen Clawson, James Freeman
-
Publication number: 20030076850Abstract: A method of determining a maximum packet size for data packets sent along a network path. A sending computer sends a packet to a receiving computer through a sending interface. The packet is fragmented during transfer to a receiving interface. The fragments are analyzed at the receiving interface and their size determined. The size of a fragment is compared to a pre-determined maximum packet size, and in response to the comparison, the maximum packet size is changed. The change is then reported to the sending interface and stored in a memory. Subsequent communications from the sending interface to the receiving interface are sent in packets of the size stored in the memory. Because the maximum packet size of a network path can change over time, test packets can be sent periodically to determine the maximum packet size.Type: ApplicationFiled: October 22, 2001Publication date: April 24, 2003Inventor: James L. Jason
-
Publication number: 20030076851Abstract: A clock selection controller is shown which allows a user to assign a priority scheme to recovered clock signals obtained from communication facilities. The clock selection controller also receives a plurality of alarm signals corresponding to the communications facilities for each of the recovered clock signals. The clock selection controller then automatically selects, for output as a reference clock signal, the highest priority clock input available for which the corresponding alarm signals are inactive. In the absence of an available clock input in the priority scheme, the processor selects a free running clock input.Type: ApplicationFiled: September 24, 1998Publication date: April 24, 2003Inventors: SANJEEV A. MAHAJAN, VENKAIAH DUKKIPATI
-
Publication number: 20030076852Abstract: A communication apparatus is connected to a network on one of a plurality of access channels selected. An amount detecting circuit detects the amount having influence on the quality of communication held on the access channel selected. A selecting circuit selects one of the access channels to be used for communication in accordance with the amount detected by the amount detecting circuit. The communication apparatus dynamically selects an optimum access channel for thereby effecting efficient, high-quality communication.Type: ApplicationFiled: October 21, 2002Publication date: April 24, 2003Inventor: Kiyoshi Fukui
-
Publication number: 20030076853Abstract: A terminal apparatus for providing wireless point-to-multipoint communications is disclosed. The apparatus includes a plurality of outdoor units that are configured to support simultaneously a plurality of channels. Additionally, the apparatus includes an indoor unit that is coupled to the plurality of outdoor units and is configured to receive a signal from a hub terminal over a wireless link.Type: ApplicationFiled: October 24, 2001Publication date: April 24, 2003Inventors: Mike Lohman, Jack Rozmaryn
-
Publication number: 20030076854Abstract: A method of operating a datagram network is disclosed. The method involves placing a group address in the source address field of the datagram. Nodes within the datagram network forward the datagram in dependence on the contents of the source address field. This provides many of the scalability advantages offered by Multiprotocol Label Switched (MPLS) networks without introducing the overheads caused by connection set-up in MPLS networks. The method can also easily provide different quality of service levels to different types of packets and is especially useful in providing Virtual Private Networks across a shared internetwork such as the public Internet.Type: ApplicationFiled: June 10, 2002Publication date: April 24, 2003Inventors: Parminder S Mudhar, Alan W O'Neill
-
Publication number: 20030076855Abstract: Methods and apparatus for sharing network bandwidth between devices connected to a bus are presented. Each of the devices belongs to one of a number of device classes. Each device class is associated with a respective data transfer rate at which information may be exchanged over the bus. An exemplary method includes the step of assigning a gap interval to each device based on at least the data transfer rate of the class to which the device belongs, the assigned gap interval being inserted between portions of a data stream sent by the corresponding device over the bus. The assigned gap interval may be inserted between portions of a data stream sent by the corresponding device over the bus to achieve the desired data rate resulting in an equitable sharing of bandwidth between the devices connected to the bus.Type: ApplicationFiled: September 25, 2002Publication date: April 24, 2003Inventor: Robert L. Chamberlain
-
Publication number: 20030076856Abstract: A receiver for receiving a data stream comprises a filtering arrangement for filtering said received data stream and a processor. The filtering arrangement is arranged to load at least a part of said data stream, to filter at least part of said data stream and to read at least part of said data stream. The filtering arrangement has a first mode in which said steps are carried out and a second mode in which said processor is arranged to interrupt the steps carried out by said filtering arrangement.Type: ApplicationFiled: June 11, 2002Publication date: April 24, 2003Applicant: STMicroelectronics LimitedInventors: Rodrigo Cordero, Patrice Woodward
-
Publication number: 20030076857Abstract: Disclosed herein is a SONET/SDH transmitter provided in a transmission system in which a SONET/SDH network and an IP network are connected with optical LAN-IF. The SONET/SDH transmitter has a redundancy transmission line structure consisting of two transmission lines, a K-packet processing section, and a transmitting section. The K-packet processing section is used for generating a specific byte (SONET K1/K2 byte) of data representing transmission-line switching control information about the transmission lines, packetizing the generated data, and outputting a packet. The transmitting section is used for transmitting the packet to the transmitter provided opposite through the transmission lines. This SONET/SDH transmitter further has a redundancy line switching section.Type: ApplicationFiled: March 26, 2002Publication date: April 24, 2003Inventors: Hirotaka Morita, Yoshinobu Takagi, Takuya Miyashita, Chiyoko Komatsu