Beichuan Zhang

Interests

No activities entered.

Courses

Scholarly Contributions

Journals/Publications

• Ghasemi, C., Yousefi, H., Shin, K. G., & Zhang, B. (2019). On the Granularity of Trie-Based Data Structures for Name Lookups and Updates. IEEE/ACM Transactions on Networking, 27(2), 777-789.
  More info

  A* in CORE
• Yang, Y., Song, T., & Zhang, B. (2019). OpenCache: A lightweight regional cache collaboration approach in hierarchical-named ICN. Computer Communications, 144.
• Li, Z., Xu, Y., Zhang, B., Yan, L., & Liu, K. (2018). Packet Forwarding in Named Data Networking Requirements and Survey of Solutions. IEEE Communications Surveys Tutorials, 1-1.
• Wang, L., Lehman, V., Hoque, A., Zhang, B., Yu, Y., & Zhang, L. (2018). A Secure Link State Routing Protocol for NDN. IEEE Access, PP(99), 1-1.
• Gao, S., Zhang, H., & Zhang, B. (2016). Energy Efficient Interest Forwarding in NDN-Based Wireless Sensor Networks. Mobile Information Systems, 2016, 3127029:1--3127029:15.
• Li, D., Yu, Y., Shi, J., & Zhang, B. (2016). PALS: Saving Network Power With Low Overhead to ISPs and Applications. IEEE/ACM Trans. on Networking, 24(5), 2913--2925.
• Pan, T., Zhang, T., Shi, J., Li, Y., Jin, L., Li, F., Yang, J., Zhang, B., Yang, X., Zhang, M., Dai, H., & Liu, B. (2016). Towards Zero-Time Wakeup of Line Cards in Power-Aware Routers. IEEE/ACM Trans. on Networking, 24(3), 1448--1461.
• Ren, Y., Li, J., Shi, S., Li, L., Wang, G., & Zhang, B. (2016). Congestion control in named data networking - A survey. COMPUTER COMMUNICATIONS, 86, 1-11.
• Gibbens, M., Gniady, C., & Zhang, B. (2015). Towards eco-friendly home networking. Sustainable Computing: Informatics and Systems.
• Abraham, J., Liu, Y., Wang, L., & Zhang, B. (2014). A flexible Quagga-based virtual network with FIB aggregation. Network, IEEE, 28, 47--53.
• Zhang, L., Afanasyev, A., Burke, J., Jacobson, V., Crowley, P., Papadopoulos, C., Wang, L., Zhang, B., & others, . (2014). Named data networking. ACM SIGCOMM Computer Communication Review, 44, 66--73.
• Cheng, Y. i., Afanasyev, A., Moiseenko, I., Wang, L., Zhang, B., & Zhang, L. (2013). A case for stateful forwarding plane. Computer Communications, 36(7), 779-791.
  More info

  Abstract: In Named Data Networking (NDN), packets carry data names instead of source and destination addresses. This paradigm shift leads to a new network forwarding plane: data consumers send Interest packets to request desired data, routers forward Interest packets and maintain the state of all pending Interests, which is then used to guide Data packets back to the consumers. Maintaining the pending Interest state, together with the two-way Interest and Data exchange, enables NDN routers' forwarding process to measure performance of different paths, quickly detect failures and retry alternative paths. In this paper we describe an initial design of NDN's forwarding plane and evaluate its data delivery performance under adverse conditions. Our results show that this stateful forwarding plane can successfully circumvent prefix hijackers, avoid failed links, and utilize multiple paths to mitigate congestion. We also compare NDN's performance with that of IP-based solutions to highlight the advantages of a stateful forwarding plane. © 2013 Elsevier B.V. All rights reserved.
• Dong, J., Shi, J., Boucadair, M., Zhang, M., & Zhang, B. (2013). Power-Aware Networks (PANET): Problem Statement. Power.
• Dong, J., Zhang, B., Boucadair, M., & Zhang, M. (2013). Requirements for Power Aware Network.
• Dong, J., Zhang, B., Khargharia, B., & Zhang, M. (2013). Use Cases for Power-Aware Networks.
• Hoque, A. M., Amin, S. O., Alyyan, A., Zhang, B., Zhang, L., & Wang, L. (2013). NLSR: Named-data link state routing protocol. ICN 2013 - Proceedings of the 3rd, 2013 ACM SIGCOMM Workshop on Information-Centric Networking, 15-20.
  More info

  Abstract: This paper presents the design of the Named-data Link State Routing protocol (NLSR), a routing protocol for Named Data Networking (NDN). Since NDN uses names to identify and retrieve data, NLSR propagates reachability to name prefixes instead of IP prefixes. Moreover, NLSR differs from IP-based link-state routing protocols in two fundamental ways. First, NLSR uses Interest/Data packets to disseminate routing updates, directly benefiting from NDN's data authenticity. Second, NLSR produces a list of ranked forwarding options for each name prefix to facilitate NDN's adaptive forwarding strategies. In this paper we discuss NLSR's main design choices on (1) a hierarchical naming scheme for routers, keys, and routing updates, (2) a hierarchical trust model for routing within a single administrative domain, (3) a hop-by-hop synchronization protocol to replace the traditional network-wide flooding for routing update dissemination, and (4) a simple way to rank multiple forwarding options. Compared with IP-based link state routing, NLSR offers more efficient update dissemination, built-in update authentication, and native support of multipath forwarding. Copyright © 2013 ACM.
• Liu, Y., Zhang, B., & Wang, L. (2013). FIFA: Fast incremental FIB aggregation. Proceedings - IEEE INFOCOM, 1213-1221.
  More info

  Abstract: The fast growth of global routing table size has been causing concerns that the Forwarding Information Base (FIB) will not be able to fit in existing routers' expensive line-card memory, and upgrades will lead to higher cost for network operators and customers. FIB Aggregation, a technique that merges multiple FIB entries into one, is probably the most practical solution since it is a software solution local to a router, and does not require any changes to routing protocols or network operations. While previous work on FIB aggregation mostly focuses on reducing table size, this work focuses on algorithms that can update compressed FIBs quickly and incrementally. Quick update is critical to routers because they have very limited time to process routing updates without impacting packet delivery performance. We have designed three algorithms: FIFA-S for smallest table size, FIFA-T for shortest running time, and FIFA-H for both small tables and short running time, and operators can use the one best suited to their needs. These algorithms significantly improve over existing work in terms of reducing routers' computation overhead and limiting impact on the forwarding plane while maintaining a good compression ratio. © 2013 IEEE.
