👽
Software Engineer Interview Handbook
  • README
  • Behavioral
    • Useful Links
    • Dongze Li
  • Algorithm
    • Segment Tree
    • Array
      • Product Of Array Except Self
      • Merge Strings Alternately
      • Increasing Triplet Subsequence
      • String Compression
      • Greatest Common Divisor Strings
      • Max Product Of Three
      • Find Duplicate Num
      • Valid Palindrome Ii
      • Next Permutation
      • Rearrange Array By Sign
      • Removing Min Max Elements
      • Find Original Array From Doubled
      • Reverse Words Ii
    • Backtracking
      • Letter Combination Phone Number
      • Combination Sum Iii
      • N Queens
      • Permutations
      • Combination Sum
    • Binary Search
      • Koko Eating Bananas
      • Find Peak Element
      • Successful Pairs Of Spells Potions
    • Binary Search Tree
      • Delete Node In BST
      • Validate Bst
      • Range Sum Bst
    • Binary Tree
      • Maximum Depth
      • Leaf Similar Trees
      • Maximum Level Sum
      • Binary Tree Right Side
      • Lowest Common Ancestor
      • Longest Zigzag Path
      • Count Good Nodes
      • Path Sum III
      • Maximum Path Sum
      • Move Zero
      • Diameter Binary Tree
      • Sum Root Leaf Number
      • Traversal
      • Binary Tree Vertical Order
      • Height Tree Removal Queries
      • Count Nodes Avg Subtree
      • Distribute Coins
      • Binary Tree Max Path Sum
    • Bit
      • Min Flips
      • Single Number
      • Pow
      • Find Unique Binary Str
    • BFS
      • Rotten Oranges
      • Nearest Exist From Entrance
      • Minimum Knight Moves
      • Network Delay Time
      • Minimum Height Tree
      • Knight Probability In Board
    • Design
      • LRU Cache
      • Get Random
      • LFU Cache
      • Moving Average
      • Rle Iterator
      • Design Hashmap
    • DFS
      • Reorder Routes Lead City
      • Evaluate Division
      • Keys And Rooms
      • Number Of Provinces
      • Disconnected Path With One Flip
      • Course Schedule Ii
      • Robot Room Cleaner
      • Word Break Ii
      • Number Coins In Tree Nodes
      • Maximum Increasing Cells
      • Number Coins In Tree Nodes
      • Detonate Maximum Bombs
      • Find All Possible Recipes
      • Min Fuel Report Capital
      • Similar String Groups
    • DP
      • Domino And Tromino Tiling
      • House Robber
      • Longest Common Subsequence
      • Trade Stock With Transaction Fee
      • Buy And Sell Stock
      • Longest Non Decreasing Subarray
      • Number Of Good Binary Strings
      • Delete And Earn
      • Minimum Costs Using Train Line
      • Decode Ways
      • Trapping Rain Water
      • Count Fertile Pyramids
      • Minimum Time Finish Race
      • Knapsack
      • Count Unique Char Substrs
      • Count All Valid Pickup
    • Greedy
      • Dota2 Senate
      • Smallest Range Ii
      • Can Place Flowers
      • Meeting Rooms II
      • Guess the word
      • Minimum Replacement
      • Longest Palindrome Two Letter Words
      • Parentheses String Valid
      • Largest Palindromic Num
      • Find Missing Observations
      • Most Profit Assigning Work
    • Hashmap
      • Equal Row Column Pairs
      • Two Strings Close
      • Group Anagrams
      • Detect Squares
    • Heap
      • Maximum Subsequence Score
      • Smallest Number Infinite Set
      • Total Cost Hire Workers
      • Kth Largest Element
      • Meeting Rooms III
      • K Closest Points Origin
      • Merge K Sorted List
      • Top K Frequent Elements
      • Meeting Room III
      • Num Flowers Bloom
      • Find Median From Stream
    • Intervals
      • Non Overlapping Intervals
      • Min Arrows Burst Ballons
    • Linkedlist
      • Reverse Linked List
      • Delete Middle Node
      • Odd Even Linkedlist
      • Palindrome Linkedlist
    • Monotonic Stack
      • Daily Temperatures
      • Online Stock Span
    • Random
      • Random Pick With Weight
      • Random Pick Index
      • Shuffle An Array
    • Recursion
      • Difference Between Two Objs
    • Segment Fenwick
      • Longest Increasing Subsequence II
    • Stack
      • Removing Stars From String
      • Asteroid Collision
      • Evaluate Reverse Polish Notation
      • Building With Ocean View
      • Min Remove Parentheses
      • Basic Calculator Ii
      • Simplify Path
      • Min Add Parentheses
    • Prefix Sum
      • Find The Highest Altitude
      • Find Pivot Index
      • Subarray Sum K
      • Range Addition
    • Sliding Window
      • Max Vowels Substring
      • Max Consecutive Ones III
      • Longest Subarray Deleting Element
      • Minimum Window Substring
      • K Radius Subarray Averages
    • String
      • Valid Word Abbreviations
    • Two Pointers
      • Container With Most Water
      • Max Number K Sum Pairs
      • Is Subsequence
      • Num Substrings Contains Three Char
    • Trie
      • Prefix Tree
      • Search Suggestions System
      • Design File System
    • Union Find
      • Accounts Merge
    • Multithreading
      • Basics
      • Web Crawler
  • System Design
    • Operating System
    • Mocks
      • Design ChatGPT
      • Design Web Crawler
      • Distributed Search
      • News Feed Search
      • Top K / Ad Click Aggregation
      • Design Job Scheduler
      • Distributed Message Queue
      • Google Maps
      • Nearby Friends
      • Proximity Service
      • Metrics monitoring and alert system
      • Design Email
      • Design Gaming Leaderboard
      • Facebook New Feed Live Comments
      • Dog Sitting App
      • Design Chat App (WhatsApp)
      • Design Youtube/Netflix
      • Design Google Doc
      • Design Webhook
      • Validate Instacart Shopper Checkout
      • Design Inventory
      • Design donation app
      • Design Twitter
    • Deep-Dive
      • Back of Envelope
      • Message Queue
      • Redis Sorted Set
      • FAQ
      • Geohash
      • Quadtree
      • Redis Pub/Sub
      • Cassandra DB
      • Collaborative Concurrency Control
      • Websocket / Long Polling / SSE
    • DDIA
      • Chapter 2: Data Models and Query Languages
      • Chapter 5: Replication
      • Chapter 9: Consistency and Consensus
  • OOD
    • Overview
    • Design Parking
  • Company Tags
    • Meta
    • Citadel
      • C++ Fundamentals
      • 面经1
      • Fibonacci
      • Pi
      • Probability
    • DoorDash
      • Similar String Groups
      • Door And Gates
      • Max Job Profit
      • Design File System
      • Count All Valid Pickup
      • Most Profit Assigning Work
      • Swap
      • Binary Tree Max Path Sum
      • Nearest Cities
      • Exployee Free Time
      • Tree Add Removal
    • Lyft
      • Autocomplete
      • Job Scheduler
      • Read4
      • Kvstore
    • Amazon
      • Min Binary Str Val
    • AppLovin
      • TODO
      • Java Basic Questions
    • Google
      • Huffman Tree
      • Unique Elements
    • Instacart
      • Meeting Rooms II
      • Pw
      • Pw2
      • Pw3
      • Expression1
      • Expression2
      • Expression3
      • PW All
      • Expression All
      • Wildcard
      • Free forum tech discussion
    • OpenAI
      • Spreadsheet
      • Iterator
      • Kv Store
    • Rabbit
      • Scheduler
      • SchedulerC++
    • [Microsoft]
      • Min Moves Spread Stones
      • Inorder Successor
      • Largest Palindromic Num
      • Count Unique Char Substrs
      • Reverse Words Ii
      • Find Missing Observations
      • Min Fuel Report Capital
      • Design Hashmap
      • Find Original Array From Doubled
      • Num Flowers Bloom
      • Distribute Coins
      • Find Median From Stream
