Classifications

• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
  • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
  • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
  • G06F16/275—Synchronous replication
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F11/00—Error detection; Error correction; Monitoring
  • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
  • G06F11/14—Error detection or correction of the data by redundancy in operation
  • G06F11/1402—Saving, restoring, recovering or retrying
  • G06F11/1471—Saving, restoring, recovering or retrying involving logging of persistent data for recovery
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L45/00—Routing or path finding of packets in data switching networks
  • H04L45/02—Topology update or discovery
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L45/00—Routing or path finding of packets in data switching networks
  • H04L45/74—Address processing for routing
  • H04L45/745—Address table lookup; Address filtering
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/01—Protocols
  • H04L67/10—Protocols in which an application is distributed across nodes in the network
  • H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/50—Network services
  • H04L67/56—Provisioning of proxy services
  • H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F11/00—Error detection; Error correction; Monitoring
  • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
  • G06F11/16—Error detection or correction of the data by redundancy in hardware
  • G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
  • G06F11/2053—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where persistent mass storage functionality or persistent mass storage control functionality is redundant
  • G06F11/2094—Redundant storage or storage space
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
  • G06F2201/80—Database-specific techniques
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L12/00—Data switching networks
  • H04L12/02—Details
  • H04L12/16—Arrangements for providing special services to substations
  • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast

Definitions