• Cheng, Y. i., Afanasyev, A., Wang, L., Zhang, B., & Zhang, L. (2012). Adaptive forwarding in named data networking. Computer Communication Review, 42(3), 62-67.
  More info

  Abstract: In Named Data Networking (NDN) architecture, packets carry data names rather than source or destination addresses. This change of paradigm leads to a new data plane: data consumers send out Interest packets, routers forward them and maintain the state of pending Interests, which is used to guide Data packets back to the consumers. NDN routers' forwarding process is able to detect network problems by observing the two-way traffic of Interest and Data packets, and explore multiple alternative paths without loops. This is in sharp contrast to today's IP forwarding process which follows a single path chosen by the routing process, with no adaptability of its own. In this paper we outline the design of NDN's adaptive forwarding, articulate its potential benefits, and identify open research issues.
• Khare, V., & Zhang, B. (2012). CDN Request Routing to reduce network access cost. Proceedings - Conference on Local Computer Networks, LCN, 610-617.
  More info

  Abstract: Content Delivery Networks (CDN) are overlay network of servers being used to deliver growing traffic demands on the Internet. As a result, CDNs are facing ever-increasing operating costs. Internet Service Providers (ISP) charge CDNs on server traffic, computed using common usage-based charging models, e.g. 95th Percentile charging. We propose Network Cost Aware Request Routing, NetReq, that assign user requests to reduce server charging volume. We compare NetReq against nearest-available server request routing in large scale simulations for both web and multicast traffic requests. NetReq reduces charging volume for both traffic request types, thereby reducing cost. NetReq provides comparable network performance for multicast traffic by introducing end-to-end delay as a constraint in the request-routing. NetReq marginally increases network performance for web traffic, when content maybe available at every server. © 2012 IEEE.
• Khare, V., Qing, J. u., & Zhang, B. (2012). Concurrent prefix hijacks: Occurrence and impacts. Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC, 29-35.
  More info

  Abstract: A concurrent prefix hijack happens when an unauthorized network originates IP prefixes of multiple other networks. Its extreme case is leaking the entire routing table, i.e., hijacking all the prefixes in the table. This is a well-known problem and there exists a preventive measure in practice to safeguard against it. However, we investigated and uncovered many concurrent prefix hijacks that didn't involve a full-table leak. We report these events and their impact on Internet routing. y correlating suspicious routing announcements and comparing it with a network's past routing announcements, we develop a method to detect a network's abnormal behavior of offending multiple other networks simultaneously. Applying the detection algorithm to BGP routing updates from 2003 through 2010, we identify five to twenty concurrent prefix hijacks every year, most of which are previously unknown to the research and operation communities at large. They typically hijack prefixes owned by a few tens of networks, last from a few minutes to a few hours, and pollute routes at most vantage points. © 2012 ACM.
• Cheng, P., Zhang, B., Massey, D., & Zhang, L. (2011). Identifying BGP routing table transfers. Computer Networks, 55(3), 636-649.
  More info

  Abstract: BGP routing updates collected by monitoring projects such as RouteViews and RIPE have been a vital source to our understanding of the global routing system. However the collected BGP data contains both the updates generated by actual route changes, and the updates of BGP routing table transfers resulted from BGP session resets between operational routers and the data collection stations. Since the latter is caused by measurement artifact, it is important to accurately separate out the latter from the former. In this paper, we present the design and evaluation of the minimum collection time (MCT) algorithm. Given a BGP update stream, MCT can identify the start and duration of each routing table transfer in the stream with high accuracy. We evaluated MCT performance by using three months of BGP data from all RIPE collectors. Our results show that out of the total 1664 BGP resets with 166 monitors, MCT can identify BGP routing table transfers with over 95% accuracy, and pinpoint the exact starting time of the detected table transfers in 83% of such cases. Accurate detection of BGP table transfers enables users to separate out real BGP routing changes and measurement artifacts, and can be used to measure and diagnose the BGP session failures. © 2010 Elsevier B.V. All rights reserved.
• Khare, V., & Zhang, B. (2011). Making CDN and ISP routings symbiotic. Proceedings - International Conference on Distributed Computing Systems, 869-878.
  More info

  Abstract: Internet Service Providers (ISPs) route traffic at the IP layer with the preference of less inter-carrier payments while Content Distribution Networks (CDNs) route traffic at the application layer with the preference of better application performance. Such mismatch of routing preferences leads to conflicts that eventually result in higher operational cost for both ISPs and CDNs. In this paper, we propose to make CDN and ISP routing mutually beneficial through ISP's non-uniform bandwidth charging and CDN's bandwidth cost-aware request routing. More specifically, ISPs charge different prices for traffic that traverses different types of inter-domain links and CDNs, in routing user requests to their servers, try to minimize their ISP payments by taking the pricing information into consideration. We evaluate the solution in large scale simulations. The greedy solution presents the lowest bandwidth cost for CDNs but at the expense of network performance for users. With end-to-end delay introduced as a constraint in the optimization process, the solution maintains good network performance for users while achieving significant savings in bandwidth cost. Compared with conventional nearest-available policy in CDN request routing, our solution moves significant amount of inter-domain traffic from provider routes to peer or customer routes, reducing operational costs for ISPs and CDNs. © 2011 IEEE.
• Cheng, P., Zhang, B., Zhao, X., & Zhang, L. (2010). Longitudinal study of BGP monitor session failures. Computer Communication Review, 40(2), 34-42.
  More info

  Abstract: BGP routing data collected by RouteViews and RIPE RIS have become an essential asset to both the network research and operation communities. However, it has long been speculated that the BGP monitoring sessions between operational routers and the data collectors fail from time to time. Such session failures lead to missing update messages as well as duplicate updates during session re-establishment, making analysis results derived from such data inaccurate. Since there is no complete record of these monitoring session failures, data users either have to sanitize the data discretionarily with respect to their specific needs or, more commonly, assume that session failures are infrequent enough and simply ignore them. In this paper, we present the first systematic assessment and documentary on BGP session failures of RouteViews and RIPE data collectors over the past eight years. Our results show that monitoring session failures are rather frequent, more than 30% of BGP monitoring sessions experienced at least one failure every month. Furthermore, we observed failures that happen to multiple peer sessions on the same collector around the same time, suggesting that the collector's local problems are a major factor in the session instability. We also developed a web site as a community resource to publish all session failures detected for RouteViews and RIPE RIS data collectors to help users select and clean up BGP data before performing their analysis.
• Khare, V., Jen, D., Zhao, X., Liu, Y., Massey, D., Wang, L., Zhang, B., & Zhang, L. (2010). Evolution towards global routing scalability. IEEE Journal on Selected Areas in Communications, 28(8), 1363-1375.
  More info

  Abstract: Internet routing tables have been growing rapidly due to factors such as edge-site multihoming, traffic engineering, and disjoint address allocations. To address the routing scalability problems caused by this rapid growth, we propose an evolutionary approach that is incrementally deployable and provides immediate benefits to any adopting ASes. The basic premise of the approach is that route aggregation removes from routing tables the unnecessary topological details about remote portions of the Internet. We demonstrate that aggregation can be applied incrementally starting from local scopes within individual routers and individual ASes, and gradually expanded to the global Internet scope. The evaluation studies show that route aggregation is effective in addressing FIB scalability problems within a router and within a network. © 2006 IEEE.
