Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Kwan L."'
Publikováno v:
IEEE Transactions on Antennas and Propagation. 70:1643-1652
Autor:
Xiaoqian Li, Kwan L. Yeung
Publikováno v:
IEEE Transactions on Network and Service Management. 17:2648-2661
Segment routing is an emerging networking technology, where an arbitrary forwarding path can be identified using a list of segments. In this article, we study network monitoring in segment routing based on monitoring trails. Unlike the existing monit
Autor:
Kwan L. Yeung, Xiaoqian Li
Publikováno v:
IEEE Transactions on Network and Service Management. 17:1941-1953
In segment routing, a packet is forwarded along a path identified by a segment list. A segment list consists of segment identifiers (SIDs). A node-SID identifies a shortest-path segment, and an adjacency-SID identifies a link segment. A ${K}$ -segmen
Autor:
Kwan L. Yeung, Ze Yang
Publikováno v:
IEEE/ACM Transactions on Networking. 28:312-321
We focus on the problem of selecting a smallest subset of IP routers for upgrading to SDN switches to protect all single link failures in a given network, or the SDN candidate selection problem . In solving the problem, we also aim at minimizing the
Publikováno v:
IEEE Transactions on Network and Service Management. 16:1268-1281
The emerging cloud applications require group communications. For these applications, multicast is a better choice than unicast, because it can significantly improve the performance by eliminating the duplicated packets generated by servers. However,
Publikováno v:
IEEE/ACM Transactions on Networking. 26:2230-2241
Fat tree is a scalable and widely deployed data center network topology. In this paper, a novel framework for designing per-packet load-balanced routing algorithms in fat tree called global round robin (GRR) is proposed. Routing in fat tree consists
Publikováno v:
IEEE/ACM Transactions on Networking. 24:3565-3577
An efficient iterative scheduling algorithm for input-queued switches, called round robin with longest queue first (RR/LQF), is proposed in this paper. RR/LQF consists of three phases: report, grant, and accept. In each phase, only a single-bit messa
Publikováno v:
IEEE Communications Surveys & Tutorials. 13:114-125
Optical layer monitoring and fault localization serves as a critical functional module in the control and management of optical networks. An efficient monitoring scheme aims at minimizing not only the hardware cost required for 100% link failure loca
Autor:
Bing Hu, Kwan L. Yeung
Publikováno v:
IEEE/ACM Transactions on Networking. 18:1077-1090
A framework for designing feedback-based scheduling algorithms is proposed for elegantly solving the notorious packet missequencing problem of a load-balanced switch. Unlike existing approaches, we show that the efforts made in load balancing and kee
Publikováno v:
IEEE/ACM Transactions on Networking. 18:284-295
The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles for a given network, conventional algorithms need to enumerate cycles in the