Yung-Chun (Justin) Wan
Yung-Chun (Justin) Wan has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Samir Khuller
University of Maryland
3 shared publications - Yoo-Ah Kim
University of Maryland
2 shared publications - Leana Golubchik
University of Southern California
1 shared publication - Mansoor Alicherry
Lucent Technol. Bell Labs., Murray Hill, NJ
1 shared publication - Rajiv Gandhi
Rutgers University-Camden
1 shared publication - Randeep Bhatia
Bell Labs, Lucent Technologies, Murray Hill, USA
1 shared publication
Latest Publications
- 11 November 2008
- Published by Springer Nature in Algorithmica
- Vol. 57 (4) , 848-868
Broadcasting on Networks of Workstations
- 11 November 2008
- Published by Springer Nature in Algorithmica
- Vol. 57 (4) , 848-868
Broadcasting on Networks of Workstations
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 16th Interntional Workshop on Quality of Service
- p. 164-172
Designing networks with hop bounded protection paths
Network QoS is essential for supporting real time interactive services such as VoIP. In the differentiated services framework QoS is provided by marking packets to receive preferential forwarding treatment, at each network node. This per hop forwarding treatment at each node may however be ineffective in providing the delay and jitter guarantees unless bounds are also imposed on the number of hops in the service routing paths. Interactive services also require minimal interruptions from network disruptions. Routing on hop limited paths may however have an adverse impact on the proportion of network capacity dedicated for protection to guarantee recovery from failures. In this paper we analyze this tradeoff in the context of MPLS fast reroute when protection capacities are pre-provisioned. We show that the underlying optimization problem is NP hard. We design almost best possible approximation algorithms for the problem and show that they work well in practice as well.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 16th Interntional Workshop on Quality of Service
- p. 164-172
Designing networks with hop bounded protection paths
Network QoS is essential for supporting real time interactive services such as VoIP. In the differentiated services framework QoS is provided by marking packets to receive preferential forwarding treatment, at each network node. This per hop forwarding treatment at each node may however be ineffective in providing the delay and jitter guarantees unless bounds are also imposed on the number of hops in the service routing paths. Interactive services also require minimal interruptions from network disruptions. Routing on hop limited paths may however have an adverse impact on the proportion of network capacity dedicated for protection to guarantee recovery from failures. In this paper we analyze this tradeoff in the context of MPLS fast reroute when protection capacities are pre-provisioned. We show that the underlying optimization problem is NP hard. We design almost best possible approximation algorithms for the problem and show that they work well in practice as well.
- 1 May 2006
- Published by Springer Nature in Algorithmica
- Vol. 45 (1) , 137-158
Data migration on parallel disks: Algorithms and evaluation
- 1 May 2006
- Published by Springer Nature in Algorithmica
- Vol. 45 (1) , 137-158
Data migration on parallel disks: Algorithms and evaluation
- 19 December 2003
- Published by Springer Nature in Algorithmica
- Vol. 38 (4) , 597-608
Algorithms for Minimizing Response Time in Broadcast Scheduling
- 19 December 2003
- Published by Springer Nature in Algorithmica
- Vol. 38 (4) , 597-608
Algorithms for Minimizing Response Time in Broadcast Scheduling