• Liu, Y., Zhao, X., Nam, K., Wang, L., & Zhang, B. (2010). Incremental forwarding table aggregation. GLOBECOM - IEEE Global Telecommunications Conference.
  More info

  Abstract: The global routing table size has been increasing rapidly, outpacing the upgrade cycle of router hardware. Recently aggregating the Forwarding Information Base (FIB) emerges as a promising solution since it reduces FIB size significantly in the short term and it is compatible with any long-term architectural solutions. Because FIB entries change dynamically with routing updates, an important component of any FIB aggregation scheme is to handle routing updates efficiently while shrinking FIB size as much as possible. In this paper, we first propose two incremental FIB aggregation algorithms based on the ORTC scheme. We then quantify the tradeoffs of the proposed algorithms, which will help operators choose the algorithms best suited for their networks. ©2010 IEEE.
• Oliveira, R., Pei, D., Willinger, W., Zhang, B., & Zhang, L. (2010). The (in)completeness of the observed internet as-level structure. IEEE/ACM Transactions on Networking, 18(1), 109-122.
  More info

  Abstract: Despite significant efforts to obtain an accurate picture of the Internet's connectivity structure at the level of individual autonomous systems (ASes), much has remained unknown in terms of the quality of the inferred AS maps that have been widely used by the research community. In this paper, we assess the quality of the inferred Internet maps through case studies of a sample set of ASes. These case studies allow us to establish the ground truth of connectivity between this set of ASes and their directly conncted neighbors. A direct comparison between the ground truth and inferred topology maps yield insights into questions such as which parts of the actual topology are adequately captured by the inferred maps, which parts are missing and why, and what is the percentage of missing links in these parts. This information is critical in assessing, for each class of real-world networking problems, whether the use of currently inferred AS maps or proposed AS topology models is, or is not, appropriate. More importantly, our newly gained insights also point to new directions towards building realistic and economically viable Internet topology maps. © 2009 IEEE.
• Zhang, M., Cheng, Y. i., Liu, B., & Zhang, B. (2010). GreenTE: Power-aware traffic engineering. Proceedings - International Conference on Network Protocols, ICNP, 21-30.
  More info

  Abstract: Current network infrastructures exhibit poor power efficiency, running network devices at full capacity all the time regardless of the traffic demand and distribution over the network. Most research on router power management are at component level or link level, treating routers as isolated devices. A complementary approach is to facilitate power management at network level by routing traffic through different paths to adjust the workload on individual routers or links. Given the high path redundancy and low link utilization in today's large networks, this approach can potentially allow more network devices or components to go into power saving mode. This paper proposes an intra-domain traffic engineering mechanism, GreenTE, which maximizes the number of links that can be put into sleep under given performance constraints such as link utilization and packet delay. Using network topologies and traffic data from several wide-area networks, our evaluation shows that GreenTE can reduce line-cards' power consumption by 27% to 42% under constraints that the maximum link utilization is below 50% and the network diameter remains the same as in shortest path routing. © 2010 IEEE.
• Zhang, M., Liu, B., & Zhang, B. (2010). Safeguarding data delivery by decoupling path propagation and adoption. Proceedings - IEEE INFOCOM.
  More info

  Abstract: False routing announcements are a serious security problem, which can lead to widespread service disruptions in the Internet. A number of detection systems have been proposed and implemented recently, however, it takes time to detect attacks, notify operators, and stop false announcements. Thus detection systems should be complemented by a mitigation scheme that can protect data delivery before the attack is resolved. We propose such a mitigation scheme, QBGP, which decouples the propagation of a path and the adoption of a path for data forwarding. QBGP does not use suspicious paths to forward data traffic, but still propagates them in the routing system to facilitate attack detection. It can protect data delivery from routing announcements of false sub-prefixes, false origins, false nodes and false links. QBGP incurs overhead only when there are suspicious paths, which happen infrequently in real BGP traces. Results from large scale simulations and BGP trace analysis show that QBGP is light-weight yet effective, and it converges faster and incurs less overhead than Pretty Good BGP. ©2010 IEEE.
• Zhao, X., Liu, Y., Wang, L., & Zhang, B. (2010). On the aggregatability of router forwarding tables. Proceedings - IEEE INFOCOM.
  More info

  Abstract: The rapid growth of global routing tables has raised concerns among many Internet Service Providers. The most immediate concern regarding routing scalability is the size of the Forwarding Information Base (FIB), which seems to be growing at a faster pace than router hardware can support. This paper focuses on one potential solution to this problem - FIB aggregation, i.e., aggregating FIB entries without affecting the forwarding paths taken by data traffic. Compared with alternative solutions to the routing scalability problem, FIB aggregation is particularly appealing because it is a purely local software optimization limited within a router, requiring no changes to routing protocols or router hardware. To understand the feasibility of using FIB aggregation to extend router lifetime, we present several FIB aggregation algorithms and evaluate their performance using routing tables and updates from tens of networks. We find that FIB aggregation can reduce the FIB table size by as much as 70% with small computational overhead. We also show that the computational overhead can be controlled through various mechanisms. ©2010 IEEE.
• Khare, V., & Zhang, B. (2009). Towards economically viable infrastructure-based overlay multicast networks. Proceedings - IEEE INFOCOM, 1989-1997.
  More info

  Abstract: Internet-scale dissemination of streaming contents (e.g., live sports games) can be achieved by infrastructure-based overlay multicast networks, where multicast service providers deliver the contents via dedicated servers strategically placed over the Internet. Given the huge amount of data traffic, one of the major operation costs is the ISP cost for network access. However, existing overlay multicast protocols only consider network performance metrics in building dissemination trees without taking into account the potentially high ISP cost they may incur. This paper presents a scheme, Revenue-driven Overlay Multicast Networks (ROMaN), to assign users to different servers in order to maximize the profit derived from providing multicast services. ROMaN exploits the fact that ISP charging functions are concave by assigning users to the cheapest available servers, and dynamically adjusts the assignment to accommodate the churns of group membership. The evaluation shows that ROMaN not only can reduce ISP cost substantially, but also has shorter end-to-end delay due to smaller overlay size, and the longer a user stays in the group the better the service it will receive. © 2009 IEEE.
