Finite State Machines - Why the fear?
Download as PPTX, PDF4 likes2,487 views
The document discusses the use of Erlang and Gen_FSM for managing concurrency and state in communication systems, including metrics for phone calls and HTTP requests. It highlights the importance of finite state machines in encapsulating complexity and facilitating error handling and fault detection. Additionally, it suggests the practical application of templates and real-world thinking in system design.
Finite State Machines - Why the fear?
- 1. { Erlang and gen_fsm @dieswaytoofast (V.P. Ubiquiti Networks)
- 3. The Business
- 5. The Metrics
- 6. Phone Calls per Second The Metrics
- 7. Phone Calls per Second The Metrics x 1000
- 8. Simultaneous Phone Calls The Metrics
- 9. Simultaneous Phone Calls The Metrics x 10,000
- 10. HTTP API requests The Metrics
- 11. HTTP API requests The Metrics x ∞
- 13. Voice Response Call Handling init Setup Call Get Caller Name Play Transfer Message Got Caller Name Dial
- 14. Call Routing Call Handling dial_in Check Blacklist get_endpoint conference Play Error Hangupauto_attendant dial_in_fml conference
- 15. init Check node Check Blacklist Cancelled Blacklisted Next Endpoint Collections Unknown Move node Auto Attendant FML Voicemail FaxConference
- 16. Self-hosted (kinda) Bet the farm moment
- 18. ERLANG!!!
- 19. Concurrency The Big Six From http://www.erlang.org/download/armstrong_thesis_2003.pdf
- 20. Concurrency Error encapsulation The Big Six From http://www.erlang.org/download/armstrong_thesis_2003.pdf
- 21. Concurrency Error encapsulation Fault detection The Big Six From http://www.erlang.org/download/armstrong_thesis_2003.pdf
- 22. Concurrency Error encapsulation Fault detection Fault identification The Big Six From http://www.erlang.org/download/armstrong_thesis_2003.pdf
- 23. Concurrency Error encapsulation Fault detection Fault identification Code upgrade The Big Six From http://www.erlang.org/download/armstrong_thesis_2003.pdf
- 24. Concurrency Error encapsulation Fault detection Fault identification Code upgrade Stable Storage The Big Six From http://www.erlang.org/download/armstrong_thesis_2003.pdf
- 25. Erlang Concurrency Hell My Blue Heaven My Blue Heaven
- 26. Erlang Concurrency Hell My Blue Heaven Deep Problems My Blue Heaven Deep Problems
- 29. gen_server gen_tcp gen_event Behaviours
- 30. gen_server gen_tcp gen_event gen_fsm Behaviours
- 31. gen_server gen_tcp gen_event gen_fsm … Behaviours
- 32. gen_server gen_tcp gen_event gen_fsm … Behaviours
- 33. A System has States Finite State Machines
- 35. A System has States States transition Finite State Machines
- 37. A System has States States transition Transitions are Atomic Finite State Machines
- 39. A System has States States transition Transitions are Atomic Events at Entry and Exit Finite State Machines
- 40. asleepStart out of bed Riiiiiiiiing Brush Teeth Coffee!!
- 43. asleepStart out of bed Riiiiiiiiing Brush Teeth Coffee!!
- 44. asleepStart out of bed Riiiiiiiiing Brush Teeth Coffee!!
- 46. asleepStart out of bed Riiiiiiiiing Brush Teeth Coffee!! HUH?
- 48. asleepStart out of bed Riiiiiiiiing Brush Teeth Coffee!!
- 49. asleepStart out of bed Riiiiiiiiing Brush Teeth Coffee!! W 00t!
- 72. Everything is an FSM Finite State Machines
- 73. Everything is an FSM Finite State Machines COM PLEXITY?
- 74. Everything is an FSM Finite State Machines ENCAPSULATION!
- 75. Voice Response Finite State Machines init Setup Call Get Caller Name Play Transfer Message Got Caller Name Dial
- 76. Voice Response Finite State Machines init Setup Call Get Caller Name Play Transfer Message Got Caller Name Dial
- 77. Voice Response Finite State Machines init Setup Call Get Caller Name Play Transfer Message Got Caller Name Dial ENCAPSULATION!
- 78. Encapsulation Concurrency Hell My Blue Heaven Deep Problems My Blue Heaven Deep Problems
- 79. Call Routing Finite State Machines dial_in Check Blacklist get_endpoint conference Play Error Hangupauto_attendant dial_in_fml conference
- 80. init Check node Check Blacklist Cancelled Blacklisted Next Endpoint Collections Unknown Move node Auto Attendant FML Voicemail FaxConference
- 81. Templates are your friend So are BIG sheets of paper Think “Real World” The Bottom Line
Editor's Notes
- #3: So, I started a phone company. It was a great thing. Phones make people happy, right?
- #4: Yeah. Kids. Don’t do this at home. Don’t start a phone company.
- #5: But I did. Hosted phone services for SMBs. Vonage for small businesses. In the cloud. Awesome
- #8: 3 orders of magnitude
- #10: 4 orders of magnitude
- #12: Infinity!
- #13: Houston – we have a problem
- #14: Consider the simplest case of handling a call
- #15: It actually gets a lot more complex
- #16: And eventually, a *lot* more complex
- #17: To put it differently,It was a “bet the farm” moment
- #18: And it basically involved a lot of beer
- #19: And we rewrote the whole damn thing in Erlang. WhyErlang? Well, Fault Tolerance, basicallyAnd oh, I’m not putting Kirk up there. That’s too obvious.
- #20: The Six Essential Characteristics of a Fault Tolerant System
- #21: The Six Essential Characteristics of a Fault Tolerant System
- #22: The Six Essential Characteristics of a Fault Tolerant System
- #23: The Six Essential Characteristics of a Fault Tolerant System
- #24: The Six Essential Characteristics of a Fault Tolerant System
- #25: The Six Essential Characteristics of a Fault Tolerant System
- #26: ‘Distributed’ problems mean you spend a huge chunk of your time dealing with theadminstrivia of distribution.With erlang you get that for free!
- #27: Ok, not really true. You still have to deal with ‘deep problems’ (hard core parallelization issues, etc.)But you’d have to deal with that anyhow!
- #28: Implement the server part of a client/server relationship
- #29: Talk to tcp over sockets
- #30: Event handling
- #31: Finite state machines
- #32: And a bunch more (gen_udp, gen_utp!, etc.)
- #33: But, we’re talking about Finite State Machines
- #34: Lets talk about FSMs
- #42: Putting this into practice, here is some code
- #43: A system has states
- #44: When certain events show up
- #45: You do something
- #46: And transition to the next state
- #47: Wait, WHUT? Where did the “events” come from?
- #48: I’m glad you asked more code
- #49: And thusly an event is sent
- #50: Voila, an ErlangFSM
- #51: 2.0 is anightmare; Stick w/ 1.0
- #52: A system has states
- #53: Events and transitions
- #54: The code
- #55: The states
- #57: When you receive an event
- #58: try to do something
- #59: If it works go to the next state
- #61: If it fails, go to a differen state
- #62: Thusly
- #63: And now for the events
- #68: But wait! What if you walk out partway?
- #69: So, a wee bit triclyhere -
- #70: We have a timeout
- #71: And it tells you where to go after the timeout
- #72: And, you’re done.
- #73: Lets look at this as a ‘real world” thingy
- #74: But, you say, BUT, what about the complexity of dealing with FSMs? They’re big! And unweildy!
- #75: Nah. They aren’t. Not in Erlang
- #76: Remember this? It was a PITA? Actually, a small part of a PITA?
- #77: But each one is tightly encapsulated, and clean.It’s the Erlang Way
- #78: But each one is tightly encapsulated, and clean.It’s the Erlang Way
- #79: My fanciful slides are actually real. This actually happens.
- #80: And it’s the same for everything else I showed. FSMs of FSMs.
- #81: An FSM of FSMs of FSMsBuilding these out “correctly”, in real time, is (was!) trivial
- #82: “Real World” Business Rules can help. (VM,syncrhonziation)