Powered by GitBook
On this page
  • Functional Requirements
  • Non-functional Requirement
  • Scale
  • Traffic Estimation Method
  • High Level Diagram
  • Websocket Diagram
  • E2E
  • API
  • Websocket
  • Data Model
  • Location Cache
  • Scale
  • API servers
  • Websocket servers
  • User database
  • Location Cache
  • Redis Pub/Sub Server
  • FAQ
  1. System Design
  2. Mocks

Nearby Friends

Design a scalable backend system "Nearby Friends". For an opt-in user who grants permission to access their location, the mobile client presents a list of friends who are geographically nearby.

Functional Requirements

  • User will be able to see a list of nearby friends.

  • When new user come online/offline, we need to update as real time as possible.

  • When user revoke the location permission, we would need to update.

  • What search radius should we support? - 5 miles for example.

  • Is distance calculated based on straight line distance? - Yes

  • Store location history.

  • Do we need to worry about privacy and data laws? - No

Non-functional Requirement

  • Highly available

  • Low latency, see location updates from friends without delay.

  • Availability > consistency, location history data doesn't have to be real-time.

  • Read == Write

Scale

  • 100M active daily users.

  • 10% concurrent user = 10M

  • User report location every 30 seconds.

  • QPS = 10M / 30s = 334000