• Oliveira, R., Zhang, B., Pei, D., & Zhang, L. (2009). Quantifying path exploration in the Internet. IEEE/ACM Transactions on Networking, 17(2), 445-458.
  More info

  Abstract: Previous measurement studies have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of protocol enhancements have been proposed to remedy the problem. However, existing measurements were conducted only over a small number of testing prefixes. There has been no systematic study to quantify the pervasiveness of Border Gateway Protocol (BGP) slow convergence in the operational Internet, nor any known effort to deploy any of the proposed solutions. In this paper, we present our measurement results that identify BGP slow convergence events across the entire global routing table. Our data shows that the severity of path exploration and slow convergence varies depending on where prefixes are originated and where the observations are made in the Internet routing hierarchy. In general, routers in tier-1 Internet service providers (ISPs) observe less path exploration, hence they experience shorter convergence delays than routers in edge ASs; prefixes originated from tier-1 ISPs also experience less path exploration than those originated from edge ASs. Furthermore, our data show that the convergence time of route fail-over events is similar to that of new route announcements and is significantly shorter than that of route failures. This observation is contrary to the widely held view from previous experiments but confirms our earlier analytical results. Our effort also led to the development of a path-preference inference method based on the path usage time, which can be used by future studies of BGP dynamics. © 2009 IEEE.
• Samuel, J., & Zhang, B. (2009). Request policy: Increasing web browsing privacy through control of cross-site requests. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5672 LNCS, 128-142.
  More info

  Abstract: Many requests that a Web browser makes are not made to the primary site a user is visiting. It is common for websites to instruct browsers to make additional requests to third-party sites for content, advertisements, as well as for purely user-tracking purposes. Current techniques for maintaining user privacy with respect to cross-site requests are limited and inadequate. We propose a client-side whitelist for controlling third-party website requests. We implement this as RequestPolicy, an extension for Mozilla browsers. We look at the usability of RequestPolicy as well its impact on the Web browsing experience. Our extension maintains a high level of usability while safeguarding user privacy against well-known threats in addition to new threats we draw attention to. © 2009 Springer Berlin Heidelberg.
• Zhang, M., Liu, B., & Zhang, B. (2009). Multi-commodity flow traffic engineering with hybrid MPLS/OSPF routing. GLOBECOM - IEEE Global Telecommunications Conference.
  More info

  Abstract: The common objective of network traffic engineering is to minimize the maximal link utilization in a network in order to accommodate more traffic and reduce the chance of congestion. Traditionally this is done by either optimizing OSPF link weights or using MPLS tunnels to direct traffic. However, they both have problems: OSPF weight optimization triggers network-wide convergence and significant traffic shift, while pure MPLS approach requires a full mesh of tunnels to be configured throughout the network. This paper formulates the traffic engineering problem as a Multi-Commodity Flow problem with hybrid MPLS/OSPF routing (MCFTE). As a result, the majority of traffic is routed by regular OSPF, while only a small number of MPLS tunnels are needed to fine-tune the traffic distribution. It keeps OSPF link weights unchanged to avoid triggering network convergence, and needs far fewer MPLS tunnels than the full-mesh to adjust traffic. Compared with existing hybrid routing approaches, MCFTE achieves the optimal link utilization, runs about two orders of magnitude faster, and is more robust against measurement inaccuracy in traffic demand.
• Oliveira, R., Pei, D., Willinger, W., Zhang, B., & Zhang, L. (2008). In search of the elusive ground truth: the internet's AS-level connectivity structure. SIGMETRICS'08: Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 36(1 SPECIAL ISSUE), 217-228.
  More info

  Abstract: Despite significant efforts to obtain an accurate picture of the Internet's actual connectivity structure at the level of individual autonomous systems (ASes), much has remained unknown in terms of the quality of the inferred AS maps that have been widely used by the research community. In this paper we assess the quality of the inferred Internet maps through case studies of a set of ASes. These case studies allow us to establish the ground truth of AS-level Internet connectivity between the set of ASes and their directly connected neighbors. They also enable a direct comparison between the ground truth and inferred topology maps and yield new insights into questions such as which parts of the actual topology are adequately captured by the inferred maps, and which parts are missing and why. This information is critical in assessing for what kinds of real-world networking problems the use of currently inferred AS maps or proposed AS topology models are, or are not, appropriate. More importantly, our newly gained insights also point to new directions towards building realistic and economically viable Internet topology maps. Copyright 2008 ACM.
• Zhang, M., Liu, B., & Zhang, B. (2008). Load-balanced IP fast failure recovery. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5275 LNCS, 53-65.
  More info

  Abstract: As a promising approach to improve network reliability, Proactive Failure Recovery (PFR) re-routes data traffic to backup paths without waiting for the completion of routing convergence after a local link failure. However, the diverted traffic may cause congestion on the backup paths if it is not carefully split over multiple paths according to their available capacity. Existing approach assigns new link weights based on links' load and re-calculates the routing paths, which incurs significant computation overhead and is susceptible to route oscillations. In this paper, we propose an efficient scheme for load balancing in PFR. We choose an adequate number of different types of loop-free backup paths for potential failures, and once a failure happens, the affected traffic is diverted to multiple paths in a well balanced manner. We formulate the traffic allocation problem as a tractable linear programming optimization problem, which can be solved iteratively and incrementally. As a result, only the flows affected by the failures are re-allocated to backup paths incrementally without disturbing flows not directly affected by the failures. Simulation results show that our scheme is computationally efficient, can effectively balance link utilization in the network, and can avoid route oscillations. © 2008 Springer-Verlag Berlin Heidelberg.
• Lad, M., Oliveira, R., Zhang, B., & Zhang, L. (2007). Understanding resiliency of internet topology against prefix hijack attacks. Proceedings of the International Conference on Dependable Systems and Networks, 368-377.
  More info

  Abstract: A prefix hijack attack involves an attacker announcing victim networks' IP prefixes into the global routing system. As a result, data traffic from portions of the Internet can be diverted to attacker networks. Prefix hijack attacks are a serious security threat in the Internet and it is important to understand the factors that affect the resiliency of victim networks against these attacks. In this paper, we conducted a systematic study to gauge the effectiveness of prefix hijacks launched at different locations in the Internet topology. Our study shows that direct customers of multiple tier1 networks are the most resilient, even more than the tier-1 networks themselves. Conversely, if these customer networks are used to launch prefix hijacks, they would also be the most effective launching pads for attacks. We verified our results through case studies using real prefix hijack incidents that had occurred in the Internet. ©2007 IEEE.
