检索结果-内蒙古大学图书馆

114th Annual ASEE Conference and Exposition, 2007

作者： Rajaravivarma, Veeramuthu Baumann, Peter Central Connecticut State University United States Computer Electronics and Graphics Technology Department Central Connecticut State University New Britain CT United States Program Coordinator of Computer Engineer Technology IEEE-Connecticut Section United States Department of Engineering CCSU

In November 2004 an innovative undergraduate computer Engineering technology program based on TAC of ABET program assessment criteria was granted licensure by the State department of Higher Education. The University has considerable experience with accreditation and associated assessment activities, most recently reporting on an "Incommon Methodology for Objective- and Outcome-based Programs Assessment" (Lema, L.F., Baumann, P.F., and Prusak, Z., ASEE 2005 Annual Conference) across three engineering technology programs. This study reports an assessment component within the computer Engineering technology program in accordance with ABET accreditation criteria. The implementation process was conducted in an undergraduate course in the program. The initial phase involves identification of course goals, and based on these goals, the measurable learning outcomes are formulated. Using web-based methodology and course management tools such as WebCT or Vista, the learning outcomes are measured in the form of pre- and post-course survey data from students. Data can be imported to data management tools such as Excel for analysis and evaluation. This study uses computer programs as tools to facilitate data collection and data analysis, making the data intensive portion of the assessment and evaluation process an easier endeavor. Applicability towards the assessment efforts of other engineering technology programs is also addressed. © American Society for Engineering Education, 2007.

关键词： E-learning

来源：评论

学校读者我要写书评

暂无评论

Visual route and virtual network computing exercises for computer network courses

Visual route and virtual network computing exercises for com...

引用

114th Annual ASEE Conference and Exposition, 2007

作者： Rajaravivarma, Veeramuthu Bellarmine, G. Thomas Central Connecticut State University United States Computer Electronics and Graphics Technology Department Central Connecticut State University New Britain CT United States IEEE-Connecticut Section United States Florida A and M-Florida State University United States Florida A and M University United States IEEE United States ASEE United States

Knowledge of networking concepts (network usage) has become crucial in today's world where all of us use different types of networks in our day-to-day life. But in a field like networking, real understanding can be achieved only by hands-on exercises. In this article, six lab exercises on Visual Route and Virtual Network Computing software suites are discussed, and how they could be further enhanced by teaming them with firewall hardware/packet sniffers, or with firewall software such as Zone Alarm. This work can be expanded with discussions of other networking concepts and technologies that will enhance one's networking experience. © American Society for Engineering Education, 2007.

关键词： computer science

来源：评论

学校读者我要写书评

暂无评论

High performance computing in classroom environment

High performance computing in classroom environment

引用

113th Annual ASEE Conference and Exposition, 2006

作者： Farahmand, Farid Rajaravivarma, Veeramuthu Central Connecticut State University United States Computer Electronics and Graphics Technology Department Central Connecticut State University New Britain CT United States

The need for high performance computing continues to grow in the coming years. Such needs are no longer limited to highly advanced scientific organizations. Today, many educational and business communities also desire high computational power to expand their activities and maintain their services. However, the high cost of a single supercomputer with massive multi-processing power makes them infeasible for many such users. An alternative approach to high performance computing is computer clustering, which provides practical and feasible infrastructure to accommodate high computational power. The key concept in computer clustering is to unify available computing resources. Recently, many different organizations, including corporations and universities, have been implementing the cluster computing. Consequently, learning and understanding the basics of cluster computing can be considered as a valuable academic investment for IT and technology students. The main purpose of this paper is to present a practical demonstration of computer clustering. We introduce a simple and easy-to-use Windows-based graphical software toolkit, called Paloma (Parallel Local Message-passing Adaptor), which was developed by Advanced Internet technology Lab at CCSU. Paloma allows students to easily create a computer cluster using multiple PCs interconnected to each other via LAN or Ethernet. Through Paloma's integrated GUI and its performance monitoring capacity, the students will understand the motivation for high performance computing, advantages of computer clustering, as well as, the challenges and limitations of a cluster system. Flexibility of Paloma allows students to use it outside the classroom environment and develop their own what-if scenarios. In this paper we describe a number of test cases for laboratory experiments, which appeared to be very attractive to our students. Furthermore, we discuss possible extensions to these demonstrations and briefly outline our future plans for

