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

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

作者： Yijie Han Xiaojun Shen Electronic Data Systems Inc. 750 Tower Drive CPS Mail Stop 7121 Troy MI Computer Science Telecommunications Program University of Missouri Kansas City 5100 Rockhill Road Kansas City MO

来源：评论

学校读者我要写书评

暂无评论

DQFS service: a tunable scheme to reduce scheduling overhead in integrated services networks

DQFS service: a tunable scheme to reduce scheduling overhead...

引用

Conference on Local computer Networks (LCN)

作者： M.S. Boykin T.F. Znati Department of Computer Science University of Pittsburgh Pittsburgh PA USA Telecommunications Program University of Pittsburgh Pittsburgh PA USA

Discrete service disciplines have been shown capable of emulating the ideal Generalized Processor Sharing discipline within one maximum-sized packet's transmission time. As a result, the accuracy of such schemes increases with improvements in link speed due to the corresponding reduction in packet transmission delay. However, the merits of such accuracy diminish with improvements in link speed as its impact on call admission decisions decreases. Meanwhile, overhead, in terms of the number of scheduling decisions to be made per unit time, increases with the number of packets transmitted. In response, this paper will present the DQFS service discipline which enables GPS emulation servers to dynamically "tune" their service quanta based upon the QoS requirements of their currently supported applications rather than the network's maximal packet size. It will also demonstrate how the overhead of a GPS emulation server can be reduced in high speed networks without jeopardizing QoS guarantees or adversely impacting fairness.

关键词： Intelligent networks Intserv networks Global Positioning System Processor scheduling Emulation computer science Network servers High-speed networks Influenza

来源：评论

学校读者我要写书评

暂无评论

Low-cost, bounded-delay multicast routing for QoS-based networks

Low-cost, bounded-delay multicast routing for QoS-based netw...

引用

International Conference on computer Communications and Networks (ICCCN)

作者： T. Alrabiah T.F. Znati Department of Computer Science University of Pittsburgh Pittsburgh PA USA Telecommunications Program University of Pittsburgh Pittsburgh PA USA

Development of efficient multicasting algorithms which support a wide range of quality of service requirements is crucial to the successful deployment of multimedia applications. In this paper we present a new class of low-cost, bounded delay multicast heuristics for integrated service networks. The heuristics use various techniques to find the solution to the multicast problem, if one exists. These heuristics are described and shown to be cycle free and of complexity O(zn/sup 2/) where z is the number of multicast nodes and n is the number of nodes in the network. We also show that if no delay bound was violated during the construction of the tree, the proposed heuristics give an approximation that does not exceed in average the cost of the optimal solution by more than 5%.

关键词： Routing Multicast algorithms Delay Costs Multicast protocols Intserv networks Steiner trees Internet computer science Quality of service

来源：评论

学校读者我要写书评

暂无评论

Improved lightpath (wavelength) routing in large WDM networks

Improved lightpath (wavelength) routing in large WDM network...

引用

International Conference on Distributed Computing Systems

作者： Weifa Liang G. Havas Xiaojun Shen Department of Mathematics University of Queensland QLD Australia Centre for Discrete Mathematics and Computing Department of Computer Science and Electrical Engineering University of Queensland QLD Australia Computer Science Telecommunications Program University of Missouri Kansas City Kansas City USA

We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpath is a fully optical transmission path, while a semilightpath is a transmission path constructed by chaining several lightpaths together, using wavelength conversion at their junctions. The problem thus is to find an optimal lightpath/semilightpath in the network in terms of the cost of wavelength conversion and the cost of using the wavelengths on links. We first present fast, efficient algorithms both for the general problem and for a natural restricted version. The new algorithms outperform earlier work, providing time improvements amounting to an almost linear time factor in most cases. Also, all our algorithms can be implemented on the network in a distributed way.

关键词： Wavelength routing Intelligent networks WDM networks Optical wavelength conversion Biomedical optical imaging Optical fiber networks Costs High speed optical techniques Bandwidth Mathematics

来源：评论

学校读者我要写书评

暂无评论

A simulation framework for the analysis of multicast tree algorithms

A simulation framework for the analysis of multicast tree al...

引用

Annual Symposium on Simulation

作者： T. Alrabiah T.F. Znati Department of Computer Science University of Pittsburgh Pittsburgh PA USA Telecommunications Program University of Pittsburgh Pittsburgh PA USA

Group communications in high speed networks require the development of efficient multicast algorithms. Finding the optimal multicast routing tree for a subset of a network nodes is an NP-complete problem known as the Steiner Minimal Tree (SMT). Several heuristics were developed to provide an approximate solutions for this problem. The analysis of these heuristics, however, have been limited to specific network topologies. This paper discusses a flexible simulation framework to study the performance of multicasting algorithms in different topologies, including dense and sparse networks. The framework is then used to provide a detailed analysis of the performance of a selected set of path distance heuristics frequently discussed in the literature. The performance of these heuristics as then compared to two new heuristics, namely Normalized Average Distance Heuristic (NADH) and Shared Average Distance Heuristic (SADH). The results show that, on average, NADH outperforms all other heuristics in dense network topologies. The results also show that SADH out-performs the selected set of path distance heuristics for most network topologies.

关键词： Analytical models Algorithm design and analysis Multicast algorithms Routing Network topology Multimedia databases Delay Computational modeling Steiner trees Surface-mount technology

来源：评论

学校读者我要写书评

暂无评论

Integrated control of connection admission, flow rate, and bandwidth for ATM based networks

Integrated control of connection admission, flow rate, and b...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： A. Pitsillides P. Ioannou D. Tipper Department of Computer Science University of Cyprus Department of Mathematics University of Cyprus Telecommunications Program University of Pittsburgh USA