• Oliveira, R. V., Zhang, B., & Zhang, L. (2007). Observing the evolution of internet as topology. ACM SIGCOMM 2007: Conference on Computer Communications, 313-324.
  More info

  Abstract: Characterizing the evolution of Internet topology is important to our understanding of the Internet architecture and its interplay with technical, economic and social forces. A major challenge in obtaining empirical data on topology evolution is to identify real topology changes from the observed topology changes, since the latter can be due to either topology changes or transient routing dynamics. In this paper, we formulate the topology liveness problem and propose a solution based on the analysis of BGP data. We find that the impact of transient routing dynamics on topology observation decreases exponentially over time, and that the real topology dynamics consist of a constant-rate birth process and a constant-rate death process. Our model enables us to infer real topology changes from observation data with a given confidence level. We demonstrate the usefulness of the model by applying it to three applications: providing more accurate views of the topology, evaluating theoretical evolution models, and empirically characterizing the trends of topology evolution. We find that customer networks and provider networks have distinct evolution trends, which can provide an important input to the design of future Internet routing architecture. Copyright 2007 ACM.
• Oliveira, R., Lad, M., Zhang, B., & Zhang, L. (2007). Geographically informed inter-domain routing. Proceedings - International Conference on Network Protocols, ICNP, 103-112.
  More info

  Abstract: In this paper we propose a new routing protocol and address scheme, Geographically Informed Inter-Domain Routing (GIRO). GIRO departs from previous geographic addressing proposals in that it uses geographic information to assist, not to replace, the provider-based IP address allocation and policy-based routing. We show that, by incorporating geographic information into the IP address structure, GIRO can significantly improve the scalability and performance of the global Internet routing system. Within the routing policy constraints, geographic information enables the selection of shortest available routing paths. We evaluate GIRO's performance through simulations using a Rocketfuel-measured Internet topology. Our results show that, compared to the current practice, GIRO can reduce the geographic distance for 70% of the existing BGP paths, and the reduction is more than 40% for about 20% of the paths. Furthermore, encoding geographic information into IP addresses also enables GIRO to apply geographical route aggregation, and a combination of geographic and topological aggregation can lead to 75% reduction of the current BGP routing table size. ©2007 IEEE.
• Oliveira, R., Zhang, B., & Zhang, L. (2007). Observing the evolution of internet AS topology. Computer Communication Review, 37(4), 313-324.
  More info

  Abstract: Characterizing the evolution of Internet topology is important to our understanding of the Internet architecture and its interplay with technical, economic and social forces. A major challenge in obtaining empirical data on topology evolution is to identify real topology changes from the observed topology changes, since the latter can be due to either topology changes or transient routing dynamics. In this paper, we formulate the topology liveness problem and propose a solution based on the analysis of BGP data. We find that the impact of transient routing dynamics on topology observation decreases exponentially over time, and that the real topology dynamics consist of a constant-rate birth process and a constant-rate death process. Our model enables us to infer real topology changes from observation data with a given confidence level. We demonstrate the usefulness of the model by applying it to three applications: providing more accurate views of the topology, evaluating theoretical evolution models, and empirically characterizing the trends of topology evolution. We find that customer networks and provider networks have distinct evolution trends, which can provide an important input to the design of future Internet routing architecture. Copyright 2007 ACM.
• Oliveira, R., Zhang, B., Pei, D., Izhak-Ratzin, R., & Zhang, L. (2006). Quantifying path exploration in the internet. Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC, 269-282.
  More info

  Abstract: A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of protocol enhancements have been proposed to remedy the problem [21, 15, 4, 20, 5]. However all the previous measurements were conducted over a small number of testing pre-fixes. There has been no systematic study to quantify the pervasiveness of BGP slow convergence in the operational Internet, nor there is any known effort to deploy any of the proposed solutions. In this paper we present our measurement results from identifying BGP slow convergence events across the entire global routing table. Our data shows that the severity of path exploration and slow convergence varies depending on where prefixes are originated and where the observations are made in the Internet routing hierarchy. In general, routers in tier-1 ISPs observe less path exploration, hence shorter convergence delays than routers in edge ASes, and prefixes originatd from tier-1 ISPs also experience less path exploration than those originated from edge ASes. Our data also shows that the convergence time of route fail-over events is similar to that of new route announcements, and significantly shorter than that of route failures, which confirms our earlier analytical results [19]. In addition, we also developed a usage-time based path preference inference method which can be used by future studies of BGP dynamics. Copyright 2006 ACM.
• Pei, D., Zhang, B., Massey, D., & Zhang, L. (2006). An analysis of convergence delay in path vector routing protocols. Computer Networks, 50(3), 398-421.
  More info

  Abstract: Path vector routing protocols such as the Border Gateway Protocol (BGP) are known to suffer from slow convergence following a change in the network topology or policy. Although a number of convergence enhancements have been proposed recently, there has been no general analytical framework to assess and compare the various proposed algorithms. In this paper we present such a general framework to analyze the upper bounds of path vector protocols' convergence delay under shortest path routing policy and single link failure. Our framework takes into account important factors such as network connectivity, failure location, and routing message processing delay. It can be used to analyze both standard BGP and all the proposed convergence improvement algorithms in the case of shortest path routing policy and single link failure. It enables us to obtain previously unavailable analytical results, including the delay bounds of path fail-over for standard BGP and its convergence enhancements. Our analysis shows that BGP fail-over delay bounds are mainly determined by two factors: (1) the distance between the failure location and the destination, and (2) the length of the longest alternate path to reach the destination after the failure. These two factors are captured formally by our analysis and can explain why existing convergence enhancements often provide only limited improvements in fail-over events. Moreover, explicitly modeling message processing delay reveals insights into the impacts of connectivity richness (i.e., node degree and total number of links in the network), and also the effectiveness of different enhancements. These new results enable one to better understand and compare the behavior of various path vector protocols under different topology structures, network sizes, and message delays. © 2005 Elsevier B.V. All rights reserved.
• Zhang, B., Wang, W., Jamin, S., Massey, D., & Zhang, L. (2006). Universal IP multicast delivery. Computer Networks, 50(6), 781-806.
  More info

  Abstract: A ubiquitous and efficient multicast data delivery service is essential to the success of large-scale group communication applications. The original IP multicast design is to enhance network routers with multicast capability [S. Deering, D. Cheriton, Multicast routing in datagram internetworks and extended LANs, ACM Transactions on Computer Systems 8(2) (1990) 85-110]. This approach can achieve great transmission efficiency and performance but also poses a critical dependency on universal deployment. A different approach, overlay multicast, moves multicast functionality to end hosts, thereby removing the dependency on router deployment, albeit at the cost of noticeable performance penalty compared to IP multicast. In this paper we present the Universal Multicast (UM) framework, along with a set of mechanisms and protocols, to provide ubiquitous multicast delivery service on the Internet. Our design can fully utilize native IP multicast wherever it is available, and automatically build unicast tunnels to connect IP Multicast "islands" to form an overall multicast overlay. The UM design consists of three major components: an overlay multicast protocol (HMTP) for inter-island routing, an intra-island multicast management protocol (HGMP) to glue overlay multicast and native IP multicast together, and a daemon program to implement the functionality at hosts. In addition to performance evaluation through simulations, we have also implemented parts of the UM framework. Our prototype implementation has been used to broadcast several workshops and the ACM SIGCOMM 2004 conference live on the Internet. We present some statistics collected during the live broadcast and describe mechanisms we adopted to support end hosts behind Network Address Translation (NAT) gateways and firewalls. © 2005 Elsevier B.V. All rights reserved.
