2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571)最新文献

CALM: congestion-aware layered multicast CALM:感知拥塞的分层组播

2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571) Pub Date : 2002-08-07 DOI: 10.1109/OPNARC.2002.1019238

S. Wen, J. Griffioen, K. Calvert

引用次数: 10

A framework for efficient and programmable sensor networks 高效可编程传感器网络框架

2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571) Pub Date : 2002-08-07 DOI: 10.1109/OPNARC.2002.1019233

A. Boulis, M. Srivastava

{"title":"A framework for efficient and programmable sensor networks","authors":"A. Boulis, M. Srivastava","doi":"10.1109/OPNARC.2002.1019233","DOIUrl":"https://doi.org/10.1109/OPNARC.2002.1019233","url":null,"abstract":"Ad hoc wireless networks of deeply embedded devices such as micro-sensors and microactuators have emerged as one of the key growth areas for wireless networking and computing technologies. So far these networks/systems have been designed with static and custom architectures for specific tasks, thus providing inflexible operation and interaction capabilities. Various architectures are currently trying to make sensor networks programmable and open to transient users. Most of these schemes though, promote algorithms that are too centralized and/or too interactive (i.e. the user is involved in the control loop most of the time), losing the efficiency these highly resource-limited systems need. Our approach employs active networking concepts in the form of lightweight and mobile control scripts that allow the computation, communication, and sensing resources at the sensor nodes to be efficiently harnessed in an application-specific fashion. The replication/migration of such scripts in several sensor nodes allows the dynamic deployment of distributed algorithms into the network. Although these mobile control scripts have similarities to mobile agents for traditional data networks, a framework to support them has different considerations than its traditional data network counterpart. The paper discusses these considerations and design choices, and describes SensorWare, our implementation of such a framework.","PeriodicalId":339359,"journal":{"name":"2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129149007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 52

Global flow control for wide area overlay networks: a cost-benefit approach 广域覆盖网络的全局流量控制:一种成本效益方法

2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571) Pub Date : 2002-08-07 DOI: 10.1109/OPNARC.2002.1019236

Y. Amir, B. Awerbuch, C. Danilov, J. Stanton

引用次数: 21

The potential of just-in-time compilation in active networks based on network processors 基于网络处理器的活动网络中实时编译的潜力

2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571) Pub Date : 2002-08-07 DOI: 10.1109/OPNARC.2002.1019230

A. Kind, R. Pletka, B. Stiller

引用次数: 9

NetBind: a binding tool for constructing data paths in network processor-based routers NetBind:用于在基于网络处理器的路由器中构造数据路径的绑定工具

2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571) Pub Date : 2002-08-07 DOI: 10.1109/OPNARC.2002.1019231

A. Campbell, S. Chou, M. Kounavis, V. D. Stachtos, J. Vicente

{"title":"NetBind: a binding tool for constructing data paths in network processor-based routers","authors":"A. Campbell, S. Chou, M. Kounavis, V. D. Stachtos, J. Vicente","doi":"10.1109/OPNARC.2002.1019231","DOIUrl":"https://doi.org/10.1109/OPNARC.2002.1019231","url":null,"abstract":"There is growing interest in network processor technologies capable of processing packets at line rates. In this paper, we present the design, implementation and evaluation of NetBind, a high performance, flexible and scalable binding tool for dynamically constructing data paths in network processor-based routers. The methodology that underpins NetBind balances the flexibility of network programmability against the need to process and forward packets at line speeds. Data paths constructed using NetBind seamlessly share the resources of the same network processor. We compare the performance of NetBind to the MicroACE system developed by Intel to support binding between software components running on Intel IXP1200 network processors. We evaluate these alternative approaches in terms of their binding overhead, and discuss how this can affect the forwarding performance of IPv4 data paths running on IXP1200 network processor-based routers. We show that NetBind provides better performance in comparison to MicroACE with smaller binding overhead. The NetBind source code described and evaluated in this paper is freely available on the Web (comet.columbia.edu/genesis/netbind) for experimentation.","PeriodicalId":339359,"journal":{"name":"2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130803048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 51

PAMcast : programmable any-multicast for scalable message delivery PAMcast:可编程的任意组播，用于可扩展的消息传递

2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571) Pub Date : 2002-08-07 DOI: 10.1109/OPNARC.2002.1019226

Youngsu Chae, E. Zegura, Haris Delalic

{"title":"PAMcast : programmable any-multicast for scalable message delivery","authors":"Youngsu Chae, E. Zegura, Haris Delalic","doi":"10.1109/OPNARC.2002.1019226","DOIUrl":"https://doi.org/10.1109/OPNARC.2002.1019226","url":null,"abstract":"The rapid growth of the Internet has led to much interest in communication paradigms that support scalability, including multicast and anycast. In this paper, we propose a new message delivery service - Programmable Any-Multicast (PAMcast) - which generalizes both anycast and multicast, by providing a message delivery service to m out of the total n group members, where 1 < m < n. Such a service has potential applications in a number of areas, including fault tolerant repositories, parallel cache queries, and parallel server downloads. Our architecture is based on a shared tree and managed by a group management protocol with similarities to IGMP. To explore what is possible with limited state and computation at the routers, we consider the implementation of two specific modes of delivery that control how the m receivers are selected. Our balanced mode aims for equal distribution of messages over receivers over time. We find that with relatively little state and computation we can achieve this goal. Our closest mode aims to deliver a packet to the m group members closest (by hop count) to the root of the distribution tree. We find that with modest state and computation we can achieve a probabilistic form of the closest mode.","PeriodicalId":339359,"journal":{"name":"2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115502123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

A comparative study of extensible routers 可扩展路由器的比较研究

2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571) Pub Date : 2002-08-07 DOI: 10.1109/OPNARC.2002.1019228

Y. Gottlieb, L. Peterson

引用次数: 39

Modular components for network address translation 用于网络地址转换的模块化组件

2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571) Pub Date : 2002-08-07 DOI: 10.1109/OPNARC.2002.1019227

E. Kohler, R. Morris, Massimiliano Poletto

引用次数: 16

Topology discovery service for router-assisted multicast transport 路由器辅助组播传输的拓扑发现服务

2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571) Pub Date : 2002-08-07 DOI: 10.1109/OPNARC.2002.1019225

J. Shapiro, J. Kurose, D. Towsley, S. Zabele

引用次数: 17

APE: fast and secure active networking architecture for active packet editing APE:快速、安全的主动网络架构，用于主动分组编辑

2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571) Pub Date : 2002-08-07 DOI: 10.1109/OPNARC.2002.1019232

N. Takahashi, T. Miyazaki, T. Murooka

引用次数: 5