Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

114 results about "Ip router" patented technology

The best way to find the IP address of your router is to use the command prompt. Open Run box and type “cmd” and hit enter. In the command prompt terminal, write the following command and execute. ipconfig. Your router IP address is listed in front of the “Default Gateway” text. This is the IP address of your router.

Method and apparatus to schedule packets through a crossbar switch with delay guarantees

A method for scheduling cell transmissions through a switch with rate and delay guarantees and with low jitter is proposed. The method applies to a classic input-buffered N×N crossbar switch without speedup. The time axis is divided into frames each containing F time-slots. An N×N traffic rate matrix specifies a quantized guaranteed traffic rate from each input port to each output port. The traffic rate matrix is transformed into a permutation with NF elements which is decomposed into F permutations of N elements using a recursive and fair decomposition method. Each permutation is used to configure the crossbar switch for one time-slot within a frame of size F time-slots, and all F permutations result in a Frame Schedule. In the frame schedule, the expected Inter-Departure Time (IDT) between cells in a flow equals the Ideal IDT and the delay jitter is bounded and small. For fixed frame size F, an individual flow can often be scheduled in O(logN) steps, while a complete reconfiguration requires O(NlogN) steps when implemented in a serial processor. An RSVP or Differentiated Services-like algorithm can be used to reserve bandwidth and buffer space in an IP-router, an ATM switch or MPLS switch during a connection setup phase, and the proposed method can be used to schedule traffic in each router or switch. Best-effort traffic can be scheduled using any existing dynamic scheduling algorithm to fill the remaining unused switch capacity within each Frame. The scheduling algorithm also supports multicast traffic.
Owner:SZYMANSKI TED HENRYK

Port-to-port, non-blocking, scalable optical router architecture and method for routing optical traffic

Embodiments of the present invention provide an optical network and switch architecture that provides non-blocking routing from an ingress router to an egress router in the network on a port-to-port basis. The present invention provides routing for fixed and variable length optical data packets of varying types (including Internet Protocol (IP), data, voice, TDM, ATM, voice over data, etc.) at speeds from sub-Terabit per second (Tbps), to significantly in excess of Petabit per second (Pbps). The present invention includes the functionality of both large IP routers and optical cross-connects combined with a unique, non-blocking optical switching and routing techniques to obtain benefits in speed and interconnected capacity in a data transport network. The present invention can utilize a TWDM wave slot transport scheme in conjunction with a just-in-time scheduling pattern and a unique optical switch configuration that provides for non-blocking transport of data from ingress to egress.One embodiment of the present invention includes a router comprising an ingress edge unit with one or more ports and an egress edge unit with one or more ports connected by a switch fabric. The ingress edge unit can receive optical data and convert the optical data into a plurality of micro lambdas, each micro lambda containing data destined for a particular egress edge port. The ingress edge unit can convert the incoming data to micro lambdas by generating a series of short-term parallel data bursts across multiple wavelengths. The ingress edge unit can also wavelength division multiplex and time domain multiplex each micro lambda for transmission to the switch fabric in a particular order. The switch fabric can receive the plurality of micro lambdas and route the plurality of micro lambdas to the plurality of egress edge units in a non-blocking manner. The router can also include a core controller that receives scheduling information from the plurality of ingress edge units and egress edge units. Based on the scheduling information, the core controller can develop a schedule pattern (i.e., a TWDM cycle) to coordinate the time domain multiplexing of micro lambdas at the plurality of ingress edge units and non-blocking switching of the micro lambdas at the switch fabric.
Owner:MIND FUSION LLC

Method and apparatus to schedule packets through a crossbar switch with delay guarantees

A method for scheduling cell transmissions through a switch with rate and delay guarantees and with low jitter is proposed. The method applies to a classic input-buffered N×N crossbar switch without speedup. The time axis is divided into frames each containing F time-slots. An N×N traffic rate matrix specifies a quantized guaranteed traffic rate from each input port to each output port. The traffic rate matrix is transformed into a permutation with NF elements which is decomposed into F permutations of N elements using a recursive and fair decomposition method. Each permutation is used to configure the crossbar switch for one time-slot within a frame of size F time-slots, and all F permutations result in a Frame Schedule. In the frame schedule, the expected Inter-Departure Time (IDT) between cells in a flow equals the Ideal IDT and the delay jitter is bounded and small. For fixed frame size F, an individual flow can often be scheduled in O(log N) steps, while a complete reconfiguration requires O(N log N) steps when implemented in a serial processor. An RSVP or Differentiated Services-like algorithm can be used to reserve bandwidth and buffer space in an IP-router, an ATM switch or MPLS switch during a connection setup phase, and the proposed method can be used to schedule traffic in each router or switch. Best-effort traffic can be scheduled using any existing dynamic scheduling algorithm to fill the remaining unused switch capacity within each Frame. The scheduling algorithm also supports multicast traffic.
Owner:SZYMANSKI TED HENRYK

