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

ieee Aerospace conference

作者： Lee, Charles H. Cheung, Kar-Ming CALTECH Jet Prop Lab Commun Architectures & Res Sect 332 Pasadena CA 91109 USA

ISBN: (纸本)9781457705571

We introduce mixed integer programming and heuristic scheduling for space communication networks in this paper. The considered communication network consists of space and ground assets with the link dynamics between any two assets vary with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view-period are optimized so that the resulting schedule meets the objectives and satisfies the operation constraints imposed by the missions. Mathematical framework for the constrained optimization along with the software, Mars Relay network Planning Tool (MRNPT), was developed in 2003 at Jet Propulsion Laboratory. In this paper, we broaden the study to include communication networks whose nodal elements can simultaneously support multiple spacecrafts and vice versa. Sample scenarios include multiple combinations of ground stations at a DSN site can form an antennas array to track a spacecraft and conversely a single ground station can support multiple spacecrafts simultaneously. Such unique network capabilities make the schedule optimization problem more challenging. Namely, the number of passes between a spacecraft and a set of ground stations soars from linear to exponential. As a result, the search space for the network optimization using start times and end times grows intractably. The new framework, casted in this paper as a mixed integer problem, provides the means to keep the search space dimensions to the linear order. The difficulty is now in the court of the optimization process. Traditional methods such as the Sequential Quadratic Optimization (SQP), used in MRNPT, are time-consuming and do not guarantee a global solution. In this pap

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

A fast and efficient algorithm to exploit multi-user diversity in ieee 802.16 BandAMC

引用

COMPUTER networkS 2011年第16期55卷 3680-3693页

作者： Cicconetti, C. Lenzini, L. Lodi, A. Martello, S. Mingozzi, E. Monaci, M. Univ Pisa Dipartimento Ingn Informaz I-56010 Pisa Italy Intecs Spa I-56121 Pisa Italy Univ Bologna Dipartimento Elettron Informat & Sistemist I-40136 Bologna Italy Univ Padua Dipartimento Ingn Informaz I-35131 Padua Italy

Mobile broadband wireless access systems like ieee 802.16/WiMAX use Orthogonal Frequency Division Multiple Access (OFDMA) in order to exploit frequency and multi-user diversity for improving the spectral efficiency. We assume in this work a two-stage approach for resource allocation, whereby scheduling of packets in a given time frame, and their allocation across different subcarriers and time slots, are carried out separately one after the other. We specifically focus on the allocation problem in the second stage. Our first contribution is a problem formulation which is based on a detailed system model close to a practical ieee 802.16/WiMAX system using BandAMC. The problem is proved to be NP-complete. Secondly, we propose a heuristic allocation algorithm, called Maximum Regret Band Allocation, and show through an extensive numerical analysis that it is very effective in realistic scenarios, as well as so computationally efficient to be executed in times in the order of one millisecond. (C) 2011 Elsevier B.V. All rights reserved.

关键词： 802.16e Mobile WiMAX BandAMC Data allocation Multi-user diversity

来源：评论

学校读者我要写书评

暂无评论

2003 ieee conference on open architectures and network programming proceedings, openarch 2003

2003 IEEE Conference on Open Architectures and Network Progr...

引用

2003 ieee conference on open architectures and network programming proceedings, openarch 2003

ISBN: (纸本)0780377648

The proceedings contain 12 papers. The topics discussed include: controlling the XenoServer open platform;code revocation for active networks;hybrid resource control of active extensions;dynamic packet processors- a new abstraction for router extensibility;run-time support for extensible protocol stacks:;OPCA: robust interdomain policy routing and traffic control;efficient programmable middleboxes for scaling large distributed applications;an open service platform for deploying and managing services at network edges;user-specified adaptive scheduling in a streaming media network;bees: a secure, resource-controlled, Java-based execution environment;a generic set-formation service;and transparent and scalable client-side server selection using netlets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

2003 ieee conference on open architectures and network programming: proceedings: openarch 2003: San Francisco, California, USA, 4-5 April 2003

2003 IEEE Conference on Open Architectures and Network Progr...

引用

2003年

来源：评论

学校读者我要写书评

暂无评论

2003 ieee conference on open Architecture and network programming proceedings. openarch 2003 (Cat. No.03TH8686)

2003 IEEE Conference on Open Architecture and Network Progra...

引用

ieee conference on open architectures and network programming

The following topics are dealt with: open architectures and network programming; resource control in active networks; extensible datapath capabilities; endpoint adaptations; application platforms; and adaptive applica...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Run-time support for extensible protocol stacks

Run-time support for extensible protocol stacks

引用

ieee conference on open architectures and network programming proceedings (openarch 2003)

作者： Dandekar, H Purtell, A Schwab, S Network Associates Labs Los Angeles CA 91324 USA

ISBN: (纸本)0780377648

By implementing an extensible network protocol stack in the AMP Operating System, we have demonstrated support for fine-grained replacement of low-level network processing components. Furthermore, our compiler technology approach provides the means to support multiple hardware architectures and a framework for enforcing safety and security properties during runtime code generation. Our preliminary results indicate that our approach is feasible, has comparable per-packet processing costs to static code, and has acceptable per-module loading and code generation costs.