关键词： Engineering education

来源：评论

学校读者我要写书评

暂无评论

Anycast algorithms supporting optical burst switched grid networks

Anycast algorithms supporting optical burst switched grid ne...

引用

International Conference on Networking and Services 2006, ICNS'06

作者： De Leenheer, Marc Farahmand, Farid Lu, Kejie Zhang, Tao Thysebaert, Pieter Volckaert, Bruno De Turck, Filip Dhoedt, Bart Demeester, Piet Jue, Jason P. Department of Information Technology Ghent University IMEC Department of Computer Electronics and Graphics Technology Central Connecticut State University Department of Electrical and Computer Engineering University of Puerto Rico Mayagüez Puerto Rico Department of Computer Science New York Institute of Technology Old Westbury Department of Electrical Engineering and Computer Science University of Texas Dallas United States

ISBN: (纸本)0769526225

In this paper we consider implementing optical burst switching as a technology for building Grids with computationally intensive requirements. This architecture has been referred to as Grid-over-OBS (GoOBS). First, we briefly describe the proposed layered Grid architecture and show how OBS can be positioned within the Grid architecture. Then, we present a generic framework for anycast routing in the context of GoOBS when requests don't have an explicit destination address and they can be serviced by any appropriate Grid resource. We also develop several algorithms to support anycasting when only a single copy of a request is transmitted. Through simulation analysis, we show the performance of our anycast algorithms and compare them with traditional shortest-path unicast routing in which all jobs have specific addresses. Our performance analysis focuses on blocking probability of requests and average end-to-end delay. © 2006 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Anycast Algorithms Supporting Optical Burst Switched Grid Networks

Anycast Algorithms Supporting Optical Burst Switched Grid Ne...

引用

International Conference on Networking and Services (ICNS)

作者： M. De Leenheer F. Farahmand Kejie Lu Tao Zhang P. Thysebaert B. Volckaert F. De Turck B. Dhoedt P. Demeester J.P. Jue Department of Information Technology Ghent University - IBBT - IMEC Department of Computer Electronics and Graphics Technology Central Connecticut State University Department of Electrical and Computer Engineering University of Puerto Rico at Mayagüez Department of Computer Science New York Institute of Technology Old Westbury Department of Electrical Engineering and Computer Science The University of Texas at Dallas

In this paper we consider implementing optical burst switching as a technology for building grids with computationally intensive requirements. This architecture has been referred to as grid-over-OBS (GoOBS). First, we briefly describe the proposed layered grid architecture and show how OBS can be positioned within the grid architecture. Then, we present a generic framework for anycast routing in the context of GoOBS when requests don't have an explicit destination address and they can be serviced by any appropriate grid resource. We also develop several algorithms to support anycasting when only a single copy of a request is transmitted. Through simulation analysis, we show the performance of our anycast algorithms and compare them with traditional shortest-path unicast routing in which all jobs have specific addresses. Our performance analysis focuses on blocking probability of requests and average end-to-end delay

关键词： Optical fiber networks computer architecture Routing Performance analysis Optical burst switching Buildings Grid computing Optical computing Context-aware services Analytical models

来源：评论

学校读者我要写书评

暂无评论

A closed-loop rate-based contention control for optical burst switched networks

A closed-loop rate-based contention control for optical burs...

引用

GLOBECOM'05: IEEE Global Telecommunications Conference, 2005

