Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David Chuck

dblp:34/9060 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Internet architecture and protocols · 45% Network optimization and economics · 33% Wireless networking · 18%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › broadband access
DSL networks
0.112011
Energy-efficient design and optimization of wireline access networks · INFOCOM 2011
Network optimization and economics › network design
network planning
0.112011
Energy-efficient design and optimization of wireline access networks · INFOCOM 2011
Network optimization and economics
resource allocation
0.112011
Energy-efficient design and optimization of wireline access networks · INFOCOM 2011
Energy-efficient computing › power management
energy-efficient networking
0.112011
Energy-efficient design and optimization of wireline access networks · INFOCOM 2011
Internet architecture and protocols › resource reservation
bandwidth reservation
0.112010
Bandwidth Recycling in IEEE 802.16 Networks · IEEE Trans. Mob. Comput. 2010
Internet architecture and protocols
quality of service
0.112010
Bandwidth Recycling in IEEE 802.16 Networks · IEEE Trans. Mob. Comput. 2010
Wireless networking › broadband wireless access
WiMAX
0.112010
Bandwidth Recycling in IEEE 802.16 Networks · IEEE Trans. Mob. Comput. 2010
Wireless networking
medium access control
0.012010
Bandwidth Recycling in IEEE 802.16 Networks · IEEE Trans. Mob. Comput. 2010
Cellular and mobile networks › resource scheduling
uplink scheduling
0.012010
Bandwidth Recycling in IEEE 802.16 Networks · IEEE Trans. Mob. Comput. 2010

Methods — techniques the papers use, named apart from their topics

polynomial-time algorithm · 0.2integer linear programming · 0.2heuristic · 0.2simulation · 0.1mathematical analysis · 0.1
YearPublicationVenuePosition
2016 Energy-aware data center networks
Han-Peng Jiang, David Chuck, Wei-Mei Chen
J. Netw. Comput. Appl.2
2011 Energy-efficient design and optimization of wireline access networks
abstract
Access networks, in particular, Digital Subscriber Line (DSL) equipment, are a significant source of energy consumption for wireline operators. Replacing large monolithic DSLAMs with smaller remote DSLAM units closer to customers can reduce the energy consumption as well as increase the reach of the access network. This paper attempts to formalize the design and optimization of the “last mile” wireline access network with energy as one of the costs to be minimized. In particular, the placement of remote DSLAM units needs to be optimized. We propose solutions for two scenarios. For the scenario where an existing all-copper network from the central office to the customers is to be transformed into a fiber-copper network with remote DSLAM units, we present efficient polynomial-time solutions. For the green-field scenario, where both the access network layout and the placement of remote DSLAM units must be determined, we show that this problem is NP-complete. We present an optimal ILP formulation and also design an efficient heuristic-based approach to build a power and cost optimized access network. Our heuristic-based approach yields results that are very close to optimal. We show how the power consumption of the access network can be reduced by carefully planning the access network and introducing remote DSLAM units.
Sourjya Bhaumik, David Chuck, Girija J. Narlikar, Gordon T. Wilfong
INFOCOM2
2010 Bandwidth Recycling in IEEE 802.16 Networks
abstract
IEEE 802.16 standard was designed to support the bandwidth demanding applications with quality of service (QoS). Bandwidth is reserved for each application to ensure the QoS. For variable bit rate (VBR) applications, however, it is difficult for the subscriber stations (SSs) to predict the amount of incoming data. To ensure the QoS guaranteed services, the SS may reserve bandwidth more than the amount of its transmitting data. As a result, the reserved bandwidth may not be fully utilized all the time. In this paper, we propose a scheme, named Bandwidth Recycling, to recycle the unused bandwidth without changing the existing bandwidth reservation. The idea of our scheme is to allow other SSs to utilize the unused bandwidth when it is available. Thus, not only the same QoS guaranteed services can be provided but also the system throughput can be improved. Mathematical analysis and simulation are used to evaluate the proposed scheme. Simulation and analysis results confirm that our proposed scheme can recycle 35 percent of unused bandwidth on average. By analyzing factors affecting the recycling performance, three scheduling algorithms are proposed to improve the overall throughput. The simulation results show that our proposed algorithm can further improve the overall throughput by 40 percent when the network is in the steady state.
David Chuck, J. Morris Chang
IEEE Trans. Mob. Comput.1