Filters








1,538 Hits in 3.2 sec

Concurrent NetCore

Cole Schlesinger, Michael Greenberg, David Walker
2014 Proceedings of the 19th ACM SIGPLAN international conference on Functional programming - ICFP '14  
Concurrent NetCore includes features for specifying sequential, conditional and concurrent control-flow between packetprocessing tables.  ...  We present a new, typed language, called Concurrent NetCore, for specifying routing policies and graphs of packet-processing tables.  ...  We can in fact characterize the behavior of well typed concurrent compositions as: p Wp||Wq q p; q (Lemma 5) = q; p (Lemma 4) Lemma 4 (Concurrency commutes).  ... 
doi:10.1145/2628136.2628157 dblp:conf/icfp/SchlesingerGW14 fatcat:itd2msmnarf7tl3tgeow6lcr34

Concurrent NetCore

Cole Schlesinger, Michael Greenberg, David Walker
2014 SIGPLAN notices  
Concurrent NetCore includes features for specifying sequential, conditional and concurrent control-flow between packetprocessing tables.  ...  We present a new, typed language, called Concurrent NetCore, for specifying routing policies and graphs of packet-processing tables.  ...  We can in fact characterize the behavior of well typed concurrent compositions as: p Wp||Wq q p; q (Lemma 5) = q; p (Lemma 4) Lemma 4 (Concurrency commutes).  ... 
doi:10.1145/2692915.2628157 fatcat:yevdxslwrbam7dvbbzj3rtflca

From Theory to Practice in Distributed Component Systems

Denis Caromel
2007 Electronical Notes in Theoretical Computer Science  
in any order; • asynchronous FIFO point-to-point is sufficient for requests; and, • the execution of a system is characterized by the order of request senders.  ...  Moreover, it also achieves an important increase in the level of abstraction used by the programmer: interfaces versus the old API style for controlling parallelism, multicasting and synchronizations.  ... 
doi:10.1016/j.entcs.2006.12.042 fatcat:34cvhhr27bedrgjcme6k73q6hm

Link Scheduling for Multiple Multicast Sessions in Distributed Wireless Networks

Antonios Argyriou
2013 IEEE Wireless Communications Letters  
The extended MILP problem that also considers power control is solved with LP relaxation.  ...  According to our system model, each source node transmits to a multicast group that resides one hop away.  ...  This means that several nodes may need to concurrently use multicast communication.  ... 
doi:10.1109/wcl.2013.040513.120924 fatcat:zbfj2z3ytrhr7isantugl56sni

Understanding the limitations of causally and totally ordered communication

David R. Cheriton, Dale Skeen
1993 ACM SIGOPS Operating Systems Review  
Causally and totally ordered communication support  ...  We prefer the term multicast. Totally ordered multicast delivers all messages in the same order to all processes within a process group, even concurrent messages.  ...  Locking is the standard solution, although optimistic concurrency control techniques can also be used. CAXICS only provides ordering between individual messages.  ... 
doi:10.1145/173668.168623 fatcat:3cesoqj4z5dzjlo7stkis3i6ve

Understanding the limitations of causally and totally ordered communication

David R. Cheriton, Dale Skeen
1993 Proceedings of the fourteenth ACM symposium on Operating systems principles - SOSP '93  
Causally and totally ordered communication support  ...  We prefer the term multicast. Totally ordered multicast delivers all messages in the same order to all processes within a process group, even concurrent messages.  ...  Locking is the standard solution, although optimistic concurrency control techniques can also be used. CAXICS only provides ordering between individual messages.  ... 
doi:10.1145/168619.168623 dblp:conf/sosp/CheritonS93 fatcat:obqrakdk2fdjxekde52bqafs5e

The process group approach to reliable distributed computing

Kenneth P. Birman
1993 Communications of the ACM  
Using the first tickerplant protocol, one needs a multicast primitive capable of delivering concurrent messages in the same order at all overlapping destinations.  ...  , concurrently issued multicasts would be treated as distinct events.  ... 
doi:10.1145/163298.163303 fatcat:3dpkzhbta5egbitdvpnvl4h4aq

Minimum-Energy Multicast in Mobile Ad Hoc Networks Using Network Coding

Y. Wu, P.A. Chou, S.-Y. Kung
2005 IEEE Transactions on Communications  
These properties render network coding potentially useful for unicasting and multicasting in mobile ad hoc networks.  ...  A characterization of the admissible rate region for routing with a single tree is presented. The minimum energy-per-bit for multicasting with routing is found by an integer linear program.  ...  Characterizing A(r 1 , . . . , r m ) remains an open problem in information theory; see [26] .  ... 
doi:10.1109/tcomm.2005.857148 fatcat:mjpfto5h4neejjdnd27kn4n4me

Multipoint communication: a survey of protocols, functions, and mechanisms