作者： Farahmand, Farid Zhang, Qiong Jue, Jason P. Department of Computer Electronics and Graphics Technology Central Connecticut State University New Britain CT 06050 Mathematical Sciences and Applied Computing Arizona State University West United States Department of Computer Science University of Texas at Dallas Richardson TX 75083

ISBN: (纸本)0780394143

In this paper we describe a rate-based OBS network architecture in which core switch nodes send explicit messages to edge nodes requesting them to reduce their transmission rate on congested links. Within this framework, we introduce a new contention avoidance mechanism called proportional control algorithm with explicit reduction request (PCwER). Through source rate control, PCwER proactively attempts to prevent the network from entering the congestion state. Basic building blocks and performance trade-offs of PCwER are the main focus of this paper. In addition, through a simple fluid model we analyze the characteristics of the algorithm. Our simulation results show that the proposed contention avoidance techniques improve the network utilization and reduce the packet loss probability.

关键词： Closed loop control systems

来源：评论

学校读者我要写书评

暂无评论

A multi-layered approach to optical burst-switched based grids

A multi-layered approach to optical burst-switched based gri...

引用

International Conference on Broadband Networks (BroadNets)

作者： F. Farahmand M. De Leenheer P. Thysebaert B. Volckaert F. De Turck B. Dhoedt P. Demeestert J.P. Jue Department of Computer Electronics and Graphics Technology Central Connecticut State University Gent Belgium Department of Computer Electronics and Graphics Technology Central Connecticut State University Dept. of Electrical Engineering and Computer Science The University of Texas at Dallas Department of Information Technology Ghent University-IBBT-IMEC Gent Belgium Department of Electrical Engineering and Computer Science University of Texas Dallas Gent Belgium Dept. of Information Technology Ghent University - IBBT - IMEC Gaston Crommenlaa Belgium

In this paper we consider implementing optical burst switching as an alternative approach to meet computationally intensive grid applications. Such architecture has been referred to as grid-over-OBS (GoOBS). We first present a unique layered architecture for grid-over-OBS and position OBS protocol stack within the framework of the layered grid architecture. Then, we present a generic framework for anycast routing in the context of GoOBS when requests don't have explicit addresses and they can be serviced by any appropriate grid resource. We develop several algorithms to support an casting when only a single copy of a request is transmitted. Through simulation analysis, we show the performance of our anycast algorithms and compare them with the shortest-path unicast routing in which all jobs have specific addresses. In our performance analysis, we focus on average end-to-end delay and blocking probability of requests

关键词： computer architecture Routing Performance analysis Optical burst switching computer applications Grid computing Optical computing Protocols Context-aware services Casting

来源：评论

学校读者我要写书评

暂无评论

Data burst grooming in optical burst-switched networks

Data burst grooming in optical burst-switched networks

引用

International Conference on Broadband Networks (BroadNets)

作者： F. Farahmand Q. Zhang J.P. Jue Department of Computer Electronics and Graphics Technology Central Connecticut State University New Britain CT USA Mathematical Sciences and Applied Computing Arizona State University USA Department of Computer Science University of Texas Dallas Richardson TX USA

In this paper we address the problem of data burst grooming in optical burst-switched (OBS) networks. In OBS networks IP packets with the same edge node destination are assembled into larger packets called data bursts. Depending on the core node's switching technology, data bursts are required to have a minimum length. On the other hand, each IP packet in a burst has a time delay constraint, called maximum end-to-end delay, which determines the upper time limit before which the packet must reach its destination. Thus, a data burst cannot wait indefinitely until sufficient number of IP packets are assembled and the minimum burst length requirement is met. In order to satisfy the packet maximum end-to-end delay requirement, many bursts will be timed out and released before they reach the minimum length requirement. Under such circumstances, padding overhead must be added to these short bursts, called sub-bursts. Excessive padding results in high overhead and high data burst blocking probability. One approach to minimize the amount of padding overhead, while maintaining the end-to-end delay requirement of IP packets, is to groom multiple sub-bursts together. That is, sub-bursts with different destinations are aggregated together at the edge node and transmitted as a single burst until they are separated at some downstream node. In this paper we present an edge node architecture enabling burst grooming capability. We also develop two basic grooming approaches, namely no-routing-overhead (NoRO) and minimum-total-overhead (MinTO). Through a comprehensive simulation study we show that, in general, our proposed grooming algorithms can significantly improve the performance compared to the case of no grooming. However, careful considerations must be given to network loading condition and the number of sub-bursts allowed to be groomed together. We show that although simple greedy algorithms can reduce network overhead, they may alter the traffic characteristics and increase it