• Meng, X., Zhiguo, X. u., Zhang, B., Huston, G., Songwu, L. u., & Zhang, L. (2005). IPv4 address allocation and the BGP routing table evolution. Computer Communication Review, 35(1), 71-80.
  More info

  Abstract: The IP address consumption and the global routing table size are two of the vital parameters of the Internet growth. In this paper we quantitatively characterize the IPv4 address allocations made over the past six years and the global BGP routing table size changes during the same period of time. About 63,000 address blocks have been allocated since the beginning of the Internet, of which about 18,000 address blocks were allocated during our study period, from November 1997 to August 2004. Among these 18,000 allocations, 90% of them started being announced into the BGP routing table within 75 days after the allocation, while 8% of them has not been used up to now. Among all the address blocks that have ever been used, 45% of them were split into fragments smaller than the original allocated blocks; without these fragmentations, the current BGP table would have been about half of its current size. Furthermore, we found that the evolution of BGP routing table consists of both the appearance of new prefixes and the disappearance of old prefixes. While the change of the BGP routing table size only reflects the combined results of the two processes, the dynamics of either process is much higher than that of the BGP table size. Finally, we classify routing prefixes into covering and covered ones, and examine their evolution separately. For the covered prefixes, which account for almost half of the BGP table size, we infer their practical motives such as multihoming, load balancing, and traffic engineering, etc., via a classification method.
• Oliveira, R. V., Izhak-Ratzin, R., Zhang, B., & Zhang, L. (2005). Measurement of highly active prefixes in BGP. GLOBECOM - IEEE Global Telecommunications Conference, 2, 894-898.
  More info

  Abstract: We conduct a systematic study on the pervasiveness and persistency of one specific phenomenon in the global routing system: a small set of highly active prefixes accounts for a large number of routing updates. Our data analysis shows that this phenomenon is commonly observed from monitors in many different ISPs, and exists throughout our 3-year study period. The analysis further shows that the majority of these prefixes are highly active for only one or a few days, while a small number of them are persistently active over long period of time. Case studies demonstrate that the causes of these high routing activity include topological failures, BGP path exploration, protocol defects, and the failure of turning on protection mechanisms. © 2005 IEEE.
• Zhang, B., Kambhampati, V., Lad, M., Massey, D., & Zhang, L. (2005). Identifying BGP routing table transfers. Proceedings of ACM SIGCOMM 2005 Workshop on Mining Network Data, MineNet 2005, 213-218.
  More info

  Abstract: BGP routing updates collected by monitoring projects such as RouteViews and RIPE have been a vital source to our understanding of the global routing system. The updates logged by these monitoring projects are generated either by individual route changes, or are part of BGP table transfer. In particular, a session reset between a monitoring station and its BGP peers can result in the peer sending its entire BGP routing table to the monitoring station. In this paper, we present a Minimum Collection Time (MCT) algorithm that accurately identify the start and duration of routing table transfers. Using three months of data from 14 different peers, MCT can identify routing table transfers triggered by BGP session resets with 100% accuracy, and can pinpoint the exact starting time of table transfers in 90% of the cases. © 2005 ACM.
• Zhang, B., Kambhampati, V., Lad, M., Massey, D., & Zhang, L. (2005). Identifying BGP routing table transfers. Proceedings of ACM SIGCOMM 2005 Workshops: Conference on Computer Communications, 213-218.
  More info

  Abstract: BGP routing updates collected by monitoring projects such as RouteViews and RIPE have been a vital source to our understanding of the global routing system. The updates logged by these monitoring projects are generated either by individual route changes, or are part of BGP table transfer. In particular, a session reset between a monitoring station and its BGP peers can result in the peer sending its entire BGP routing table to the monitoring station. In this paper, we present a Minimum Collection Time (MCT) algorithm that accurately identify the start and duration of routing table transfers. Using three months of data from 14 different peers, MCT can identify routing table transfers triggered by BGP session resets with 100% accuracy, and can pinpoint the exact starting time of table transfers in 90% of the cases. Copyright 2005 ACM.
• Zhang, B., Liu, R., Massey, D., & Zhang, L. (2005). Collecting the Internet AS-level topology. Computer Communication Review, 35(1), 53-61.
  More info

  Abstract: At the inter-domain level, the Internet topology can be represented by a graph with Autonomous Systems (ASes) as nodes and AS peerings as links. This AS-level topology graph has been widely used in a variety of research efforts. Conventionally this topology graph is derived from routing tables collected by Route Views or RIPE RIS. In this work, we assemble the most complete AS-level topology by extending the conventional method along two dimensions. First, in addition to using data from Route Views and RIPE RIS, we also collect data from many other sources, including route servers, looking glasses, and routing registries. Second, in addition to using routing tables, we also accumulate topological information from routing updates over time. The resulting topology graph on a recent day contains 44% more links and 3% more nodes than that from using Route Views routing tables alone. Our data collection and topology generation process have been automated, and we publish the latest topology on the web on a daily basis.
• Zhang, B., Pei, D., Massey, D., & Zhang, L. (2005). Timer interaction in route flap damping. Proceedings - International Conference on Distributed Computing Systems, 393-403.
  More info

  Abstract: Route Flap Damping is a mechanism generally used in network routing protocols. Its goal is to limit the global impact of unstable routes by temporarily suppressing routes with rapid changes over short time periods. Although route damping is a clearly defined and simple procedure at each router, its effect in a large network setting is not well understood. We show that the current damping design leads to the intended behavior only under persistent route flapping. When the number of flaps is small, the global routing dynamics deviates significantly from the expected behavior with a longer convergence delay. Previous work observed that a single route flap can falsely trigger mute suppression due to path exploration. However our simulations show that this false suppression only accounts for 30% of the convergence delay after a single route flap. Our study reveals previously unknown interactions between reuse timers at different routers. Route suppression and reuse at different routers are triggered at different times and thus affect the number of updates received by other routers. In turn, this impacts other routers' damping behavior. We propose to use Root Cause Notification to eliminate both false suppression and undesirable timer interaction. © 2005 IEEE.
