示例#1
0
        /// <summary>
        /// Remove item from doing queue, if not success, insert them back to the
        /// todo queue.
        /// </summary>
        /// <param name="item"></param>
        /// <param name="success"></param>
        public void FinishRequests(DoingQueueItem item, bool success)
        {
            Console.WriteLine("Finish {0}", success);
            this.usedBandwidth -= item.bandWidth;
            this.doing.Remove(item);

            if (!success)
            {
                // Add them back to todo (merge)
                foreach (DoingQueueFileItem fileItem in item.files)
                {
                    if (!this.todoFileToPeer.ContainsKey(fileItem.file))
                    {
                        this.todoFileToPeer[fileItem.file] = new List <Peer>();
                    }

                    foreach (Peer peer in fileItem.whoHaveMe)
                    {
                        // Maintain Peer->File
                        if (this.todoPeerToFile[peer].IndexOf(fileItem.file) == -1)
                        {
                            this.todoPeerToFile[peer].Add(fileItem.file);
                        }

                        // Maintain File->Peer
                        if (this.todoFileToPeer[fileItem.file].IndexOf(peer) == -1)
                        {
                            this.todoFileToPeer[fileItem.file].Add(peer);
                        }
                    }
                }
            }
        }
示例#2
0
        /// <summary>
        /// Gets some requests to be send to a peer. The requests will not exceed <see cref="Distribox.CommonLib.Properties.MaxRequestSize"/>
        /// </summary>
        /// <returns>
        /// The requests.
        /// </returns>
        public Tuple<List<FileEvent>, Peer> GetRequests()
        {
            CheckForRequestExpire();
            lock (this)
            {
                // No requests
                if (this.todoFileToPeer.Count() == 0)
                {
                    return null;
                }

                Peer bestPeer = new Peer();
                List<FileEvent> bestCollection = new List<FileEvent>();
                double bestScore = 0;
                long bestSize = 0;

                // For each peer
                foreach (KeyValuePair<Peer, List<FileEvent>> ppf in this.todoPeerToFile)
                {
                    Peer peer = ppf.Key;
                    var slist = ppf.Value.OrderBy(x => x.When.Ticks).ToList();

                    // Find file collections
                    double score = Properties.RMBandwidthWeight * this.estimator.GetPeerBandwidth(peer);

                    long currentSize = 0;
                    List<FileEvent> currentCollection = new List<FileEvent>();
                    foreach (FileEvent f in slist)
                    {
                        if (currentSize + f.Size <= Properties.MaxRequestSize)
                        {
                            currentSize += f.Size;
                            currentCollection.Add(f);

                            double uniqueness = 1.0 / this.todoFileToPeer[f].Count();
                            score += Properties.RMUniquenessWeight * uniqueness;
                        }
                        else
                        {
                            break;
                        }
                    }
                    score += Properties.RMSizeWeight * currentSize;

                    // Update best solution
                    if (score > bestScore)
                    {
                        bestScore = score;
                        bestPeer = peer;
                        bestCollection = currentCollection;
                        bestSize = currentSize;
                    }
                }

                // Do we have enough bandwidth ?
                int needBandwidth = this.estimator.GetPeerBandwidth(bestPeer);
                if (needBandwidth == 0)
                {
                    needBandwidth = Properties.DefaultConnectionSpeed;
                }

                if (usedBandwidth + needBandwidth > Properties.DefaultBandwidth)
                {
                    return null;
                }

                // Do this!
                Console.WriteLine("Request");
                usedBandwidth += needBandwidth;

                DoingQueueItem dqItem = new DoingQueueItem();
                dqItem.bandWidth = needBandwidth;
                dqItem.expireDate = DateTime.Now.AddSeconds(bestSize * Properties.ExpireSlackCoefficient / needBandwidth + Properties.DefaultDelay);
                dqItem.files = new List<DoingQueueFileItem>();

                foreach (FileEvent file in bestCollection)
                {
                    DoingQueueFileItem fileItem = new DoingQueueFileItem();
                    fileItem.file = file;
                    fileItem.whoHaveMe = this.todoFileToPeer[file];

                    // Remove File->Peer
                    this.todoFileToPeer.Remove(file);

                    // Remove Peer->File
                    foreach (Peer peer in fileItem.whoHaveMe)
                    {
                        this.todoPeerToFile[peer].Remove(file);
                    }

                    dqItem.files.Add(fileItem);
                }

                // Add it
                dqItem.filesHash = CommonHelper.GetHashCode(bestCollection);
                this.doing.Add(dqItem);
                this.estimator.BeginRequest(bestPeer, dqItem.filesHash, (int)bestSize);

                // return success
                return new Tuple<List<FileEvent>,Peer>(bestCollection, bestPeer);
            }
        }
