getting higher in the spovnet stack
play

Getting higher in the SpoVNet stack Services in SpoVNet Reside - PDF document

Aug 01, 2023 •402 likes •478 views

Considering Network Heterogeneity in Global Application Layer Multicast Provision Christian Hbsch Institute of Telematics, University of Karlsruhe (TH) 8th Wrzburg Workshop on IP: Joint EuroNF, ITC, and ITG Workshop on Visions of Future

  1. Considering Network Heterogeneity in Global Application Layer Multicast Provision Christian Hübsch Institute of Telematics, University of Karlsruhe (TH) 8th Würzburg Workshop on IP: Joint EuroNF, ITC, and ITG Workshop on “Visions of Future Generation Networks” (EuroView2008) July 21st - July 22nd 2008, Würzburg/Germany Getting higher in the SpoVNet stack… Services in SpoVNet Reside above Application Application Underlay Abstraction Service abstraction Offer interface to applications Services Several services as part of the Cross-layer information Underlay abstraction architecture SpoVNet Base MCP-O (Data Dissemination) Security ES (Event Service) Base Overlay Security Service Base Communication Focus here: MCP-O Underlay 1 EuroView2008 - Christian Hübsch Considering Network Heterogeneity in Global ALM Provision

  2. Goal: Efficient Data Dissemination Group Communication in SpoVNet instances Router End System Solution: Application Layer Multicast (ALM) Overlay Link Underlay Link Several existing approaches Narada, NICE, Yoid, Nemo, … Each with different target applications Drawbacks Considering homogeneous (UDP-)underlays Measure link property themselves • Mostly latency SpoVNet Vision Global service provision • Heterogeneity of nodes and network! Different application demands 2 EuroView2008 - Christian Hübsch Considering Network Heterogeneity in Global ALM Provision NICE Achieve scalability through hierarchical clustering Limit protocol overhead Consider node distances (n-2-n latencies) Logical structure determines date dissemination Cluster Leader Cluster Member Cluster 3 EuroView2008 - Christian Hübsch Considering Network Heterogeneity in Global ALM Provision

  3. MCP-O Protocol Design Basic idea (enhance NICE approach to…) Evaluate application demands for structural design decisions Consider Cross-Layer-Information (provided by CLIO comp.) Built efficient dissemination topologies for every use case Use underlay functionality where possible Structure Application QoS Info Request (QoS) Requirements N-2-n-Links Base CLIO MCP-O Link QoS Info Request 4 EuroView2008 - Christian Hübsch Considering Network Heterogeneity in Global ALM Provision Service Demands Adaption Use Service Metric to affect building of structure Weights a i determined through application requirements f i (x,y) e.g. latency, same WiFi domain, same IP Multicast domain, … Cluster Leader Cluster Member Cluster IP Multicast Broadcast Domain Domain 5 EuroView2008 - Christian Hübsch Considering Network Heterogeneity in Global ALM Provision

  4. Service Demands Adaption But: Hierarchical approach not always the best choice Good scalability, but cutting back e.g. latencies � Example: Latency-sensitive app with < 16 Members Adapt cluster size K K = (lowest current upstream) / (data stream) Unicast brings best achievable latency, protocol decides reasonable overhead in bounds 6 EuroView2008 - Christian Hübsch Considering Network Heterogeneity in Global ALM Provision Examples for Protocol Behavior Single Source Videostreaming application Locate High-Bandwidth nodes near source Make them cluster leader, upstream determines cluster size � Flat tree to bound latency and jitter Realtime Game Latency critical factor Use unicast where feasible 7 EuroView2008 - Christian Hübsch Considering Network Heterogeneity in Global ALM Provision

  5. WiFi Integration First Steps: Wireless Integration Save transmission overhead through broadcast � NICE-WLI Introduce Gateway-Nodes for mediation WiFi domain not part of structure, but connected through Gateway Prevent Gateways from becoming cluster leaders (save overhead) AP 8 EuroView2008 - Christian Hübsch Considering Network Heterogeneity in Global ALM Provision WiFi Integration Approach saves data transmission overhead Figure: P(WLAN) denotes probability of WiFi node Traffic per node Node count 9 EuroView2008 - Christian Hübsch Considering Network Heterogeneity in Global ALM Provision

  6. Summary & Outlook Efficient data transmission for SpoVNet applications through Considering node and network heterogeneity Use appropriate dissemination strategies • IP Multicast, broadcast, QoS reservations,… WiFi support already integrated Further Work Multiple group support per instance Usage of underlay features 10 EuroView2008 - Christian Hübsch Considering Network Heterogeneity in Global ALM Provision

Recommend

Buffer Overflow Attacks IA32 Linux Stack Higher Addresses Virtual Address Space Heap Data

Buffer Overflow Attacks IA32 Linux Stack Higher Addresses Virtual Address Space Heap Data

Buffer Overflow Attacks IA32 Linux Stack Higher Addresses Virtual Address Space Heap Data Text Lower Addresses Stack and Base Pointers Stack is made up of stack frames Stack frames contain: parameters, local variables, return

