@conference {19260,
	title = {Design methods for Wireless Sensor Network Building Energy Monitoring Systems},
	booktitle = {2011 IEEE 36th Conference on Local Computer Networks (LCN)},
	year = {2011},
	month = {2011},
	pages = {974 - 981},
	abstract = {In this paper, we present a new energy analysis method for evaluating energy consumption of embedded sensor nodes at the application level and the network level. Then we apply the proposed energy analysis method to develop new energy management schemes in order to maximize lifetime for Wireless Sensor Network Building Energy Monitoring Systems (WSNBEMS). At the application level, we develop a new design approach that uses dataflow techniques to model the application-level interfacing behavior between the processor and sensors on an embedded sensor node. At the network level, we analyze the energy consumption of the IEEE 802.15.4 MAC functionality. Based on our techniques for modeling and energy analysis, we have implemented an optimized WSNBEMS for a real building, and validated our energy analysis techniques through measurements on this implementation. The performance of our implementation is also evaluated in terms of monitoring accuracy and energy consumption savings. We have demonstrated that by applying the proposed scheme, system lifetime can be improved significantly without affecting monitoring accuracy.},
	keywords = {Analytical models, application-level interfacing behavior, building energy monitoring system, Buildings, dataflow technique, embedded sensor node, energy analysis method, Energy consumption, energy management systems, Energy resolution, IEEE 802.15.4 MAC functionality, Monitoring, OPTIMIZATION, wireless sensor network, Wireless sensor networks, WSNBEMS, Zigbee},
	author = {Cho, Inkeun and Chung-Ching Shen and Potbhare, S. and Bhattacharyya, Shuvra S. and Goldsman,N.}
}
@conference {19296,
	title = {Simulating dynamic communication systems using the core functional dataflow model},
	booktitle = {2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)},
	year = {2010},
	month = {2010},
	pages = {1538 - 1541},
	abstract = {The latest communication technologies invariably consist of modules with dynamic behavior. There exists a number of design tools for communication system design with their foundation in dataflow modeling semantics. These tools must not only support the functional specification of dynamic communication modules and subsystems but also provide accurate estimation of resource requirements for efficient simulation and implementation. We explore this trade-off - between flexible specification of dynamic behavior and accurate estimation of resource requirements - using a representative application employing an adaptive modulation scheme. We propose an approach for precise modeling of such applications based on a recently-introduced form of dynamic dataflow called core functional dataflow. From our proposed modeling approach, we show how parameterized looped schedules can be generated and analyzed to simulate applications with low run-time overhead as well as guaranteed bounded memory execution. We demonstrate our approach using the Advanced Design System from Agilent Technologies, Inc., which is a commercial tool for design and simulation of communication systems.},
	keywords = {adaptive modulation, Analytical models, Application software, Computational modeling, core functional dataflow model, Dataflow, dataflow modeling semantics, design tools, Digital signal processing, dynamic communication systems, functional specification, Hardware, modeling and simulation, Power system modeling, Predictive models, Processor scheduling, Production, Signal processing, software tools, wireless communication},
	author = {Sane, N. and Chia-Jui Hsu and Pino,J. L and Bhattacharyya, Shuvra S.}
}
@conference {15694,
	title = {Immunity-Based Epidemic Routing in Intermittent Networks},
	booktitle = {5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2008. SECON {\textquoteright}08},
	year = {2008},
	month = {2008/06/16/20},
	pages = {609 - 611},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this research, we propose to modify and extend epidemic routing used in intermittent networks. In particular, we propose to include immunity-based information disseminated in the reverse once messages get delivered to their destination. The goal is to design a more efficient routing protocol in terms of resource utilization. The idea is to analyze and evaluate the network performance using an immunity scheme in the context of epidemic routing and its variants. The reverse dissemination of such information requires minimal resources and the tradeoff in timely purging of delivered messages can be significant. We are using ns2 to implement a detailed simulation of the proposed immunity-based epidemic routing.},
	keywords = {Analytical models, Delay, delivered messages, Disruption tolerant networking, Educational institutions, immunity-based epidemic routing, information dissemination, intermittent networks, Mobile ad hoc networks, Network topology, Performance analysis, Resource management, resource utilization, routing protocol, routing protocols, telecommunication network topology},
	isbn = {978-1-4244-1777-3},
	doi = {10.1109/SAHCN.2008.86},
	author = {Mundur, Padma and Seligman,M. and Jin Na Lee}
}
@article {15678,
	title = {Class-based access control for distributed video-on-demand systems},
	journal = {IEEE Transactions on Circuits and Systems for Video Technology},
	volume = {15},
	year = {2005},
	month = {2005/07//},
	pages = {844 - 853},
	abstract = {The focus of this paper is the analysis of threshold-based admission control policies for distributed video-on-demand (VoD) systems. Traditionally, admission control methods control access to a resource based on the resource capacity. We have extended that concept to include the significance of an arriving request to the VoD system by enforcing additional threshold restrictions in the admission control process on request classes deemed less significant. We present an analytical model for computing blocking performance of the VoD system under threshold-based admission control. Extending the same methodology to a distributed VoD architecture we show through simulation that the threshold performance conforms to the analytical model. We also show that threshold-based analysis can work in conjunction with other request handling policies and are useful for manipulating the VoD performance since we are able to distinguish between different request classes based on their merit. Enforcing threshold restrictions with the option of downgrading blocked requests in a multirate service environment results in improved performance at the same time providing different levels of quality of service (QoS). In fact, we show that the downgrade option combined with threshold restrictions is a powerful tool for manipulating an incoming request mix over which we have no control into a workload that the VoD system can handle.},
	keywords = {Access control, Admission control, Analytical models, blocking performance, class-based access control, Computational modeling, Computer architecture, Computer science, Distributed control, Distributed video-on-demand (VoD) system, distributed video-on-demand system, multimedia systems, multirate service model, Performance analysis, QoS, quality of service, request handling policy, resource allocation, resource capacity, telecommunication congestion control, threshold-based admission control, video on demand},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2005.848351},
	author = {Mundur, Padma and Sood,A. K and Simon,R.}
}
@conference {17875,
	title = {High Performance Communication between Parallel Programs},
	booktitle = {Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International},
	year = {2005},
	month = {2005/04//},
	pages = {177b- 177b - 177b- 177b},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present algorithms for high performance communication between message-passing parallel programs, and evaluate the algorithms as implemented in InterComm. InterComm is a framework to couple parallel programs in the presence of complex data distributions within a coupled application. Multiple parallel libraries and languages may be used in the different programs of a single coupled application. The ability to couple such programs is required in many emerging application areas, such as complex simulations that model physical phenomena at multiple scales and resolutions, and image data analysis applications. We describe the new algorithms we have developed for computing inter-program communication patterns. We present experimental results showing the performance of various algorithmic tradeoffs, and also compare performance against an earlier system.},
	keywords = {Adaptive arrays, Analytical models, Chaotic communication, Computational modeling, Computer science, Data analysis, data distribution, Educational institutions, high performance communication, image data analysis, image resolution, inter-program communication patterns, InterComm, Libraries, Message passing, parallel languages, parallel libraries, parallel programming, parallel programs, performance evaluation, Wind},
	isbn = {0-7695-2312-9},
	doi = {10.1109/IPDPS.2005.243},
	author = {Jae-Yong Lee and Sussman, Alan}
}
@conference {12086,
	title = {Achieving packet-level quality of service through scheduling in multirate WLANs},
	booktitle = {Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th},
	volume = {4},
	year = {2004},
	month = {2004/09/26/29},
	pages = {2730- 2734 Vol. 4 - 2730- 2734 Vol. 4},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Wireless packet scheduling has been a popular paradigm to achieve packet-level QoS in terms of fairness and throughput in the presence of channel errors. However, the current design does not anticipate the multi-rate capability offered by the IEEE 802.11a/b/g physical layer, thus suffering significant performance degradation in 802.11 WLANs. In this paper, we propose multirate wireless fair scheduling (WMFS). In MWFS, each flow is granted a temporal fair share of the channel, in contrast to the throughput fair share adopted by existing algorithms. Therefore, each flow receives services in proportion to its perceived transmission rate, and high-rate flows are able to opportunistically exploit their good channel conditions and receive more services. MWFS also renovates the compensation model in order to allow for error-prone flows to catch up, thus ensuring fairness for all flows over error-prone channels. We demonstrate the effectiveness of MWFS through both simulations and analysis. Especially, WMFS achieves system throughput 159\% of state-of-the-art scheduling algorithms in simulated scenarios.},
	keywords = {Analytical models, channel conditions, channel errors, channel temporal fair share, compensation, Computer science, Delay, error-prone flow compensation, IEEE 802.11a/b/g physical layer, multirate wireless fair scheduling, multirate WLAN, packet radio networks, packet-level quality of service, Physical layer, Processor scheduling, QoS, quality of service, radio access networks, Scheduling algorithm, Throughput, throughput fairness, USA Councils, Wireless LAN, wireless packet scheduling, WMFS},
	isbn = {0-7803-8521-7},
	doi = {10.1109/VETECF.2004.1400554},
	author = {Yuan Yuan and Daqing Gu and Arbaugh, William A. and Jinyun Zhang}
}
@article {15679,
	title = {End-to-end analysis of distributed video-on-demand systems},
	journal = {IEEE Transactions on Multimedia},
	volume = {6},
	year = {2004},
	month = {2004/02//},
	pages = {129 - 141},
	abstract = {The focus of the research presented in this paper is the end-to-end analysis of a distributed Video-on-Demand (VoD) system. We analyze the distributed architecture of a VoD system to design global request handling and admission control strategies and evaluate them using global metrics. The performance evaluation methodology developed in this paper helps in determining efficient ways of using all resources in the VoD architecture within the constraints of providing guaranteed high quality service to each request. For instance, our simulation results show that request handling policies based on limited redirection of blocked requests to other resources perform better than load sharing policies. We also show that request handling policies based on redirection have simpler connection establishment semantics than load sharing policies and, therefore, are easily incorporated into reservation or signaling protocols.},
	keywords = {Admission control, admission control strategies, Analytical models, Computer science, distributed architecture, distributed video-on-demand systems, end-to-end analysis, global request handling, High-speed networks, Network servers, Next generation networking, Performance analysis, performance evaluation methodology, Protocols, request handling, reservation protocols, resource allocation, Resource management, signaling protocols, telecommunication congestion control, video on demand, Video sharing},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2003.819757},
	author = {Mundur, Padma and Simon,R. and Sood,A. K}
}
@conference {15680,
	title = {Threshold-based admission control for multi-class video-on-demand systems},
	booktitle = {Performance, Computing and Communications, 1998. IPCCC {\textquoteright}98., IEEE International},
	year = {1998},
	month = {1998/02/16/18},
	pages = {154 - 160},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The next generation of distributed digital video-on-demand (VoD) systems will use admission control tests to ensure that users receive predictable and guaranteed service. If the system cannot support a new request then that request is blocked This paper presents an analytical model to evaluate unified admission control strategies for distributed VoD systems with multiple video classes. We prove that there exists a computationally efficient technique to determine the blocking probabilities for newly arriving requests. Through numerical analysis we show the effect of different admission control policies on overall system blocking rates},
	keywords = {Admission control, admission control tests, analytical model, Analytical models, blocking probabilities, buffer storage, Computer architecture, distributed digital VoD systems, File servers, guaranteed service, High-speed networks, interactive video, Motion pictures, multi-class video-on-demand systems, multimedia systems, Network servers, newly arriving requests, numerical analysis, Predictive models, probability, recursive algorithm, system blocking rates, telecommunication congestion control, threshold-based admission control, unified admission control},
	isbn = {0-7803-4468-5},
	doi = {10.1109/PCCC.1998.659937},
	author = {Mundur, Padma and Sood,A. and Simon,R.}
}