• Lad, M., Zhao, X., Zhang, B., Massey, D., & Zhang, L. (2004). Analysis of BGP Update Surge during Slammer Worm Attack. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2918, 66-79.
  More info

  Abstract: Although the Internet routing infrastructure was not a direct target of the January 2003 Slammer worm attack, the worm attack coincided in time with a large, globally observed increase in the number of BGP routing update messages. Our analysis shows that the current global routing protocol BGP allows local connectivity dynamics to propagate globally. As a result, any small number of edge networks can potentially cause wide-scale routing overload. For example, two small edges ASes, which announced less than 0.25% of BGP routing table entries, contributed over 6% of total update messages observed at monitoring points during the worm attack. Although BGP route flap damping has been proposed to eliminate such undesirable global consequences of edge instability, our analysis shows that damping has not been fully deployed even within the Internet core. Our simulation further reveals that partial deployment of BGP damping not only has limited effect, but may also worsen the routing performance under certain topological conditions. The results show that it remains a research challenge to design a routing protocol that can prevent local dynamics from triggering global messages in order to scale well in a large, dynamic environment. © Springer-Verlag 2003.
• Pappas, V., Zhang, B., Terzis, A., & Zhang, L. (2004). Fault-tolerant data delivery for multicast overlay networks. Proceedings - International Conference on Distributed Computing Systems, 24, 670-679.
  More info

  Abstract: Overlay networks represent an emerging technology for rapid deployment of novel network services and applications. However, since public overlay networks are built out of loosely coupled end-hosts, individual nodes are less trustworthy than Internet routers in carrying out the data forwarding function. In this paper we describe a set of mechanisms designed to detect and repair errors in the data stream. Utilizing the highly redundant connectivity in overlay networks, our design splits each data stream to multiple sub-streams which are delivered over disjoint paths. Each sub-stream carries additional information that enables receivers to detect damaged or lost packets. Furthermore, each node can verify the validity of data by periodically exchanging Bloom filters, the digests of recently received packets, with other nodes in the overlay. We have evaluated our design through both simulations and experiments over a network testbed. The results show that most nodes can effectively detect corrupted data streams even in the presence of multiple tampering nodes.
• Zhang, B., Massey, D., & Zhang, L. (2004). Destination readability and BGP convergence time. GLOBECOM - IEEE Global Telecommunications Conference, 3, 1383-1389.
  More info

  Abstract: One important performance measure for routing protocols is packet delivery. An ideal routing protocol should quickly adapt to topological changes and deliver packets as long as any path to the destination exists. In this paper, we examine the packet delivery performance in a network running the BGP routing protocol when a destination may be disconnected from time to time. We develop two metrics, extra downtime and false uptime, to capture the time difference between actual loss of connectivity and perceived unreachability. Our results show that extra downtime closely matches T up convergence delay, and false uptime closely matches T down convergence delay. Furthermore, our results show that, for transient connectivity failures, a shorter T down convergence time can have negative impact on packet delivery. © 2004 IEEE.
• Jin, Y., Zhang, B., Pappas, V., Zhang, L., & Jamin, S. (2003). DIP: Distance information protocol for IDMaps. Proceedings - IEEE Symposium on Computers and Communications, 775-782.
  More info

  Abstract: The Internet distance map service (IDMaps) [P. Francis, S. Jamin, C. Jin, D. Raz, Y. Shavitt, and L. Zhang, 2001] provides distance estimates between any pair of hosts connected to the Internet. The IDMaps system comprises two component types: tracers that measure distance between IP address prefixes, and servers that collect measurement results and answer distance queries. The distance information protocol (DIP) is used for tracers to report measured distance data to servers. The dynamics on the Internet topology, the distributed nature of autonomous tracers and servers, and the vast size of the data set require that DIP provide highly adaptive and scalable data dissemination from tracers to servers. DIP is a soft-state announce/listen protocol and scales independently from the total amount of measurement data by all tracers. DIP achieves its scalability through combination of staged timers, positive feedback, and feedback suppression techniques, which enable DIP to disseminate only the most useful measurement data to servers in a dynamic way. Simulations verified DIP's scalability and adaptability under various network conditions. © 2003 IEEE.
• Zhang, B., Jamin, S., & Zhang, L. (2002). Host multicast: A framework for delivering multicast to end users. Proceedings - IEEE INFOCOM, 3, 1366-1375.
  More info

  Abstract: While the advantages of multicast delivery over multiple unicast deliveries is undeniable, the deployment of the IP multicast protocol has been limited to "islands" of network domains under single administrative control. Deployment of inter-domain multicast delivery has been slow due to both technical and administrative reasons. In this paper we propose a Host Multicast Tree Protocol (HMTP) that (1) automates the interconnection of IP-multicast enabled islands and (2) provides multicast delivery to end hosts where IP multicast is not available. With HMTP, end-hosts and proxy gateways of IP multicast-enabled islands can dynamically create shared multicast trees across different islands. Members of an HMTP multicast group self-organize into an efficient, scalable and robust multicast tree. The tree structure is adjusted periodically to accommodate changes in group membership and network topology. Simulation results show that the multicast tree has low cost, and data delivered over it experiences moderately low latency.
• Gu, D. L., Pei, G., Henry, L. y., Gerla, M., Zhang, B., & Hong, X. (2000). UAV aided intelligent routing for ad-hoc wireless network in single-area theater. 2000 IEEE Wireless Communications and Networking Conference, 1220-1225.
  More info

  Abstract: Large homogeneous ad hoc wireless networks have a problem: the bandwidth available to an mobile user decreases as the number of nodes in the network increases. Using the embedded ad-hoc networking mechanism, nodes are able to transport packets across the network in a multihop fashion. An embedded mobile backbone is dynamically constructed to form 2-level physical heterogeneous multihop wireless network. These backbone nodes provide two critical functions: (1) direct communication between neighboring cluster heads. (2) efficient route discovery in HSR. With the broadcast feature of UAV, Link state can be broadcasted to backbone nodes instead of "flooding" on the level 2. Thus, routing overhead can be tremendously reduced, throughput will be improved. We modified Hierarchical State Routing to have an intelligent selection algorithm to reduce the system latency caused by long propagation delay of UAV channel. The performance of the system is evaluated through simulation experiments.

Proceedings Publications

• Ghasemi, C., Yousefi, H., & Zhang, B. (2020, September). Far Cry: Will CDNs hear NDN’s call?. In ACM Conference on Information-Centric Networking (ICN).
• Ghasemi, C., Yousefi, H., & Zhang, B. (2020, September). iCDN: An NDN-Based CDN. In ACM Conference on Information-Centric Networking (ICN).
• Liang, T., Pan, J., Rahman, M. A., Pesavento, D., Afanasyev, A., & Zhang, B. (2020, August). Enabling Named Data Networking Forwarder to Work Out-of-the-box at Edge Networks. In IEEE ICC.
• Liang, T., Shi, J., & Zhang, B. (2020, September). On the Prefix Granularity Problem in NDN Adaptive Forwarding. In ACM Conference on Information-Centric Networking (ICN).
• Schneider, K., Benmohamed, L., & Zhang, B. (2020, Spring). Hop-by-Hop Multipath Routing: Choosing the Right Nexthop Set. In IEEE INFOCOM.
  More info

  A* in CORE
