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

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： Xi Zhang Jia Tang Networking and Information Systems Laboratory Department of Electrical Engineering Texas A and M University College Station TX USA

In order to support the quality of service (QoS) requirements for real-time traffic over broadband wireless networks, advanced techniques such as space-time diversity (STD) and multicarrier direct-sequence code division multiple access (MC-DS-CDMA) are implemented at the physical layer. However, the employment of such techniques evidently affects the QoS provisioning algorithms at the medium access control (MAC) layer. In this paper, we propose a space-time infrastructure and develop a set of cross-layer real-time QoS-provisioning algorithms for admission control, scheduling, and subchannel-allocations. We analytically map the parameters characterizing the space-time diversity onto the admission-control region guaranteeing the real-time QoS. Our analytical analyses show that the proposed algorithms can effectively support real-time QoS provisioning. Also presented are numerical solutions and simulation results showing that the space-time diversity can significantly improve the QoS provisioning for real-time services over wireless networks.

关键词： Wireless networks Quality of service Algorithm design and analysis Communication system traffic control Multiaccess communication Physical layer Employment Media Access Protocol Scheduling algorithm Admission control

来源：评论

学校读者我要写书评

暂无评论

QoS-driven asynchronous uplink subchannel allocation algorithms for space-time OFDM-CDMA systems in wireless networks

QoS-driven asynchronous uplink subchannel allocation algorit...

引用

International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE)

作者： Xi Zhang Jia Tang Networking and Information Systems Laboratory Department of Electrical Engineering Texas A and M University College Station TX USA

ISBN: (纸本)0769522335

In order to support the diverse quality of service (QoS) requirements for differentiated data applications in broadband wireless networks, advanced techniques such as space-time coding (STC) and orthogonal frequency division multiplexing (OFDM) are implemented at the physical layer. However, the employment of such techniques evidently affects the subchannel-allocation algorithms at the medium access control (MAC) layer. In this paper, we propose the QoS-driven cross-layer subchannel-allocation algorithms for data transmissions over asynchronous uplink space-time OFDM-CDMA systems. We mainly focus on QoS requirements of maximizing the best-effort throughput and proportional bandwidth fairness, while minimizing the upper-bound of scheduling delay. Our extensive simulations show that the proposed infrastructure and algorithms can achieve high bandwidth fairness and system throughput while reducing scheduling delay over wireless networks.

关键词： Wireless networks Quality of service OFDM Throughput Bandwidth Physical layer Employment Media Access Protocol Data communication Delay

来源：评论

学校读者我要写书评

暂无评论

Excitation of terahertz plasma oscillations in a field-effect heterostructure device by ultrashort optical pulses: Physics and modeling

Excitation of terahertz plasma oscillations in a field-effec...

引用

International Conference on Ultrafast Phenomena, UP 2004

作者： Ryzhii, V. Khmyrova, I. Ryzhii, M. Satou, A. Otsuji, T. Shur, M.S. Computer Solid State Physics Laboratory University of Aizu Aizu-Wakamatsu965-8580 Japan Department of Control Engineering and Science Kyushu Institute of Technology Iizuka820-8502 Japan Department of Electrical Computer and Systems Engineering Rcnssclaer Polytechnic Institute Troy12180 United States

We report on the proposal and modeling of a heterostructure device similar to a field-effect transistor using optical excitation of electron plasma oscillations and intended for generation of terahertz signals. ©... 详细信息

ISBN: (纸本)3540241108

关键词： Field effect transistors

来源：评论

学校读者我要写书评

暂无评论

The case for mobile OLAP

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3268卷 405-414页

作者： Maniatis, Andreas S. National Technical University of Athens Department of Electrical and Computer Engineering Knowledge and Database Systems Laboratory Greece