604 views • 45 slides
A Pumping Lemma for Pushdown Graphs of Any Level Pawe Parys University of Warsaw Higher order

A Pumping Lemma for Pushdown Graphs of Any Level Pawe Parys University of Warsaw Higher order

A Pumping Lemma for Pushdown Graphs of Any Level Pawe Parys University of Warsaw Higher order pushdown systems/automata [Maslov 74, 76] A 1-stack is an ordinary stack. A 2-stack (resp. (n + 1)-stack) is a stack of 1-stacks (resp. n-stack).

786 views • 31 slides
Call Stack Stack Bottom Memory region managed with stack discipline Procedures and the Call

Call Stack Stack Bottom Memory region managed with stack discipline Procedures and the Call

Call Stack Stack Bottom Memory region managed with stack discipline Procedures and the Call Stack higher %rsp holds lowest stack address addresses (address of &quot;top&quot; element) Topics stack grows Procedures toward lower

76 views • 5 slides
Smashing the Stack Protector for Fun and Profit 1 1996: Smashing The Stack for Fun and Profit

Smashing the Stack Protector for Fun and Profit 1 1996: Smashing The Stack for Fun and Profit

Smashing the Stack Protector for Fun and Profit 1 1996: Smashing The Stack for Fun and Profit ... overflow direction / higher addresses int main(int argc, char **argv) buf { stack growth char buf[0x10]; gets(buf); saved return address

911 views • 13 slides
Sup.py ping like functionality for higher up the stack chasemp@gmail.com

Sup.py ping like functionality for higher up the stack chasemp@gmail.com

Sup.py ping like functionality for higher up the stack chasemp@gmail.com https://github.com/chasemp How often have we done this? PING: Since 1983 Host is up, what about my service: The many ways to confirm locally Sometimes we can confirm

407 views • 12 slides
Stack and Queue Stack Overview Stack ADT Basic operations of stack Pushing, popping

Stack and Queue Stack Overview Stack ADT Basic operations of stack Pushing, popping

Stack and Queue Stack Overview Stack ADT Basic operations of stack Pushing, popping etc. Implementations of stacks using array linked list The Stack ADT A stack is a list with the restriction that insertions and

566 views • 44 slides
The Stack Eric McCreath The Stack The stack is a simple but useful data structure in computer

The Stack Eric McCreath The Stack The stack is a simple but useful data structure in computer

The Stack Eric McCreath The Stack The stack is a simple but useful data structure in computer science. The stack is an abstract data type that has two main operations. These are push which adds an element to the top of the stack and pop which

754 views • 8 slides
Stack ADT Tiziana Ligorio 1 Todays Plan Questons? Stack ADT 2 Abstract Data Types

Stack ADT Tiziana Ligorio 1 Todays Plan Questons? Stack ADT 2 Abstract Data Types

Stack ADT Tiziana Ligorio 1 Todays Plan Questons? Stack ADT 2 Abstract Data Types Bag List Stack 3 Stack 34 A data structure representing a stack of things Objects can be pushed onto the stack or popped from the stack

1.62k views • 116 slides
1 Array-based Stack (2.1.1) Algorithm pop (): if isEmpty () then A simple way of throw

1 Array-based Stack (2.1.1) Algorithm pop (): if isEmpty () then A simple way of throw

Elementary Data Structures Stacks, Queues, Vectors, Lists &amp; Sequences Trees The Stack ADT (2.1.1) The Stack ADT stores arbitrary objects Insertions and deletions Auxiliary stack follow the last-in first-out operations: scheme

473 views • 13 slides
ADT Stack 1 Stacks of Coins and Plates 2 Stacks of Rocks and Books TOP OF THE STACK TOP OF

ADT Stack 1 Stacks of Coins and Plates 2 Stacks of Rocks and Books TOP OF THE STACK TOP OF

ADT Stack 1 Stacks of Coins and Plates 2 Stacks of Rocks and Books TOP OF THE STACK TOP OF THE STACK Add, remove rock and book from the top, or else 3 Stack at logical level A stack is an ADT in which elements add added and

1.06k views • 37 slides
ADT Stack 1 Stacks of Coins and Plates 2 Stacks of Rocks and Books TOP OF THE STACK TOP OF

ADT Stack 1 Stacks of Coins and Plates 2 Stacks of Rocks and Books TOP OF THE STACK TOP OF

ADT Stack 1 Stacks of Coins and Plates 2 Stacks of Rocks and Books TOP OF THE STACK TOP OF THE STACK Add, remove rock and book from the top, or else 3 Stack at logical level A stack is an ADT in which elements add added and

679 views • 19 slides
Stack 7 January 2019 OSU CSE 1 Stack The Stack component family allows you to manipulate

Stack 7 January 2019 OSU CSE 1 Stack The Stack component family allows you to manipulate

Stack 7 January 2019 OSU CSE 1 Stack The Stack component family allows you to manipulate strings of entries of any (arbitrary) type in LIFO (last-in-first-out) order A kind of dual to Queue Remember, &quot;first&quot; and

450 views • 33 slides
Compilers Stack Machines Alex Aiken Stack Machines Only storage is a stack An

Compilers Stack Machines Alex Aiken Stack Machines Only storage is a stack An

Compilers Stack Machines Alex Aiken Stack Machines Only storage is a stack An instruction r = F(a 1 ,a n ): Pops n operands from the stack Computes the operation F using the operands Pushes the result r on the stack Alex

362 views • 13 slides
Re-arquitetando o Re-arquitetando o Stack Overflow Stack Overflow ou como construmos o Stack

Re-arquitetando o Re-arquitetando o Stack Overflow Stack Overflow ou como construmos o Stack

Re-arquitetando o Re-arquitetando o Stack Overflow Stack Overflow ou como construmos o Stack Overflow for Teams Roberta Arcoverde 1 /whois /whois recifense programadora h 15 anos principal software developer na stack overflow

711 views • 52 slides
Stack machines (Using slides adapted from the book) Stacks A stack machine maintains an

Stack machines (Using slides adapted from the book) Stacks A stack machine maintains an

Stack machines (Using slides adapted from the book) Stacks A stack machine maintains an unbounded stack of symbols We'll represent these stacks as strings Left end of the string is the top of the stack For example, abc is a stack

406 views • 12 slides
Increasing Addresses Grows Stack Down Stack Pointer: %rsp Stack Top Sean Barker 2

Increasing Addresses Grows Stack Down Stack Pointer: %rsp Stack Top Sean Barker 2

Procedure Call Registers %rax %r8 %eax %r8d Return Arg 5 %rbx %r9 %ebx %r9d Arg 6 %rcx %r10 %ecx %r10d Arg 4 %rdx %r11 %edx %r11d Arg 3 %rsi %r12 %esi %r12d Arg 2 %rdi %r13 %edi %r13d Arg 1 %rsp %r14 %esp %r14d

483 views • 20 slides
Sorting with Pop Stacks Stack sorting Pop stack sorting 1-pop-stack sortability 2-pop-stack

Sorting with Pop Stacks Stack sorting Pop stack sorting 1-pop-stack sortability 2-pop-stack

Sorting with Pop Stacks Lara Pudwell Sorting with Pop Stacks Stack sorting Pop stack sorting 1-pop-stack sortability 2-pop-stack sortability Polyominoes on a helix Lara Pudwell Width 2 Width 3 faculty.valpo.edu/lpudwell Wrapping up

1.3k views • 69 slides
Procedures and the Call Stack Topics Procedures Call stack Procedure/stack

Procedures and the Call Stack Topics Procedures Call stack Procedure/stack

Procedures and the Call Stack Topics Procedures Call stack Procedure/stack instructions Calling conventions Register-saving conventions Why Procedures? Why functions? Why methods? int contains_char(char* haystack,

892 views • 52 slides
Procedures and the Call Stack Topics Procedures Call stack Procedure/stack

Procedures and the Call Stack Topics Procedures Call stack Procedure/stack

Procedures and the Call Stack Topics Procedures Call stack Procedure/stack instructions Calling conventions Register-saving conventions Why Procedures? Why functions? Why methods? int contains_char(char* haystack,

705 views • 54 slides
Optimization for marking and sweeping Optimization for marking Use a marking stack

Optimization for marking and sweeping Optimization for marking Use a marking stack

Optimization for marking and sweeping Optimization for marking Use a marking stack Iterative marking Minimize stack depth to avoid stack overflow Knuth: treat marking stark circularly Kurokawa: remove items from stack that have

612 views • 16 slides
Michael Q. McShane, PhD. -What are some of the big issues in higher education today? -Is Mizzou

Michael Q. McShane, PhD. -What are some of the big issues in higher education today? -Is Mizzou

Michael Q. McShane, PhD. -What are some of the big issues in higher education today? -Is Mizzou more or less efficient or effective than the other public institutions of higher education in Missouri? -How does Mizzou stack up the 115 other

373 views • 19 slides
Stacks The stack ADT Stack Implementation using arrays using generic linked lists

Stacks The stack ADT Stack Implementation using arrays using generic linked lists

Stacks The stack ADT Stack Implementation using arrays using generic linked lists using List ADT Stack Examples EECS 268 Programming II 1 Stacks and Queues Linear data structures each item has specific first , next

497 views • 32 slides
Procedures and the Stack Chapter 10 S. Dandamudi Outline What is stack? Examples

Procedures and the Stack Chapter 10 S. Dandamudi Outline What is stack? Examples

Procedures and the Stack Chapter 10 S. Dandamudi Outline What is stack? Examples Call-by-value Pentium implementation Call-by-reference of stack Bubble sort Pentium stack instructions Procedures with variable

668 views • 50 slides
Stack and Queue ADT Stack Queue 2 ADT Example All main programs rely on concept of

Stack and Queue ADT Stack Queue 2 ADT Example All main programs rely on concept of

Advanced Programming Stack - Queue Summary Stack and Queue ADT Stack Queue 2 ADT Example All main programs rely on concept of Abstract It is possible to define an ADT corresponding Data Type (ADT). to a generic set of elements,

350 views • 7 slides

More recommend