关键词： Computer languages Costs Hardware Laboratories Libraries Operating systems Protection Protocols Runtime Vehicle safety

来源：评论

学校读者我要写书评

暂无评论

An open service platform for deploying and managing services at network edges

An open service platform for deploying and managing services...

引用

ieee conference on open architectures and network programming proceedings (openarch 2003)

作者： Falchuk, B Chiang, J Hafid, A Cheng, YH Natarajan, N Lin, FJ Cheng, H Telcordia Technol Inc Morristown NJ 07960 USA

ISBN: (纸本)0780377648

Over the past several years, in response to demands from users that access to networked information and services be both customized and rapid, services and content have increasingly been 'pushed' towards network edges by Providers. In turn, this has resulted in an increased need for a software framework that provides an open and systematic way for Providers to deploy and manage such network edge services. We have implemented and tested such a framework in our Lab, called the Telcordia Edge Services Node. Inspired by the foundations built in the IETF OPES-related drafts, it is beneficial to Access, Service, and Content Providers alike. This paper reports on the design, implementation, and lessons-learned from our edge service node framework and management tools.

关键词： Access protocols Content management Delay Innovation management IP networks Markup languages Peer to peer computing Risk management Technology management Web and internet services

来源：评论

学校读者我要写书评

暂无评论

Code revocation for active networks

Code revocation for active networks

引用

ieee conference on open architectures and network programming proceedings (openarch 2003)

作者： Murphy, S Hayatnagarkar, A Krishnaswamy, S Morrison, W Watson, R Network Associates Labs Rockville MD USA

ISBN: (纸本)0780377648

Active networks are placed at considerable risk by running code that arrives over the network. Careful crafting of authorization policy and stringent enforcement provide considerable protection against such risks. However, there still might be reasons why a packet that is executing in accordance with the authorization policy might cause damage. For example, the code might have bugs or may have been improperly configured or the packet might have been unintentionally launched. For the safety of the network, a mechanism is needed that would permit users and networks to find faulty, misconfigured, or misbehaving active code and revoke its ability to execute. This paper I considers the important issues and features of providing for revocation of code and an architecture that will support it in a wide-scale active network. It describes the parameters that identify the entities that issue the revocation notice and the entities that are to be revoked. It also describes an approach for policy composition from multiple entities, which eventually decides whether a revocation notice is authorized to act on a particular piece of code. Finally, this paper presents an innovative approach towards revocation in traditional networks using active networking as the transporting mechanism.

关键词： active networks security revocation code credentials Hunter policy composition

来源：评论

学校读者我要写书评

暂无评论

User-specified adaptive scheduling in a streaming media network

User-specified adaptive scheduling in a streaming media netw...

引用

ieee conference on open architectures and network programming proceedings (openarch 2003)

作者： Hicks, M Nagarajan, A van Renesse, R Univ Maryland Dept Comp Sci College Pk MD 20742 USA

ISBN: (纸本)0780377648

In disaster and combat situations, mobile cameras and other sensors transmit real-time data, used by many operators or analysis tools. Unfortunately, in the face of limited, unreliable resources, and varying demands, not all users may be able to get the fidelity they require. This paper describes MediaNet, a distributed stream processing system designed with the above scenarios in mind. Unlike past approaches, MediaNet's users can intuitively specify how the system should adapt based on their individual needs. MediaNet uses both local and online global resource scheduling to improve user performance and network utilization, and adapts without requiring underlying support for resource reservations. Performance experiments show that our scheduling algorithm is reasonably fast, and that user performance and network utilization are both significantly improved.

关键词： Adaptive scheduling Cameras Computer networks Computer science Educational institutions Intelligent networks Mobile computing Process design Quality of service Streaming media

来源：评论

学校读者我要写书评

暂无评论

A generic set-formation service

A generic set-formation service

引用

ieee conference on open architectures and network programming proceedings (openarch 2003)

作者： Sehgal, A Calvert, KL Griffioen, J Univ Kentucky Lab Adv Networking Lexington KY 40506 USA

ISBN: (纸本)0780377648

Dynamic group formation and discovery is an important component of several emerging end system applications and network services including peer-to-peer and overlay systems, network storage/caching systems, and reliable multicast/distribution services. In our previous work, we proposed a programmable, scalable grouping service based on multicast and concast. In this paper, we present a generalized abstraction that subsumes the earlier service and can be implemented using other forms of network support in addition to (or apart from) multicast/concast. In designing the new grouping abstraction, we have attempted to separate the policies governing set formation from the network mechanisms (multicast, concast, distributed hash tables, etc.) used to implement those policies. In addition, we allow policies to be specified in terms of both application-specific criteria and networkbased criteria. We describe how the service can be used to solve grouping problems from different application areas, and give an example showing how it can leverage different network support mechanisms, including ephemeral state processing.

关键词： Delay Laboratories Multicast protocols network servers network topology Peer to peer computing Routing Scalability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：