Traffic Estimation Method

Peak Load (10% of DAU concurrent users)
Average Load (Use 10^5 sec a day as divider)

Takes into account the potential spikes in usage and ensures that your system is designed to handle maximum load.

Might not accurately capture sudden spikes in usage during specific times of the day.

Might overestimate the load during regular periods when not all users are active.

Provides a more smoothed out estimation of load over a day.

High Level Diagram

Websocket Diagram

User1's friends: User2, User3 and User4

User5's friends: User4, User6

We assign channel to every user who uses "nearby" feature. A user would, upon app initialization, subscribe to each friend's channel regardless whether the friend is online or not.

We trade memory for simpler architecture in this case.

E2E

  1. Client send both http/Websocket request to API Gateway with its own location.

    1. http request for fetching friends' list.

    2. websocket request for publishing its own location as well as subscribe to friends' channels.

  2. API Gateway routes Websocket request onto Websocket servers and http request onto API servers.

  3. Websocket services:

    • Fetch friends' locations, filter out friends out of radius.

    • Subscribe to friends' channels based on friend list.

    • Publish user's location to Redis pub/sub, this message got broadcasted to all subscribers channels.

    • Store user's location onto location cache.

    • On receiving broadcast messages from Redis Pub/Sub, connection handler computes the distance between two users, if distance is out of radius, the update is dropped.

  4. HTTP services

    • Fetch all of friend list of the user.

    • Add/Remove friends -> api service calls websocket service to notify client a friend is added or removed (event handler from websocket) -> client sends back websocket request to subscribe/unsubscribe channels.

    • Store location into location history DB.

API

Websocket

  • Websocket initialization (onConnect)

    • Request: Client send latitude, longitude and timestamp.

    • Response: Friend location with timestamp.

User subscribe to all of his/her friends' channels on connection.

  • Periodic location update

    • Request: Client send latitude, longitude and timestamp.

    • Response: Nothing

  • Client receives location updates

    • Event: Friend location with timestamp.

  • Subscribe to a friend

    • Request: friend ID

    • Response: friend's location with timestamp

Subscribe to friend's channel.

  • Unsubscribe a friend

    • Request: friend ID

    • Response: Nothing.

Unsubscribe to a friend's channel.

Data Model

Location Cache

key
value

user_id

{latitude, longitude, timestamp}

Use TTL to automatically purge inactive user's location, this helps prevent user receive location data from inactive friends.

Scale

API servers

stateless servers, auto-scale the clusters based on CPU, load or I/O.

Websocket servers

Effective auto-scaling of stateful servers is the job of a good load balancer.

They are stateful. Before a node can be removed, all existing connections should be allowed to drain. Mark the node at the load balancer so no new websocket connections will be routed to the draining server.

User database

The user database holds two distinct sets of data: user profiles and friendships. Data is horizontally scalable by sharing based on User ID.

Location Cache

Memory:

10M active users * 100 bytes = 1GB

QPS:

10M active users, update every 30s = 334k per seconds.

QPS is too high, we need to shard location data based on user ID and replicate location data on each shard to improve availability.

Read replicas are not enough because the write QPS is large.

Redis Pub/Sub Server

Memory:

1B users * 10% = 100M users = 100M channels.

20 bytes to track each subscriber using hash table and linked list.

On average, each user has around 100 friends.

100M channels * 20 bytes * 100 friends / 10^9 = 200 GB

We need 2 Redis Pub/Sub servers with 100 GB

QPS:

10M active users + update every 30 seconds = 334k QPS.

On average user have 400 friends, only 10% online and nearby:

334K * 400 * 10% = 14M location pushes.

Assume a modern server with a gigabit network can handle 100k push per second.

14M / 100k = 140 Redis servers.

Distributed Redis Pub/Sub server

Use some service discovery component like etcd, ZooKeeper to:

  1. Keep a list of servers, a simple UI or API to update it.

Key: /config/pub_sub_ring
Value: ["p_1", "p_2", "p_3", "p_4"]
  1. For client (websocket servers) to subscribe to any updates to the "Value" (a list of Redis Pub/Sub servers)

FAQ

PreviousGoogle MapsNextProximity Service

Last updated 1 year ago

Architecture
Drawing
Drawing
Drawing