On-Line Analytical Processing (OLAP) is a trend in database technology, based on the multidimensional view of data. Numerous applications and development environments exist, offering OLAP analysis to developers, analysts and end users. Further more, mobile devices find their way into almost all aspects of every day life, ranging from cellular phones with advanced capabilities (smart phones) for personal use to professional PDA's used for numerous wireless applications - OLAP included - and thus generating the need for convergence of the two technologies. In this paper we introduce the term Mobile OLAP to express the porting of requirements and specifications for OLAP applications into the wireless and mobile computing world. More specifically, we examine the requirements posed for OLAP visualization applications on mobile devices, both in terms of presentation and usability. We then proceed by investigating the state of the art of the broader wireless computing community, focusing in the specifications more close to OLAP. Finally, we demonstrate how a "lightweight" presentation model for OLAP can significantly contribute towards mobile OLAP. © Springer-Verlag 2004.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

A novel packet marking scheme for IP traceback

A novel packet marking scheme for IP traceback

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： B. Al-Duwairi G. Manimaran Dependable Computing & Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA USA

Recently, several schemes have been proposed for IP traffic source identification for tracing denial of service (DoS) attacks. Most of these schemes require very large number of packets to conduct the traceback process, which results in lengthy and complicated procedure. In this paper, we address this issue by proposing a scheme, called probabilistic pipelined packet marking (PPPM), which employs the concept of "pipeline" for propagating marking information from one marking router to another so that it eventually reaches the destination. The key benefit of this pipeline process lies in drastically reducing the number of packets that is required for the traceback process. We evaluate the effectiveness of the proposed scheme for various performance metrics through combination of analytical and simulation studies. Our studies show that the proposed scheme offers high attack source detection percentage, and attack source localization distance of less than two hops under different attack scenarios.

关键词： computer crime Web and internet services computer networks Laboratories Telecommunication traffic Pipelines Measurement Performance analysis Analytical models Availability

来源：评论

学校读者我要写书评

暂无评论

A novel fairness algorithm for resilient packet ring networks with low computational and hardware complexity

A novel fairness algorithm for resilient packet ring network...

引用

IEEE Workshop on Local and Metropolitan Area Networks (LANMAN)

作者： F. Alharbi N. Ansari Advanced Networking Laboratory Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

The resilient packet ring (RPR), defined under IEEE 802.17, has been proposed as a high-speed backbone technology for metropolitan area networks. RPR is introduced to mitigate the underutilization and unfairness problems associated with the current technologies SONET and Ethernet, respectively. The key performance objectives of RPR is to achieve high bandwidth utilization, optimum spatial reuse on the dual rings, and fairness. The challenge is to design an algorithm that can react dynamically to the traffics in achieving these objectives. The RPR fairness algorithm (J. Kao et al., January 2002) is comparatively simple, but it poses some critical limitations that require further investigation and remedy. One of the major problems is that the amount of bandwidth allocated by the algorithm oscillates severely under the unbalanced traffic scenarios. These oscillations presents a barrier in achieving spatial reuse and high bandwidth utilization. We propose a low complexity fairness algorithm (LCFA) in allocating the bandwidth fairly to RPR nodes with a very low computational complexity O(1) that requires a simple hardware requirement similar to that of the RPR fairness algorithm.

关键词： computer networks Hardware Bandwidth Traffic control SONET Ethernet networks Protection Channel allocation Laboratories USA Councils

来源：评论

学校读者我要写书评

暂无评论

Reputation management framework and its use as currency in large-scale peer-to-peer networks

Reputation management framework and its use as currency in l...

引用

International Conference on Peer-to-Peer Computing

作者： R. Gupta A.K. Somani Dependable Computing and Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA USA

We propose a reputation management framework for large-scale peer-to-peer (P2P) networks, wherein all nodes are assumed to behave selfishly. The proposed framework has several advantages. It enables a form of virtual currency, such that the reputation of nodes is a measure of their wealth. The framework is scalable and provides protection against attacks by malicious nodes. The above features are achieved by developing trusted communities of nodes whose members trust each other and cooperate to deal with the problem of nodes' selfishness and possible maliciousness.

