Chen, Yang

[["dc.bibliographiccitation.firstpage","1"],["dc.bibliographiccitation.lastpage","6"],["dc.contributor.author","Fu, Xiaoming"],["dc.contributor.author","Zhu, Yibo"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Zhang, Zengbin"],["dc.contributor.author","Li, Dan"],["dc.contributor.author","Deng, Beixing"],["dc.contributor.author","Li, Xing"],["dc.date.accessioned","2018-05-09T13:56:04Z"],["dc.date.available","2018-05-09T13:56:04Z"],["dc.date.issued","2010"],["dc.description.abstract","Network Coordinate (NC) systems are efficient in scalable Internet latency estimation. While most of the focus has been put on how to distort Triangle Inequality Violation (TIV) in metric spaces to relieve the inaccuracy caused by it, TIV is a persistently and widely existing phenomenon on the Internet and thus should be embraced by future NC systems rather than being eliminated. Besides high accuracy, such an NC system can also provide the benefit of reducing the data transmission time by use of proper relay routes. With that in mind, we design an NC system with a hierarchical architecture, which is motivated by the natural idea of partitioning the three TIV links into different autonomous NC systems, in order to make as many as TIVs inherently embeddable in metric space. We implement and deploy our work, named Toread, on real Internet. Evaluation results show that Toread's metric space can well characterize more than 60% TIVs, thus Toread is highly accurate (0.54 in Toread versus 1.06 in Pyxida at 90th percentile Relative Error) and effective in searching detour paths (succeeds in 58.2% cases)."],["dc.identifier.doi","10.1145/1921233.1921242"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/14651"],["dc.language.iso","en"],["dc.notes.status","final"],["dc.relation.eventend","2010-11-30"],["dc.relation.eventlocation","Philadelphia, Pennsylvania"],["dc.relation.eventstart","2010-11-30"],["dc.relation.isbn","978-1-4503-0469-6"],["dc.relation.ispartof","ReARCH '10 Proceedings of the Re-Architecting the Internet Workshop"],["dc.title","Taming the Triangle Inequality Violations with Network Coordinate System on Real Internet"],["dc.type","conference_paper"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","334"],["dc.bibliographiccitation.issue","4"],["dc.bibliographiccitation.journal","IEEE Transactions on Network and Service Management"],["dc.bibliographiccitation.lastpage","347"],["dc.bibliographiccitation.volume","8"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Wang, Xiao"],["dc.contributor.author","Shi, Cong"],["dc.contributor.author","Lua, Eng Keong"],["dc.contributor.author","Fu, Xiaoming"],["dc.contributor.author","Deng, Beixing"],["dc.contributor.author","Li, Xing"],["dc.date.accessioned","2017-09-07T11:44:53Z"],["dc.date.available","2017-09-07T11:44:53Z"],["dc.date.issued","2011"],["dc.identifier.doi","10.1109/tnsm.2011.110911.100079"],["dc.identifier.gro","3149011"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/5652"],["dc.notes.intern","Fu Crossref Import"],["dc.notes.status","final"],["dc.notes.submitter","chake"],["dc.publisher","Institute of Electrical and Electronics Engineers (IEEE)"],["dc.relation.issn","1932-4537"],["dc.title","Phoenix: A Weight-Based Network Coordinate System Using Matrix Factorization"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dc.type.peerReviewed","no"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","406"],["dc.bibliographiccitation.issue","4"],["dc.bibliographiccitation.journal","ACM SIGCOMM Computer Communication Review"],["dc.bibliographiccitation.lastpage","407"],["dc.bibliographiccitation.volume","41"],["dc.contributor.author","Chen, Zhuo"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Ding, Cong"],["dc.contributor.author","Deng, Beixing"],["dc.contributor.author","Li, Xing"],["dc.date.accessioned","2018-11-07T08:53:51Z"],["dc.date.available","2018-11-07T08:53:51Z"],["dc.date.issued","2011"],["dc.description.abstract","Computing the shortest-path distances between nodes is a key problem in analyzing social graphs. Traditional methods like breadth-first search (BFS) do not scale well with graph size. Recently, a Graph Coordinate System, called Orion, has been proposed to estimate shortest-path distances in a scalable way. Orion uses a landmark-based approach, which does not take account of the shortest-path distances between non-landmark nodes in coordinate calculation. Such biased input for the coordinate system cannot characterize the graph structure well. In this paper, we propose Pomelo, which calculates the graph coordinates in a decentralized manner. Every node in Pomelo computes its shortest-path distances to both nearby neighbors and some random distant neighbors. By introducing the novel partial BFS, the computational overhead of Pomelo is tunable. Our experimental results from different representative social graphs show that Pomelo greatly outperforms Orion in estimation accuracy while maintaining the same computational overhead."],["dc.identifier.doi","10.1145/2043164.2018491"],["dc.identifier.isi","000302124800043"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/22528"],["dc.notes.status","zu prüfen"],["dc.notes.submitter","Najko"],["dc.publisher","Assoc Computing Machinery"],["dc.relation.issn","1943-5819"],["dc.relation.issn","0146-4833"],["dc.title","Pomelo: Accurate and Decentralized Shortest-path Distance Estimation in Social Graphs"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dc.type.peerReviewed","yes"],["dc.type.status","published"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","401"],["dc.bibliographiccitation.issue","4"],["dc.bibliographiccitation.journal","ACM SIGCOMM Computer Communication Review"],["dc.bibliographiccitation.lastpage","402"],["dc.bibliographiccitation.volume","40"],["dc.contributor.author","Wang, Tianyi"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Zhang, Z."],["dc.contributor.author","Sun, Peng"],["dc.contributor.author","Deng, Beixing"],["dc.contributor.author","Li, Xing"],["dc.date.accessioned","2018-11-07T08:38:10Z"],["dc.date.available","2018-11-07T08:38:10Z"],["dc.date.issued","2010"],["dc.description.abstract","Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is a directed graph instead of an undirected graph. Recently, due to the explosive increase of population size, graph sampling has started to play a critical role in measurement and characterization studies of such OSNs. However, previous studies have only focused on the unbiased sampling of undirected social graphs. In this paper, we study the unbiased sampling algorithm for directed social graphs. Based on the traditional Metropolis-Hasting Random Walk (MHRW) algorithm, we propose an unbiased sampling method for directed social graphs(USDSG). Using this method, we get the first, to the best of our knowledge, unbiased sample of directed social graphs. Through extensive experiments comparing with the \"ground truth\" (UNI, obtained through uniform sampling of directed graph nodes), we show that our method can achieve excellent performance in directed graph sampling and the error to UNI is less than 10%."],["dc.identifier.doi","10.1145/1851275.1851231"],["dc.identifier.isi","000284879800036"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/18707"],["dc.notes.status","zu prüfen"],["dc.notes.submitter","Najko"],["dc.publisher","Assoc Computing Machinery"],["dc.publisher.place","New york"],["dc.relation.conference","ACM SIGCOMM Conference 2010"],["dc.relation.eventlocation","New Delhi, INDIA"],["dc.relation.issn","1943-5819"],["dc.relation.issn","0146-4833"],["dc.title","Unbiased Sampling in Directed Social Graph"],["dc.type","conference_paper"],["dc.type.internalPublication","yes"],["dc.type.peerReviewed","yes"],["dc.type.status","published"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","1"],["dc.bibliographiccitation.lastpage","2"],["dc.contributor.author","Sun, Peng"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Zhu, Yibo"],["dc.contributor.author","Fu, Xiaoming"],["dc.contributor.author","Deng, Beixing"],["dc.contributor.author","Li, Xing"],["dc.date.accessioned","2018-05-24T09:32:10Z"],["dc.date.available","2018-05-24T09:32:10Z"],["dc.date.issued","2010"],["dc.description.abstract","The network proximity metrics, such as bottleneck bandwidth and round-trip time, are very useful in different network applications. The round-trip-time prediction has been studied extensively. However, the prediction of bottleneck bandwidth has received much less attention. Therefore, we attempt to design a new bottleneck bandwidth prediction system by matrix factorization. As a first step, we focus on the dimension reduction of network bottleneck bandwidth data space in this paper. Evaluation is carried out based on real-world bottleneck bandwidth datasets, which are collected in the past three months. The results show that a 250D data space can be compressed to 10D and the average median-relative-error is only 8.65%. Although preliminary, our work provides some insights into the design direction towards matrix factorization based distributed system to predict the bottleneck bandwidth."],["dc.identifier.doi","10.1109/INFCOMW.2010.5466622"],["dc.identifier.uri","http://hdl.handle.net/2/14743"],["dc.language.iso","en"],["dc.notes.status","final"],["dc.publisher","IEEE"],["dc.relation.eventend","2010-03-19"],["dc.relation.eventlocation","San Diego, CA, USA"],["dc.relation.eventstart","2010-03-15"],["dc.relation.isbn","978-1-4244-6739-6"],["dc.relation.ispartof","INFOCOM IEEE Conference on Computer Communications Workshops"],["dc.title","Dimension Reduction of Network Bottleneck Bandwidth Data Space"],["dc.type","conference_paper"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]