• Zhang, C., Feng, Y., Song, H., Wang, Y., Wan, Y., Xu, W., Liu, B., & Zhang, B. (2020, June). PBC: Effective Prefix Caching for Fast Name Lookups. In IFIP Networking.
  More info

  A
• Newberry, E., & Zhang, B. (2019, Fall). On the Power of In-Network Caching in the Hadoop Distributed File System. In ACM Conference on Information-Centric Networking (ICN).
  More info

  not included in CORE, but the go-to conference in this new field of information-centric networking.
• Pan, T., Lin, X., Zhang, J., Li, H., Lv, J., Huang, T., Liu, B., & Zhang, B. (2019, 06). NB-cache: non-blocking in-network caching for high-speed content routers. In International Symposium on Quality of Service (IWQoS).
• Ghasemi, C., Yousefi, H., Shin, K. G., & Zhang, B. (2018, May). MUCA : New Routing for Named Data Networking. In IFIP Networking.
  More info

  This conference is ranked A in CORE
• Ghasemi, C., Yousefi, H., Shin, K., & Zhang, B. (2018, 09). A Fast and Memory-Efficient Trie Structure for Name-Based Packet Forwarding. In IEEE International Conference on Network Protocols (ICNP).
  More info

  This conference is ranked A in CORE.
• Liang, T., & Zhang, B. (2018, May). Enabling Off-the-Grid Communication for Existing Applications: A Case Study of Email Access. In 2018 IEEE International Conference on Communications Workshops (ICC Workshops).
• Liang, T., & Zhang, B. (2018, Sep). NDNizing Existing Applications: Research Issues and Experiences. In ACM Information-Centric Networking (ICN).
• Gibbens, M., Ye, L., Gniady, C., & Zhang, B. (2017, June). Hadoop on Named Data Networking: Experience and Results. In ACM SIGMETRICS.
• Shi, J., Newberry, E., & Zhang, B. (2017, June). On broadcast-based self-learning in named data networking. In IFIP Networking.
• Tang, R., Li, H., Sui, K., Jin, Z., Yang, X., Pei, D., & Zhang, B. (2017, August). How Vulnerable Is the Public WiFi AP You Are Using?. In IEEE International Conference on Computer Communications and Networks (ICCCN).
• Wu, H., Shi, J., Wang, Y., Wang, Y., Zhang, G., Wang, Y., Liu, B., & Zhang, B. (2017, May). On Incremental Deployment of Named Data Networking in Local Area Networks. In 2017 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).
• Cao, J., Pei, D., Wu, Z., Zhang, X., Zhang, B., Wang, L., & Zhao, Y. (2016). Improving the freshness of NDN forwarding states. In 2016 IFIP Networking Conference, Networking 2016 and Workshops, Vienna, Austria, May 17-19, 2016.
• Cao, J., Pei, D., Zhang, X., Zhang, B., & Zhao, Y. (2016). Fetching Popular Data from the Nearest Replica in NDN. In 25th International Conference on Computer Communication and Networks (ICCCN).
• Gao, S., Zhang, H., & Zhang, B. (2016). Supporting Multi-dimensional Naming for NDN Applications. In IEEE Globecom.
• Lehman, V., Gawande, A., Zhang, B., Zhang, L., Aldecoa, R., Krioukov, D. V., & Wang, L. (2016). An experimental investigation of hyperbolic routing with a smart forwarding plane in NDN. In 24th IEEE/ACM International Symposium on Quality of Service (IWQoS).
• Li, M., Pei, D., Zhang, X., Zhang, B., Wang, Z., Xu, H., & Wang, Z. (2016, June). M3: Practical and reliable multi-layer video multicast over multi-rate Wi-Fi network. In 24th IEEE/ACM International Symposium on Quality of Service (IWQoS).
• Schneider, K., Yi, C., Zhang, B., & Zhang, L. (2016). A Practical Congestion Control Scheme for Named Data Networking. In Proceedings of the 3rd ACM Conference on Information-Centric Networking (ICN '16).
• Shang, W., Bannis, A., Liang, T., Wang, Z., Yu, Y., Afanasyev, A., Thompson, J., Burke, J., Zhang, B., & Zhang, L. (2016, September). Named Data Networking of Things (Invited Paper). In First IEEE International Conference on Internet-of-Things Design and Implementation (IoTDI).
• Shi, J., Liang, T., Wu, H., Liu, B., & Zhang, B. (2016). NDN-NIC: Name-based Filtering on Network Interface Card. In 3rd ACM Conference on Information-Centric Networking (ICN).
• Afanasyev, A., Yi, C., Wang, L., Zhang, B., & Zhang, L. (2015). SNAMP: Secure namespace mapping to scale NDN forwarding. In Computer Communications Workshops (INFOCOM WKSHPS), 2015 IEEE Conference on.
• Li, M., Pei, D., Zhang, X., Zhang, B., & Xu, K. (2015). NDN Live Video Broadcasting over Wireless LAN. In Computer Communication and Networks (ICCCN), 2015 24th International Conference on.
• Song, T., Yuan, H., Crowley, P., & Zhang, B. (2015). Scalable name-based packet forwarding: From millions to billions. In Proceedings of the 2nd International Conference on Information-Centric Networking.
• Su, S., Zhang, B., Ye, L., Zhang, H., & Yee, N. (2015, June). Towards real-time route leak events detection. In Communications (ICC), 2015 IEEE International Conference on.
• Pan, T., Zhang, T., Shi, J., Li, Y., Jin, L., Li, F., Yang, J., Zhang, B., & Liu, B. (2014). Towards zero-time wakeup of line cards in power-aware routers. In INFOCOM, 2014 Proceedings IEEE.
• Shi, J., & Zhang, B. (2014). Making inter-domain routing power-aware?. In Computing, Networking and Communications (ICNC), 2014 International Conference on.
• Wang, Y., Xu, B., Tai, D., Lu, J., Zhang, T., Dai, H., Zhang, B., & Liu, B. (2014). Fast name lookup for named data networking. In Quality of Service (IWQoS), 2014 IEEE 22nd International Symposium of.
• Yi, C., Abraham, J., Afanasyev, A., Wang, L., Zhang, B., & Zhang, L. (2014). On the role of routing in named data networking. In Proceedings of the 1st international conference on Information-centric networking.

Others

• Afanasyev, A., Shi, J., Zhang, B., Zhang, L., Moiseenko, I., Yu, Y., Shang, W., Huang, Y., Abraham, J. P., DiBenedetto, S., & others, . (2014). NFD developer’s guide.