C. Diot, W. Dabbous, J. Crowcroft
1997 IEEE Journal on Selected Areas in Communications  
This paper surveys protocol functions and mechanisms for data transmission within a group, from multicast routing problems up to end-to-end multipoint transmission control.  ...  For some types of multimedia applications, it is the only way to control data transmission to group members.  ...  Montgomery, "A high performance totally ordered multicast protocol," Theory and Practice in Distributed Systems. Berlin: Springer Verlag LCNS 938, 1995. B.  ... 
doi:10.1109/49.564128 fatcat:6gre3yoktvaknoilqj7bomi5um

Scalable flow control for multicast ABR services in ATM networks

Xi Zhang, K.G. Shin, D. Saha, D.D. Kandlur
2002 IEEE/ACM Transactions on Networking  
It works well irrespective of the topology of the multicast tree. Using the fluid analysis, we model the proposed scheme and analyze the system dynamics for multicast ABR traffic.  ...  We propose a flow-control scheme for multicast 1 ABR services in ATM networks.  ...  The equilibrium-state analysis is mainly used to characterize the dynamics of the multicast-tree bottleneck after it has converged to a particular path and become relatively steady.  ... 
doi:10.1109/90.986538 fatcat:koyx6id7tbafnb6ijrpkyhcrge

Evaluating high-throughput reliable multicast for grid applications in production networks

M.P. Barcellos, M. Nekovee, M. Koyabe, M. Daw, J. Brooke
2005 CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.  
It is widely accepted that this can be, in theory, best achieved using reliable multicast protocols.  ...  The emphasis of the study is on highperformance computing and communication, and on 1-N reliable multicast using the NACK Oriented Reliable Multicast (NORM) protocol family.  ...  We also thank the reviewers for their useful comments.  ... 
doi:10.1109/ccgrid.2005.1558588 dblp:conf/ccgrid/BarcellosNKDB05 fatcat:fbdxiao6ufdszgi53caamvl6yq

Providing Flexible Services for Managing Shared State in Collaborative Systems [chapter]

Hyong Sop Shim, Robert W. Hall, Atul Prakash, Farnam Jahanian
1997 Proceedings of the Fifth European Conference on Computer Supported Cooperative Work  
We present the shared state management services provided by our Corona server that embodies our approach and report experience with its use.  ...  In order to provide a desired degree of synchronization and control concurrent updates on the shared state of a group, the Corona server allows locks to be associated with the objects in a shared state  ...  Patterson, et al. (1996) and Nichols, et al. (1995) also discuss the merits of such a centralized serialization point for their lock management and concurrency control strategies, respectively.  ... 
doi:10.1007/978-94-015-7372-6_16 fatcat:hfz65qx7ojd4rarijwvhaarfx4

An Optimal Admission Control Protocol for Heterogeneous Multicast Streaming Services

Tae Ok Kim, Chamara N. Devanarayana, Attahiru S. Alfa, Bong Dae Choi
2015 IEEE Transactions on Communications  
We investigate optimal call admission control (CAC) policy for multicast streaming services (MSS) in 3rd generation (3G) and beyond wireless mobile networks.  ...  Index Terms-Multicast service, admission control policy, Markov decision policy, performance evaluation, Markov chain. T. O. Kim was with the  ...  [4] investigated an efficient admission control policy for multicast and unicast integrated services.  ... 
doi:10.1109/tcomm.2015.2421896 fatcat:d7dsl5dey5ff5plczkf2g6xm3y

Compressed Video Streaming in Cooperative Wireless Networks with Interfering Transmissions

Antonios Argyriou
2012 IEEE Transactions on Communications  
Our system model considers multiple and independent unicast or multicast transmissions between network nodes while a number of them serve as relays.  ...  For the case of multicast video delivery the performance of the proposed scheme is significantly improved for good channel conditions while the improvement is minimized in the low channel SNR regime when  ...  Stream Adaptation Now, as shown in [26] (17) can be efficiently solved using the rate-distortion characterization of the video packets comprising a flow.  ... 
doi:10.1109/tcomm.2012.082712.110772 fatcat:yup7vqxkmndqhglrglbayxv5fm

Building open programmable multimedia networks

Andrew T Campbell, Aurel A Lazar, Henning Schulzrinne, Rolf Stadler
1998 Computer Communications  
Recent advances in distributed systems and transportable software and increasing demand for better quality-of-service (QOS) control in multiservice networks are driving a re-examination of network software  ...  We established the COMET Group (Control Management and Telemedia) at Columbia University's Center for Telecommunications Research to provide a comprehensive understanding of network software architecture  ...  Today, we are developing open programmable ATM, Internet and mobile networks that will enable new models for network signalling, control and management to be created in the future.  ... 
doi:10.1016/s0140-3664(98)00123-6 fatcat:efah7gfddrgxzpsikmnvuwbqiu
« Previous Showing results 1 — 15 out of 1,538 results