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

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

来源：评论

学校读者我要写书评

暂无评论

OPCA: Robust interdomain policy routing and traffic control

OPCA: Robust interdomain policy routing and traffic control

引用

ieee conference on open architectures and network programming Proceedings (openARCH 2003)

作者： Agarwal, S Chuah, CN Katz, RH Univ Calif Berkeley Div Comp Sci Berkeley CA 94720 USA

ISBN: (纸本)0780377648

An increasing number of ASes have been connecting to the Internet through the BGP inter-domain routing protocol. With increasing stress on the scale of this system and increasing reliance on Internet connectivity, more participants demand additional functionality from interdomain routing that BGP cannot handle. For example, we believe that the recent trend towards multihomed stub networks exhibits a likely intent to achieve fault tolerant and load balanced connectivity to the Internet. However, BGP today offers route fail-over times as long as 15 minutes, and very limited control over incoming traffic across multiple wide area paths. More research literature and news media are calling for stemming malicious or erroneous routing announcements. We propose a policy control architecture, OPCA, that runs as an overlay network on top of BGP. OPCA allows an AS to make route change requests at other, remote ASes to achieve faster route fail-over and provide capabilities to control traffic entering the local AS. The proposed architecture and protocol will co-exist and interact with the existing routing infrastructure and will allow for a scalable rollout of the protocol.

关键词： Communication system traffic control Fault tolerance ieee news Internet IP networks Joining processes Robust control Routing protocols Stress Traffic control

来源：评论

学校读者我要写书评

暂无评论

Dynamic packet processors -: A new abstraction for router extensibility

Dynamic packet processors -: A new abstraction for router ex...

引用

ieee conference on open architectures and network programming Proceedings (openARCH 2003)

作者： Hjálmtysson, G Sverrisson, HF Brynjúlfsson, B Helgason, OR Reykjavik Univ Dept Comp Sci Reykjavik Iceland

ISBN: (纸本)0780377648

The history of the Internet is that of rapid change and adaptability. The simple IP service model and the informal standardization process have fostered rapid evolution of systems and services. However, as the Internet has transformed from an academic playground to an essential commercial infrastructure the service model and the standardization process have become more complex. While outsourcing and optimizations are driving services into the network, the IETF is increasingly the battleground of vendors. Consequently, introducing new services to the Internet has become increasingly complicated. Active and programmable networking is an effort to reclaim the flexibility of the early Internet and reduce the need for standardization. In this paper we introduce a new abstraction, packet processors, to evolve the lower layer router facilities and to extend the programmable interface in a type safe manner. We show how this abstraction is sufficient to capture all facilities commonly found in data-paths of commodity routers and how it gives the ability to introduce new types of packet processors. Packet processors can add type specific methods thereby extending the programmable interface while maintaining the semantic integrity of the Node OS and the Execution Environment. We discuss how paths can be constructed from a sequence of packet processors, and how these paths can cross the services/node OS boundary, and cross hardware processor boundaries. Our measurements show that the added flexibility adds negligible overhead.

关键词： Computer science Hardware History IP networks Kernel Outsourcing programming profession Search engines Standardization Web and internet services

来源：评论

学校读者我要写书评

暂无评论

Transparent and scalable client-side server selection using netlets

Transparent and scalable client-side server selection using ...

引用

ieee conference on open architectures and network programming Proceedings (openARCH 2003)

作者： Dharmalingam, K Collier, M Dublin City Univ Sch Elect Engn Res Inst Networks & Commun Engn Dublin 9 Ireland

ISBN: (纸本)0780377648

Replication of web content in the Internet has been found to improve service response time, performance and reliability offered by web services. When working with such distributed server systems, the location of servers with respect to client nodes is found to affect service response time perceived by clients in addition to server load conditions. This is due to the characteristics of the network path segments through which client requests get routed. Hence, a number of researchers have advocated making server selection decisions at the client-side of the network. In this paper, we present a transparent approach for clientside server selection in the Internet using Netlet services. Netlets are autonomous, nomadic mobile software components which persist and roam in the network independently, providing predefined network services. In this application, Netlet based services embedded with intelligence to support server selection are deployed by servers close to potential client communities to setup dynamic service decision points within the network. An anycast address is used to identify available distributed decision points in the network. Each service decision point transparently directs client requests to the best performing server based on its in-built intelligence supported by real-time measurements from probes sent by the Netlet to each server. It is shown that the resulting system provides a client-side server selection solution which is server-customisable, scalable and fault transparent.

关键词： Delay Electronic mail IP networks network servers Performance evaluation Probes Reliability engineering Telecommunication network reliability Web and internet services Web server

来源：评论

学校读者我要写书评

暂无评论

Comparing analytical modeling with simulation for network processors: A case study

Comparing analytical modeling with simulation for network pr...

引用

Design, Automation and Test in Europe conference and Exhibition (DATE 03)

作者： Gries, M Kulkarni, C Sauer, C Keutzer, K Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)0769518702

programming network processors remains an art due to the variety of different network processor architectures and due to little support to reason and explore implementations on such architectures. We present a case study of mapping an IPnu4 forwarding switch application on the Intel IXP1200 network processor and we compare this implementation with an analytical model of both the application and architecture used to evaluate different design alternatives. Our results not only show that we are able to model the IXP1200 and our application within 15% of the accuracy compared to that of IXP1200 simulation, but also find closely matching trends for different workloads. This shows the clear potential of such analytical techniques for design space exploration.

关键词： Analytical models

来源：评论

学校读者我要写书评

暂无评论

A design and implementation of active network socket programming 11

