2
TECHNICAL FIELD
[0001] The present subject matter relates to wireless networks and, particularly but not exclusively, to reducing redundant traffic in wireless networks.
BACKGROUND
[0002] Wireless networks, such as cellular networks, are often used for accessing data available on the internet. The number of users using internet services has increased substantially over the years. This has led to development and deployment of techniques which increase the capacity and the bandwidth of the wireless networks. In recent times, the standards for wireless communication, such as Long Term Evolution (LTE), facilitate high speed data transfer. However, the increasing popularity of data intensive applications and services, such as streaming video applications, quickly exhaust the capacity and the bandwidth of the wireless networks. This results in degradation of the quality of experience of the users.
[0003] Further, in many cases, multiple users download the same content, from various sources, over the wireless network. For example, different users may download the same video file of a popular movie or a song. This increases the data traffic that is transmitted over the wireless network. The service providers operating the wireless network usually upgrade their existing network infrastructure to address the increasing demand for high speed data transfer. However, the same is expensive and time-consuming. In certain scenarios, service providers, during selected time intervals, may block some applications that are data intensive during selected time intervals of the day so as to manage the demand for data transfer. This leads to dissatisfaction of the users who are unable to access their applications when they wish.
SUMMARY
[0004] This summary is provided to introduce concepts related to reducing redundant traffic in wireless networks. This summary is neither intended to identify essential features of the claimed subject matter nor for use in determining or limiting the scope of the claimed subject matter.
[0005] In one implementation, the method for reducing redundant traffic in wireless network comprises receiving, by a second computing system, a hash of a
3
portion of data from a first computing system and determining whether the portion of data is present within the second computing system The method further comprises transmitting the portion of data to the first computing system, based on the determining over a peer to peer protocol.
[0006] In another implementation, the method for reducing redundant traffic in wireless network comprises receiving a request from a first computing system (102) to download data and identifying a second computing system which has at least a portion of the data. The method further comprises transmitting a request to a second computing system to transfer the portion of the data to the first computing system and transmitting instructions for the second computing system to establish a communication channel with the first computing system for the transfer.
[0007] In another implementation, a computing system, for reducing redundant traffic in wireless networks, comprises a processor and a data request module, coupled to the processor, to receive a hash of a portion of data from a first computing system. The computing system further comprises a data comparison module, coupled to the processor, to determine whether the portion of data is present within the computing system and a data receiving module to transmit the portion of data to the first computing system, based on the determining.
[0008] In yet another implementation, a non-transitory computer-readable medium having a set of computer readable instructions that, when executed, cause a base station system to receive a request from a first computing system to download data and identify a second computing system which has at least a portion of the data. The base station system further transmits a request to a second computing system to transfer the portion of the data to the first computing system and transmit instructions for the second computing system to establish a communication channel with the first computing system for the transfer.
BRIEF DESCRIPTION OF DRAWINGS
[0009] The detailed description is described with reference to the accompanying figures. In the figures, the left-most digit(s) of a reference number identifies the figure in which the reference number first appears. The same numbers are used throughout the figures to reference like features and components:
4
[0010] Figures 1a and 1b schematically illustrate network implementations of a computing system for reducing redundant traffic in wireless networks, according to an example of the present subject matter.
[0011] Figure 2 schematically illustrates the components of the computing system and a base station system for reducing redundant traffic in wireless networks, according to an example of the present subject matter.
[0012] Figures 3a and 3b schematically illustrate methods for reducing redundant traffic in wireless networks, according to an example of the present subject matter.
DETAILED DESCRIPTION
[0013] The present subject matter relates to systems and methods for reducing redundant traffic in wireless networks. The methods and systems as described herein may be implemented as any computing system capable of receiving data from a wireless network. Example of such computing systems may include mobile phones, smart phones, tablets, digital cameras, and personal digital assistants.
[0014] To reduce data traffic in wired networks, redundancy elimination (RE) techniques are implemented. However, the RE techniques have been implemented in wireless networks to a very limited extent as wireless networks operate in a very different manner from the wired networks. For example, in wireless networks, even though the medium of wireless communication is shared, the computing systems are aware of only their own data packets and are unaware of the data packets of other computing systems. Further, the commercially available RE techniques are effective when there is synchronization between the computing system sending the data and the computing system receiving the data. In wireless networks the synchronization is difficult to achieve as the rate of loss of data packets is higher as compared to wired network.
[0015] Another technique which has been commercially used to reduce data traffic in wireless networks is data compression. However, various data compression techniques have tradeoffs, such as ------ against -----. The effectiveness of the data compression techniques depends on the nature of the data traffic, format of the data being transferred, and so on. Generally, the data compression technique to be implemented for a wireless network is selected based on the statistical analysis of the
5
data traffic of the wireless network over a predefined previous time interval. Thus, the implemented data compression technique may soon be outdated.
[0016] The systems and methods, described herein, reduce redundant data traffic in wireless networks. In one implementation, the computing system for reducing redundant data traffic in wireless networks may be implemented in any commercially available computing system having an interface for connecting to wireless networks, such as mobile phones, smart phones, digital cameras, laptops, and navigation systems.
[0017] In operation, a base station of a service provider of the wireless network and computing systems cache a programmable predefined number, represented by N, corresponding to a number of packets of data sent and received by each of the base station and the computing systems. In one example, the number, N, is configured by the service providers and the manufacturers of the computing system. The base station may maintain a separate cache corresponding to each of the computing systems connected to it. In one example, the base station may maintain an index or hash table for the packets present in the cache. In said example, the hashes of the data or parts of the data may be the keys of the index and the locations of the packets in the cache may be the values.
[0018] On receiving a request for data from a requesting computing system, the base station ascertains whether packets corresponding to the requested data or parts of the request data are present the cache of any of the computing systems connected to it. In one implementation, the base station may conduct a search on the index to determine whether packets corresponding to the requested data or parts of the request data are present in the cache of any of the computing systems connected to it. If the base station detects a hit, i.e. a match of the requested data and data packets present in the cache of one of the connected computing system, the base station transmits control signals to the connected computing system, henceforth referred to as the forwarder computing system, and requests it to transmit the data packets, corresponding to the requested data, to the requesting computing system. On receiving a confirmation from the forwarder computing system, the base station transmits an encoded header to the forwarder computing system. The encoded header may include unique identifiers for the packets, the offset from where the matched part(s) begin, and the length of the matched parts. The forwarder computing system decodes the header received from the base station by looking up at its own cache and forwards the matching parts of the data directly to the requesting computing system, for example, by using peer to peer (P2P) connection.
6
[0019] In one example, the base station may maintain a database of the computing systems which may communicate using P2P protocol and the computing systems which are willing to transmit data to other computing systems over P2P protocol. The base station may update the database at regular intervals or on receiving a request from one or more of the connected computing systems.
[0020] In another example, the base station may have to transmit a first content to a first computing system and a second content to a second computing system. In said example, there may be a scenario, wherein the first computing system already has the second content, the second computing system already has the first content and the third computing system includes both the first content and the second content. In such a scenario, the base station may select the third computing system for P2P transmission as the same provides opportunities for leveraging network coding.
[0021] In operation, the base station may transmit the encoded headers for both the first and the second contents to the third computing system. The third computing system reconstructs the first and the second contents from its cache, combines the first and the second contents to a single content and multicasts it simultaneously to the first and second computing systems using P2P. On receipt of the combined packet, the first computing system retrieves the first content, for example by performing an exclusive or (XOR) of the received content and the second content that the first computing system already had. The second computing system may also retrieve the second content in a similar manner. Thus, by selecting the third computing system, the base station facilitates network coding and reduces the total data traffic in the wireless network.
[0022] As mentioned earlier, the computing systems maintain their own cache. Based on various parameters, such as the volume of storage possessed by the computing system, each computing system may refresh the values in its cache at regular time intervals. This may lead to cache incoherence between the cache maintained at the computing system and the cache, corresponding to the computing system, maintained by the base station. Further, cache inconsistencies may also occur when any computing system associated with the base station, obtains data from other sources, such as Bluetooth and Wi-Fi. The present subject matter provides for mechanism to reduce the effect of cache incoherence.
[0023] For example, in one scenario, the base station transmits a large volume of data, such as a high definition video file, to the first computing system. On receiving a data packet from the base station, the first computing system computes hashes of
7
received data or parts of the received data and broadcasts the hashes, at regular time intervals, to other computing systems within a predefined radius.
[0024] In one example, the first computing system may transmit the hashes to the second computing system and the third computing system. In case any of the nearby computing systems determines that it already possess the requested data, it voluntarily reveals its cache information to the base station. In said example, the second computing system determines that it already possesses the data requested by the first computing system. The base station then initiates P2P transmission of the requested data from the second computing system to the first computing system. Thus the bandwidth usage in downlink from base station to the first computing system is significantly reduced.
[0025] In one example, the computing systems may transmit collision-resistant hashes, such as SHA-1 hashes and 8B Jenkins Hash plus checksum, along with the data to the requesting computing system. The base station would also send the same hashes to the requesting computing system. The requesting computing system may then ascertain whether there is a match between the hashes received from the computing systems and the base stations. On determining a match, the requesting computing system can verify the integrity of obtained data from the computing system. In case, the requesting computing system determines that the hashes do not match, the requesting computing system notifies base-station about the malicious computing system. This prevents the spread of unauthorized of malicious content.
[0026] Thus, the computing system for reducing redundant traffic in wireless networks as described above facilitates reducing data traffic in wireless networks by initiating P2P transmission of data amongst computing systems.
[0027] The above systems and methods are further described in conjunction with the following figures. It should be noted that the description and figures merely illustrate the principles of the present subject matter. It will thus be appreciated that those skilled in the art will be able to devise various arrangements that, although not explicitly described or shown herein, embody the principles of the present subject matter and are included within its spirit and scope. Furthermore, all examples recited herein are principally intended expressly for pedagogical purposes to aid the reader in understanding the principles of the present subject matter and the concepts contributed by the inventor(s) to furthering the art, and are to be construed as being without limitation to such specifically recited examples and conditions. Moreover, all statements
8
herein reciting principles, aspects, and examples of the present subject matter, as well as specific examples thereof, are intended to encompass equivalents thereof.
[0028] The manner in which the systems and methods for context based scanning are implemented shall be explained in details with respect to Figures 1a, 1b, 2, 3a and 3b. While aspects of described systems and methods for reducing redundant traffic in wireless networks can be implemented in any number of different computing systems, environments, and/or configurations, the examples and implementations are described in the context of the following system(s).
[0029] Figures 1a and 1b schematically illustrate a network implementation 100 of a computing system, such as the computing systems 102-1 and 102-2, for reducing redundant traffic in wireless networks, according to examples of the present subject matter. The computing systems 102-1 and 102-2 are collectively referred to as computing systems 102 and singularly as computing system 102. In one example, the computing system 102 may be implemented as a mobile phone, smart phone, laptop, tablet, digital camera, multimedia player, navigation systems and personal digital assistants.
[0030] The network implementation 100 further includes a base station system (BSS) 104. The BSS 104 may be implemented as any commercially available computing system, such as a workstation, a server and a network server. In one example, the BSS 104 can be communicatively coupled to cell tower 106 which implements a wireless network. Examples of the wireless network implemented by the BSS 104 include Global System for Mobile Communication (GSM) network, Universal Mobile Telecommunications System (UMTS) network, Personal Communications Service (PCS) network, Time Division Multiple Access (TDMA) network, Code Division Multiple Access (CDMA) network, Next Generation Network (NGN), IP-based network, Public Switched Telephone Network (PSTN), Integrated Services Digital Network (ISDN), Long Term Evolution (LTE) networks, networks that use a variety of protocols, for example, Hypertext Transfer Protocol (HTTP), Transmission Control Protocol/Internet Protocol (TCP/IP), Wireless Application Protocol (WAP). The cell tower may be connected to the computing systems 102 using radio channels.
[0031] With reference to Figure 1a, in operation, a requesting computing system 102-1 sends a request to the BSS 104 for data indicated by block 108-1. On receiving the request, the BSS 104 ascertains whether packets corresponding to the requested data 108-1 or parts of the request data 108-2 are present the cache of any of the computing
9
systems 102 connected to it. In one example, say the computing system 102-2 already possess data indicated by block 108-2. The data indicated by block 108-2 may be identical to data indicated by block 108-1. On detecting a hit, a redundancy reduction module 110 of the BSS 104 transmits control signals to the connected computing system 102-2, henceforth referred to as the forwarder computing system 102-2, and requests the forwarder computing system 102-2 to transmit the data packets, corresponding to the requested data, to the requesting computing system 102.
[0032] The forwarder computing system 102-2 thereafter sends an acknowledgement message to the BSS 104 indicating the availability of the forwarder computing system 102-2 to transmit the data packets, corresponding to the requested data, to the requesting computing system 102. On receiving a confirmation from the forwarder computing system 102-2, the BSS 104 transmits an encoded header to the forwarder computing system 102-2. The forwarder computing system 102-2 decodes the header by looking up its own cache and forwards the matching parts of the data to the requesting computing system 102-1 directly, for example by using peer to peer (P2P) connection 112.
[0033] With reference to Figure 1b, in operation the BSS 104 may have to transmit a first content 116-1 to the first computing system 102-1 and a second content 116-2 to the second computing system 116-2. In said example, there may be a scenario, wherein the first computing system 102-1 already has the second content 116-2, the second computing system 102-2 already has the first content 116-1 and the third computing system 102-3 includes both the first content 116-1 and the second content 116-2.
[0034] In operation, the BSS 104 transmits the encoded headers for both first content 116-1 and second content 116-2 to the third computing system 102-3. The third computing system 102-3 reconstructs the first content 116-1 and second content 116-2 from its cache. The third computing system 102-3 then combines the first and second contents to a single content 118 and multicasts it to the first computing system 102-1 and second computing system 102-2 using P2P channels 112-1 and 112-2 simultaneously in one transmission. On receipt of the combined packet 118, the first computing system 112-1 retrieves the first content by performing an exclusive or (XOR) of the received content 118 and the second content 116-2 that the first computing system 102-1 already had. The second computing system 102-2 may also retrieve the second content 116-2 in a similar manner. Thus, by selecting the third computing system 102-3,
10
the BSS 104 facilitates network coding and reduces the total data traffic in the wireless network. Thus the bandwidth usage in downlink from the BSS 104 to the first computing system 102-1 and the second computing system 102-2 can be significantly reduced.
[0035] Figure 2 schematically illustrates the components of the computing system 102 and the base station system 104 for reducing redundant traffic in wireless networks, according to an example of the present subject matter.
[0036] In one implementation, the computing system 102 and the BSS 104 include a processor 202-2 and a base station processor 202-1. The processor 202-2 and a base station processor 202-1 are collectively referred to as the processors 202. The processor 202 may include microprocessors, microcomputers, microcontrollers, digital signal processors, central processing units, state machines, logic circuitries and/or any other devices that manipulate signals and data based on computer-readable instructions. Among other capabilities, the processor 202 may fetch and execute computer-readable instructions stored in a memory of the computing system 102 and the BSS 104.
[0037] Functions of the various elements shown in the figures, including any functional blocks labeled as “processor(s)”, may be provided through the use of dedicated hardware as well as hardware capable of executing computer-readable instructions.
[0038] Further, the BSS 104 may include modules 204-1 and the computing system 102 may include modules 204-2. The modules 204-1 and 204-2 may be coupled to the processor 202. The modules 204-1 and 204-2 amongst other things, include routines, programs, objects, components, and data structures, which perform particular tasks or implement particular abstract data types. The modules 204-1 and 204-2 may also be implemented as, signal processor(s), state machine(s), logic circuitries, and/or any other device or component that manipulate signals based on computer-readable instructions.
[0039] In said implementation, the modules 204-1 include a computing system selection (CSS) module 208, a P2P connection initiation module 210, the redundant reduction module 110 and other module(s) 212-1. The modules 204-2 include a data request module 218, a data comparison module 220, a data receiving module 222 and other modules 212-2. The other module(s) 212-1 and 212-2 may include computer-
11
readable instructions that supplement applications or functions performed by the BSS 104 and the computing system 102 respectively.
[0040] Further, the BSS 104 may also include data 206-1 and the computing system 102 may include data 206-2. The data 206-1 includes data cache 214-1, P2P sharing data 216-1 and other data 224-1. The data 206-2 may include data cache 214-2, P2P sharing data 216-2 and other data 224-2. The other data 224-1 and 224-2 may include data generated and saved by the modules 208-1 and 208-2 for providing various functionalities of the BSS 104 and the computing system 100.
[0041] In operation, the data request module 218 of the requesting computing system 102 sends a request to the BSS 104 for data. In one implementation, the request may be initiated may be initiated by an application, such as an update software, running on the requesting computing system 102. In another example, the request may be initiated based on user input. The request for data can be received by the redundancy reduction module 114. The redundancy reduction module 114 scans the data cache 214-1 to ascertain whether packets corresponding to the requested data 108-1 or parts of the request data are present in the cache maintained for any of the computing systems 102 connected to the BSS 104. In one example, the redundancy reduction module 114 may maintain an index or hash table for the packets present in the data cache 214-1cache to increase the efficiency and speed of the ascertaining.
[0042] On detecting a hit, the redundancy reduction module 110 transmits control signals to the forwarder computing system 102-2, and requests the forwarder computing system 102-2 to transmit the data packets, corresponding to the requested data, to the requesting computing system 102. Thereafter, data request module 218 of the forwarder computing system 102 sends an acknowledgement message to the BSS 104 indicating the availability of the forwarder computing system 102-2 to transmit the data packets, corresponding to the requested data, to the requesting computing system 102. On receiving a confirmation from the forwarder computing system 102-2, the P2P_ connection initiation module 210 transmits an encoded header to the forwarder computing system 102-2. The forwarder computing system 102-2 decodes the header by looking up its own cache and forwards the matching parts of the data to the requesting computing system 102-1 directly, for example by using peer to peer (P2P) connection 112.
[0043] In another scenario, the BSS 104 may leverage network coding to further reduce the traffic in the wireless network. As mentioned in an earlier example, there
12
may be a scenario wherein based on requests received from a first computing system 102 and a second computing system 102, the BSS 104 may have to transmit a first content 116-1 to the first computing system 102 and a second content 116 to the second computing system 116-2. Further, in said scenario, there may be case wherein the first computing system 102-1 already has the second content 116-2, the second computing system 102-2 already has the first content 116-1 and the third computing system 102-3 includes both the first content 116-1 and the second content 116-2.
[0044] In operation, the CS selection module 208 may identify or select the first, second and the third computing systems 102 based on the comparison of the cache maintained for each of the first, second and the third computing systems 102. In said example, the P2P connection initiation module 210 transmits the encoded headers for both first content 116-1 and second content 116-2 to the third computing system 102. The third computing system 102 combines the first and second contents to a single content 118 and multicasts it to the first computing system 102 and second computing system 102 simultaneously in one transmission. On receipt of the combined packet 118, the first computing system 102 retrieves the first content by performing an exclusive or (XOR) of the received content 118 and the second content 116-2 that the first computing system 102 already had. The second computing system 102 may also retrieve the second content 116-2 in a similar manner. Thus, by selecting the third computing system 102-3, the BSS 104 facilitates network coding and reduces the total data traffic in the wireless network. Thus the bandwidth usage in downlink from the BSS 104 to the first computing system 102 and the second computing system 102 is significantly reduced.
[0045] As mentioned earlier, the computing systems 102 maintain their own cache as data cache 214-2. Based on various parameters, such as the volume of storage possessed by the computing system, each computing system 102 refreshes the values in its data cache 214-2 at regular time intervals. This may lead to cache incoherence between the data cache maintained at the computing system 214-2 and the data cache 214-1, corresponding to the computing system 102, maintained by the BSS 104. Further, cache inconsistencies may also occur when the computing system 102 obtains data from other sources.
[0046] In one scenario, the BSS 104 transmits a large volume of data, such as a high definition video file, to the first computing system 102. On receiving a data packet from the BSS 104 by the data receiving module 222 of the first computing system 102, the data request module 218 computes hashes of received data or parts of the received
13
data and broadcasts the hashes, at regular time intervals, to other computing systems 102 within a predefined radius.
[0047] As stated in an earlier example, the first computing system 102 may transmit the hashes to the second computing system 102 and the third computing system 102. The data comparison module 220 of the computing systems 102 may determine whether it already possess the requested data based on comparison of the received hash and a hash computed based on the data possessed by the computing systems 102. On determining that the computing system 102 possesses the data, the data request module 220 voluntarily reveals its cache information to the BSS 104. In said example, the second computing system 102 determines that it already possesses the data requested by the first computing system 102. The P2P_ connection initiation module 210 then initiates P2P transmission of the requested data from the second computing system to the first computing system. Thus the bandwidth usage in downlink from BSS 104 to the first computing system 102 is significantly reduced.
[0048] Figures 3a and 3b schematically illustrate methods 300 and 350 respectively for reducing redundant traffic in wireless networks, according to an example of the present subject matter.. The order in which the methods 300 and 350 are described is not intended to be construed as a limitation, and any number of the described method blocks can be combined in any order to implement methods 300 and 350, or an alternative method. Additionally, individual blocks may be deleted from the methods 300 and 350 without departing from the spirit and scope of the subject matter described herein. Furthermore, the methods 300 and 350 may be implemented in any suitable hardware, machine readable instructions, firmware, or combination thereof.
[0049] In one example, the steps of the methods 300 and 350 can be performed by programmed computers. Herein, some examples are also intended to cover program storage devices, for example, digital data storage media, which are machine or computer readable and encode machine-executable or computer-executable programs of instructions, where said instructions perform some or all of the steps of the described methods 300 and 350. The program storage devices may be, for example, digital memories, magnetic storage media such as a magnetic disks and magnetic tapes, hard drives, or optically readable digital data storage media.
[0050] With reference to method 300 as depicted in Figure 3a, as depicted in block 302 a request can be received from the computing system 102 to download data.
14
In one example, the redundancy reduction module 110 of the BSS 104 receives the request from the computing system 102.
[0051] As illustrated in block 304, at least one computing system 102, which has a portion of the data, can be identified. In one implementation, the CS selection module 208 identifies at least one computing system 102 which has a portion of the data. In said implementation, the CS selection module 208 may scan the data cache 214-1 to identify the at least one computing system 102.
[0052] As shown in block 306, a request can be transmitted to the at least one computing system 102 to transmit the portion of the data to the computing system 102. In one example, the P2P connection initiation module 210 generates and sends the request to the at least one computing system 102 to transmit the portion of the data to the computing system 102.
[0053] As depicted in block 308, instructions are transmitted to initiate a communication channel between the computing system and the at least one computing system. In one example, the P2P connection initiation module 210 transmits instructions to at least one computing system 102 to establish a communication channel with the computing system 102 based on various commercially available protocols, such as P2P protocol.
[0054] With reference to method 350 as depicted in Figure 3b, as depicted in block 352, a hash of a portion of data can be received from the first computing system 102 downloading data. In one implementation, the data receiving module 222 receives the hash from the first computing system 102.
[0055] At block 354 it can be determined whether a portion of the data can be stored within the computing system 102. In one implementation, the data comparison module 220 compares the received hash with the hash of data stored within the computing system 102. Based on the comparison, the data comparison module 220 determines whether the portion of the data can be stored within the computing system 102.
[0056] If at block 354 it can be determined that the portion of the data can be stored within the computing system 102 then, as illustrated at block 356, cache information can be transmitted to the BSS 104. In one implementation, the data request module 218 transmits the cache information present in the data cache 214-2 to the BSS 104.
15
[0057] As shown in block 358, instructions are received to initiate a communication channel with the first computing system 102. In one implementation, the data receiving module 218 receives the instructions from the BSS 104.
[0058] As depicted in block 360, a communication channel with the first computing system 102 can be established. In one example, the data request module 218 establishes the communication channel with the first computing system 102.
[0059] As illustrated in block 362, portion of the data can be transmitted to the first computing system 102. In one implementation, the data request module 218 transmits the data to the first computing system 102 using various protocols, such as P2P protocol.
[0060] If at block 354 it can be determined that the portion of the data can be not stored within the computing system 102 then, as illustrated at block 364, the operation can be aborted.
[0061] Although implementations for reducing redundant traffic in wireless networks have been described in language specific to structural features and/or methods, it is to be understood that the appended claims are not necessarily limited to the specific features or methods described. Rather, the specific features and methods are disclosed as examples of systems and methods for reducing redundant traffic in wireless networks.
16
I/We claim:
1. A method for reducing redundant traffic in a wireless network, the method comprising:
receiving a request from a first computing system (102) to download data, the first computing system is connected to the wireless network;
identifying a second computing system which has at least a portion of the data, the second computing system is connected to the wireless network;
transmitting a request to the second computing system to transfer the portion of the data to the first computing system; and
transmitting instructions to the second computing system for establishing a communication channel with the first computing system to transfer the data.
2. The method as claimed in claim 1, wherein the identifying further comprises:
generating hashes for portions of the data
scanning data cache maintained for a plurality of computing systems; and
ascertaining a match between at least one generated hash and a hash stored in the data cache.
3. The method as claimed in claim 1, further comprising:
receiving an updated cache from at least one computing system; and
updating the data cache maintained for the at least one data cache.
4. The method as claimed in claim 1, further comprising processing the text of the digital document to format the text based on at least one formatting style of the application.
5. The method as claimed in claim 1, the method further comprising:
receiving a security hash from the second computing system;
transmitting the security hash to the first computing system;
receiving a notification from the first computing system whether the transmitted security hash matches the security hash received by the first computing system from the second computing system; and
17
updating a list of safe forwarder computing systems based on the notification.
6. A method for reducing redundant traffic in wireless networks, the method comprising:
receiving, by a second computing system, a hash of a portion of data from a first computing system;
determining whether the portion of data is present within the second computing system; and
transmitting the portion of data to the first computing system, based on the determining, over a peer to peer protocol.
7. The method as claimed in claim 6, further comprising:
transmitting cache information of the second computing system to a base station system;
receiving instructions from the base station system to initiate a communication channel with the first computing system; and
establishing the communication channel with the first computing system for transmitting the portion of data.
8. The method as claimed in claim 6, further comprising: transmitting a security hash to the base station system and the first computing system.
9. A computing system (102) for reducing redundant traffic in a wireless network, the computing system (102) comprising:
a processor (202-2);
a data request module (218), coupled to the processor (202-2), to receive a hash of a portion of data from a first computing system;
a data comparison module (220), coupled to the processor (202-2), to determine whether the portion of data is present within the computing system (102); and
a data receiving module (222), coupled to the processor (202-2), to transmit the portion of data to the first computing system, based on the determination.
18
10. The computing system (102) as claimed in claim 9, wherein the data request module (218) further transmits a security hash to the base station system and the first computing system.
11. The computing system (102) as claimed in claim 9, wherein the data request module (218) further transmits a request to the base station system to update cache information associated the computing system (102).
12. A non-transitory computer-readable medium having a set of computer readable instructions that, when executed, cause a base station system to:
receive a request from a first computing system (102) to download data;
identify a second computing system which has at least a portion of the data;
transmit a request to a second computing system to transfer the portion of the data to the first computing system; and
transmit instructions for the second computing system to establish a communication channel with the first computing system for the transfer.
Dated 22 March 2013
DAMODAR PANDHARINATH VAIDYA
IN/PA-1431
Agent for the Applicant
To,
The Controller of Patents
The Patent Office at New Delhi