Patents by Inventor Dah Ming Chiu
Dah Ming Chiu has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9210451Abstract: Provided are systems and methods for making a replication decision in a P2P VoD architecture. A system according to the present application may comprise a plurality of peers; a plurality of videos distributed over the peers; and a server maintaining a replication indicator for each of the plurality of videos. In the system, each of the peers reports a first piece of information regarding one or more first videos of the plurality of videos which are stored in the peer and a second piece of information regarding a second video of the plurality of videos which is required to be stored in the peer to the server when the peer does not have enough space for storing the second video. The server then determines, according to the first and second pieces of information and the replication indicators for the first and the second videos, whether the peer is to replace one of the first videos with the second video.Type: GrantFiled: May 19, 2011Date of Patent: December 8, 2015Assignee: The Chinese University of Hong KongInventors: Yipeng Zhou, Zhengjia Fu, Dah Ming Chiu
-
Patent number: 9112771Abstract: Disclosed are a system and a method for catching top users. The system may comprise: a filter (10) configured to sample flows from the hosts and remove the flows not satisfying a constraint; an tracker (20) configured to record a first estimated flow count for each host and to determine a first set of hosts from the plurality of hosts in term of the estimated flow count; and an estimator (30) configured to determine a second estimated flow count for each of the determined hosts and select a second set of hosts from the determined hosts based on the second estimated flow count.Type: GrantFiled: February 5, 2010Date of Patent: August 18, 2015Assignee: The Chinese University of Hong KongInventors: Xingang Shi, Dah-Ming Chiu
-
Patent number: 8825886Abstract: A system and a method for evaluating transport of data segments of media content bitstream over a peer-to-peer network by streaming data chunks of a media content through a peer-to-peer network, generating network transport distortion on the data chunks using live experiments, simulation, or artificial generation, determining a playback strategy of each of the data segment at the receiver end, and evaluating a playback performance of the media content bitstream under the playback strategy.Type: GrantFiled: July 28, 2010Date of Patent: September 2, 2014Assignee: Hong Kong Applied Science and Technology Research Institute Company LimitedInventors: Zhibin Lei, Dah Ming Chiu, Zhengjia Fu
-
Patent number: 8681628Abstract: Disclosed are a method and a system for determining top spreaders in high speed network. The method may comprise: sampling a plurality of packets from the plurality of hosts during an interval of time; determining a difference between a count and a count error for each host based on the sampled packets; ranking the hosts based on the determined difference to identify a first set of hosts that are top in the ranked hosts; and selecting a second set of hosts from the first set of hosts as the top spreaders.Type: GrantFiled: September 10, 2009Date of Patent: March 25, 2014Assignee: The Chinese University of Hong KongInventors: Xingang Shi, Dah-Ming Chiu
-
Patent number: 8555323Abstract: There is disclosed a method for replicating media contents in a P2P VoD system comprising a plurality of peers. The method may comprise: determining that a candidate media unit shall be replicated into a local storage of one of the peers; checking whether said local storage has enough space to store the candidate media unit; if not, selecting one media unit previously stored in said local storage to be replaced; and replacing the selected media unit by the candidate media unit.Type: GrantFiled: September 28, 2010Date of Patent: October 8, 2013Assignee: The Chinese University of Hong KongInventors: Yipeng Zhou, Zhengjia Fu, Dah Ming Chiu
-
Publication number: 20120297432Abstract: Provided are systems and methods for making a replication decision in a P2P VoD architecture. A system according to the present application may comprise a plurality of peers; a plurality of videos distributed over the peers; and a server maintaining a replication indicator for each of the plurality of videos. In the system, each of the peers reports a first piece of information regarding one or more first videos of the plurality of videos which are stored in the peer and a second piece of information regarding a second video of the plurality of videos which is required to be stored in the peer to the server when the peer does not have enough space for storing the second video. The server then determines, according to the first and second pieces of information and the replication indicators for the first and the second videos, whether the peer is to replace one of the first videos with the second video.Type: ApplicationFiled: May 19, 2011Publication date: November 22, 2012Applicant: THE CHINESE UNIVERSITY OF HONG KONGInventors: Yipeng ZHOU, Zhengjia FU, Dah Ming CHIU
-
Publication number: 20120079543Abstract: There is disclosed a method for replicating media contents in a P2P VoD system comprising a plurality of peers. The method may comprise: determining that a candidate media unit shall be replicated into a local storage of one of the peers; checking whether said local storage has enough space to store the candidate media unit; if not, selecting one media unit previously stored in said local storage to be replaced; and replacing the selected media unit by the candidate media unit.Type: ApplicationFiled: September 28, 2010Publication date: March 29, 2012Applicant: THE CHINESE UNIVERSITY OF HONG KONGInventors: Yipeng ZHOU, Zhengjia FU, Dah Ming CHIU
-
Publication number: 20120030367Abstract: A system and a method for evaluating transport of data segments of media content bitstream over a peer-to-peer network by streaming data chunks of a media content through a peer-to-peer network, generating network transport distortion on the data chunks using live experiments, simulation, or artificial generation, determining a playback strategy of each of the data segment at the receiver end, and evaluating a playback performance of the media content bitstream under the playback strategy.Type: ApplicationFiled: July 28, 2010Publication date: February 2, 2012Applicant: Hong Kong Applied Science and Technology Research Institute Company LimitedInventors: Zhibin Lei, Dah Ming Chiu, Zhengjia Fu
-
Publication number: 20120030348Abstract: Disclosed are a system and a method for catching top users. The system may comprise: a filter (10) configured to sample flows from the hosts and remove the flows not satisfying a constraint; an tracker (20) configured to record a first estimated flow count for each host and to determine a first set of hosts from the plurality of hosts in term of the estimated flow count; and an estimator (30) configured to determine a second estimated flow count for each of the determined hosts and select a second set of hosts from the determined hosts based on the second estimated flow count.Type: ApplicationFiled: February 5, 2010Publication date: February 2, 2012Inventors: Xingang Shi, Dah-Ming Chiu
-
Publication number: 20110170413Abstract: Disclosed are a method and a system for determining top spreaders in high speed network. The method may comprise: sampling a plurality of packets from the plurality of hosts during an interval of time; determining a difference between a count and a count error for each host based on the sampled packets; ranking the hosts based on the determined difference to identify a first set of hosts that are top in the ranked hosts; and selecting a second set of hosts from the first set of hosts as the top spreaders.Type: ApplicationFiled: September 10, 2009Publication date: July 14, 2011Applicant: THE CHINESE UNIVERSITY OF HONG KONGInventors: Xingang Shi, Dah-Ming Chiu
-
Patent number: 7904597Abstract: Disclosed are a system and a process for identifying P2P applications and specific P2P software as well from an original mixed packet trace based on behavioral-signatures. The behavioral-signature based system and process according to the invention is mainly to check whether the application has these specific periodic behaviors or not. The process of this invention comprises the steps of filtering out all irrelative packets; translating the filtered packet trace into discrete-time sequences; processing the sequences to obtain frequency-domain characteristics of original packet trace; and analyzing the frequency-domain characteristics and determining the identification.Type: GrantFiled: January 23, 2008Date of Patent: March 8, 2011Assignee: The Chinese University of Hong KongInventors: Zhengjia Fu, Dah Ming Chiu
-
Publication number: 20090187653Abstract: Disclosed are a system and a process for identifying P2P applications and specific P2P software as well from an original mixed packet trace based on behavioral-signatures. The behavioral-signature based system and process according to the invention is mainly to check whether the application has these specific periodic behaviors or not. The process of this invention comprises the steps of filtering out all irrelative packets; translating the filtered packet trace into discrete-time sequences; processing the sequences to obtain frequency-domain characteristics of original packet trace; and analyzing the frequency-domain characteristics and determining the identification.Type: ApplicationFiled: January 23, 2008Publication date: July 23, 2009Applicant: The Chinese University of Hong KongInventors: Zhengjia Fu, Dah Ming Chiu
-
Patent number: 7200117Abstract: A system for selecting routing information from a routing table describing alternative routes between end nodes. The routing table represents a set of minimum cost, deadlock-free routes between end nodes. The selected routing information is included in forwarding tables, and sent to networking devices in the network. The selected routing information is optimized for at least one network performance metric, such as overall network capacity or fault tolerance. Capacity optimization is obtained by selecting from alternative routes stored within the routing table such that the standard deviation of the number of routes flowing over each link in the network is minimized. Fault tolerance optimization is achieved by selecting from the alternative routes stored in the routing table such that the selected route for a given end node pair has a “failover” route with a maximum number of dissimilar links from the selected route.Type: GrantFiled: January 31, 2002Date of Patent: April 3, 2007Assignee: Sun Microsystems, Inc.Inventors: Dah Ming Chiu, Miriam C. Kadansky, Murat Yuksel
-
Patent number: 7152113Abstract: A system and method for adding routing information for a node to a routing table, which efficiently makes necessary changes to the routing table to support routing to and from the node, while maintaining the deadlock-free quality of the paths described by the routing table. The routing table is generated by storing routing information in the routing table that reflects and describes a deadlock-free set of paths through a network of nodes. A row of entries is added to the routing table describing how to forward data units from the node. A column of entries is added to the routing table describing how to forward data units addressed to the node. The forwarding information within each entry added to the routing table maintains the deadlock-free quality of the set of paths represented by the forwarding table.Type: GrantFiled: October 19, 2001Date of Patent: December 19, 2006Assignee: Sun Microsystems, Inc.Inventors: John V. Reynders, Radia J. Perlman, Guy L. Steele, Jr., Dah Ming Chiu, Miriam C. Kadansky, Murat Yuksel
-
Patent number: 7096251Abstract: A distributed system and method generate “layered routes” that reflect a layered representation of a network, which representation provides deadlock-free routes. The layered representation consists of an ordered set of layers, where each layer is a deadlock-free sub-topology of the network. In determining routes, the links used in each route are constrained to be taken from layers of non-decreasing order as the route extends from source to destination. A device that determines a better or equal cost path to a destination node with respect to its current path to that node sends a route information message to its neighbor devices. The receiver of a route information message may then accept the message and begin using the new path described by the message, or reject the message without using the new path.Type: GrantFiled: July 31, 2002Date of Patent: August 22, 2006Assignee: Sun Microsystems, Inc.Inventors: Dah Ming Chiu, Miriam C. Kadansky, Radia J. Perlman, Murat Yuksel
-
Patent number: 6850488Abstract: One embodiment of the present invention provides a system that facilitates efficient flow control for data transmissions between a sender and a plurality of receivers. The system operates by sending a stream of packets from the sender to the plurality of receivers, wherein the packets include information specifying a sampling window for the stream of packets. The sender subsequently receives feedback information from the plurality of receivers, wherein a receiver sends feedback information to the sender if a congestion condition occurs at the receiver while receiving packets within the sampling window. In response to the feedback information, the sender adjusts a rate of transmission for the stream of packets. In one embodiment of the present invention, the feedback information from the receivers is aggregated at intermediate nodes prior to reaching the sender in order to eliminate redundant feedback information.Type: GrantFiled: April 14, 2000Date of Patent: February 1, 2005Assignee: Sun Microsystems, Inc.Inventors: Joseph S. Wesley, Dah Ming Chiu, Miriam C. Kadansky, Joseph E. Provino
-
Patent number: 6757843Abstract: An embodiment consistent with the present invention includes a method and apparatus for forming a multicast repair tree. The methods perform by a data processor and comprises the steps of determining, for each of a plurality of potential heads in a multicast group, a ranking value associated with the potential head; advertising, by the potential heads to a plurality of potential receivers; prioritizing, by a potential receiver, the ranking values from the potential heads; and binding, by a potential receiver to the head having the highest ranking value, thereby forming a group of which the potential receiver,is a member and the potential head is the head. The ranking values may include “able”, “unable”, “willing”, and “reluctant.” The ranking value of a potential head determines in accordance with a static or a dynamic configuration. Ranking values determine dynamically based on ranges of system resource levels such as memory and available processor resources.Type: GrantFiled: October 26, 2000Date of Patent: June 29, 2004Assignee: Sun Microsystems, Inc.Inventors: Joseph Wesley, Stephen A. Hurst, Miriam C. Kadansky, Stephen R. Hanna, Philip M. Rosenzweig, Dah Ming Chiu, Radia J. Perlman
-
Patent number: 6693907Abstract: A method and system for accurately measuring the reception characteristics of receivers in a multicast data distribution group having a sending node and a plurality of receivers. The multicast group is organized as a repair tree in which selected nodes of the multicast group comprise repair nodes for downstream receivers. Multicast data packets transmitted by the repair nodes include a retransmission count field in addition to the multicast packet header information, a session identifier, a packet sequence number and payload data. The retransmission count provides an indication of the number of times the respective packet has been retransmitted in response to a repair request. The receivers include an original packet counter and a retransmission count counter for each multicast session. Each receiver increments the original packet counter upon receipt of a packet that has not been previously received.Type: GrantFiled: April 11, 2000Date of Patent: February 17, 2004Assignee: Sun Microsystems, Inc.Inventors: Joseph S. Wesley, Dah Ming Chiu, Miriam C. Kadansky, Joseph E. Provino, Stephen R. Hanna
-
Patent number: 6658004Abstract: A method and apparatus for identifying a data message that is eligible for discard. A beacon node periodically transmits a beacon message to a plurality of client nodes communicatively coupled via a network. Each beacon message includes a beacon sequence number and preferably, the beacon sequence numbers are authenticated by the beacon, node. The client nodes, upon receipt of the beacon messages, verify the authenticity of the respective received beacon sequence numbers and generate a local sequence number derived from the received beacon sequence number. When one client in the session has data to transmit to another client in the session, the sending client assembles a data message and inserts its local sequence number in the data message prior to transmission of the data message to the other client nodes in the session.Type: GrantFiled: December 28, 1999Date of Patent: December 2, 2003Assignee: Sun Microsystems, Inc.Inventors: Miriam C. Kadansky, Dah Ming Chiu, Stephen R. Hanna, Stephen A. Hurst, Radia J. Perlman, Joseph S. Wesley
-
Patent number: 6658565Abstract: A system efficiently distributes processing-intensive loads among a plurality of intermediate stations in a computer internetwork. The intermediate stations include routers, bridges, switches and/or firewalls configured with monitoring and filtering agents that communicate via a defined protocol to implement the system. Those stations configured with agents and having available resources cooperate to execute the loads which generally comprise verification operations on digital signatures appended to frame and/or packet traffic traversing paths of the computer internetwork. Techniques associated with the system are directed to efficiently detecting and filtering unauthorized traffic over portions of the internetwork protected as trust domains as well as unprotected portions of the internetwork.Type: GrantFiled: June 1, 1998Date of Patent: December 2, 2003Assignee: Sun Microsystems, Inc.Inventors: Amit Gupta, Radia Joy Perlman, Dah-Ming Chiu