关键词： Intelligent networks Large-scale systems Peer to peer computing computer network management Protection engineering management Protocols computer networks Laboratories Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Evaluating dual-failure restorability in mesh-restorable WDM optical networks

Evaluating dual-failure restorability in mesh-restorable WDM...

引用

International Conference on computer Communications and Networks (ICCCN)

作者： M.T. Frederick P. Datta A.K. Somani Dependable Computing & Networking Laboratory Department of Electrical & Computer Engineering Iowa State University Ames IA USA

Double link failure models, in which any two links in the network fail in an arbitrary order, are becoming critical in survivable optical network design. A significant finding is that designs offering complete dual-failure restorability require almost triple the amount of spare capacity. In this paper, networks are designed to achieve 100% restorability under single link failures, while maximizing coverage against any second link failure in the network. In the event of a single link failure, the restoration model attempts to dynamically find a second alternate link-disjoint end-to-end path to provide coverage against a sequential overlapping link failure. Sub-graph routing (M. T. Frederick et al., Feb. 2003) is extended to provide dual-failure restorability for a network provisioned to tolerate all single-link failures. This strategy is compared with shared-mesh protection. The results indicate that sub-graph routing can achieve overlapping second link failure restorability for 95-99% of connections. It is also observed that sub-graph routing can inherently provide complete dual-failure coverage for ~72-81% of the connections

关键词： Intelligent networks Wavelength division multiplexing WDM networks Optical fiber networks Protection Routing computer networks Optical computing Optical design Laboratories

来源：评论

学校读者我要写书评

暂无评论

Optimal light trail design in WDM optical networks

Optimal light trail design in WDM optical networks

引用

IEEE International Conference on Communications (ICC)

作者： Jing Fang Wensheng He A.K. Somani Dependable Computing & Networking Laboratory Department of Electrical & Computer Engineering Iowa State University Ames IA USA

The enabling technology for supporting IP centric traffic over optical transport networks evolves as the amount of traffic grows. In this paper, we first review a recently proposed concept called light trails. Light trails can enable high speed provisioning, accommodate multigranularity traffic, support high data rates and offer a good candidate for carrying IP traffic over optical networks. Next, we focus on light trail design. We propose a two-step approach for solving the light trail design problem. The first step is called traffic matrix preprocessing, it divides single long hop paths into several shorter paths that satisfy the hop-length constraint. In the second step, the light trail design problem is formulated as an integer linear programming (ILP) optimization problem. The results obtained from our experiments show that the resulting light trail network has high wavelength utilization.

关键词： Optical design Intelligent networks Wavelength division multiplexing WDM networks Optical fiber networks Telecommunication traffic High speed optical techniques Optical buffering Bandwidth computer networks

来源：评论

学校读者我要写书评

暂无评论

Core-stateless proportional fair queuing for AF traffic

Core-stateless proportional fair queuing for AF traffic

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： Gang Cheng Kai Xu Ye Tian N. Ansari Advanced Networking Laboratory Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

Proportional fair queuing is to ensure that a flow passing through the network only consumes a fair share of the network resource that is proportional to its committed rate or other service level agreement (SLA). It is of great importance in Differentiated Services (DiffServ) networks as well as other price incentive network services. In this paper, we propose a simple core-stateless proportional fair queuing algorithm (CSPFQ) for the assured forward (AF) traffic in DiffServ networks. We first develop our algorithm based on a fluid model analysis and then extend it to a realizable packet level algorithm. We prove analytically and instantiate through simulations that our algorithm can achieve proportional fair bandwidth allocation among competing flows without requiring routers to estimate flows' fair share rates. Our simulation results also demonstrate that our algorithm outperforms the weighted core-stateless fair queuing (WC-SFQ) in terms of proportional fairness.

关键词： Traffic control Channel allocation Diffserv networks IP networks Bandwidth Telecommunication traffic Algorithm design and analysis Web and internet services Laboratories Forward contracts

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：