Dynamic IP router tables using highest-priority matching

An improved system and method is provided for packet routing in dynamic router tables. Specifically, the invention relates to a method and system for using tree data structures to select the highest priority rule that matches a destination address in dynamic Internet packet routing tables. In an embodiment, a data structure called BOB (binary tree on binary tree) for dynamic router tables in which the rule filters are nonintersecting ranges and in which ties are broken by selecting the highest-priority rule that matches a destination address is disclosed. Prefix filters are a special case of nonintersecting ranges and the commonly used longest-prefix tie breaker is a special case of the highest-priority tie breaker. When an n-rule router table is represented using BOB, the highest-priority rule that matches a destination address may be found in O(log2n) time; a new rule maybe inserted and an old one deleted in O(log n) time. For the case when all rule filters are prefixes, the data structure PBOB (prefix BOB) permits highest-priority matching as well as rule insertion and deletion in O(W) time, where W is the length of the longest prefix, each. When all rule filters are prefixes and longest-prefix matching is to be done, the data structures LMPBOB (longest matching-prefix BOB) permits longest-prefix matching in O(W) time; rule insertion and deletion each take O(log n) time. On practical rule tables, BOB and PBOB perform each of the three dynamic-table operations in O(log n) time and with O(log n) cache misses. The number of cache misses incurred by LMPBOB is also O(log n).
Owner:UNIV OF FLORIDA RES FOUNDATION INC

Autoconfiguring IP routers

In automatically configuring network-layer addresses for network nodes in a network region, a specified router on each link generates link number request messages for the link. An address-assigning node assigns a region-wise unique link number to each link identified in a request message, and returns link number assignment messages containing the assigned link numbers. Each specified router assigns the link number from a received link number assignment message to a field of the network-layer addresses of the nodes on the associated link. According to a variation of the method, each specified router self-selects a link number and communicates with the other specified routers to avoid conflicts. Each specified router receives messages from the other specified routers containing numbers selected as region-wise unique link numbers for other links. Each specified router stores the received link numbers in association with the respective links in a local database. To configure a link number for the local link, a specified router selects a candidate region-wise unique link number not already associated with another link in the local database, generates a message containing the selected number, and propagates the message within the network region. Each specified router monitors the messages to detect when another specified router has selected the same link number. When this occurs, the specified router evaluates a conflict-resolution criterion to determine which router is entitled to keep a duplicate link number, and selects a new link number if necessary.
Owner:ORACLE INT CORP

General method for configuring WiFi device to make same to connect WiFi router

The invention discloses a general method for configuring a WiFi device to make the same to connect a WiFi router. The method includes the following steps that: step 1, a unidirectional physical data transmission channel is established between the WiFi device and the WiFi router; step 2, user configuration data are written and are adopted as multicast data packets, wherein the user configuration data include the SSID and password of the WiFi router; step 3, the WiFi router continuously sends the multicast packets through IP multicast; step 4, the WiFi device continuously scan all channels at intervals until a certain channel captures the multicast packets of a WiFi link layer, captures the multicast packets of the WiFi link layer, and filters the captured multicast data packets through a destination MAC address and multicast information so as to filter out illegal data packets, and obtains legitimate data packets, decrypts the data packets, performs analysis to obtain the SSID and password in the data, and is connected to the WiFi router; and step 5, if the WiFi device is successfully connected to the WiFi router, the WiFi device returns successful connection information to the WiFi device, otherwise, the method returns to the step 4, and scanning is further carried out.
Owner:SHENZHEN OGEMRAY TECH CO LTD

Method of providing quality of service (QOS) to voice applications in routed IP networks

A simplified methodology for accomplishing traffic management in a packet based network is achieved by allowing allocation of bandwidth based on a count of the number of endpoint connections associated with a specific service for a corresponding network device. A network device (e.g., IP router) can be configured to count the number of TCP/IP and UDP/IP connections and bandwidth usage per interface. The counting can be done by identifying the IP Addresses, Type of Service (TOS), and TCP/UDP and/or UDP/IP socket number range in the IP Header of a packet and then querying a specific communication type. When reaching the maximum allowed connections or bandwidth for a specific service, the network device (e.g., IP router) stops forwarding any new calls by means of dropping packets of new calls and informing the given endpoints to disconnect the new calls. In one exemplary embodiment of the invention, a procedure for managing traffic flowing through individual routers of a packet network includes the steps of reserving a given amount of bandwidth on interfaces of the individual routers for specific types of communications traffic, periodically querying endpoint connections based on data from a corresponding router connection table, receiving responses from the periodic querying to determine a current connection status and bandwidth allocation of said endpoints and calculating current bandwidth allocation for a specific type communications service on an interface handled by the router. The router admits additional communications traffic for a specific type of communications service if bandwidth is available.
Owner:LUCENT TECH INC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products