关键词： Intelligent networks Optical fiber networks Assembly Optical network units Delay effects Optical packet switching computer networks Optical computing Telecommunication traffic Bandwidth

来源：评论

学校读者我要写书评

暂无评论

A closed-loop rate-based contention control for optical burst switched networks

A closed-loop rate-based contention control for optical burs...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： F. Farahmand Qiong Zhang J.P. Jue Department of Computer Electronics and Graphics Technology Central Connecticut State University New Britain CT USA Mathematical Sciences and Applied Computing Arizona State University USA Department of Computer Science University of Texas Dallas Richardson TX USA

关键词： Optical control Optical fiber networks Optical feedback Optical network units Optical packet switching Optical losses Optical buffering computer networks Optical computing Switches

来源：评论

学校读者我要写书评

暂无评论

Performance of the H.263 Video Compression Standard

引用

Journal of VLSI Signal Processing Systems for Signal, Image, and Video technology 1997年第2-3期17卷 101-111页

作者： Girod, Bernd Steinbach, Eckehard Färber, Nikolaus Telecommunications Institute University of Erlangen-Nuremberg 91058 Erlangen Cauerstrasse 7 Germany Georgia Institute of Technology United States University of Hannover Germany Inst. F. Theor. N. University of Hannover Germany Massachussetts Inst. of Technology Cambridge MA United States Research Laboratory of Electronics United States Department of Media Technology Media Laboratory Germany Department of Computer Graphics Germany Academy of Media Arts Cologne Germany Computer Science Section Cologne University Germany Digital Signal Processing Group Georgia Institute of Technology Atlanta GA United States Dept. of Elec. Eng./Telecom. University of Erlangen-Nuremberg Germany Telecommunications Institute Germany Vivo Software Inc. Waltham MA United States University of Karlsruhe Germany University of Essex United Kingdom ESIEE Paris France Image Communication Group Telecommunications Institute University of Erlangen-Nuremberg Germany University of Munich Germany Telecommunications Institute University of Erlangen-Nuremberg Germany Image Communication Group

The draft international standard ITU-T H.263 is closely related to the well known and widely used ITU-T Recommendation H.261. However, H.263 does provide the same subjective image quality at less than half the bit-rate. In this paper we investigate to what extend single enhancements of H.263 contribute to this performance gain, and consider the trade-off quality vs. complexity. Based on typical test sequences, H.263 with its various modes is compared to H.261 on the basis of rate distortion curves at bit-rates up to 128 kbps. At 64 kbps, the performance gain of H.263 in its default mode compared to H.261 is approximately 2 dB. This improvement is achieved with only little increase of complexity, and is mainly due to more accurate motion compensation with half-pel accuracy. Considering the trade-off quality vs. complexity, the combination of the optional coding-modes "Advanced prediction mode" and "PB-frames mode" is a good compromise, resulting in an additional performance gain of 1.5 dB PSNR at 64 kbps. The "Syntax-based arithmetic coding mode" on the other hand, offers only a very small performance gain (0.1 dB at 64 kbps) for its increased computational complexity. Results from profiling an H.263 software codec are presented in order to support complexity considerations of the optional coding-modes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：