A design and implementation of active network socket program...

引用

11th International conference on Computer Communications and networks

作者： Law, KLE Leung, R Univ Toronto Dept Elect & Comp Engn Toronto ON Canada

ISBN: (纸本)078037553X

The concept of programmable nodes and active networks introduces programmability into communication networks. Code and data can be sent and modified on their ways to destinations. Recently, various research groups have designed and implemented their own execution platforms for active networks. Each design has its own benefits and drawbacks. Hence, there exist interoperability problems among them. Therefore in this paper, we introduce a concept that is similar to the socket programming for writing network programs. A set of simple interfaces, the Active network Socket programming (ANSP), for programming active applications is established. The resulting active applications will be able to work on top of all other execution environments in future. The ANSP offers a concept that is similar to 'write once, run everywhere.' It is an open programming model that active applications can work on all execution environments. It solves the heterogeneity within the active networks. This is especially useful when active applications need to access all regions within a heterogeneous network to deploy special service at critical points or to monitor the performance of the entire networks. Instead of introducing a new platform, our approach provides a thin, transparent layer on top of existing environments that can be easily installed for all active applications. (C) 2003 Elsevier Science B.V. All rights reserved.

关键词： active networks active applications active network socket programming application programming interface execution environments

来源：评论

学校读者我要写书评

暂无评论

On the fusion and transference of knowledge: Part I

On the fusion and transference of knowledge: Part I

引用

ieee International conference on Information Reuse and Integration (IRI-2003)

作者： Rubin, SH SPAWARS SYST CTR San Diego CA USA

ISBN: (纸本)0780382420

Contemporary neural architectures having one or more hidden layers suffer from the same deficiencies that genetic algorithms and methodologies for non-trivial automatic programming do;namely, they cannot exploit inherent domain symmetries for the transference of knowledge from an application of lesser to greater rank, or across similar applications. As a direct consequence, no ensemble of contemporary neural architectures allows for the effective codification and transference of knowledge within a society of individuals (i.e., swarm knowledge). These deficiencies stem from the fact that contemporary neural architectures cannot reason symbolically using heuristic ontologies. They cannot directly provide symbolic explanations of what was learned for purposes of inspection and verification. Moreover, they do not allow the knowledge engineer to precondition the internal feature space through the application of domain-specific modeling languages. A symbolic representation can support the heuristic evolution of an ensemble of neural architectures. Each neural network in the ensemble imbues a hidden layer and for this reason is NP-hard in its learning performance. It may be argued that the internal use of a neat representation subsumes the heuristic evolution of a scruffy one. It follows that there is a duality of representation under transformation. The goal of Al then is to find symbolic representations, transformations, and associated heuristic ontologics. This paper provides an introduction to this quest. Consider the game of chess for example. If a neural network or symbolic heuristic is used to evaluate board positions, then the best found iterate (i.e., of weights or symbols) serves as a starting point for iterative refinement. This paper will address the ordering and similarity of the training instances in refining subsequent iterates. If we fix the learning technology, then we need to focus on reducing the problem, composing intermediate results, and transfering t

关键词： heuristics information fusion neural network ensembles reuse and transference

来源：评论

学校读者我要写书评

暂无评论

eLoom and Flatland: specification, simulation and visualization engines for the study of arbitrary hierarchical neural architectures

引用

NEURAL networkS 2003年第5-6期16卷 617-624页

作者： Caudell, TP Xiao, YH Healy, MJ Univ New Mexico Dept Elect & Comp Engn Albuquerque NM 87131 USA Univ Washington Seattle WA 98125 USA

eLoom is an open source graph simulation software tool, developed at the University of New Mexico (UNM), that enables users to specify and simulate neural network models. Its specification language and libraries enables users to construct and simulate arbitrary, potentially hierarchical network structures on serial and parallel processing systems. In addition, eLoom is integrated with UNM's Flatland, an open source virtual environments development tool to provide real-time visualizations of the network structure and activity. Visualization is a useful method for understanding both learning and computation in artificial neural networks. Through 3D animated pictorially representations of the state and flow of information in the network, a better understanding of network functionality is achieved. ART-1, LAPART-II, MLP, and SOM neural networks are presented to illustrate eLoom and Mallard's capabilities. (C) 2003 Elsevier Science Ltd. All rights reserved.

关键词： eLoom flatland visualization simulation tools

来源：评论

学校读者我要写书评

暂无评论

programming challenges in network processor deployment

Programming challenges in network processor deployment

引用

CASES 2003: International conference on Compilers, Architecture, and Synthesis for Embedded Systems

作者： Kulkarni, Chidamer Gries, Matthias Sauer, Christian Keutzer, Kurt Electronics Research Lab. University of California Berkeley United States Infineon Technologies Corporate Research Munich Germany

ISBN: (纸本)1581136765

programming multi-processor ASIPs, such as network processors, remains an art due to the wide variety of architectures and due to little support for exploring different implementation alternatives. We present a study that implements an IP forwarding router application on two different network processors to better understand the main challenges in programming such multi-processor ASIPs. The goal of this study is to identify the elements central to a successful deployment of such systems based on a detailed profiling of the two architectures. Our results show that inefficient partitioning can impact the throughput by more than 30%;a better arbitration of resources increases the throughput by at least 10%, and localization of computation related to the memories can increase the available bandwidth on internal buses by a factor of two. The main observation of our study is that there is a critical lack of tools and methods that support an integrated approach to partitioning, scheduling and arbitration, and data transfer management for such system implementations. Copyright 2003 ACM.

关键词： Microprocessor chips

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：