We consider the combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, service-rate) under nonstationary conditions. A fluid flow model in state variable form describes the time varying mean behaviour of available bit rate (ABR) traffic, which competes with guaranteed traffic for network resources. Using nonlinear control we derive an integrated control strategy, for the finite buffer and finite server case, that is insensitive to any propagation delay. We also derive bounds on mix between ABR and guaranteed traffic to ensure that control strategy is effective, and select control design variables which can be used to influence the delivered QoS. The performance of proposed scheme is evaluated using analysis and simulation. Simulation results show that it achieves effective server and buffer utilisation (as predicted by analysis) and by appropriate choice of control design variables achieves prescribed bounded delays (for guaranteed traffic only) and zero cell loss (even for ABR traffic demands exceeding server capacity, which if not controlled would cause losses). Hence proposed scheme delivers guaranteed QoS to user and avoids retransmissions, thus increasing network utilisation.

关键词： Centralized control Communication system traffic control Traffic control Fluid flow control Network servers Control design Analytical models Channel allocation Fluid flow Bit rate

来源：评论

学校读者我要写书评

暂无评论

The computer science fair: an alternative to the computer programming contest 96

The computer science fair: an alternative to the computer pr...

引用

Proceedings of the twenty-seventh SIGCSE technical symposium on computer science education

作者： Sue Fitzgerald Mary Lou Hines Department of Math Computer Science and Physics Rockhurst College Kansas City MO Computer Science and Telecommunications Program University of Missouri -- Kansas City Kansas City MO

ISBN: (纸本)9780897917575

Dissatisfaction with the results of programming contest events has led to the development of a new type of competitive event, a computer science fair. The computer science fair, a combination art show/science fair, is designed to attract a wider diversity of participants, to encourage creativity, and to reinforce good project development practices. Students are asked to creatively use technology to express themselves, to design new inventions, and to solve problems by submitting projects in the following categories: 1) computers and the arts and humanities --- computer music, computer art, multimedia projects; 2) computer programs --- entertainment, education, scientific, business, modeling and simulation; and 3) computer or electronically controlled inventions. This paper outlines the rules for submissions and judging of projects and the results of the First Annual Kansas City computer science Fair. Results based on gender and age category are reported.

关键词： gender issues

来源：评论

学校读者我要写书评

暂无评论

Partition and task migration on k-extra-stage omega networks

Partition and task migration on k-extra-stage omega networks

引用

International Conference on Parallel Processing (ICPP)

作者： Xiaojun Shen Yixin Zhang Computer Science Telecommunications Program University of Missouri Kansas City Kansas City MO USA Computer Science Department Guangdong Institute of Technology Guangzhou Guangdong China

ISBN: (纸本)081867623X

In a large-scale parallel computing system the interconnection network is its key component. Partitionability of such a network is an important feature which allow multiple tasks to be run independently on different subsystems. Partitionable networks also provide fault-tolerant ability by localizing and disabling the minimal faulty subsystem so the entire system can gracefully sustain the normal computation. A task run on a subsystem may need to be migrated to another subsystem if the subsystem is faulty, or load balance is needed, or subsystem restructuring desired. Siegel et al. (1990) discussed the migration problem for Omega-equivalent networks. This paper studies the partitionability and presents an optimal task migration algorithm for k-extra-stage Omega networks.

关键词： Parallel processing Multiprocessor interconnection networks computer science Cities and towns Large-scale systems Fault tolerant systems computer networks Partitioning algorithms Electronic mail Degradation

来源：评论

学校读者我要写书评

暂无评论

A nonstationary analysis of bandwidth access control schemes for heterogeneous traffic in B-ISDN

A nonstationary analysis of bandwidth access control schemes...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Yi Qian D. Tipper D. Medhi Department of Electrical and Computer Engineering Clemson University Clemson SC USA Telecommunications Program Department of Information Science University of Pittsburgh Pittsburgh PA USA Department of Computer Networking University of Missouri Kansas City Kansas City MO USA

We present a comparative analysis of bandwidth access control schemes under nonstationary traffic conditions for heterogeneous circuit-mode traffic offered to a B-ISDN network link. A unified model for analysing the behavior of several bandwidth access control schemes is developed using a Markov process model with acceptance functions. Numerical techniques are used to solve the associated Chapman-Kolmogorov equations and determine the nonstationary behavior. Performance results are given for several common bandwidth access control schemes, namely: complete sharing, complete partitioning, partial sharing, classical trunk reservation, and the probabilistic reservation policy. It is shown that the use of the average arrival rate to estimate the average connection blocking rate may be an underestimate for a system with a time varying arrival process. Also, it is found that a nonstationarity in one traffic class arrival process can impact other stationary traffic classes and the degree of variability depends on the particular access control scheme.

关键词： Bandwidth Access control B-ISDN Traffic control Communication system traffic control Circuits Queueing analysis Markov processes Information analysis Cities and towns

来源：评论

学校读者我要写书评

暂无评论

MODIFIED KEY AGREEMENT PROTOCOL BASED ON THE DIGITAL SIGNATURE STANDARD

引用

ELECTRONICS LETTERS 1995年第6期31卷 448-449页

作者： HARN, L Computer Science Telecommunications Program University of Missouri Kansas City USA

Arazi proposed a scheme to integrate a key exchange protocol into the DSS (digital signature standard) to authenticate two public keys exchanged between two users and then one corresponding secret session key can be shared by two parties based on the Diffie-Hellman public-key distribution scheme. Later, Nyberg and Rueppel pointed out a weakness in the Arazi protocol: if one secret session key is compromised then the others will be disclosed as well. The Letter proposes a modified key agreement protocol based on the DSS.

关键词： CRYPTOGRAPHY INFORMATION THEORY

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：