Patent application number | Description | Published |
20150207881 | DEVICES AND METHODS FOR NETWORK-CODED AND CACHING-AIDED CONTENT DISTRIBUTION - A method for caching in a network includes determining popularities for a plurality of data files based on requests for the plurality of data files. The method includes sending random packets of the plurality of data files to at least one destination based on the popularities. The method may include ranking the plurality of data files from a most popular data file to a least popular data file using the determined popularities. The method may include selecting, for each data file, a number of random packets based on the ranking, wherein the sending sends the selected number of random packets for each data file. | 07-23-2015 |
20150207895 | DEVICES AND METHODS FOR NETWORK-CODED AND CACHING-AIDED CONTENT DISTRIBUTION - A method for transmitting data files in a network includes receiving requests from destination devices for packets of the data files. The method includes constructing a conflict graph such that (i) each packet requested by each destination device is represented by a distinct vertex in a plurality of vertices of the conflict graph, (ii) the plurality of vertices are associated with the destination devices, and (iii) links are created between the plurality of vertices based on which of the plurality of vertices represent a same requested packet and which requested packets are stored in caches belonging to destination devices. The method includes assigning the plurality of vertices to groups based on the links. The method includes coloring the plurality of vertices based on the assigning. The method includes combining the packets represented by vertices having a same color. The method includes sending the combined packets. | 07-23-2015 |
20150207896 | DEVICES AND METHODS FOR CONTENT DISTRIBUTION IN A COMMUNICATIONS NETWORK - According to at least one example embodiment, a method for transmitting data files in a network includes receiving requests from user devices for packets of the data files. The method includes constructing a conflict graph such that each packet requested by each user device is represented by a distinct vertex in a plurality of vertices of the conflict graph, the constructing being based on which of the plurality of vertices represent a same requested packet and which requested packets are stored in caches belonging to the user devices. The method includes coloring the plurality of vertices of the conflict graph to label the requested packets. The method includes combining the packets represented by vertices having a same color. The method includes sending the combined packets. | 07-23-2015 |
20150207903 | DEVICES AND METHODS FOR NETWORK-CODED AND CACHING-AIDED CONTENT DISTRIBUTION - A method for transmitting data files in a network includes receiving requests from destination devices for packets of the data files. The method includes constructing a conflict graph such that each packet requested by each destination device is represented by a distinct vertex in a plurality of vertices of the conflict graph, the plurality of vertices being associated with the destination devices. The method includes assigning labels to the plurality of vertices. The method includes assigning levels to the plurality of vertices. The method includes ordering the plurality of vertices from vertices having a highest level to vertices having a lowest level. The method includes coloring the plurality of vertices based on the ordering. The method includes combining the packets represented by vertices in the plurality of vertices having a same color. The method includes sending the combined packets. | 07-23-2015 |
Patent application number | Description | Published |
20130046889 | METHODS AND APPARATUSES FOR SCHEDULING USERS IN WIRELESS NETWORKS - In a method for scheduling a set of active users for transmission in a wireless network, a plurality of scheduling metrics are calculated based on system state information for the wireless network, and the set of active users are scheduled for transmission according to the candidate transmission schedule corresponding to a maximum scheduling metric from among the calculated scheduling metrics. Each of the plurality of scheduling metrics corresponding to a candidate transmission schedule among a plurality of candidate transmission schedules. | 02-21-2013 |
20130182634 | WIRELESS COMMUNICATION SYSTEMS, RELAY SYSTEMS AND METHODS OF RELAYING DATA - A wireless communication system includes at least one first relay configured to forward data received from at least one of a plurality of base stations, and to reduce intra-cell interference between a plurality of sectors of the plurality of base stations. | 07-18-2013 |
20140181282 | SYSTEM AND METHOD FOR MANAGING NETWORK INFORMATION - A method for managing information in a network includes identifying a first network entity storing a requested object, receiving the object from the first network entity, and storing the object in a storage area based on a parameter. The storage area is coupled to a second network entity which received the request and the object from the first network entity, and the parameter is indicative of an amount of energy for the second network entity to receive the object from the first network entity. | 06-26-2014 |
20150350415 | METHODS AND SYSTEMS FOR DETERMINING CROSSTALK FOR A JOINING LINE IN A VECTORED SYSTEM - At least one example embodiment discloses a method of determining crosstalk for a joining line in a communication system having a plurality of current active lines. The method includes obtaining a number of disturber lines among the plurality of current active lines, the number of disturber lines being less than a number of the plurality of current active lines, obtaining a pilot matrix, a first dimension of the pilot matrix being based on the number of disturber lines, the pilot matrix representing a sequence of pilots to be transmitted across the plurality of current active lines and the joining line, the first dimension being a number of time instances, the number of time instances being less than the number of the plurality of active lines and determining a crosstalk coupling vector for the joining line based on the pilot matrix. | 12-03-2015 |