• Embodiments of the present disclosure relate to devices and associated methods for maintaining distributed storage in a network environment, and more specifically, but not limited to, a system and method for optimizing the distributed storage network environment.
• System administrators can distribute collections of data (e.g. in a database) across multiple physical locations.
• a distributed database can reside on network servers on the Internet, on corporate intranets, or on other company networks. As distributed databases store data across multiple computers, they improve performance at end-user by allowing transactions to be processed on many machines, instead of being limited to one.
• a distributed storage within the purview of the current invention may refer to a computer network where information is stored on more than one network node, e.g. in a replicated fashion. Thus, it may also refer to either a distributed database where users store information on a number of network nodes, or a computer network in which users store information on a number of peer network nodes.
• a person ordinary skilled in the art may very well know that in communication networks, a node may refer to a connection point, either a redistribution point or a communication endpoint (e.g. some terminal equipment).
• a physical network node is an active electronic device that is attached to a network, and is capable of sending, receiving, or forwarding information (e.g. data packets) over a communications channel.
• replication involves utilizing specialized software modules that look for changes in the distributive database. Once the changes have been identified, the replication process makes all the databases look the same i.e. contain similar data. The replication process can be tediously complex and time-consuming depending on the size and number of the distributed databases. This process also requires a lot of computer resources.
• the system and corresponding method in a typical embodiment of the instant invention offers a mechanism for the routers with minimal configuration from the user to determine the nature of the storage/database replication topology and then using the topology awareness, the routers are equipped to optimize the data storage/database replication streams.
• An embodiment of the invention provides a determination of the cluster topology of the underlying network by a router.
• a method and system for optimizing replication in a distributed network environment configured for hosting and communicating among plurality of data packets and a database [server], comprises of determining existing cluster topology of the network environment by one or more router(s) device(s) operating in the network; Identifying and optimizing a data replication stream/service in use in network environment , by said router(s);determining a routing scheme based on the cluster topology by the router device routing data packets though said network environment based on said routing scheme; applying predefined policy to a predefined set of router(s) corresponding to identified data replication stream by the router
• router device(s) determine existing cluster topology of the network environment using a set of edge router(s) and an edge router operating closest to said database server is a database node edge router.
• database node edge router contains configured data comprising of Internet Protocol Address of database node edge router, Data base cluster unique identifier ,Channel and associated policy configurations.
• master edge router optimizes data replication stream by enabling caching on edge router(s) and attaching a finger print to a payload associated with the cache.
• routing of data packets within the context of the instant invention comprises creating a path along with a label by a first router for routing a data packet to a third router using cached data of a second router, determining by the router 1 that a data packet to be transmitted to third router is cached in the second router and using a cached finger print along with the path label; Receiving by router 2 the fingerprint with corresponding label, processing the received packet data, converting the packet data with actual data and forwarding the actual data towards third router.
• the method and system is configured for Advertising/publishing the identified data replication stream/service by the edge router in the network environment, receiving and storing said advertised/published information by a database-aware router, subscribing to a master database edge router by the database-aware router, adding the database-aware router in a cluster as a SDER (Subscription Database Edge Router) after said subscription, configuring the corresponding SDER (Subscription Database Edge Router) for each added database-aware router, wherein master database edge router (MDER) on receiving a subscription request is configured for checking if requesting database-aware router or SDER is already subscribed , enabling caching on MDER-SDER link after determining that requesting database-aware router or SDER is already subscribed.
• SDER Subscribescription Database Edge Router
• the method and system are configured for sending a REDO log information as data packets to a subscriber node by its corresponding master DB node, intercepting said packet data by MDER (master database edge router) for determining REDO log information, caching said packet data after determining that it contains REDO log information and that cache is not already enabled.
• MDER master database edge router
• the method and system are configured for extracting destination address of a data packet by master database edge router via a lookup edge router information generating a finger print for the packet data for cache enabled edge router and storing and forwarding finger print data and packet, labeling the packet data and forwarding finger print and generating a label by master database edge router for the packet data and forwarding only finger print when it is determined that a finger print already exists.
• a master database edge router based on a determined topology of a DB cluster exhibits an optimal utilization of caching.
• the present invention provides for optimization of a replication streams OR a redo stream by a plurality of routers.
• the present disclosure in an embodiment of the invention provides a system (and a method) applying specific policies for different nature of streams expressed in terms of the DB (Database operations).
• FIGURE 1 illustrates an existing Single Master Replication mechanism.
• FIGURE 2 illustrates an existing Multi-master replication.
• FIGURE 3 illustrates Redundancy in Traditional Replication.
• FIGURE 4 illustrates a diagrammatic representation of an existing Multicast solution for Solving over- subscription in a distributed network environment.
• FIGURE 5 illustrates a diagrammatic representation of an existing solution for redundancy elimination.
• FIGURE 6 illustrates a diagrammatic representation of an existing solution for Packet Level Redundancy Detection.
• FIGURE 7 illustrates an exemplary distributed/replication database.
• FIGURE 8 illustrates an optimal Routing methodology based on Caching and Topology
• FIGURE 9 illustrates data configured in an exemplary MDER (Master DB Node Edge Router)
• FIGURE 10 illustrates a flow diagram depicting Advertisement and Subscription by MDER (Master DB Node Edge Router) in a distributed network environment.
• MDER Master DB Node Edge Router
• FIGURE 11 illustrates a flow diagram depicting REDO Caching Optimization.
• FIGURE 12 illustrates a sequence Diagram for REDO caching.
• FIGURE 13 illustrates an exemplary network diagram for cache based optimal routing.
• FIGURE 14 illustrates Path Creation for Cache Based Optimal Routing.
• FIGURE 15 illustrates a Geographically Distributed Multi-master DB Cluster.
• the connections shown are logical connections; the actual physical connections may be different. It is apparent to a person skilled in the art that the structure may also comprise other functions and structures. It should be appreciated that the functions, structures, elements and the protocols used in communication are irrelevant to the present disclosure. Therefore, they need not be discussed in more detail here.
• all logical units described and depicted in the figures include the software and/or hardware components required for the unit to function. Further, each unit may comprise within itself one or more components which are implicitly understood. These components may be operatively coupled to each other and be configured to communicate with each other to perform the function of the said unit.
• server architecture includes the infrastructure (e.g. hardware, software, and communication lines) that offers wireless network services.
• the operations in embodiment of the present invention may in certain embodiments are performed wirelessly during on-air or air interface.
• the operations described herein are operations performed by a network, device, computer or a machine, or in some embodiments in conjunction with a human operator or user that interacts with the computer or the machine.
• the programs, modules, processes, methods, data, and the like, described herein are but an exemplary implementation and are not related, or limited, to any particular computer, apparatus, or computer language. Rather, various types of general purpose computing machines or devices may be used with programs constructed in accordance with the teachings described herein.
• the instant mechanism advantageously provides a mechanism for a given set of edge routers to determine DataBase cluster topology given some minimal configuration.
• the edge routers are closest to a master DB (DataBase) node as the "Master DB Node Edge Router" or shortly “MDER”.
• the MDER (“Master DB Node Edge Router") is configured when a cluster comprising of a plurality of network nodes e.g. routers is being created.
• the router may offer CLI (Command Line Interface) or SNMP (Simple Network Management Protocol) or other configuration mechanisms to enable this configuration.
• the data configured in the MDER (“Master DB Node Edge Router") comprise:
• the edge routers within the purview of the instant invention are configured to detect the topology of data storage networks, replicated database cluster, distributed databases and distributed data storage.
• a router is a device that forwards data packets between computer networks, creating an overlay internetwork.
• a router may be typically connected to two or more data lines from different networks. When a data packet comes in one of the lines, the router reads the address information in the packet to determine its destination. Then, using information in its routing table or routing policy, it directs the packet to the next network on its journey. Thus, routers perform the "traffic directing" functions on the Internet.
• a person ordinary skilled in the art within the purview of the instant invention may note that a cluster within the purview of the instant invention consists of a set of loosely connected or tightly connected computers that work together so and are typically viewed as a single system.
• the MDER (“Master DB Node Edge Router") uses a suitable advertisement/publication mechanism to advertise/publish this service across the network.
• One of the advertisement ways is using the BGP (Border Gateway Protocol) advertisement/publication mechanism introduced in IETF ⁇ Internet Engineering Task Force) draft "draft-keyupate-bgp-services-02".
• the present invention also provides a framework for service advertisement/publishing and the same is described in detail via later paragraphs.
• FIG 1 illustrates an existing Single Master Replication mechanism.
• a transaction (104) made to a Master Database (101) is propagated to a subscriber database (102) and a subscriber database (103) via transactions (105) and (106) respectively.
• redundant copies are maintained at subscriber databases (102) (103).
• FIG. 2 illustrates an existing Multi-master replication mechanism.
• multiple master databases 201,202,203
• Any update made to a particular Master Database needs to be propagated to remaining Master databases for consistency.
• Master Database (201) when updated with a transaction (204) propagates the updates to remaining Master Databases (202,203). Same holds true for remaining master databases which propagate their updates to all other Master databases.
• FIG. 3 illustrates redundancy in an existing /traditional replication.
• Master Database (301) has two subscriber databases (302,303). Any change/update made to Master Database (301) needs to be propagated to all its subscribers (302,303). Therefore, whenever an update is made to Master Database (301), the Master Database (301) serves two copies of the update to subscriber database (302) and subscriber database (303). Said two copies are propagated within distributed network via a no. of intermediate routers. A copy of update made to Master Database is therefore repeated at each router for delivery to subscriber databases (302 and 303) using precious network resources and increasing redundancy manifold.
• Figure 4 illustrates a diagrammatic representation of an existing Multicast solution For Solving Over- subscription in a distributed network environment.
• Figure 5 illustrates a diagrammatic representation of an existing solution for Redundancy elimination.
• Figure 6 illustrates an existing solution for Packet Level Redundancy Detection.
• the basic solution to avoid over-subscription is the usage of multicast solutions.
• multicast solutions are available only for UDP (User Datagram Protocol).
• Most of the replication implementations are based on TCP (Transmission Control Protocol) which do not have optimal multicast solutions.
• TCP Transmission Control Protocol
• the UDP (User Datagram Protocol) multicast solutions also suffer from lack of reliability. Also to use multicast solutions require a lot of change in DataBase implementations which make the solutions more complex.
• Figure 7 illustrates an exemplary distributed/replication database of the instant invention.
• One of the many primary aspect of the invention deals with the determination of a cluster topology by a router operating in the distributed network environment of the instant invention. Such determination may utilize existing mechanisms standardized by IETF (Internet Engineering Task Force), e.g. including but not limited to "Service Advertisement Using BGP (Border Gateway Protocol), draft-keyupate-bgp-services-02".
• IETF Internet Engineering Task Force
• BGP Border Gateway Protocol
• draft-keyupate-bgp-services-02 draft-keyupate-bgp-services-02.
• the instant invention allows a router device to advertise (i.e. publish) a service using BGP protocol.
• instant invention in a typical embodiment uses this mechanism to publish a DataBase Replication Service.
• This mechanism as mentioned is merely an exemplary mechanism used to advertise in line with the objectives of the present invention.
• an edge router which is closest to a "Master DB node" is configured with the database replication information.
• the router advertises/publishes this service across the whole distributed network.
• the edge router which is closest to this node is also configured marking the role as a subscriber. Based on this configuration the router subscribes to the Master DataBase router. By this mechanism the routers are able to understand the underlying DataBase cluster topology.
• Another aspect of the instant invention deals with the optimization of replication streams (e.g. a redo stream needs to be optimized in case of a database replication) by the router devices.
• replication streams e.g. a redo stream needs to be optimized in case of a database replication
• the master DB (DataBase) node edge router need not use "sliding window” caching techniques (like Rabin's fingerprint), but can use a fixed pay load cache like MD5. Then the finger print is attached to the pay load and this is synchronized across the routers.
• a Master DB Node (701) maintains a master copy of the database.
• the Master DB Node (701) is accessible via a Master DB Router device (702).
• the Master DB router device (702) is specifically configured with Master DB information.
• Master DB router device (702) is further configurable to discover DB cluster topology using BGP advertisement.
• the Master DB router device (702) in effect, caches first REDO sent but advantageously sends a fingerprint for second REDO thereby saving precious network resources.
• subscriber DB routers (703) (707) are configured for subscriber DB information.
• the subscriber DB routers (703) (707) subscribe to Master DB router service.
• Figure 8 illustrates an optimal Routing methodology based on Caching and Topology Awareness.
• This aspect of the invention relates with the routing concepts for different topologies.
• One of the typical topologies is a multi-master DataBase cluster.
• the distributed network environment may adopt any of existing "Mesh” or a "star” schema.
• the master DB node router identifies the topology of the DB cluster to be of the above said nature, it computes the path to each node. Based on this computation the DB cluster establishes paths across the network which can use caching.
• the paths in exemplary embodiments, could be established by RSVP-TE (Resource Reservation Protocol - Traffic Engineering) or MPLS-TE mechanisms.
• Router- 1 determines a packet is cached in Router-2, but it has to be now transmitted to Router-3, it uses the cached fingerprint along with this path label.
• Router-2 on receiving the finger-print with the specific label, processes the packet and converts the packet data with the actual data and then forwards it to Router-3.
• This technical feature essentially saves "2 units of distance" which is otherwise redundant data.
• Another embodiment of the inventions deals with applying specific policies for different nature of streams expressed in terms of the DB operations e.g. like a "REDO stream”, “Full Mirror stream”, “Priority Stream”.
• the DataBase aware router is configured with various connection parameters along with policies.
• One exemplary embodiment includes a connection for an initial mirroring stream with maximum MTU ⁇ Maximum Transmission Unit ⁇ and compression.
• the DataBase aware router creates a label switched path using the policies mentioned. Such a label switched path is implemented via CSPF and LDP.
• the master DataBase node edge router determines the nature of the stream and applies appropriate policies.
• Figure 9 illustrates data configured in an exemplary MDER (Master DB Node Edge Router)
• Figure 10 illustrates a flow diagram depicting Advertisement and Subscription by MDER (Master DB Node Edge Router) in a distributed network environment
• the Advertisement and Subscription by MDER in line with the present invention includes, but not limited to, following steps.
• the MDER Master DB Node Edge Router
• Any router DB-aware router receives this advertisement and stores the advertisement information.
• the DB-aware router is configured for subscriber information and the corresponding cluster information the DB-aware router subscribes to the MDER for the subscription service.
• this node becomes the SDER (Subscriber DataBase Edge Router).
• the subscription in exemplary embodiments can be handled by one of the subscription protocols like XMPP, Jabber or SIP Presence (RFC-3265).
• the corresponding SDER Subscriber DataBase Edge Router
• SDER Subscriber DataBase Edge Router
• MDER Master DB Node Edge Router
• SDER Subscriber DataBase Edge Router
• the MDER on receiving a subscription checks if this SDER (Subscriber DataBase Edge Router) has already subscribed. If this SDER (Subscriber DataBase Edge Router) has already subscribed to the service, then the MDER enables cache on this MDER-SDER link.
• the master DataBase sends REDO log information to its subscriber.
• the MDER Master DB Node Edge Router
• the MDER intercepts the packet from the master DB node and tries to determine if this packet is a REDO log packet. Said determination in a typical embodiment may be achieved by configuration of IP no. and Port No.
• a specific (originating IP + Destination IP + Destination Port) could also be associated with a channel and the channel could be associated with REDO log policy.
• the MDER could be equipped with the packet format of a REDO message and by using DPI (Deep Packet Inspection) techniques could determine the nature of the packet.
• DPI Deep Packet Inspection
• a replication (Master) Service is configured at Master DB Edge Router (1001). Thereafter, replication service is advertised/published (1002) by Master DB Edge Router. The corresponding Subscriber DB Edge Router stores replication service advertisement (1003) and configures replication (subscriber) service (1004).
• Subscriber DB Edge Router determines whether an advertisement/publication for such a service already exists. If the advertisement for service exists, a subscription is sent by Subscriber DB Edge Router and the subscription is received (1007) at the Master DB Edge Router.
• the Master DB Edge Router on receiving said subscription determines if the router is already subscribed (1008) and if so, enables caching (1009) and then stores subscription details (1011). In case Router is not already subscribed, subscription details are stored (1011) (without enabling caching).
• Figure 11 illustrates a flow diagram depicting REDO Caching Optimization.
• the MDER Master DataBase Edge Router
• the MDER tries to cache it optimally. If more than one Subscriber node exists in this MDER-SDER path, this packet is sure to repeat.
• the MDER checks if cache is enabled on this MDER-SDER path. If enabled the MDER proceeds to handle the packet as described in the above flow chart.
• Another key point to note is that for cached packets, the packet is labeled. This label could be pre-negotiated with the SDER or statically configured with the SDER/MDER. Once the SDER receives a packet with this label, it will convert the fingerprint to the actual packet and forward the actual packet to the subscriber. It may be required that the TCP streams between Master-S 1 and Master-S2 are periodically reconciled. If not reconciled, the streams may have an offset because of network conditions and the caching will fail.
• a MDER Master DataBase Edge Router determines whether data packet received (1102) from a Master DataBase is REDO Data. (1103). In case the received data is REDO data, destination address is extracted from the data packet and matched with a lookup edge router information (1105).In case it is determined that data packet is not already cached for the Edge Router , the data packet is forwarded (1108).
• Fingerprinting a data packet within the purview of the instant invention is a method of creating a unique key using the characteristics of the packet, through which the packet can be uniquely determined in the cache.
• Optimistic caching a IP packet/data packet is based on the enablement of cache.
• the caching is performed for physical replication logs (REDO in case of DB) as well as for logical replication logs (SQL in case of DB)
• Figure 12 illustrates a corresponding sequence Diagram for optimized REDO caching as described above with reference to Figure 11.
• a Master Database sends a first REDO-1 (1200) towards Master DB Edge Router.
• the Master DB Edge Router in turn caches said received first REDO-1 (1202).
• Master DB Edge Router forwards the first REDO-1 along with a finger print towards a Subscriber DataBase (DB) Router (1203).
• the subscriber database router forwards the REDO-1 packet towards subscriber database (DB) (1).
• DB Subscriber DataBase
• DB Subscriber DataBase
• DB Subscriber DataBase
• DB Subscriber DataBase
• DB Subscriber DataBase
• DB Subscriber DataBase
• subscriber database router forwards REDO-1 towards Subscriber DataBase 2 (1207).
• FIGURE 13 illustrates an exemplary network diagram for cache based optimal routing
• the MDER after determining the topology of the DB (DataBase) cluster attempts to optimally use caching. If a new SDER is subscribed to the MDER and the SDER has only one subscriber, the MDER tries to find if there are any adjacent SDER which are already subscribed. If this holds true, the MDER tries to create a "switched path" for optimizing the MDER.
• DB DataBase
• a first REDO to S I (Subscriber One) is sent through R2 (Router two).
• the packet is marked for caching.
• the fingerprint is switched to R2 (Router Two).
• R2 (Router Two) retrieves the actual data packet and forwards it to R3 (Router Three) which then forwards it to S2 (Subscriber Two).
• exemplary embodiments of distributed network environment of present invention comprises of Master DataBase (M), two subscribers (S I, S2), one edge router (Rl) and two subscriber routers (R2, R3).
• M Master DataBase
• S I, S2 two subscribers
• Rl edge router
• R2, R3 two subscriber routers
• Master DataBase (M) sends two REDO's for two of its subscribers (S I, S2) (1301).
• the Edge Router (Rl) receives the two REDO's but sends only a FingerPrint to Router 2 (R2) for subscriber Two (S2).
• the Router R2 then sends a REDO for SI (Subscriber One) and also forwards a separate REDO to (Router Three) R3. Router Three (R3) in effect forwards REDO to Subscriber Two (S2).
• Figure 14 illustrates an exemplary path Creation for Cache Based Optimal Routing.
• the routers are made aware of multiple kind of DB replication traffic that flows between the DB (DataBase) nodes. Each kind of traffic is considered as a channel.
• the data replication traffic could be routine REDO (synchronization) traffic or Initial (or complete) mirroring or priority-packet (for some kind of DDL).
• REDO synchronization
• Initial or complete
• priority-packet for some kind of DDL.
• the router device of the instant invention creates rules in the router like compression enabled, complete redundancy elimination.
• the MDER also creates special paths or labels to accommodate these channels. For the initial (or complete) mirroring, the router creates a path which has the maximum MTU (Maximum Transmitting Unit). Similarly for a priority channel the MDER creates another labeled path to the destination. For the priority channel the MDER never enables compression.
• the mechanism for the MDER (Master DataBase Edge Router) to detect the channel includes but not limited to IP+Port configuration or using DPI.
• DB DataBase nodes actively interact with the routers to offer multiple inputs so that the router can operate optimally to build the topology.
• the routers are configurable to manage the streams, by implementing a configuration or management protocol like SNMP or Netconf.
• essentially database node interacts with the edge router to help the edge routers determine the nature of various packets which the routers can optimize very efficiently.
• a database node may offer replication topology insights e.g. when the database node determines that a peer node has gone off service then it actively indicates this information to the router. This makes the database respond to the actual situation of the topology faster.
• instant invention configures the ability of the database nodes and storage nodes to interact with the edge routers in order to offer a clear view of the "nature" of data being replicated so that the routers can optimize the data better.
• database nodes and storage nodes are also configured to interact with the edge routers to input the changes in the cluster topology so that the routers can make suitable adjustments.
• the CPU bus (1402) is, essentially, an interconnection wires that all subsystems are connected to. In general, only one pair of devices can talk to each other at a time, so communication of the bus must be coordinated to prevent message collisions. This coordination is often handled by the CPU (1401).
• the central processing unit (CPU) (1401) executes instructions contained in memory (1403). These instructions are executed at a rate specified by the computer's clock (1404).
• the CPU (1401) needs to access two different types of memory (1403) in order to execute a program.
• memory 1403
• ROM read-only memory
• EPROM erasable programmable read-only memory
• EEPROM electrically erasable programmable read-only memory
• Random access memory or RAM (1406) is used to temporarily store data and instructions.
• ROUTER device(s) and DataBase Nodes (404) of the present invention selectively comprise of:
• Signal control unit (not shown):
• Device Mainly comprising of CPU + software in memory + rf section, for controlling the bandwidth usage in device.
• Service provider network Mainly comprising of server + software in memory + rf section, for controlling the bandwidth usage in network.
• Device Mainly comprising of memory, for storing software + data associated with one or more services/tasks/operations as transceived by the said signal control unit.
• Service provider network Mainly comprising of memory, for storing software + data associated with one or more services/tasks/operations as transceived by the said signal control unit
• Device Mainly comprising of CPU + software in memory + speaker, for processing short switching trigger data pulse signal to accomplish the operations by performing output to the speaker after recalling the corresponding service memory from device and confirm to network provider/operator.
• Service provider network Mainly comprising of server + software in memory, for processing short switching trigger data pulse signal to accomplish the operations by transceiving to device and confirmation from device.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Theoretical Computer Science (AREA)
• Databases & Information Systems (AREA)
• Physics & Mathematics (AREA)
• General Engineering & Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Computing Systems (AREA)
• Data Mining & Analysis (AREA)
• Quality & Reliability (AREA)
• Data Exchanges In Wide-Area Networks (AREA)

Priority Applications (3)

Applications Claiming Priority (2)

Related Child Applications (1)

Publications (1)

Family

ID=54398509

Family Applications (1)

Country Status (5)

Cited By (1)

Families Citing this family (13)

Citations (4)

Family Cites Families (22)

• 2013
  • 2013-11-08 IN IN5044CH2013 patent/IN2013CH05044A/en unknown
• 2014
  • 2014-05-06 EP EP14860071.1A patent/EP3053047B1/en active Active
  • 2014-05-06 CN CN201480060023.XA patent/CN105683929B/zh active Active
  • 2014-05-06 WO PCT/CN2014/076844 patent/WO2015067013A1/en not_active Ceased
• 2016
  • 2016-05-06 US US15/148,910 patent/US10275412B2/en active Active

Patent Citations (4)

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events