示例#3
0
        /// <summary>
        /// Remove item from doing queue, if not success, insert them back to the
        /// todo queue.
        /// </summary>
        /// <param name="item"></param>
        /// <param name="success"></param>
        public void FinishRequests(DoingQueueItem item, bool success)
        {
            Console.WriteLine("Finish {0}", success);
            this.usedBandwidth -= item.bandWidth;
            this.doing.Remove(item);

            if (!success)
            {
                // Add them back to todo (merge)
                foreach (DoingQueueFileItem fileItem in item.files)
                {
                    if (!this.todoFileToPeer.ContainsKey(fileItem.file))
                    {
                        this.todoFileToPeer[fileItem.file] = new List<Peer>();
                    }

                    foreach (Peer peer in fileItem.whoHaveMe)
                    {
                        // Maintain Peer->File
                        if (this.todoPeerToFile[peer].IndexOf(fileItem.file) == -1)
                            this.todoPeerToFile[peer].Add(fileItem.file);

                        // Maintain File->Peer
                        if (this.todoFileToPeer[fileItem.file].IndexOf(peer) == -1)
                            this.todoFileToPeer[fileItem.file].Add(peer);
                    }
                }
            }
        }
示例#4
0
        /// <summary>
        /// Gets some requests to be send to a peer. The requests will not exceed <see cref="Distribox.CommonLib.Properties.MaxRequestSize"/>
        /// </summary>
        /// <returns>
        /// The requests.
        /// </returns>
        public Tuple <List <FileEvent>, Peer> GetRequests()
        {
            CheckForRequestExpire();
            lock (this)
            {
                // No requests
                if (this.todoFileToPeer.Count() == 0)
                {
                    return(null);
                }

                Peer             bestPeer       = new Peer();
                List <FileEvent> bestCollection = new List <FileEvent>();
                double           bestScore      = 0;
                long             bestSize       = 0;

                // For each peer
                foreach (KeyValuePair <Peer, List <FileEvent> > ppf in this.todoPeerToFile)
                {
                    Peer peer  = ppf.Key;
                    var  slist = ppf.Value.OrderBy(x => x.When.Ticks).ToList();

                    // Find file collections
                    double score = Properties.RMBandwidthWeight * this.estimator.GetPeerBandwidth(peer);

                    long             currentSize       = 0;
                    List <FileEvent> currentCollection = new List <FileEvent>();
                    foreach (FileEvent f in slist)
                    {
                        if (currentSize + f.Size <= Properties.MaxRequestSize)
                        {
                            currentSize += f.Size;
                            currentCollection.Add(f);

                            double uniqueness = 1.0 / this.todoFileToPeer[f].Count();
                            score += Properties.RMUniquenessWeight * uniqueness;
                        }
                        else
                        {
                            break;
                        }
                    }
                    score += Properties.RMSizeWeight * currentSize;

                    // Update best solution
                    if (score > bestScore)
                    {
                        bestScore      = score;
                        bestPeer       = peer;
                        bestCollection = currentCollection;
                        bestSize       = currentSize;
                    }
                }

                // Do we have enough bandwidth ?
                int needBandwidth = this.estimator.GetPeerBandwidth(bestPeer);
                if (needBandwidth == 0)
                {
                    needBandwidth = Properties.DefaultConnectionSpeed;
                }

                if (usedBandwidth + needBandwidth > Properties.DefaultBandwidth)
                {
                    return(null);
                }

                // Do this!
                Console.WriteLine("Request");
                usedBandwidth += needBandwidth;

                DoingQueueItem dqItem = new DoingQueueItem();
                dqItem.bandWidth  = needBandwidth;
                dqItem.expireDate = DateTime.Now.AddSeconds(bestSize * Properties.ExpireSlackCoefficient / needBandwidth + Properties.DefaultDelay);
                dqItem.files      = new List <DoingQueueFileItem>();

                foreach (FileEvent file in bestCollection)
                {
                    DoingQueueFileItem fileItem = new DoingQueueFileItem();
                    fileItem.file      = file;
                    fileItem.whoHaveMe = this.todoFileToPeer[file];

                    // Remove File->Peer
                    this.todoFileToPeer.Remove(file);

                    // Remove Peer->File
                    foreach (Peer peer in fileItem.whoHaveMe)
                    {
                        this.todoPeerToFile[peer].Remove(file);
                    }

                    dqItem.files.Add(fileItem);
                }

                // Add it
                dqItem.filesHash = CommonHelper.GetHashCode(bestCollection);
                this.doing.Add(dqItem);
                this.estimator.BeginRequest(bestPeer, dqItem.filesHash, (int)bestSize);

                // return success
                return(new Tuple <List <FileEvent>, Peer>(bestCollection, bestPeer));
            }
        }